diff --git a/packages/tiptap/dist/tiptap.common.js b/packages/tiptap/dist/tiptap.common.js
deleted file mode 100644
index fc7edd84..00000000
--- a/packages/tiptap/dist/tiptap.common.js
+++ /dev/null
@@ -1,18813 +0,0 @@
-
-	/*!
-  * tiptap vundefined
-  * (c) 2018 Scrumpy UG (limited liability)
-  * @license MIT
-  */
-
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var Vue = _interopDefault(require('vue'));
-
-function unwrapExports (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
-function createCommonjsModule(fn, module) {
-	return module = { exports: {} }, fn(module, module.exports), module.exports;
-}
-
-// ::- Persistent data structure representing an ordered mapping from
-// strings to values, with some convenient update methods.
-function OrderedMap(content) {
-  this.content = content;
-}
-
-OrderedMap.prototype = {
-  constructor: OrderedMap,
-
-  find: function(key) {
-    var this$1 = this;
-
-    for (var i = 0; i < this.content.length; i += 2)
-      { if (this$1.content[i] === key) { return i } }
-    return -1
-  },
-
-  // :: (string) → ?any
-  // Retrieve the value stored under `key`, or return undefined when
-  // no such key exists.
-  get: function(key) {
-    var found = this.find(key);
-    return found == -1 ? undefined : this.content[found + 1]
-  },
-
-  // :: (string, any, ?string) → OrderedMap
-  // Create a new map by replacing the value of `key` with a new
-  // value, or adding a binding to the end of the map. If `newKey` is
-  // given, the key of the binding will be replaced with that key.
-  update: function(key, value, newKey) {
-    var self = newKey && newKey != key ? this.remove(newKey) : this;
-    var found = self.find(key), content = self.content.slice();
-    if (found == -1) {
-      content.push(newKey || key, value);
-    } else {
-      content[found + 1] = value;
-      if (newKey) { content[found] = newKey; }
-    }
-    return new OrderedMap(content)
-  },
-
-  // :: (string) → OrderedMap
-  // Return a map with the given key removed, if it existed.
-  remove: function(key) {
-    var found = this.find(key);
-    if (found == -1) { return this }
-    var content = this.content.slice();
-    content.splice(found, 2);
-    return new OrderedMap(content)
-  },
-
-  // :: (string, any) → OrderedMap
-  // Add a new key to the start of the map.
-  addToStart: function(key, value) {
-    return new OrderedMap([key, value].concat(this.remove(key).content))
-  },
-
-  // :: (string, any) → OrderedMap
-  // Add a new key to the end of the map.
-  addToEnd: function(key, value) {
-    var content = this.remove(key).content.slice();
-    content.push(key, value);
-    return new OrderedMap(content)
-  },
-
-  // :: (string, string, any) → OrderedMap
-  // Add a key after the given key. If `place` is not found, the new
-  // key is added to the end.
-  addBefore: function(place, key, value) {
-    var without = this.remove(key), content = without.content.slice();
-    var found = without.find(place);
-    content.splice(found == -1 ? content.length : found, 0, key, value);
-    return new OrderedMap(content)
-  },
-
-  // :: ((key: string, value: any))
-  // Call the given function for each key/value pair in the map, in
-  // order.
-  forEach: function(f) {
-    var this$1 = this;
-
-    for (var i = 0; i < this.content.length; i += 2)
-      { f(this$1.content[i], this$1.content[i + 1]); }
-  },
-
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a new map by prepending the keys in this map that don't
-  // appear in `map` before the keys in `map`.
-  prepend: function(map) {
-    map = OrderedMap.from(map);
-    if (!map.size) { return this }
-    return new OrderedMap(map.content.concat(this.subtract(map).content))
-  },
-
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a new map by appending the keys in this map that don't
-  // appear in `map` after the keys in `map`.
-  append: function(map) {
-    map = OrderedMap.from(map);
-    if (!map.size) { return this }
-    return new OrderedMap(this.subtract(map).content.concat(map.content))
-  },
-
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a map containing all the keys in this map that don't
-  // appear in `map`.
-  subtract: function(map) {
-    var result = this;
-    map = OrderedMap.from(map);
-    for (var i = 0; i < map.content.length; i += 2)
-      { result = result.remove(map.content[i]); }
-    return result
-  },
-
-  // :: number
-  // The amount of keys in this map.
-  get size() {
-    return this.content.length >> 1
-  }
-};
-
-// :: (?union<Object, OrderedMap>) → OrderedMap
-// Return a map with the given content. If null, create an empty
-// map. If given an ordered map, return that map itself. If given an
-// object, create a map from the object's properties.
-OrderedMap.from = function(value) {
-  if (value instanceof OrderedMap) { return value }
-  var content = [];
-  if (value) { for (var prop in value) { content.push(prop, value[prop]); } }
-  return new OrderedMap(content)
-};
-
-var orderedmap = OrderedMap;
-
-var dist = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var OrderedMap = _interopDefault(orderedmap);
-
-function findDiffStart(a, b, pos) {
-  for (var i = 0;; i++) {
-    if (i == a.childCount || i == b.childCount)
-      { return a.childCount == b.childCount ? null : pos }
-
-    var childA = a.child(i), childB = b.child(i);
-    if (childA == childB) { pos += childA.nodeSize; continue }
-
-    if (!childA.sameMarkup(childB)) { return pos }
-
-    if (childA.isText && childA.text != childB.text) {
-      for (var j = 0; childA.text[j] == childB.text[j]; j++)
-        { pos++; }
-      return pos
-    }
-    if (childA.content.size || childB.content.size) {
-      var inner = findDiffStart(childA.content, childB.content, pos + 1);
-      if (inner != null) { return inner }
-    }
-    pos += childA.nodeSize;
-  }
-}
-
-function findDiffEnd(a, b, posA, posB) {
-  for (var iA = a.childCount, iB = b.childCount;;) {
-    if (iA == 0 || iB == 0)
-      { return iA == iB ? null : {a: posA, b: posB} }
-
-    var childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;
-    if (childA == childB) {
-      posA -= size; posB -= size;
-      continue
-    }
-
-    if (!childA.sameMarkup(childB)) { return {a: posA, b: posB} }
-
-    if (childA.isText && childA.text != childB.text) {
-      var same = 0, minSize = Math.min(childA.text.length, childB.text.length);
-      while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {
-        same++; posA--; posB--;
-      }
-      return {a: posA, b: posB}
-    }
-    if (childA.content.size || childB.content.size) {
-      var inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);
-      if (inner) { return inner }
-    }
-    posA -= size; posB -= size;
-  }
-}
-
-// ::- A fragment represents a node's collection of child nodes.
-//
-// Like nodes, fragments are persistent data structures, and you
-// should not mutate them or their content. Rather, you create new
-// instances whenever needed. The API tries to make this easy.
-var Fragment = function Fragment(content, size) {
-  var this$1 = this;
-
-  this.content = content;
-  // :: number
-  // The size of the fragment, which is the total of the size of its
-  // content nodes.
-  this.size = size || 0;
-  if (size == null) { for (var i = 0; i < content.length; i++)
-    { this$1.size += content[i].nodeSize; } }
-};
-
-var prototypeAccessors$1 = { firstChild: {},lastChild: {},childCount: {} };
-
-// :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)
-// Invoke a callback for all descendant nodes between the given two
-// positions (relative to start of this fragment). Doesn't descend
-// into a node when the callback returns `false`.
-Fragment.prototype.nodesBetween = function nodesBetween (from, to, f, nodeStart, parent) {
-    var this$1 = this;
-    if ( nodeStart === void 0 ) { nodeStart = 0; }
-
-  for (var i = 0, pos = 0; pos < to; i++) {
-    var child = this$1.content[i], end = pos + child.nodeSize;
-    if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {
-      var start = pos + 1;
-      child.nodesBetween(Math.max(0, from - start),
-                         Math.min(child.content.size, to - start),
-                         f, nodeStart + start);
-    }
-    pos = end;
-  }
-};
-
-// :: ((node: Node, pos: number, parent: Node) → ?bool)
-// Call the given callback for every descendant node. The callback
-// may return `false` to prevent traversal of a given node's children.
-Fragment.prototype.descendants = function descendants (f) {
-  this.nodesBetween(0, this.size, f);
-};
-
-// : (number, number, ?string, ?string) → string
-Fragment.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
-  var text = "", separated = true;
-  this.nodesBetween(from, to, function (node, pos) {
-    if (node.isText) {
-      text += node.text.slice(Math.max(from, pos) - pos, to - pos);
-      separated = !blockSeparator;
-    } else if (node.isLeaf && leafText) {
-      text += leafText;
-      separated = !blockSeparator;
-    } else if (!separated && node.isBlock) {
-      text += blockSeparator;
-      separated = true;
-    }
-  }, 0);
-  return text
-};
-
-// :: (Fragment) → Fragment
-// Create a new fragment containing the combined content of this
-// fragment and the other.
-Fragment.prototype.append = function append (other) {
-  if (!other.size) { return this }
-  if (!this.size) { return other }
-  var last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;
-  if (last.isText && last.sameMarkup(first)) {
-    content[content.length - 1] = last.withText(last.text + first.text);
-    i = 1;
-  }
-  for (; i < other.content.length; i++) { content.push(other.content[i]); }
-  return new Fragment(content, this.size + other.size)
-};
-
-// :: (number, ?number) → Fragment
-// Cut out the sub-fragment between the two given positions.
-Fragment.prototype.cut = function cut (from, to) {
-    var this$1 = this;
-
-  if (to == null) { to = this.size; }
-  if (from == 0 && to == this.size) { return this }
-  var result = [], size = 0;
-  if (to > from) { for (var i = 0, pos = 0; pos < to; i++) {
-    var child = this$1.content[i], end = pos + child.nodeSize;
-    if (end > from) {
-      if (pos < from || end > to) {
-        if (child.isText)
-          { child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos)); }
-        else
-          { child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1)); }
-      }
-      result.push(child);
-      size += child.nodeSize;
-    }
-    pos = end;
-  } }
-  return new Fragment(result, size)
-};
-
-Fragment.prototype.cutByIndex = function cutByIndex (from, to) {
-  if (from == to) { return Fragment.empty }
-  if (from == 0 && to == this.content.length) { return this }
-  return new Fragment(this.content.slice(from, to))
-};
-
-// :: (number, Node) → Fragment
-// Create a new fragment in which the node at the given index is
-// replaced by the given node.
-Fragment.prototype.replaceChild = function replaceChild (index, node) {
-  var current = this.content[index];
-  if (current == node) { return this }
-  var copy = this.content.slice();
-  var size = this.size + node.nodeSize - current.nodeSize;
-  copy[index] = node;
-  return new Fragment(copy, size)
-};
-
-// : (Node) → Fragment
-// Create a new fragment by prepending the given node to this
-// fragment.
-Fragment.prototype.addToStart = function addToStart (node) {
-  return new Fragment([node].concat(this.content), this.size + node.nodeSize)
-};
-
-// : (Node) → Fragment
-// Create a new fragment by appending the given node to this
-// fragment.
-Fragment.prototype.addToEnd = function addToEnd (node) {
-  return new Fragment(this.content.concat(node), this.size + node.nodeSize)
-};
-
-// :: (Fragment) → bool
-// Compare this fragment to another one.
-Fragment.prototype.eq = function eq (other) {
-    var this$1 = this;
-
-  if (this.content.length != other.content.length) { return false }
-  for (var i = 0; i < this.content.length; i++)
-    { if (!this$1.content[i].eq(other.content[i])) { return false } }
-  return true
-};
-
-// :: ?Node
-// The first child of the fragment, or `null` if it is empty.
-prototypeAccessors$1.firstChild.get = function () { return this.content.length ? this.content[0] : null };
-
-// :: ?Node
-// The last child of the fragment, or `null` if it is empty.
-prototypeAccessors$1.lastChild.get = function () { return this.content.length ? this.content[this.content.length - 1] : null };
-
-// :: number
-// The number of child nodes in this fragment.
-prototypeAccessors$1.childCount.get = function () { return this.content.length };
-
-// :: (number) → Node
-// Get the child node at the given index. Raise an error when the
-// index is out of range.
-Fragment.prototype.child = function child (index) {
-  var found = this.content[index];
-  if (!found) { throw new RangeError("Index " + index + " out of range for " + this) }
-  return found
-};
-
-// :: (number) → ?Node
-// Get the child node at the given index, if it exists.
-Fragment.prototype.maybeChild = function maybeChild (index) {
-  return this.content[index]
-};
-
-// :: ((node: Node, offset: number, index: number))
-// Call `f` for every child node, passing the node, its offset
-// into this parent node, and its index.
-Fragment.prototype.forEach = function forEach (f) {
-    var this$1 = this;
-
-  for (var i = 0, p = 0; i < this.content.length; i++) {
-    var child = this$1.content[i];
-    f(child, p, i);
-    p += child.nodeSize;
-  }
-};
-
-// :: (Fragment) → ?number
-// Find the first position at which this fragment and another
-// fragment differ, or `null` if they are the same.
-Fragment.prototype.findDiffStart = function findDiffStart$1 (other, pos) {
-    if ( pos === void 0 ) { pos = 0; }
-
-  return findDiffStart(this, other, pos)
-};
-
-// :: (Fragment) → ?{a: number, b: number}
-// Find the first position, searching from the end, at which this
-// fragment and the given fragment differ, or `null` if they are the
-// same. Since this position will not be the same in both nodes, an
-// object with two separate positions is returned.
-Fragment.prototype.findDiffEnd = function findDiffEnd$1 (other, pos, otherPos) {
-    if ( pos === void 0 ) { pos = this.size; }
-    if ( otherPos === void 0 ) { otherPos = other.size; }
-
-  return findDiffEnd(this, other, pos, otherPos)
-};
-
-// : (number, ?number) → {index: number, offset: number}
-// Find the index and inner offset corresponding to a given relative
-// position in this fragment. The result object will be reused
-// (overwritten) the next time the function is called. (Not public.)
-Fragment.prototype.findIndex = function findIndex (pos, round) {
-    var this$1 = this;
-    if ( round === void 0 ) { round = -1; }
-
-  if (pos == 0) { return retIndex(0, pos) }
-  if (pos == this.size) { return retIndex(this.content.length, pos) }
-  if (pos > this.size || pos < 0) { throw new RangeError(("Position " + pos + " outside of fragment (" + (this) + ")")) }
-  for (var i = 0, curPos = 0;; i++) {
-    var cur = this$1.child(i), end = curPos + cur.nodeSize;
-    if (end >= pos) {
-      if (end == pos || round > 0) { return retIndex(i + 1, end) }
-      return retIndex(i, curPos)
-    }
-    curPos = end;
-  }
-};
-
-// :: () → string
-// Return a debugging string that describes this fragment.
-Fragment.prototype.toString = function toString () { return "<" + this.toStringInner() + ">" };
-
-Fragment.prototype.toStringInner = function toStringInner () { return this.content.join(", ") };
-
-// :: () → ?Object
-// Create a JSON-serializeable representation of this fragment.
-Fragment.prototype.toJSON = function toJSON () {
-  return this.content.length ? this.content.map(function (n) { return n.toJSON(); }) : null
-};
-
-// :: (Schema, ?Object) → Fragment
-// Deserialize a fragment from its JSON representation.
-Fragment.fromJSON = function fromJSON (schema, value) {
-  if (!value) { return Fragment.empty }
-  if (!Array.isArray(value)) { throw new RangeError("Invalid input for Fragment.fromJSON") }
-  return new Fragment(value.map(schema.nodeFromJSON))
-};
-
-// :: ([Node]) → Fragment
-// Build a fragment from an array of nodes. Ensures that adjacent
-// text nodes with the same marks are joined together.
-Fragment.fromArray = function fromArray (array) {
-  if (!array.length) { return Fragment.empty }
-  var joined, size = 0;
-  for (var i = 0; i < array.length; i++) {
-    var node = array[i];
-    size += node.nodeSize;
-    if (i && node.isText && array[i - 1].sameMarkup(node)) {
-      if (!joined) { joined = array.slice(0, i); }
-      joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text);
-    } else if (joined) {
-      joined.push(node);
-    }
-  }
-  return new Fragment(joined || array, size)
-};
-
-// :: (?union<Fragment, Node, [Node]>) → Fragment
-// Create a fragment from something that can be interpreted as a set
-// of nodes. For `null`, it returns the empty fragment. For a
-// fragment, the fragment itself. For a node or array of nodes, a
-// fragment containing those nodes.
-Fragment.from = function from (nodes) {
-  if (!nodes) { return Fragment.empty }
-  if (nodes instanceof Fragment) { return nodes }
-  if (Array.isArray(nodes)) { return this.fromArray(nodes) }
-  return new Fragment([nodes], nodes.nodeSize)
-};
-
-Object.defineProperties( Fragment.prototype, prototypeAccessors$1 );
-
-var found = {index: 0, offset: 0};
-function retIndex(index, offset) {
-  found.index = index;
-  found.offset = offset;
-  return found
-}
-
-// :: Fragment
-// An empty fragment. Intended to be reused whenever a node doesn't
-// contain anything (rather than allocating a new empty fragment for
-// each leaf node).
-Fragment.empty = new Fragment([], 0);
-
-function compareDeep(a, b) {
-  if (a === b) { return true }
-  if (!(a && typeof a == "object") ||
-      !(b && typeof b == "object")) { return false }
-  var array = Array.isArray(a);
-  if (Array.isArray(b) != array) { return false }
-  if (array) {
-    if (a.length != b.length) { return false }
-    for (var i = 0; i < a.length; i++) { if (!compareDeep(a[i], b[i])) { return false } }
-  } else {
-    for (var p in a) { if (!(p in b) || !compareDeep(a[p], b[p])) { return false } }
-    for (var p$1 in b) { if (!(p$1 in a)) { return false } }
-  }
-  return true
-}
-
-// ::- A mark is a piece of information that can be attached to a node,
-// such as it being emphasized, in code font, or a link. It has a type
-// and optionally a set of attributes that provide further information
-// (such as the target of the link). Marks are created through a
-// `Schema`, which controls which types exist and which
-// attributes they have.
-var Mark = function Mark(type, attrs) {
-  // :: MarkType
-  // The type of this mark.
-  this.type = type;
-  // :: Object
-  // The attributes associated with this mark.
-  this.attrs = attrs;
-};
-
-// :: ([Mark]) → [Mark]
-// Given a set of marks, create a new set which contains this one as
-// well, in the right position. If this mark is already in the set,
-// the set itself is returned. If any marks that are set to be
-// [exclusive](#model.MarkSpec.excludes) with this mark are present,
-// those are replaced by this one.
-Mark.prototype.addToSet = function addToSet (set) {
-    var this$1 = this;
-
-  var copy, placed = false;
-  for (var i = 0; i < set.length; i++) {
-    var other = set[i];
-    if (this$1.eq(other)) { return set }
-    if (this$1.type.excludes(other.type)) {
-      if (!copy) { copy = set.slice(0, i); }
-    } else if (other.type.excludes(this$1.type)) {
-      return set
-    } else {
-      if (!placed && other.type.rank > this$1.type.rank) {
-        if (!copy) { copy = set.slice(0, i); }
-        copy.push(this$1);
-        placed = true;
-      }
-      if (copy) { copy.push(other); }
-    }
-  }
-  if (!copy) { copy = set.slice(); }
-  if (!placed) { copy.push(this); }
-  return copy
-};
-
-// :: ([Mark]) → [Mark]
-// Remove this mark from the given set, returning a new set. If this
-// mark is not in the set, the set itself is returned.
-Mark.prototype.removeFromSet = function removeFromSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (this$1.eq(set[i]))
-      { return set.slice(0, i).concat(set.slice(i + 1)) } }
-  return set
-};
-
-// :: ([Mark]) → bool
-// Test whether this mark is in the given set of marks.
-Mark.prototype.isInSet = function isInSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (this$1.eq(set[i])) { return true } }
-  return false
-};
-
-// :: (Mark) → bool
-// Test whether this mark has the same type and attributes as
-// another mark.
-Mark.prototype.eq = function eq (other) {
-  return this == other ||
-    (this.type == other.type && compareDeep(this.attrs, other.attrs))
-};
-
-// :: () → Object
-// Convert this mark to a JSON-serializeable representation.
-Mark.prototype.toJSON = function toJSON () {
-    var this$1 = this;
-
-  var obj = {type: this.type.name};
-  for (var _ in this$1.attrs) {
-    obj.attrs = this$1.attrs;
-    break
-  }
-  return obj
-};
-
-// :: (Schema, Object) → Mark
-Mark.fromJSON = function fromJSON (schema, json) {
-  if (!json) { throw new RangeError("Invalid input for Mark.fromJSON") }
-  var type = schema.marks[json.type];
-  if (!type) { throw new RangeError(("There is no mark type " + (json.type) + " in this schema")) }
-  return type.create(json.attrs)
-};
-
-// :: ([Mark], [Mark]) → bool
-// Test whether two sets of marks are identical.
-Mark.sameSet = function sameSet (a, b) {
-  if (a == b) { return true }
-  if (a.length != b.length) { return false }
-  for (var i = 0; i < a.length; i++)
-    { if (!a[i].eq(b[i])) { return false } }
-  return true
-};
-
-// :: (?union<Mark, [Mark]>) → [Mark]
-// Create a properly sorted mark set from null, a single mark, or an
-// unsorted array of marks.
-Mark.setFrom = function setFrom (marks) {
-  if (!marks || marks.length == 0) { return Mark.none }
-  if (marks instanceof Mark) { return [marks] }
-  var copy = marks.slice();
-  copy.sort(function (a, b) { return a.type.rank - b.type.rank; });
-  return copy
-};
-
-// :: [Mark] The empty set of marks.
-Mark.none = [];
-
-// ReplaceError:: class extends Error
-// Error type raised by [`Node.replace`](#model.Node.replace) when
-// given an invalid replacement.
-
-function ReplaceError(message) {
-  var err = Error.call(this, message);
-  err.__proto__ = ReplaceError.prototype;
-  return err
-}
-
-ReplaceError.prototype = Object.create(Error.prototype);
-ReplaceError.prototype.constructor = ReplaceError;
-ReplaceError.prototype.name = "ReplaceError";
-
-// ::- A slice represents a piece cut out of a larger document. It
-// stores not only a fragment, but also the depth up to which nodes on
-// both side are ‘open’ (cut through).
-var Slice = function Slice(content, openStart, openEnd) {
-  // :: Fragment The slice's content.
-  this.content = content;
-  // :: number The open depth at the start.
-  this.openStart = openStart;
-  // :: number The open depth at the end.
-  this.openEnd = openEnd;
-};
-
-var prototypeAccessors$2 = { size: {} };
-
-// :: number
-// The size this slice would add when inserted into a document.
-prototypeAccessors$2.size.get = function () {
-  return this.content.size - this.openStart - this.openEnd
-};
-
-Slice.prototype.insertAt = function insertAt (pos, fragment) {
-  var content = insertInto(this.content, pos + this.openStart, fragment, null);
-  return content && new Slice(content, this.openStart, this.openEnd)
-};
-
-Slice.prototype.removeBetween = function removeBetween (from, to) {
-  return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)
-};
-
-// :: (Slice) → bool
-// Tests whether this slice is equal to another slice.
-Slice.prototype.eq = function eq (other) {
-  return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd
-};
-
-Slice.prototype.toString = function toString () {
-  return this.content + "(" + this.openStart + "," + this.openEnd + ")"
-};
-
-// :: () → ?Object
-// Convert a slice to a JSON-serializable representation.
-Slice.prototype.toJSON = function toJSON () {
-  if (!this.content.size) { return null }
-  var json = {content: this.content.toJSON()};
-  if (this.openStart > 0) { json.openStart = this.openStart; }
-  if (this.openEnd > 0) { json.openEnd = this.openEnd; }
-  return json
-};
-
-// :: (Schema, ?Object) → Slice
-// Deserialize a slice from its JSON representation.
-Slice.fromJSON = function fromJSON (schema, json) {
-  if (!json) { return Slice.empty }
-  var openStart = json.openStart || 0, openEnd = json.openEnd || 0;
-  if (typeof openStart != "number" || typeof openEnd != "number")
-    { throw new RangeError("Invalid input for Slice.fromJSON") }
-  return new Slice(Fragment.fromJSON(schema, json.content), json.openStart || 0, json.openEnd || 0)
-};
-
-// :: (Fragment, ?bool) → Slice
-// Create a slice from a fragment by taking the maximum possible
-// open value on both side of the fragment.
-Slice.maxOpen = function maxOpen (fragment, openIsolating) {
-    if ( openIsolating === void 0 ) { openIsolating=true; }
-
-  var openStart = 0, openEnd = 0;
-  for (var n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) { openStart++; }
-  for (var n$1 = fragment.lastChild; n$1 && !n$1.isLeaf && (openIsolating || !n$1.type.spec.isolating); n$1 = n$1.lastChild) { openEnd++; }
-  return new Slice(fragment, openStart, openEnd)
-};
-
-Object.defineProperties( Slice.prototype, prototypeAccessors$2 );
-
-function removeRange(content, from, to) {
-  var ref = content.findIndex(from);
-  var index = ref.index;
-  var offset = ref.offset;
-  var child = content.maybeChild(index);
-  var ref$1 = content.findIndex(to);
-  var indexTo = ref$1.index;
-  var offsetTo = ref$1.offset;
-  if (offset == from || child.isText) {
-    if (offsetTo != to && !content.child(indexTo).isText) { throw new RangeError("Removing non-flat range") }
-    return content.cut(0, from).append(content.cut(to))
-  }
-  if (index != indexTo) { throw new RangeError("Removing non-flat range") }
-  return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))
-}
-
-function insertInto(content, dist, insert, parent) {
-  var ref = content.findIndex(dist);
-  var index = ref.index;
-  var offset = ref.offset;
-  var child = content.maybeChild(index);
-  if (offset == dist || child.isText) {
-    if (parent && !parent.canReplace(index, index, insert)) { return null }
-    return content.cut(0, dist).append(insert).append(content.cut(dist))
-  }
-  var inner = insertInto(child.content, dist - offset - 1, insert);
-  return inner && content.replaceChild(index, child.copy(inner))
-}
-
-// :: Slice
-// The empty slice.
-Slice.empty = new Slice(Fragment.empty, 0, 0);
-
-function replace($from, $to, slice) {
-  if (slice.openStart > $from.depth)
-    { throw new ReplaceError("Inserted content deeper than insertion position") }
-  if ($from.depth - slice.openStart != $to.depth - slice.openEnd)
-    { throw new ReplaceError("Inconsistent open depths") }
-  return replaceOuter($from, $to, slice, 0)
-}
-
-function replaceOuter($from, $to, slice, depth) {
-  var index = $from.index(depth), node = $from.node(depth);
-  if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {
-    var inner = replaceOuter($from, $to, slice, depth + 1);
-    return node.copy(node.content.replaceChild(index, inner))
-  } else if (!slice.content.size) {
-    return close(node, replaceTwoWay($from, $to, depth))
-  } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case
-    var parent = $from.parent, content = parent.content;
-    return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))
-  } else {
-    var ref = prepareSliceForReplace(slice, $from);
-    var start = ref.start;
-    var end = ref.end;
-    return close(node, replaceThreeWay($from, start, end, $to, depth))
-  }
-}
-
-function checkJoin(main, sub) {
-  if (!sub.type.compatibleContent(main.type))
-    { throw new ReplaceError("Cannot join " + sub.type.name + " onto " + main.type.name) }
-}
-
-function joinable($before, $after, depth) {
-  var node = $before.node(depth);
-  checkJoin(node, $after.node(depth));
-  return node
-}
-
-function addNode(child, target) {
-  var last = target.length - 1;
-  if (last >= 0 && child.isText && child.sameMarkup(target[last]))
-    { target[last] = child.withText(target[last].text + child.text); }
-  else
-    { target.push(child); }
-}
-
-function addRange($start, $end, depth, target) {
-  var node = ($end || $start).node(depth);
-  var startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;
-  if ($start) {
-    startIndex = $start.index(depth);
-    if ($start.depth > depth) {
-      startIndex++;
-    } else if ($start.textOffset) {
-      addNode($start.nodeAfter, target);
-      startIndex++;
-    }
-  }
-  for (var i = startIndex; i < endIndex; i++) { addNode(node.child(i), target); }
-  if ($end && $end.depth == depth && $end.textOffset)
-    { addNode($end.nodeBefore, target); }
-}
-
-function close(node, content) {
-  if (!node.type.validContent(content))
-    { throw new ReplaceError("Invalid content for node " + node.type.name) }
-  return node.copy(content)
-}
-
-function replaceThreeWay($from, $start, $end, $to, depth) {
-  var openStart = $from.depth > depth && joinable($from, $start, depth + 1);
-  var openEnd = $to.depth > depth && joinable($end, $to, depth + 1);
-
-  var content = [];
-  addRange(null, $from, depth, content);
-  if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {
-    checkJoin(openStart, openEnd);
-    addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);
-  } else {
-    if (openStart)
-      { addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content); }
-    addRange($start, $end, depth, content);
-    if (openEnd)
-      { addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content); }
-  }
-  addRange($to, null, depth, content);
-  return new Fragment(content)
-}
-
-function replaceTwoWay($from, $to, depth) {
-  var content = [];
-  addRange(null, $from, depth, content);
-  if ($from.depth > depth) {
-    var type = joinable($from, $to, depth + 1);
-    addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);
-  }
-  addRange($to, null, depth, content);
-  return new Fragment(content)
-}
-
-function prepareSliceForReplace(slice, $along) {
-  var extra = $along.depth - slice.openStart, parent = $along.node(extra);
-  var node = parent.copy(slice.content);
-  for (var i = extra - 1; i >= 0; i--)
-    { node = $along.node(i).copy(Fragment.from(node)); }
-  return {start: node.resolveNoCache(slice.openStart + extra),
-          end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}
-}
-
-// ::- You can [_resolve_](#model.Node.resolve) a position to get more
-// information about it. Objects of this class represent such a
-// resolved position, providing various pieces of context information,
-// and some helper methods.
-//
-// Throughout this interface, methods that take an optional `depth`
-// parameter will interpret undefined as `this.depth` and negative
-// numbers as `this.depth + value`.
-var ResolvedPos = function ResolvedPos(pos, path, parentOffset) {
-  // :: number The position that was resolved.
-  this.pos = pos;
-  this.path = path;
-  // :: number
-  // The number of levels the parent node is from the root. If this
-  // position points directly into the root node, it is 0. If it
-  // points into a top-level paragraph, 1, and so on.
-  this.depth = path.length / 3 - 1;
-  // :: number The offset this position has into its parent node.
-  this.parentOffset = parentOffset;
-};
-
-var prototypeAccessors$3 = { parent: {},doc: {},textOffset: {},nodeAfter: {},nodeBefore: {} };
-
-ResolvedPos.prototype.resolveDepth = function resolveDepth (val) {
-  if (val == null) { return this.depth }
-  if (val < 0) { return this.depth + val }
-  return val
-};
-
-// :: Node
-// The parent node that the position points into. Note that even if
-// a position points into a text node, that node is not considered
-// the parent—text nodes are ‘flat’ in this model, and have no content.
-prototypeAccessors$3.parent.get = function () { return this.node(this.depth) };
-
-// :: Node
-// The root node in which the position was resolved.
-prototypeAccessors$3.doc.get = function () { return this.node(0) };
-
-// :: (?number) → Node
-// The ancestor node at the given level. `p.node(p.depth)` is the
-// same as `p.parent`.
-ResolvedPos.prototype.node = function node (depth) { return this.path[this.resolveDepth(depth) * 3] };
-
-// :: (?number) → number
-// The index into the ancestor at the given level. If this points at
-// the 3rd node in the 2nd paragraph on the top level, for example,
-// `p.index(0)` is 2 and `p.index(1)` is 3.
-ResolvedPos.prototype.index = function index (depth) { return this.path[this.resolveDepth(depth) * 3 + 1] };
-
-// :: (?number) → number
-// The index pointing after this position into the ancestor at the
-// given level.
-ResolvedPos.prototype.indexAfter = function indexAfter (depth) {
-  depth = this.resolveDepth(depth);
-  return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)
-};
-
-// :: (?number) → number
-// The (absolute) position at the start of the node at the given
-// level.
-ResolvedPos.prototype.start = function start (depth) {
-  depth = this.resolveDepth(depth);
-  return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1
-};
-
-// :: (?number) → number
-// The (absolute) position at the end of the node at the given
-// level.
-ResolvedPos.prototype.end = function end (depth) {
-  depth = this.resolveDepth(depth);
-  return this.start(depth) + this.node(depth).content.size
-};
-
-// :: (?number) → number
-// The (absolute) position directly before the wrapping node at the
-// given level, or, when `level` is `this.depth + 1`, the original
-// position.
-ResolvedPos.prototype.before = function before (depth) {
-  depth = this.resolveDepth(depth);
-  if (!depth) { throw new RangeError("There is no position before the top-level node") }
-  return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]
-};
-
-// :: (?number) → number
-// The (absolute) position directly after the wrapping node at the
-// given level, or the original position when `level` is `this.depth + 1`.
-ResolvedPos.prototype.after = function after (depth) {
-  depth = this.resolveDepth(depth);
-  if (!depth) { throw new RangeError("There is no position after the top-level node") }
-  return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize
-};
-
-// :: number
-// When this position points into a text node, this returns the
-// distance between the position and the start of the text node.
-// Will be zero for positions that point between nodes.
-prototypeAccessors$3.textOffset.get = function () { return this.pos - this.path[this.path.length - 1] };
-
-// :: ?Node
-// Get the node directly after the position, if any. If the position
-// points into a text node, only the part of that node after the
-// position is returned.
-prototypeAccessors$3.nodeAfter.get = function () {
-  var parent = this.parent, index = this.index(this.depth);
-  if (index == parent.childCount) { return null }
-  var dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);
-  return dOff ? parent.child(index).cut(dOff) : child
-};
-
-// :: ?Node
-// Get the node directly before the position, if any. If the
-// position points into a text node, only the part of that node
-// before the position is returned.
-prototypeAccessors$3.nodeBefore.get = function () {
-  var index = this.index(this.depth);
-  var dOff = this.pos - this.path[this.path.length - 1];
-  if (dOff) { return this.parent.child(index).cut(0, dOff) }
-  return index == 0 ? null : this.parent.child(index - 1)
-};
-
-// :: () → [Mark]
-// Get the marks at this position, factoring in the surrounding
-// marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the
-// position is at the start of a non-empty node, the marks of the
-// node after it (if any) are returned.
-ResolvedPos.prototype.marks = function marks () {
-  var parent = this.parent, index = this.index();
-
-  // In an empty parent, return the empty array
-  if (parent.content.size == 0) { return Mark.none }
-
-  // When inside a text node, just return the text node's marks
-  if (this.textOffset) { return parent.child(index).marks }
-
-  var main = parent.maybeChild(index - 1), other = parent.maybeChild(index);
-  // If the `after` flag is true of there is no node before, make
-  // the node after this position the main reference.
-  if (!main) { var tmp = main; main = other; other = tmp; }
-
-  // Use all marks in the main node, except those that have
-  // `inclusive` set to false and are not present in the other node.
-  var marks = main.marks;
-  for (var i = 0; i < marks.length; i++)
-    { if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))
-      { marks = marks[i--].removeFromSet(marks); } }
-
-  return marks
-};
-
-// :: (ResolvedPos) → ?[Mark]
-// Get the marks after the current position, if any, except those
-// that are non-inclusive and not present at position `$end`. This
-// is mostly useful for getting the set of marks to preserve after a
-// deletion. Will return `null` if this position is at the end of
-// its parent node or its parent node isn't a textblock (in which
-// case no marks should be preserved).
-ResolvedPos.prototype.marksAcross = function marksAcross ($end) {
-  var after = this.parent.maybeChild(this.index());
-  if (!after || !after.isInline) { return null }
-
-  var marks = after.marks, next = $end.parent.maybeChild($end.index());
-  for (var i = 0; i < marks.length; i++)
-    { if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))
-      { marks = marks[i--].removeFromSet(marks); } }
-  return marks
-};
-
-// :: (number) → number
-// The depth up to which this position and the given (non-resolved)
-// position share the same parent nodes.
-ResolvedPos.prototype.sharedDepth = function sharedDepth (pos) {
-    var this$1 = this;
-
-  for (var depth = this.depth; depth > 0; depth--)
-    { if (this$1.start(depth) <= pos && this$1.end(depth) >= pos) { return depth } }
-  return 0
-};
-
-// :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange
-// Returns a range based on the place where this position and the
-// given position diverge around block content. If both point into
-// the same textblock, for example, a range around that textblock
-// will be returned. If they point into different blocks, the range
-// around those blocks in their shared ancestor is returned. You can
-// pass in an optional predicate that will be called with a parent
-// node to see if a range into that parent is acceptable.
-ResolvedPos.prototype.blockRange = function blockRange (other, pred) {
-    var this$1 = this;
-    if ( other === void 0 ) { other = this; }
-
-  if (other.pos < this.pos) { return other.blockRange(this) }
-  for (var d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)
-    { if (other.pos <= this$1.end(d) && (!pred || pred(this$1.node(d))))
-      { return new NodeRange(this$1, other, d) } }
-};
-
-// :: (ResolvedPos) → bool
-// Query whether the given position shares the same parent node.
-ResolvedPos.prototype.sameParent = function sameParent (other) {
-  return this.pos - this.parentOffset == other.pos - other.parentOffset
-};
-
-// :: (ResolvedPos) → ResolvedPos
-// Return the greater of this and the given position.
-ResolvedPos.prototype.max = function max (other) {
-  return other.pos > this.pos ? other : this
-};
-
-// :: (ResolvedPos) → ResolvedPos
-// Return the smaller of this and the given position.
-ResolvedPos.prototype.min = function min (other) {
-  return other.pos < this.pos ? other : this
-};
-
-ResolvedPos.prototype.toString = function toString () {
-    var this$1 = this;
-
-  var str = "";
-  for (var i = 1; i <= this.depth; i++)
-    { str += (str ? "/" : "") + this$1.node(i).type.name + "_" + this$1.index(i - 1); }
-  return str + ":" + this.parentOffset
-};
-
-ResolvedPos.resolve = function resolve (doc, pos) {
-  if (!(pos >= 0 && pos <= doc.content.size)) { throw new RangeError("Position " + pos + " out of range") }
-  var path = [];
-  var start = 0, parentOffset = pos;
-  for (var node = doc;;) {
-    var ref = node.content.findIndex(parentOffset);
-      var index = ref.index;
-      var offset = ref.offset;
-    var rem = parentOffset - offset;
-    path.push(node, index, start + offset);
-    if (!rem) { break }
-    node = node.child(index);
-    if (node.isText) { break }
-    parentOffset = rem - 1;
-    start += offset + 1;
-  }
-  return new ResolvedPos(pos, path, parentOffset)
-};
-
-ResolvedPos.resolveCached = function resolveCached (doc, pos) {
-  for (var i = 0; i < resolveCache.length; i++) {
-    var cached = resolveCache[i];
-    if (cached.pos == pos && cached.doc == doc) { return cached }
-  }
-  var result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);
-  resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;
-  return result
-};
-
-Object.defineProperties( ResolvedPos.prototype, prototypeAccessors$3 );
-
-var resolveCache = [];
-var resolveCachePos = 0;
-var resolveCacheSize = 12;
-
-// ::- Represents a flat range of content, i.e. one that starts and
-// ends in the same node.
-var NodeRange = function NodeRange($from, $to, depth) {
-  // :: ResolvedPos A resolved position along the start of the
-  // content. May have a `depth` greater than this object's `depth`
-  // property, since these are the positions that were used to
-  // compute the range, not re-resolved positions directly at its
-  // boundaries.
-  this.$from = $from;
-  // :: ResolvedPos A position along the end of the content. See
-  // caveat for [`$from`](#model.NodeRange.$from).
-  this.$to = $to;
-  // :: number The depth of the node that this range points into.
-  this.depth = depth;
-};
-
-var prototypeAccessors$1$1 = { start: {},end: {},parent: {},startIndex: {},endIndex: {} };
-
-// :: number The position at the start of the range.
-prototypeAccessors$1$1.start.get = function () { return this.$from.before(this.depth + 1) };
-// :: number The position at the end of the range.
-prototypeAccessors$1$1.end.get = function () { return this.$to.after(this.depth + 1) };
-
-// :: Node The parent node that the range points into.
-prototypeAccessors$1$1.parent.get = function () { return this.$from.node(this.depth) };
-// :: number The start index of the range in the parent node.
-prototypeAccessors$1$1.startIndex.get = function () { return this.$from.index(this.depth) };
-// :: number The end index of the range in the parent node.
-prototypeAccessors$1$1.endIndex.get = function () { return this.$to.indexAfter(this.depth) };
-
-Object.defineProperties( NodeRange.prototype, prototypeAccessors$1$1 );
-
-var emptyAttrs = Object.create(null);
-
-// ::- This class represents a node in the tree that makes up a
-// ProseMirror document. So a document is an instance of `Node`, with
-// children that are also instances of `Node`.
-//
-// Nodes are persistent data structures. Instead of changing them, you
-// create new ones with the content you want. Old ones keep pointing
-// at the old document shape. This is made cheaper by sharing
-// structure between the old and new data as much as possible, which a
-// tree shape like this (without back pointers) makes easy.
-//
-// **Do not** directly mutate the properties of a `Node` object. See
-// [the guide](/docs/guide/#doc) for more information.
-var Node = function Node(type, attrs, content, marks) {
-  // :: NodeType
-  // The type of node that this is.
-  this.type = type;
-
-  // :: Object
-  // An object mapping attribute names to values. The kind of
-  // attributes allowed and required are
-  // [determined](#model.NodeSpec.attrs) by the node type.
-  this.attrs = attrs;
-
-  // :: Fragment
-  // A container holding the node's children.
-  this.content = content || Fragment.empty;
-
-  // :: [Mark]
-  // The marks (things like whether it is emphasized or part of a
-  // link) applied to this node.
-  this.marks = marks || Mark.none;
-};
-
-var prototypeAccessors = { nodeSize: {},childCount: {},textContent: {},firstChild: {},lastChild: {},isBlock: {},isTextblock: {},inlineContent: {},isInline: {},isText: {},isLeaf: {},isAtom: {} };
-
-// text:: ?string
-// For text nodes, this contains the node's text content.
-
-// :: number
-// The size of this node, as defined by the integer-based [indexing
-// scheme](/docs/guide/#doc.indexing). For text nodes, this is the
-// amount of characters. For other leaf nodes, it is one. For
-// non-leaf nodes, it is the size of the content plus two (the start
-// and end token).
-prototypeAccessors.nodeSize.get = function () { return this.isLeaf ? 1 : 2 + this.content.size };
-
-// :: number
-// The number of children that the node has.
-prototypeAccessors.childCount.get = function () { return this.content.childCount };
-
-// :: (number) → Node
-// Get the child node at the given index. Raises an error when the
-// index is out of range.
-Node.prototype.child = function child (index) { return this.content.child(index) };
-
-// :: (number) → ?Node
-// Get the child node at the given index, if it exists.
-Node.prototype.maybeChild = function maybeChild (index) { return this.content.maybeChild(index) };
-
-// :: ((node: Node, offset: number, index: number))
-// Call `f` for every child node, passing the node, its offset
-// into this parent node, and its index.
-Node.prototype.forEach = function forEach (f) { this.content.forEach(f); };
-
-// :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)
-// Invoke a callback for all descendant nodes recursively between
-// the given two positions that are relative to start of this node's
-// content. The callback is invoked with the node, its
-// parent-relative position, its parent node, and its child index.
-// When the callback returns false for a given node, that node's
-// children will not be recursed over. The last parameter can be
-// used to specify a starting position to count from.
-Node.prototype.nodesBetween = function nodesBetween (from, to, f, startPos) {
-    if ( startPos === void 0 ) { startPos = 0; }
-
-  this.content.nodesBetween(from, to, f, startPos, this);
-};
-
-// :: ((node: Node, pos: number, parent: Node) → ?bool)
-// Call the given callback for every descendant node. Doesn't
-// descend into a node when the callback returns `false`.
-Node.prototype.descendants = function descendants (f) {
-  this.nodesBetween(0, this.content.size, f);
-};
-
-// :: string
-// Concatenates all the text nodes found in this fragment and its
-// children.
-prototypeAccessors.textContent.get = function () { return this.textBetween(0, this.content.size, "") };
-
-// :: (number, number, ?string, ?string) → string
-// Get all text between positions `from` and `to`. When
-// `blockSeparator` is given, it will be inserted whenever a new
-// block node is started. When `leafText` is given, it'll be
-// inserted for every non-text leaf node encountered.
-Node.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
-  return this.content.textBetween(from, to, blockSeparator, leafText)
-};
-
-// :: ?Node
-// Returns this node's first child, or `null` if there are no
-// children.
-prototypeAccessors.firstChild.get = function () { return this.content.firstChild };
-
-// :: ?Node
-// Returns this node's last child, or `null` if there are no
-// children.
-prototypeAccessors.lastChild.get = function () { return this.content.lastChild };
-
-// :: (Node) → bool
-// Test whether two nodes represent the same piece of document.
-Node.prototype.eq = function eq (other) {
-  return this == other || (this.sameMarkup(other) && this.content.eq(other.content))
-};
-
-// :: (Node) → bool
-// Compare the markup (type, attributes, and marks) of this node to
-// those of another. Returns `true` if both have the same markup.
-Node.prototype.sameMarkup = function sameMarkup (other) {
-  return this.hasMarkup(other.type, other.attrs, other.marks)
-};
-
-// :: (NodeType, ?Object, ?[Mark]) → bool
-// Check whether this node's markup correspond to the given type,
-// attributes, and marks.
-Node.prototype.hasMarkup = function hasMarkup (type, attrs, marks) {
-  return this.type == type &&
-    compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&
-    Mark.sameSet(this.marks, marks || Mark.none)
-};
-
-// :: (?Fragment) → Node
-// Create a new node with the same markup as this node, containing
-// the given content (or empty, if no content is given).
-Node.prototype.copy = function copy (content) {
-    if ( content === void 0 ) { content = null; }
-
-  if (content == this.content) { return this }
-  return new this.constructor(this.type, this.attrs, content, this.marks)
-};
-
-// :: ([Mark]) → Node
-// Create a copy of this node, with the given set of marks instead
-// of the node's own marks.
-Node.prototype.mark = function mark (marks) {
-  return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)
-};
-
-// :: (number, ?number) → Node
-// Create a copy of this node with only the content between the
-// given positions. If `to` is not given, it defaults to the end of
-// the node.
-Node.prototype.cut = function cut (from, to) {
-  if (from == 0 && to == this.content.size) { return this }
-  return this.copy(this.content.cut(from, to))
-};
-
-// :: (number, ?number) → Slice
-// Cut out the part of the document between the given positions, and
-// return it as a `Slice` object.
-Node.prototype.slice = function slice (from, to, includeParents) {
-    if ( to === void 0 ) { to = this.content.size; }
-    if ( includeParents === void 0 ) { includeParents = false; }
-
-  if (from == to) { return Slice.empty }
-
-  var $from = this.resolve(from), $to = this.resolve(to);
-  var depth = includeParents ? 0 : $from.sharedDepth(to);
-  var start = $from.start(depth), node = $from.node(depth);
-  var content = node.content.cut($from.pos - start, $to.pos - start);
-  return new Slice(content, $from.depth - depth, $to.depth - depth)
-};
-
-// :: (number, number, Slice) → Node
-// Replace the part of the document between the given positions with
-// the given slice. The slice must 'fit', meaning its open sides
-// must be able to connect to the surrounding content, and its
-// content nodes must be valid children for the node they are placed
-// into. If any of this is violated, an error of type
-// [`ReplaceError`](#model.ReplaceError) is thrown.
-Node.prototype.replace = function replace$1 (from, to, slice) {
-  return replace(this.resolve(from), this.resolve(to), slice)
-};
-
-// :: (number) → ?Node
-// Find the node directly after the given position.
-Node.prototype.nodeAt = function nodeAt (pos) {
-  for (var node = this;;) {
-    var ref = node.content.findIndex(pos);
-      var index = ref.index;
-      var offset = ref.offset;
-    node = node.maybeChild(index);
-    if (!node) { return null }
-    if (offset == pos || node.isText) { return node }
-    pos -= offset + 1;
-  }
-};
-
-// :: (number) → {node: ?Node, index: number, offset: number}
-// Find the (direct) child node after the given offset, if any,
-// and return it along with its index and offset relative to this
-// node.
-Node.prototype.childAfter = function childAfter (pos) {
-  var ref = this.content.findIndex(pos);
-    var index = ref.index;
-    var offset = ref.offset;
-  return {node: this.content.maybeChild(index), index: index, offset: offset}
-};
-
-// :: (number) → {node: ?Node, index: number, offset: number}
-// Find the (direct) child node before the given offset, if any,
-// and return it along with its index and offset relative to this
-// node.
-Node.prototype.childBefore = function childBefore (pos) {
-  if (pos == 0) { return {node: null, index: 0, offset: 0} }
-  var ref = this.content.findIndex(pos);
-    var index = ref.index;
-    var offset = ref.offset;
-  if (offset < pos) { return {node: this.content.child(index), index: index, offset: offset} }
-  var node = this.content.child(index - 1);
-  return {node: node, index: index - 1, offset: offset - node.nodeSize}
-};
-
-// :: (number) → ResolvedPos
-// Resolve the given position in the document, returning an
-// [object](#model.ResolvedPos) with information about its context.
-Node.prototype.resolve = function resolve (pos) { return ResolvedPos.resolveCached(this, pos) };
-
-Node.prototype.resolveNoCache = function resolveNoCache (pos) { return ResolvedPos.resolve(this, pos) };
-
-// :: (number, number, MarkType) → bool
-// Test whether a mark of the given type occurs in this document
-// between the two given positions.
-Node.prototype.rangeHasMark = function rangeHasMark (from, to, type) {
-  var found = false;
-  if (to > from) { this.nodesBetween(from, to, function (node) {
-    if (type.isInSet(node.marks)) { found = true; }
-    return !found
-  }); }
-  return found
-};
-
-// :: bool
-// True when this is a block (non-inline node)
-prototypeAccessors.isBlock.get = function () { return this.type.isBlock };
-
-// :: bool
-// True when this is a textblock node, a block node with inline
-// content.
-prototypeAccessors.isTextblock.get = function () { return this.type.isTextblock };
-
-// :: bool
-// True when this node has inline content.
-prototypeAccessors.inlineContent.get = function () { return this.type.inlineContent };
-
-// :: bool
-// True when this is an inline node (a text node or a node that can
-// appear among text).
-prototypeAccessors.isInline.get = function () { return this.type.isInline };
-
-// :: bool
-// True when this is a text node.
-prototypeAccessors.isText.get = function () { return this.type.isText };
-
-// :: bool
-// True when this is a leaf node.
-prototypeAccessors.isLeaf.get = function () { return this.type.isLeaf };
-
-// :: bool
-// True when this is an atom, i.e. when it does not have directly
-// editable content. This is usually the same as `isLeaf`, but can
-// be configured with the [`atom` property](#model.NodeSpec.atom) on
-// a node's spec (typically used when the node is displayed as an
-// uneditable [node view](#view.NodeView)).
-prototypeAccessors.isAtom.get = function () { return this.type.isAtom };
-
-// :: () → string
-// Return a string representation of this node for debugging
-// purposes.
-Node.prototype.toString = function toString () {
-  if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
-  var name = this.type.name;
-  if (this.content.size)
-    { name += "(" + this.content.toStringInner() + ")"; }
-  return wrapMarks(this.marks, name)
-};
-
-// :: (number) → ContentMatch
-// Get the content match in this node at the given index.
-Node.prototype.contentMatchAt = function contentMatchAt (index) {
-  return this.type.contentMatch.matchFragment(this.content, 0, index)
-};
-
-// :: (number, number, ?Fragment, ?number, ?number) → bool
-// Test whether replacing the range between `from` and `to` (by
-// child index) with the given replacement fragment (which defaults
-// to the empty fragment) would leave the node's content valid. You
-// can optionally pass `start` and `end` indices into the
-// replacement fragment.
-Node.prototype.canReplace = function canReplace (from, to, replacement, start, end) {
-    var this$1 = this;
-    if ( replacement === void 0 ) { replacement = Fragment.empty; }
-    if ( start === void 0 ) { start = 0; }
-    if ( end === void 0 ) { end = replacement.childCount; }
-
-  var one = this.contentMatchAt(from).matchFragment(replacement, start, end);
-  var two = one && one.matchFragment(this.content, to);
-  if (!two || !two.validEnd) { return false }
-  for (var i = start; i < end; i++) { if (!this$1.type.allowsMarks(replacement.child(i).marks)) { return false } }
-  return true
-};
-
-// :: (number, number, NodeType, ?[Mark]) → bool
-// Test whether replacing the range `from` to `to` (by index) with a
-// node of the given type would leave the node's content valid.
-Node.prototype.canReplaceWith = function canReplaceWith (from, to, type, marks) {
-  if (marks && !this.type.allowsMarks(marks)) { return false }
-  var start = this.contentMatchAt(from).matchType(type);
-  var end = start && start.matchFragment(this.content, to);
-  return end ? end.validEnd : false
-};
-
-// :: (Node) → bool
-// Test whether the given node's content could be appended to this
-// node. If that node is empty, this will only return true if there
-// is at least one node type that can appear in both nodes (to avoid
-// merging completely incompatible nodes).
-Node.prototype.canAppend = function canAppend (other) {
-  if (other.content.size) { return this.canReplace(this.childCount, this.childCount, other.content) }
-  else { return this.type.compatibleContent(other.type) }
-};
-
-// Unused. Left for backwards compatibility.
-Node.prototype.defaultContentType = function defaultContentType (at) {
-  return this.contentMatchAt(at).defaultType
-};
-
-// :: ()
-// Check whether this node and its descendants conform to the
-// schema, and raise error when they do not.
-Node.prototype.check = function check () {
-  if (!this.type.validContent(this.content))
-    { throw new RangeError(("Invalid content for node " + (this.type.name) + ": " + (this.content.toString().slice(0, 50)))) }
-  this.content.forEach(function (node) { return node.check(); });
-};
-
-// :: () → Object
-// Return a JSON-serializeable representation of this node.
-Node.prototype.toJSON = function toJSON () {
-    var this$1 = this;
-
-  var obj = {type: this.type.name};
-  for (var _ in this$1.attrs) {
-    obj.attrs = this$1.attrs;
-    break
-  }
-  if (this.content.size)
-    { obj.content = this.content.toJSON(); }
-  if (this.marks.length)
-    { obj.marks = this.marks.map(function (n) { return n.toJSON(); }); }
-  return obj
-};
-
-// :: (Schema, Object) → Node
-// Deserialize a node from its JSON representation.
-Node.fromJSON = function fromJSON (schema, json) {
-  if (!json) { throw new RangeError("Invalid input for Node.fromJSON") }
-  var marks = null;
-  if (json.marks) {
-    if (!Array.isArray(json.marks)) { throw new RangeError("Invalid mark data for Node.fromJSON") }
-    marks = json.marks.map(schema.markFromJSON);
-  }
-  if (json.type == "text") {
-    if (typeof json.text != "string") { throw new RangeError("Invalid text node in JSON") }
-    return schema.text(json.text, marks)
-  }
-  var content = Fragment.fromJSON(schema, json.content);
-  return schema.nodeType(json.type).create(json.attrs, content, marks)
-};
-
-Object.defineProperties( Node.prototype, prototypeAccessors );
-
-var TextNode = (function (Node) {
-  function TextNode(type, attrs, content, marks) {
-    Node.call(this, type, attrs, null, marks);
-
-    if (!content) { throw new RangeError("Empty text nodes are not allowed") }
-
-    this.text = content;
-  }
-
-  if ( Node ) { TextNode.__proto__ = Node; }
-  TextNode.prototype = Object.create( Node && Node.prototype );
-  TextNode.prototype.constructor = TextNode;
-
-  var prototypeAccessors$1 = { textContent: {},nodeSize: {} };
-
-  TextNode.prototype.toString = function toString () {
-    if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
-    return wrapMarks(this.marks, JSON.stringify(this.text))
-  };
-
-  prototypeAccessors$1.textContent.get = function () { return this.text };
-
-  TextNode.prototype.textBetween = function textBetween (from, to) { return this.text.slice(from, to) };
-
-  prototypeAccessors$1.nodeSize.get = function () { return this.text.length };
-
-  TextNode.prototype.mark = function mark (marks) {
-    return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)
-  };
-
-  TextNode.prototype.withText = function withText (text) {
-    if (text == this.text) { return this }
-    return new TextNode(this.type, this.attrs, text, this.marks)
-  };
-
-  TextNode.prototype.cut = function cut (from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.text.length; }
-
-    if (from == 0 && to == this.text.length) { return this }
-    return this.withText(this.text.slice(from, to))
-  };
-
-  TextNode.prototype.eq = function eq (other) {
-    return this.sameMarkup(other) && this.text == other.text
-  };
-
-  TextNode.prototype.toJSON = function toJSON () {
-    var base = Node.prototype.toJSON.call(this);
-    base.text = this.text;
-    return base
-  };
-
-  Object.defineProperties( TextNode.prototype, prototypeAccessors$1 );
-
-  return TextNode;
-}(Node));
-
-function wrapMarks(marks, str) {
-  for (var i = marks.length - 1; i >= 0; i--)
-    { str = marks[i].type.name + "(" + str + ")"; }
-  return str
-}
-
-// ::- Instances of this class represent a match state of a node
-// type's [content expression](#model.NodeSpec.content), and can be
-// used to find out whether further content matches here, and whether
-// a given position is a valid end of the node.
-var ContentMatch = function ContentMatch(validEnd) {
-  // :: bool
-  // True when this match state represents a valid end of the node.
-  this.validEnd = validEnd;
-  this.next = [];
-  this.wrapCache = [];
-};
-
-var prototypeAccessors$5 = { inlineContent: {},defaultType: {},edgeCount: {} };
-
-ContentMatch.parse = function parse (string, nodeTypes) {
-  var stream = new TokenStream(string, nodeTypes);
-  if (stream.next == null) { return ContentMatch.empty }
-  var expr = parseExpr(stream);
-  if (stream.next) { stream.err("Unexpected trailing text"); }
-  var match = dfa(nfa(expr));
-  checkForDeadEnds(match, stream);
-  return match
-};
-
-// :: (NodeType) → ?ContentMatch
-// Match a node type, returning a match after that node if
-// successful.
-ContentMatch.prototype.matchType = function matchType (type) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.next.length; i += 2)
-    { if (this$1.next[i] == type) { return this$1.next[i + 1] } }
-  return null
-};
-
-// :: (Fragment, ?number, ?number) → ?ContentMatch
-// Try to match a fragment. Returns the resulting match when
-// successful.
-ContentMatch.prototype.matchFragment = function matchFragment (frag, start, end) {
-    if ( start === void 0 ) { start = 0; }
-    if ( end === void 0 ) { end = frag.childCount; }
-
-  var cur = this;
-  for (var i = start; cur && i < end; i++)
-    { cur = cur.matchType(frag.child(i).type); }
-  return cur
-};
-
-prototypeAccessors$5.inlineContent.get = function () {
-  var first = this.next[0];
-  return first ? first.isInline : false
-};
-
-// :: ?NodeType
-// Get the first matching node type at this match position that can
-// be generated.
-prototypeAccessors$5.defaultType.get = function () {
-    var this$1 = this;
-
-  for (var i = 0; i < this.next.length; i += 2) {
-    var type = this$1.next[i];
-    if (!(type.isText || type.hasRequiredAttrs())) { return type }
-  }
-};
-
-ContentMatch.prototype.compatible = function compatible (other) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.next.length; i += 2)
-    { for (var j = 0; j < other.next.length; j += 2)
-      { if (this$1.next[i] == other.next[j]) { return true } } }
-  return false
-};
-
-// :: (Fragment, bool, ?number) → ?Fragment
-// Try to match the given fragment, and if that fails, see if it can
-// be made to match by inserting nodes in front of it. When
-// successful, return a fragment of inserted nodes (which may be
-// empty if nothing had to be inserted). When `toEnd` is true, only
-// return a fragment if the resulting match goes to the end of the
-// content expression.
-ContentMatch.prototype.fillBefore = function fillBefore (after, toEnd, startIndex) {
-    if ( toEnd === void 0 ) { toEnd = false; }
-    if ( startIndex === void 0 ) { startIndex = 0; }
-
-  var seen = [this];
-  function search(match, types) {
-    var finished = match.matchFragment(after, startIndex);
-    if (finished && (!toEnd || finished.validEnd))
-      { return Fragment.from(types.map(function (tp) { return tp.createAndFill(); })) }
-
-    for (var i = 0; i < match.next.length; i += 2) {
-      var type = match.next[i], next = match.next[i + 1];
-      if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {
-        seen.push(next);
-        var found = search(next, types.concat(type));
-        if (found) { return found }
-      }
-    }
-  }
-
-  return search(this, [])
-};
-
-// :: (NodeType) → ?[NodeType]
-// Find a set of wrapping node types that would allow a node of the
-// given type to appear at this position. The result may be empty
-// (when it fits directly) and will be null when no such wrapping
-// exists.
-ContentMatch.prototype.findWrapping = function findWrapping (target) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.wrapCache.length; i += 2)
-    { if (this$1.wrapCache[i] == target) { return this$1.wrapCache[i + 1] } }
-  var computed = this.computeWrapping(target);
-  this.wrapCache.push(target, computed);
-  return computed
-};
-
-ContentMatch.prototype.computeWrapping = function computeWrapping (target) {
-  var seen = Object.create(null), active = [{match: this, type: null, via: null}];
-  while (active.length) {
-    var current = active.shift(), match = current.match;
-    if (match.matchType(target)) {
-      var result = [];
-      for (var obj = current; obj.type; obj = obj.via)
-        { result.push(obj.type); }
-      return result.reverse()
-    }
-    for (var i = 0; i < match.next.length; i += 2) {
-      var type = match.next[i];
-      if (!type.isLeaf && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {
-        active.push({match: type.contentMatch, type: type, via: current});
-        seen[type.name] = true;
-      }
-    }
-  }
-};
-
-// :: number
-// The number of outgoing edges this node has in the finite
-// automaton that describes the content expression.
-prototypeAccessors$5.edgeCount.get = function () {
-  return this.next.length >> 1
-};
-
-// :: (number) → {type: NodeType, next: ContentMatch}
-// Get the _n_th outgoing edge from this node in the finite
-// automaton that describes the content expression.
-ContentMatch.prototype.edge = function edge (n) {
-  var i = n << 1;
-  if (i > this.next.length) { throw new RangeError(("There's no " + n + "th edge in this content match")) }
-  return {type: this.next[i], next: this.next[i + 1]}
-};
-
-ContentMatch.prototype.toString = function toString () {
-  var seen = [];
-  function scan(m) {
-    seen.push(m);
-    for (var i = 1; i < m.next.length; i += 2)
-      { if (seen.indexOf(m.next[i]) == -1) { scan(m.next[i]); } }
-  }
-  scan(this);
-  return seen.map(function (m, i) {
-    var out = i + (m.validEnd ? "*" : " ") + " ";
-    for (var i$1 = 0; i$1 < m.next.length; i$1 += 2)
-      { out += (i$1 ? ", " : "") + m.next[i$1].name + "->" + seen.indexOf(m.next[i$1 + 1]); }
-    return out
-  }).join("\n")
-};
-
-Object.defineProperties( ContentMatch.prototype, prototypeAccessors$5 );
-
-ContentMatch.empty = new ContentMatch(true);
-
-var TokenStream = function TokenStream(string, nodeTypes) {
-  this.string = string;
-  this.nodeTypes = nodeTypes;
-  this.inline = null;
-  this.pos = 0;
-  this.tokens = string.split(/\s*(?=\b|\W|$)/);
-  if (this.tokens[this.tokens.length - 1] == "") { this.tokens.pop(); }
-  if (this.tokens[0] == "") { this.tokens.unshift(); }
-};
-
-var prototypeAccessors$1$3 = { next: {} };
-
-prototypeAccessors$1$3.next.get = function () { return this.tokens[this.pos] };
-
-TokenStream.prototype.eat = function eat (tok) { return this.next == tok && (this.pos++ || true) };
-
-TokenStream.prototype.err = function err (str) { throw new SyntaxError(str + " (in content expression '" + this.string + "')") };
-
-Object.defineProperties( TokenStream.prototype, prototypeAccessors$1$3 );
-
-function parseExpr(stream) {
-  var exprs = [];
-  do { exprs.push(parseExprSeq(stream)); }
-  while (stream.eat("|"))
-  return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
-}
-
-function parseExprSeq(stream) {
-  var exprs = [];
-  do { exprs.push(parseExprSubscript(stream)); }
-  while (stream.next && stream.next != ")" && stream.next != "|")
-  return exprs.length == 1 ? exprs[0] : {type: "seq", exprs: exprs}
-}
-
-function parseExprSubscript(stream) {
-  var expr = parseExprAtom(stream);
-  for (;;) {
-    if (stream.eat("+"))
-      { expr = {type: "plus", expr: expr}; }
-    else if (stream.eat("*"))
-      { expr = {type: "star", expr: expr}; }
-    else if (stream.eat("?"))
-      { expr = {type: "opt", expr: expr}; }
-    else if (stream.eat("{"))
-      { expr = parseExprRange(stream, expr); }
-    else { break }
-  }
-  return expr
-}
-
-function parseNum(stream) {
-  if (/\D/.test(stream.next)) { stream.err("Expected number, got '" + stream.next + "'"); }
-  var result = Number(stream.next);
-  stream.pos++;
-  return result
-}
-
-function parseExprRange(stream, expr) {
-  var min = parseNum(stream), max = min;
-  if (stream.eat(",")) {
-    if (stream.next != "}") { max = parseNum(stream); }
-    else { max = -1; }
-  }
-  if (!stream.eat("}")) { stream.err("Unclosed braced range"); }
-  return {type: "range", min: min, max: max, expr: expr}
-}
-
-function resolveName(stream, name) {
-  var types = stream.nodeTypes, type = types[name];
-  if (type) { return [type] }
-  var result = [];
-  for (var typeName in types) {
-    var type$1 = types[typeName];
-    if (type$1.groups.indexOf(name) > -1) { result.push(type$1); }
-  }
-  if (result.length == 0) { stream.err("No node type or group '" + name + "' found"); }
-  return result
-}
-
-function parseExprAtom(stream) {
-  if (stream.eat("(")) {
-    var expr = parseExpr(stream);
-    if (!stream.eat(")")) { stream.err("Missing closing paren"); }
-    return expr
-  } else if (!/\W/.test(stream.next)) {
-    var exprs = resolveName(stream, stream.next).map(function (type) {
-      if (stream.inline == null) { stream.inline = type.isInline; }
-      else if (stream.inline != type.isInline) { stream.err("Mixing inline and block content"); }
-      return {type: "name", value: type}
-    });
-    stream.pos++;
-    return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
-  } else {
-    stream.err("Unexpected token '" + stream.next + "'");
-  }
-}
-
-// The code below helps compile a regular-expression-like language
-// into a deterministic finite automaton. For a good introduction to
-// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html
-
-// : (Object) → [[{term: ?any, to: number}]]
-// Construct an NFA from an expression as returned by the parser. The
-// NFA is represented as an array of states, which are themselves
-// arrays of edges, which are `{term, to}` objects. The first state is
-// the entry state and the last node is the success state.
-//
-// Note that unlike typical NFAs, the edge ordering in this one is
-// significant, in that it is used to contruct filler content when
-// necessary.
-function nfa(expr) {
-  var nfa = [[]];
-  connect(compile(expr, 0), node());
-  return nfa
-
-  function node() { return nfa.push([]) - 1 }
-  function edge(from, to, term) {
-    var edge = {term: term, to: to};
-    nfa[from].push(edge);
-    return edge
-  }
-  function connect(edges, to) { edges.forEach(function (edge) { return edge.to = to; }); }
-
-  function compile(expr, from) {
-    if (expr.type == "choice") {
-      return expr.exprs.reduce(function (out, expr) { return out.concat(compile(expr, from)); }, [])
-    } else if (expr.type == "seq") {
-      for (var i = 0;; i++) {
-        var next = compile(expr.exprs[i], from);
-        if (i == expr.exprs.length - 1) { return next }
-        connect(next, from = node());
-      }
-    } else if (expr.type == "star") {
-      var loop = node();
-      edge(from, loop);
-      connect(compile(expr.expr, loop), loop);
-      return [edge(loop)]
-    } else if (expr.type == "plus") {
-      var loop$1 = node();
-      connect(compile(expr.expr, from), loop$1);
-      connect(compile(expr.expr, loop$1), loop$1);
-      return [edge(loop$1)]
-    } else if (expr.type == "opt") {
-      return [edge(from)].concat(compile(expr.expr, from))
-    } else if (expr.type == "range") {
-      var cur = from;
-      for (var i$1 = 0; i$1 < expr.min; i$1++) {
-        var next$1 = node();
-        connect(compile(expr.expr, cur), next$1);
-        cur = next$1;
-      }
-      if (expr.max == -1) {
-        connect(compile(expr.expr, cur), cur);
-      } else {
-        for (var i$2 = expr.min; i$2 < expr.max; i$2++) {
-          var next$2 = node();
-          edge(cur, next$2);
-          connect(compile(expr.expr, cur), next$2);
-          cur = next$2;
-        }
-      }
-      return [edge(cur)]
-    } else if (expr.type == "name") {
-      return [edge(from, null, expr.value)]
-    }
-  }
-}
-
-function cmp(a, b) { return a - b }
-
-// Get the set of nodes reachable by null edges from `node`. Omit
-// nodes with only a single null-out-edge, since they may lead to
-// needless duplicated nodes.
-function nullFrom(nfa, node) {
-  var result = [];
-  scan(node);
-  return result.sort(cmp)
-
-  function scan(node) {
-    var edges = nfa[node];
-    if (edges.length == 1 && !edges[0].term) { return scan(edges[0].to) }
-    result.push(node);
-    for (var i = 0; i < edges.length; i++) {
-      var ref = edges[i];
-      var term = ref.term;
-      var to = ref.to;
-      if (!term && result.indexOf(to) == -1) { scan(to); }
-    }
-  }
-}
-
-// : ([[{term: ?any, to: number}]]) → ContentMatch
-// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set
-// of state objects (`ContentMatch` instances) with transitions
-// between them.
-function dfa(nfa) {
-  var labeled = Object.create(null);
-  return explore(nullFrom(nfa, 0))
-
-  function explore(states) {
-    var out = [];
-    states.forEach(function (node) {
-      nfa[node].forEach(function (ref) {
-        var term = ref.term;
-        var to = ref.to;
-
-        if (!term) { return }
-        var known = out.indexOf(term), set = known > -1 && out[known + 1];
-        nullFrom(nfa, to).forEach(function (node) {
-          if (!set) { out.push(term, set = []); }
-          if (set.indexOf(node) == -1) { set.push(node); }
-        });
-      });
-    });
-    var state = labeled[states.join(",")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);
-    for (var i = 0; i < out.length; i += 2) {
-      var states$1 = out[i + 1].sort(cmp);
-      state.next.push(out[i], labeled[states$1.join(",")] || explore(states$1));
-    }
-    return state
-  }
-}
-
-function checkForDeadEnds(match, stream) {
-  for (var i = 0, work = [match]; i < work.length; i++) {
-    var state = work[i], dead = !state.validEnd, nodes = [];
-    for (var j = 0; j < state.next.length; j += 2) {
-      var node = state.next[j], next = state.next[j + 1];
-      nodes.push(node.name);
-      if (dead && !(node.isText || node.hasRequiredAttrs())) { dead = false; }
-      if (work.indexOf(next) == -1) { work.push(next); }
-    }
-    if (dead) { stream.err("Only non-generatable nodes (" + nodes.join(", ") + ") in a required position"); }
-  }
-}
-
-// For node types where all attrs have a default value (or which don't
-// have any attributes), build up a single reusable default attribute
-// object, and use it for all nodes that don't specify specific
-// attributes.
-function defaultAttrs(attrs) {
-  var defaults = Object.create(null);
-  for (var attrName in attrs) {
-    var attr = attrs[attrName];
-    if (!attr.hasDefault) { return null }
-    defaults[attrName] = attr.default;
-  }
-  return defaults
-}
-
-function computeAttrs(attrs, value) {
-  var built = Object.create(null);
-  for (var name in attrs) {
-    var given = value && value[name];
-    if (given === undefined) {
-      var attr = attrs[name];
-      if (attr.hasDefault) { given = attr.default; }
-      else { throw new RangeError("No value supplied for attribute " + name) }
-    }
-    built[name] = given;
-  }
-  return built
-}
-
-function initAttrs(attrs) {
-  var result = Object.create(null);
-  if (attrs) { for (var name in attrs) { result[name] = new Attribute(attrs[name]); } }
-  return result
-}
-
-// ::- Node types are objects allocated once per `Schema` and used to
-// [tag](#model.Node.type) `Node` instances. They contain information
-// about the node type, such as its name and what kind of node it
-// represents.
-var NodeType = function NodeType(name, schema, spec) {
-  // :: string
-  // The name the node type has in this schema.
-  this.name = name;
-
-  // :: Schema
-  // A link back to the `Schema` the node type belongs to.
-  this.schema = schema;
-
-  // :: NodeSpec
-  // The spec that this type is based on
-  this.spec = spec;
-
-  this.groups = spec.group ? spec.group.split(" ") : [];
-  this.attrs = initAttrs(spec.attrs);
-
-  this.defaultAttrs = defaultAttrs(this.attrs);
-
-  // :: ContentMatch
-  // The starting match of the node type's content expression.
-  this.contentMatch = null;
-
-  // : ?[MarkType]
-  // The set of marks allowed in this node. `null` means all marks
-  // are allowed.
-  this.markSet = null;
-
-  // :: bool
-  // True if this node type has inline content.
-  this.inlineContent = null;
-
-  // :: bool
-  // True if this is a block type
-  this.isBlock = !(spec.inline || name == "text");
-
-  // :: bool
-  // True if this is the text node type.
-  this.isText = name == "text";
-};
-
-var prototypeAccessors$4 = { isInline: {},isTextblock: {},isLeaf: {},isAtom: {} };
-
-// :: bool
-// True if this is an inline type.
-prototypeAccessors$4.isInline.get = function () { return !this.isBlock };
-
-// :: bool
-// True if this is a textblock type, a block that contains inline
-// content.
-prototypeAccessors$4.isTextblock.get = function () { return this.isBlock && this.inlineContent };
-
-// :: bool
-// True for node types that allow no content.
-prototypeAccessors$4.isLeaf.get = function () { return this.contentMatch == ContentMatch.empty };
-
-// :: bool
-// True when this node is an atom, i.e. when it does not have
-// directly editable content.
-prototypeAccessors$4.isAtom.get = function () { return this.isLeaf || this.spec.atom };
-
-NodeType.prototype.hasRequiredAttrs = function hasRequiredAttrs (ignore) {
-    var this$1 = this;
-
-  for (var n in this$1.attrs)
-    { if (this$1.attrs[n].isRequired && (!ignore || !(n in ignore))) { return true } }
-  return false
-};
-
-NodeType.prototype.compatibleContent = function compatibleContent (other) {
-  return this == other || this.contentMatch.compatible(other.contentMatch)
-};
-
-NodeType.prototype.computeAttrs = function computeAttrs$1 (attrs) {
-  if (!attrs && this.defaultAttrs) { return this.defaultAttrs }
-  else { return computeAttrs(this.attrs, attrs) }
-};
-
-// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-// Create a `Node` of this type. The given attributes are
-// checked and defaulted (you can pass `null` to use the type's
-// defaults entirely, if no required attributes exist). `content`
-// may be a `Fragment`, a node, an array of nodes, or
-// `null`. Similarly `marks` may be `null` to default to the empty
-// set of marks.
-NodeType.prototype.create = function create (attrs, content, marks) {
-  if (this.isText) { throw new Error("NodeType.create can't construct text nodes") }
-  return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))
-};
-
-// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-// Like [`create`](#model.NodeType.create), but check the given content
-// against the node type's content restrictions, and throw an error
-// if it doesn't match.
-NodeType.prototype.createChecked = function createChecked (attrs, content, marks) {
-  content = Fragment.from(content);
-  if (!this.validContent(content))
-    { throw new RangeError("Invalid content for node " + this.name) }
-  return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))
-};
-
-// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → ?Node
-// Like [`create`](#model.NodeType.create), but see if it is necessary to
-// add nodes to the start or end of the given fragment to make it
-// fit the node. If no fitting wrapping can be found, return null.
-// Note that, due to the fact that required nodes can always be
-// created, this will always succeed if you pass null or
-// `Fragment.empty` as content.
-NodeType.prototype.createAndFill = function createAndFill (attrs, content, marks) {
-  attrs = this.computeAttrs(attrs);
-  content = Fragment.from(content);
-  if (content.size) {
-    var before = this.contentMatch.fillBefore(content);
-    if (!before) { return null }
-    content = before.append(content);
-  }
-  var after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true);
-  if (!after) { return null }
-  return new Node(this, attrs, content.append(after), Mark.setFrom(marks))
-};
-
-// :: (Fragment) → bool
-// Returns true if the given fragment is valid content for this node
-// type with the given attributes.
-NodeType.prototype.validContent = function validContent (content) {
-    var this$1 = this;
-
-  var result = this.contentMatch.matchFragment(content);
-  if (!result || !result.validEnd) { return false }
-  for (var i = 0; i < content.childCount; i++)
-    { if (!this$1.allowsMarks(content.child(i).marks)) { return false } }
-  return true
-};
-
-// :: (MarkType) → bool
-// Check whether the given mark type is allowed in this node.
-NodeType.prototype.allowsMarkType = function allowsMarkType (markType) {
-  return this.markSet == null || this.markSet.indexOf(markType) > -1
-};
-
-// :: ([Mark]) → bool
-// Test whether the given set of marks are allowed in this node.
-NodeType.prototype.allowsMarks = function allowsMarks (marks) {
-    var this$1 = this;
-
-  if (this.markSet == null) { return true }
-  for (var i = 0; i < marks.length; i++) { if (!this$1.allowsMarkType(marks[i].type)) { return false } }
-  return true
-};
-
-// :: ([Mark]) → [Mark]
-// Removes the marks that are not allowed in this node from the given set.
-NodeType.prototype.allowedMarks = function allowedMarks (marks) {
-    var this$1 = this;
-
-  if (this.markSet == null) { return marks }
-  var copy;
-  for (var i = 0; i < marks.length; i++) {
-    if (!this$1.allowsMarkType(marks[i].type)) {
-      if (!copy) { copy = marks.slice(0, i); }
-    } else if (copy) {
-      copy.push(marks[i]);
-    }
-  }
-  return !copy ? marks : copy.length ? copy : Mark.empty
-};
-
-NodeType.compile = function compile (nodes, schema) {
-  var result = Object.create(null);
-  nodes.forEach(function (name, spec) { return result[name] = new NodeType(name, schema, spec); });
-
-  var topType = schema.spec.topNode || "doc";
-  if (!result[topType]) { throw new RangeError("Schema is missing its top node type ('" + topType + "')") }
-  if (!result.text) { throw new RangeError("Every schema needs a 'text' type") }
-  for (var _ in result.text.attrs) { throw new RangeError("The text node type should not have attributes") }
-
-  return result
-};
-
-Object.defineProperties( NodeType.prototype, prototypeAccessors$4 );
-
-// Attribute descriptors
-
-var Attribute = function Attribute(options) {
-  this.hasDefault = Object.prototype.hasOwnProperty.call(options, "default");
-  this.default = options.default;
-};
-
-var prototypeAccessors$1$2 = { isRequired: {} };
-
-prototypeAccessors$1$2.isRequired.get = function () {
-  return !this.hasDefault
-};
-
-Object.defineProperties( Attribute.prototype, prototypeAccessors$1$2 );
-
-// Marks
-
-// ::- Like nodes, marks (which are associated with nodes to signify
-// things like emphasis or being part of a link) are
-// [tagged](#model.Mark.type) with type objects, which are
-// instantiated once per `Schema`.
-var MarkType = function MarkType(name, rank, schema, spec) {
-  // :: string
-  // The name of the mark type.
-  this.name = name;
-
-  // :: Schema
-  // The schema that this mark type instance is part of.
-  this.schema = schema;
-
-  // :: MarkSpec
-  // The spec on which the type is based.
-  this.spec = spec;
-
-  this.attrs = initAttrs(spec.attrs);
-
-  this.rank = rank;
-  this.excluded = null;
-  var defaults = defaultAttrs(this.attrs);
-  this.instance = defaults && new Mark(this, defaults);
-};
-
-// :: (?Object) → Mark
-// Create a mark of this type. `attrs` may be `null` or an object
-// containing only some of the mark's attributes. The others, if
-// they have defaults, will be added.
-MarkType.prototype.create = function create (attrs) {
-  if (!attrs && this.instance) { return this.instance }
-  return new Mark(this, computeAttrs(this.attrs, attrs))
-};
-
-MarkType.compile = function compile (marks, schema) {
-  var result = Object.create(null), rank = 0;
-  marks.forEach(function (name, spec) { return result[name] = new MarkType(name, rank++, schema, spec); });
-  return result
-};
-
-// :: ([Mark]) → [Mark]
-// When there is a mark of this type in the given set, a new set
-// without it is returned. Otherwise, the input set is returned.
-MarkType.prototype.removeFromSet = function removeFromSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (set[i].type == this$1)
-      { return set.slice(0, i).concat(set.slice(i + 1)) } }
-  return set
-};
-
-// :: ([Mark]) → ?Mark
-// Tests whether there is a mark of this type in the given set.
-MarkType.prototype.isInSet = function isInSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (set[i].type == this$1) { return set[i] } }
-};
-
-// :: (MarkType) → bool
-// Queries whether a given mark type is
-// [excluded](#model.MarkSpec.excludes) by this one.
-MarkType.prototype.excludes = function excludes (other) {
-  return this.excluded.indexOf(other) > -1
-};
-
-// SchemaSpec:: interface
-// An object describing a schema, as passed to the [`Schema`](#model.Schema)
-// constructor.
-//
-//   nodes:: union<Object<NodeSpec>, OrderedMap<NodeSpec>>
-//   The node types in this schema. Maps names to
-//   [`NodeSpec`](#model.NodeSpec) objects that describe the node type
-//   associated with that name. Their order is significant—it
-//   determines which [parse rules](#model.NodeSpec.parseDOM) take
-//   precedence by default, and which nodes come first in a given
-//   [group](#model.NodeSpec.group).
-//
-//   marks:: ?union<Object<MarkSpec>, OrderedMap<MarkSpec>>
-//   The mark types that exist in this schema. The order in which they
-//   are provided determines the order in which [mark
-//   sets](#model.Mark.addToSet) are sorted and in which [parse
-//   rules](#model.MarkSpec.parseDOM) are tried.
-//
-//   topNode:: ?string
-//   The name of the default top-level node for the schema. Defaults
-//   to `"doc"`.
-
-// NodeSpec:: interface
-//
-//   content:: ?string
-//   The content expression for this node, as described in the [schema
-//   guide](/docs/guide/#schema.content_expressions). When not given,
-//   the node does not allow any content.
-//
-//   marks:: ?string
-//   The marks that are allowed inside of this node. May be a
-//   space-separated string referring to mark names or groups, `"_"`
-//   to explicitly allow all marks, or `""` to disallow marks. When
-//   not given, nodes with inline content default to allowing all
-//   marks, other nodes default to not allowing marks.
-//
-//   group:: ?string
-//   The group or space-separated groups to which this node belongs,
-//   which can be referred to in the content expressions for the
-//   schema.
-//
-//   inline:: ?bool
-//   Should be set to true for inline nodes. (Implied for text nodes.)
-//
-//   atom:: ?bool
-//   Can be set to true to indicate that, though this isn't a [leaf
-//   node](#model.NodeType.isLeaf), it doesn't have directly editable
-//   content and should be treated as a single unit in the view.
-//
-//   attrs:: ?Object<AttributeSpec>
-//   The attributes that nodes of this type get.
-//
-//   selectable:: ?bool
-//   Controls whether nodes of this type can be selected as a [node
-//   selection](#state.NodeSelection). Defaults to true for non-text
-//   nodes.
-//
-//   draggable:: ?bool
-//   Determines whether nodes of this type can be dragged without
-//   being selected. Defaults to false.
-//
-//   code:: ?bool
-//   Can be used to indicate that this node contains code, which
-//   causes some commands to behave differently.
-//
-//   defining:: ?bool
-//   Determines whether this node is considered an important parent
-//   node during replace operations (such as paste). Non-defining (the
-//   default) nodes get dropped when their entire content is replaced,
-//   whereas defining nodes persist and wrap the inserted content.
-//   Likewise, in _inserted_ content the defining parents of the
-//   content are preserved when possible. Typically,
-//   non-default-paragraph textblock types, and possibly list items,
-//   are marked as defining.
-//
-//   isolating:: ?bool
-//   When enabled (default is false), the sides of nodes of this type
-//   count as boundaries that regular editing operations, like
-//   backspacing or lifting, won't cross. An example of a node that
-//   should probably have this enabled is a table cell.
-//
-//   toDOM:: ?(node: Node) → DOMOutputSpec
-//   Defines the default way a node of this type should be serialized
-//   to DOM/HTML (as used by
-//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).
-//   Should return a DOM node or an [array
-//   structure](#model.DOMOutputSpec) that describes one, with an
-//   optional number zero (“hole”) in it to indicate where the node's
-//   content should be inserted.
-//
-//   For text nodes, the default is to create a text DOM node. Though
-//   it is possible to create a serializer where text is rendered
-//   differently, this is not supported inside the editor, so you
-//   shouldn't override that in your text node spec.
-//
-//   parseDOM:: ?[ParseRule]
-//   Associates DOM parser information with this node, which can be
-//   used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to
-//   automatically derive a parser. The `node` field in the rules is
-//   implied (the name of this node will be filled in automatically).
-//   If you supply your own parser, you do not need to also specify
-//   parsing rules in your schema.
-//
-//   toDebugString:: ?(node: Node) -> string
-//   Defines the default way a node of this type should be serialized
-//   to a string representation for debugging (e.g. in error messages).
-
-// MarkSpec:: interface
-//
-//   attrs:: ?Object<AttributeSpec>
-//   The attributes that marks of this type get.
-//
-//   inclusive:: ?bool
-//   Whether this mark should be active when the cursor is positioned
-//   at its end (or at its start when that is also the start of the
-//   parent node). Defaults to true.
-//
-//   excludes:: ?string
-//   Determines which other marks this mark can coexist with. Should
-//   be a space-separated strings naming other marks or groups of marks.
-//   When a mark is [added](#model.Mark.addToSet) to a set, all marks
-//   that it excludes are removed in the process. If the set contains
-//   any mark that excludes the new mark but is not, itself, excluded
-//   by the new mark, the mark can not be added an the set. You can
-//   use the value `"_"` to indicate that the mark excludes all
-//   marks in the schema.
-//
-//   Defaults to only being exclusive with marks of the same type. You
-//   can set it to an empty string (or any string not containing the
-//   mark's own name) to allow multiple marks of a given type to
-//   coexist (as long as they have different attributes).
-//
-//   group:: ?string
-//   The group or space-separated groups to which this mark belongs.
-//
-//   toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec
-//   Defines the default way marks of this type should be serialized
-//   to DOM/HTML. When the resulting spec contains a hole, that is
-//   where the marked content is placed. Otherwise, it is appended to
-//   the top node.
-//
-//   parseDOM:: ?[ParseRule]
-//   Associates DOM parser information with this mark (see the
-//   corresponding [node spec field](#model.NodeSpec.parseDOM)). The
-//   `mark` field in the rules is implied.
-
-// AttributeSpec:: interface
-//
-// Used to [define](#model.NodeSpec.attrs) attributes on nodes or
-// marks.
-//
-//   default:: ?any
-//   The default value for this attribute, to use when no explicit
-//   value is provided. Attributes that have no default must be
-//   provided whenever a node or mark of a type that has them is
-//   created.
-
-// ::- A document schema. Holds [node](#model.NodeType) and [mark
-// type](#model.MarkType) objects for the nodes and marks that may
-// occur in conforming documents, and provides functionality for
-// creating and deserializing such documents.
-var Schema = function Schema(spec) {
-  var this$1 = this;
-
-  // :: SchemaSpec
-  // The [spec](#model.SchemaSpec) on which the schema is based,
-  // with the added guarantee that its `nodes` and `marks`
-  // properties are
-  // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances
-  // (not raw objects).
-  this.spec = {};
-  for (var prop in spec) { this$1.spec[prop] = spec[prop]; }
-  this.spec.nodes = OrderedMap.from(spec.nodes);
-  this.spec.marks = OrderedMap.from(spec.marks);
-
-  // :: Object<NodeType>
-  // An object mapping the schema's node names to node type objects.
-  this.nodes = NodeType.compile(this.spec.nodes, this);
-
-  // :: Object<MarkType>
-  // A map from mark names to mark type objects.
-  this.marks = MarkType.compile(this.spec.marks, this);
-
-  var contentExprCache = Object.create(null);
-  for (var prop$1 in this$1.nodes) {
-    if (prop$1 in this$1.marks)
-      { throw new RangeError(prop$1 + " can not be both a node and a mark") }
-    var type = this$1.nodes[prop$1], contentExpr = type.spec.content || "", markExpr = type.spec.marks;
-    type.contentMatch = contentExprCache[contentExpr] ||
-      (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this$1.nodes));
-    type.inlineContent = type.contentMatch.inlineContent;
-    type.markSet = markExpr == "_" ? null :
-      markExpr ? gatherMarks(this$1, markExpr.split(" ")) :
-      markExpr == "" || !type.inlineContent ? [] : null;
-  }
-  for (var prop$2 in this$1.marks) {
-    var type$1 = this$1.marks[prop$2], excl = type$1.spec.excludes;
-    type$1.excluded = excl == null ? [type$1] : excl == "" ? [] : gatherMarks(this$1, excl.split(" "));
-  }
-
-  this.nodeFromJSON = this.nodeFromJSON.bind(this);
-  this.markFromJSON = this.markFromJSON.bind(this);
-
-  // :: NodeType
-  // The type of the [default top node](#model.SchemaSpec.topNode)
-  // for this schema.
-  this.topNodeType = this.nodes[this.spec.topNode || "doc"];
-
-  // :: Object
-  // An object for storing whatever values modules may want to
-  // compute and cache per schema. (If you want to store something
-  // in it, try to use property names unlikely to clash.)
-  this.cached = Object.create(null);
-  this.cached.wrappings = Object.create(null);
-};
-
-// :: (union<string, NodeType>, ?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-// Create a node in this schema. The `type` may be a string or a
-// `NodeType` instance. Attributes will be extended
-// with defaults, `content` may be a `Fragment`,
-// `null`, a `Node`, or an array of nodes.
-Schema.prototype.node = function node (type, attrs, content, marks) {
-  if (typeof type == "string")
-    { type = this.nodeType(type); }
-  else if (!(type instanceof NodeType))
-    { throw new RangeError("Invalid node type: " + type) }
-  else if (type.schema != this)
-    { throw new RangeError("Node type from different schema used (" + type.name + ")") }
-
-  return type.createChecked(attrs, content, marks)
-};
-
-// :: (string, ?[Mark]) → Node
-// Create a text node in the schema. Empty text nodes are not
-// allowed.
-Schema.prototype.text = function text (text$1, marks) {
-  var type = this.nodes.text;
-  return new TextNode(type, type.defaultAttrs, text$1, Mark.setFrom(marks))
-};
-
-// :: (union<string, MarkType>, ?Object) → Mark
-// Create a mark with the given type and attributes.
-Schema.prototype.mark = function mark (type, attrs) {
-  if (typeof type == "string") { type = this.marks[type]; }
-  return type.create(attrs)
-};
-
-// :: (Object) → Node
-// Deserialize a node from its JSON representation. This method is
-// bound.
-Schema.prototype.nodeFromJSON = function nodeFromJSON (json) {
-  return Node.fromJSON(this, json)
-};
-
-// :: (Object) → Mark
-// Deserialize a mark from its JSON representation. This method is
-// bound.
-Schema.prototype.markFromJSON = function markFromJSON (json) {
-  return Mark.fromJSON(this, json)
-};
-
-Schema.prototype.nodeType = function nodeType (name) {
-  var found = this.nodes[name];
-  if (!found) { throw new RangeError("Unknown node type: " + name) }
-  return found
-};
-
-function gatherMarks(schema, marks) {
-  var found = [];
-  for (var i = 0; i < marks.length; i++) {
-    var name = marks[i], mark = schema.marks[name], ok = mark;
-    if (mark) {
-      found.push(mark);
-    } else {
-      for (var prop in schema.marks) {
-        var mark$1 = schema.marks[prop];
-        if (name == "_" || (mark$1.spec.group && mark$1.spec.group.split(" ").indexOf(name) > -1))
-          { found.push(ok = mark$1); }
-      }
-    }
-    if (!ok) { throw new SyntaxError("Unknown mark type: '" + marks[i] + "'") }
-  }
-  return found
-}
-
-// ParseOptions:: interface
-// These are the options recognized by the
-// [`parse`](#model.DOMParser.parse) and
-// [`parseSlice`](#model.DOMParser.parseSlice) methods.
-//
-//   preserveWhitespace:: ?union<bool, "full">
-//   By default, whitespace is collapsed as per HTML's rules. Pass
-//   `true` to preserve whitespace, but normalize newlines to
-//   spaces, and `"full"` to preserve whitespace entirely.
-//
-//   findPositions:: ?[{node: dom.Node, offset: number}]
-//   When given, the parser will, beside parsing the content,
-//   record the document positions of the given DOM positions. It
-//   will do so by writing to the objects, adding a `pos` property
-//   that holds the document position. DOM positions that are not
-//   in the parsed content will not be written to.
-//
-//   from:: ?number
-//   The child node index to start parsing from.
-//
-//   to:: ?number
-//   The child node index to stop parsing at.
-//
-//   topNode:: ?Node
-//   By default, the content is parsed into the schema's default
-//   [top node type](#model.Schema.topNodeType). You can pass this
-//   option to use the type and attributes from a different node
-//   as the top container.
-//
-//   topMatch:: ?ContentMatch
-//   Provide the starting content match that content parsed into the
-//   top node is matched against.
-//
-//   context:: ?ResolvedPos
-//   A set of additional nodes to count as
-//   [context](#model.ParseRule.context) when parsing, above the
-//   given [top node](#model.ParseOptions.topNode).
-
-// ParseRule:: interface
-// A value that describes how to parse a given DOM node or inline
-// style as a ProseMirror node or mark.
-//
-//   tag:: ?string
-//   A CSS selector describing the kind of DOM elements to match. A
-//   single rule should have _either_ a `tag` or a `style` property.
-//
-//   namespace:: ?string
-//   The namespace to match. This should be used with `tag`.
-//   Nodes are only matched when the namespace matches or this property
-//   is null.
-//
-//   style:: ?string
-//   A CSS property name to match. When given, this rule matches
-//   inline styles that list that property. May also have the form
-//   `"property=value"`, in which case the rule only matches if the
-//   propery's value exactly matches the given value. (For more
-//   complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)
-//   and return undefined to indicate that the match failed.)
-//
-//   priority:: ?number
-//   Can be used to change the order in which the parse rules in a
-//   schema are tried. Those with higher priority come first. Rules
-//   without a priority are counted as having priority 50. This
-//   property is only meaningful in a schema—when directly
-//   constructing a parser, the order of the rule array is used.
-//
-//   context:: ?string
-//   When given, restricts this rule to only match when the current
-//   context—the parent nodes into which the content is being
-//   parsed—matches this expression. Should contain one or more node
-//   names or node group names followed by single or double slashes.
-//   For example `"paragraph/"` means the rule only matches when the
-//   parent node is a paragraph, `"blockquote/paragraph/"` restricts
-//   it to be in a paragraph that is inside a blockquote, and
-//   `"section//"` matches any position inside a section—a double
-//   slash matches any sequence of ancestor nodes. To allow multiple
-//   different contexts, they can be separated by a pipe (`|`)
-//   character, as in `"blockquote/|list_item/"`.
-//
-//   node:: ?string
-//   The name of the node type to create when this rule matches. Only
-//   valid for rules with a `tag` property, not for style rules. Each
-//   rule should have one of a `node`, `mark`, or `ignore` property
-//   (except when it appears in a [node](#model.NodeSpec.parseDOM) or
-//   [mark spec](#model.MarkSpec.parseDOM), in which case the `node`
-//   or `mark` property will be derived from its position).
-//
-//   mark:: ?string
-//   The name of the mark type to wrap the matched content in.
-//
-//   ignore:: ?bool
-//   When true, ignore content that matches this rule.
-//
-//   skip:: ?bool
-//   When true, ignore the node that matches this rule, but do parse
-//   its content.
-//
-//   attrs:: ?Object
-//   Attributes for the node or mark created by this rule. When
-//   `getAttrs` is provided, it takes precedence.
-//
-//   getAttrs:: ?(union<dom.Node, string>) → ?union<Object, false>
-//   A function used to compute the attributes for the node or mark
-//   created by this rule. Can also be used to describe further
-//   conditions the DOM element or style must match. When it returns
-//   `false`, the rule won't match. When it returns null or undefined,
-//   that is interpreted as an empty/default set of attributes.
-//
-//   Called with a DOM Element for `tag` rules, and with a string (the
-//   style's value) for `style` rules.
-//
-//   contentElement:: ?union<string, (dom.Node) → dom.Node>
-//   For `tag` rules that produce non-leaf nodes or marks, by default
-//   the content of the DOM element is parsed as content of the mark
-//   or node. If the child nodes are in a descendent node, this may be
-//   a CSS selector string that the parser must use to find the actual
-//   content element, or a function that returns the actual content
-//   element to the parser.
-//
-//   getContent:: ?(dom.Node, schema: Schema) → Fragment
-//   Can be used to override the content of a matched node. When
-//   present, instead of parsing the node's child nodes, the result of
-//   this function is used.
-//
-//   preserveWhitespace:: ?union<bool, "full">
-//   Controls whether whitespace should be preserved when parsing the
-//   content inside the matched element. `false` means whitespace may
-//   be collapsed, `true` means that whitespace should be preserved
-//   but newlines normalized to spaces, and `"full"` means that
-//   newlines should also be preserved.
-
-// ::- A DOM parser represents a strategy for parsing DOM content into
-// a ProseMirror document conforming to a given schema. Its behavior
-// is defined by an array of [rules](#model.ParseRule).
-var DOMParser = function DOMParser(schema, rules) {
-  var this$1 = this;
-
-  // :: Schema
-  // The schema into which the parser parses.
-  this.schema = schema;
-  // :: [ParseRule]
-  // The set of [parse rules](#model.ParseRule) that the parser
-  // uses, in order of precedence.
-  this.rules = rules;
-  this.tags = [];
-  this.styles = [];
-
-  rules.forEach(function (rule) {
-    if (rule.tag) { this$1.tags.push(rule); }
-    else if (rule.style) { this$1.styles.push(rule); }
-  });
-};
-
-// :: (dom.Node, ?ParseOptions) → Node
-// Parse a document from the content of a DOM node.
-DOMParser.prototype.parse = function parse (dom, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var context = new ParseContext(this, options, false);
-  context.addAll(dom, null, options.from, options.to);
-  return context.finish()
-};
-
-// :: (dom.Node, ?ParseOptions) → Slice
-// Parses the content of the given DOM node, like
-// [`parse`](#model.DOMParser.parse), and takes the same set of
-// options. But unlike that method, which produces a whole node,
-// this one returns a slice that is open at the sides, meaning that
-// the schema constraints aren't applied to the start of nodes to
-// the left of the input and the end of nodes at the end.
-DOMParser.prototype.parseSlice = function parseSlice (dom, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var context = new ParseContext(this, options, true);
-  context.addAll(dom, null, options.from, options.to);
-  return Slice.maxOpen(context.finish())
-};
-
-DOMParser.prototype.matchTag = function matchTag (dom, context) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.tags.length; i++) {
-    var rule = this$1.tags[i];
-    if (matches(dom, rule.tag) &&
-        (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&
-        (!rule.context || context.matchesContext(rule.context))) {
-      if (rule.getAttrs) {
-        var result = rule.getAttrs(dom);
-        if (result === false) { continue }
-        rule.attrs = result;
-      }
-      return rule
-    }
-  }
-};
-
-DOMParser.prototype.matchStyle = function matchStyle (prop, value, context) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.styles.length; i++) {
-    var rule = this$1.styles[i];
-    if (rule.style.indexOf(prop) != 0 ||
-        rule.context && !context.matchesContext(rule.context) ||
-        // Test that the style string either precisely matches the prop,
-        // or has an '=' sign after the prop, followed by the given
-        // value.
-        rule.style.length > prop.length &&
-        (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))
-      { continue }
-    if (rule.getAttrs) {
-      var result = rule.getAttrs(value);
-      if (result === false) { continue }
-      rule.attrs = result;
-    }
-    return rule
-  }
-};
-
-// : (Schema) → [ParseRule]
-DOMParser.schemaRules = function schemaRules (schema) {
-  var result = [];
-  function insert(rule) {
-    var priority = rule.priority == null ? 50 : rule.priority, i = 0;
-    for (; i < result.length; i++) {
-      var next = result[i], nextPriority = next.priority == null ? 50 : next.priority;
-      if (nextPriority < priority) { break }
-    }
-    result.splice(i, 0, rule);
-  }
-
-  var loop = function ( name ) {
-    var rules = schema.marks[name].spec.parseDOM;
-    if (rules) { rules.forEach(function (rule) {
-      insert(rule = copy(rule));
-      rule.mark = name;
-    }); }
-  };
-
-    for (var name in schema.marks) { loop( name ); }
-  var loop$1 = function ( name ) {
-    var rules$1 = schema.nodes[name$1].spec.parseDOM;
-    if (rules$1) { rules$1.forEach(function (rule) {
-      insert(rule = copy(rule));
-      rule.node = name$1;
-    }); }
-  };
-
-    for (var name$1 in schema.nodes) { loop$1( name ); }
-  return result
-};
-
-// :: (Schema) → DOMParser
-// Construct a DOM parser using the parsing rules listed in a
-// schema's [node specs](#model.NodeSpec.parseDOM), reordered by
-// [priority](#model.ParseRule.priority).
-DOMParser.fromSchema = function fromSchema (schema) {
-  return schema.cached.domParser ||
-    (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))
-};
-
-// : Object<bool> The block-level tags in HTML5
-var blockTags = {
-  address: true, article: true, aside: true, blockquote: true, canvas: true,
-  dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,
-  footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,
-  h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,
-  output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true
-};
-
-// : Object<bool> The tags that we normally ignore.
-var ignoreTags = {
-  head: true, noscript: true, object: true, script: true, style: true, title: true
-};
-
-// : Object<bool> List tags.
-var listTags = {ol: true, ul: true};
-
-// Using a bitfield for node context options
-var OPT_PRESERVE_WS = 1;
-var OPT_PRESERVE_WS_FULL = 2;
-var OPT_OPEN_LEFT = 4;
-
-function wsOptionsFor(preserveWhitespace) {
-  return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === "full" ? OPT_PRESERVE_WS_FULL : 0)
-}
-
-var NodeContext = function NodeContext(type, attrs, marks, solid, match, options) {
-  this.type = type;
-  this.attrs = attrs;
-  this.solid = solid;
-  this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);
-  this.options = options;
-  this.content = [];
-  this.marks = marks;
-  this.activeMarks = Mark.none;
-};
-
-NodeContext.prototype.findWrapping = function findWrapping (node) {
-  if (!this.match) {
-    if (!this.type) { return [] }
-    var fill = this.type.contentMatch.fillBefore(Fragment.from(node));
-    if (fill) {
-      this.match = this.type.contentMatch.matchFragment(fill);
-    } else {
-      var start = this.type.contentMatch, wrap;
-      if (wrap = start.findWrapping(node.type)) {
-        this.match = start;
-        return wrap
-      } else {
-        return null
-      }
-    }
-  }
-  return this.match.findWrapping(node.type)
-};
-
-NodeContext.prototype.finish = function finish (openEnd) {
-  if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace
-    var last = this.content[this.content.length - 1], m;
-    if (last && last.isText && (m = /\s+$/.exec(last.text))) {
-      if (last.text.length == m[0].length) { this.content.pop(); }
-      else { this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length)); }
-    }
-  }
-  var content = Fragment.from(this.content);
-  if (!openEnd && this.match)
-    { content = content.append(this.match.fillBefore(Fragment.empty, true)); }
-  return this.type ? this.type.create(this.attrs, content, this.marks) : content
-};
-
-var ParseContext = function ParseContext(parser, options, open) {
-  // : DOMParser The parser we are using.
-  this.parser = parser;
-  // : Object The options passed to this parse.
-  this.options = options;
-  this.isOpen = open;
-  this.pendingMarks = [];
-  var topNode = options.topNode, topContext;
-  var topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0);
-  if (topNode)
-    { topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, true,
-                                 options.topMatch || topNode.type.contentMatch, topOptions); }
-  else if (open)
-    { topContext = new NodeContext(null, null, Mark.none, true, null, topOptions); }
-  else
-    { topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, true, null, topOptions); }
-  this.nodes = [topContext];
-  // : [Mark] The current set of marks
-  this.open = 0;
-  this.find = options.findPositions;
-  this.needsBlock = false;
-};
-
-var prototypeAccessors$6 = { top: {},currentPos: {} };
-
-prototypeAccessors$6.top.get = function () {
-  return this.nodes[this.open]
-};
-
-// : (dom.Node)
-// Add a DOM node to the content. Text is inserted as text node,
-// otherwise, the node is passed to `addElement` or, if it has a
-// `style` attribute, `addElementWithStyles`.
-ParseContext.prototype.addDOM = function addDOM (dom) {
-    var this$1 = this;
-
-  if (dom.nodeType == 3) {
-    this.addTextNode(dom);
-  } else if (dom.nodeType == 1) {
-    var style = dom.getAttribute("style");
-    var marks = style ? this.readStyles(parseStyles(style)) : null;
-    if (marks != null) { for (var i = 0; i < marks.length; i++) { this$1.addPendingMark(marks[i]); } }
-    this.addElement(dom);
-    if (marks != null) { for (var i$1 = 0; i$1 < marks.length; i$1++) { this$1.removePendingMark(marks[i$1]); } }
-  }
-};
-
-ParseContext.prototype.addTextNode = function addTextNode (dom) {
-  var value = dom.nodeValue;
-  var top = this.top;
-  if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /\S/.test(value)) {
-    if (!(top.options & OPT_PRESERVE_WS)) {
-      value = value.replace(/\s+/g, " ");
-      // If this starts with whitespace, and there is either no node
-      // before it or a node that ends with whitespace, strip the
-      // leading space.
-      if (/^\s/.test(value) && this.open == this.nodes.length - 1) {
-        var nodeBefore = top.content[top.content.length - 1];
-        if (!nodeBefore || nodeBefore.isText && /\s$/.test(nodeBefore.text))
-          { value = value.slice(1); }
-      }
-    } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {
-      value = value.replace(/\r?\n|\r/g, " ");
-    }
-    if (value) { this.insertNode(this.parser.schema.text(value)); }
-    this.findInText(dom);
-  } else {
-    this.findInside(dom);
-  }
-};
-
-// : (dom.Element)
-// Try to find a handler for the given tag and use that to parse. If
-// none is found, the element's content nodes are added directly.
-ParseContext.prototype.addElement = function addElement (dom) {
-  var name = dom.nodeName.toLowerCase();
-  if (listTags.hasOwnProperty(name)) { normalizeList(dom); }
-  var rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) || this.parser.matchTag(dom, this);
-  if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
-    this.findInside(dom);
-  } else if (!rule || rule.skip) {
-    if (rule && rule.skip.nodeType) { dom = rule.skip; }
-    var sync, top = this.top, oldNeedsBlock = this.needsBlock;
-    if (blockTags.hasOwnProperty(name)) {
-      sync = true;
-      if (!top.type) { this.needsBlock = true; }
-    }
-    this.addAll(dom);
-    if (sync) { this.sync(top); }
-    this.needsBlock = oldNeedsBlock;
-  } else {
-    this.addElementByRule(dom, rule);
-  }
-};
-
-// Run any style parser associated with the node's styles. Either
-// return an array of marks, or null to indicate some of the styles
-// had a rule with `ignore` set.
-ParseContext.prototype.readStyles = function readStyles (styles) {
-    var this$1 = this;
-
-  var marks = Mark.none;
-  for (var i = 0; i < styles.length; i += 2) {
-    var rule = this$1.parser.matchStyle(styles[i], styles[i + 1], this$1);
-    if (!rule) { continue }
-    if (rule.ignore) { return null }
-    marks = this$1.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks);
-  }
-  return marks
-};
-
-// : (dom.Element, ParseRule) → bool
-// Look up a handler for the given node. If none are found, return
-// false. Otherwise, apply it, use its return value to drive the way
-// the node's content is wrapped, and return true.
-ParseContext.prototype.addElementByRule = function addElementByRule (dom, rule) {
-    var this$1 = this;
-
-  var sync, nodeType, markType, mark;
-  if (rule.node) {
-    nodeType = this.parser.schema.nodes[rule.node];
-    if (nodeType.isLeaf) { this.insertNode(nodeType.create(rule.attrs)); }
-    else { sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace); }
-  } else {
-    markType = this.parser.schema.marks[rule.mark];
-    mark = markType.create(rule.attrs);
-    this.addPendingMark(mark);
-  }
-  var startIn = this.top;
-
-  if (nodeType && nodeType.isLeaf) {
-    this.findInside(dom);
-  } else if (rule.getContent) {
-    this.findInside(dom);
-    rule.getContent(dom, this.parser.schema).forEach(function (node) { return this$1.insertNode(node); });
-  } else {
-    var contentDOM = rule.contentElement;
-    if (typeof contentDOM == "string") { contentDOM = dom.querySelector(contentDOM); }
-    else if (typeof contentDOM == "function") { contentDOM = contentDOM(dom); }
-    if (!contentDOM) { contentDOM = dom; }
-    this.findAround(dom, contentDOM, true);
-    this.addAll(contentDOM, sync);
-  }
-  if (sync) { this.sync(startIn); this.open--; }
-  if (mark) { this.removePendingMark(mark); }
-  return true
-};
-
-// : (dom.Node, ?NodeBuilder, ?number, ?number)
-// Add all child nodes between `startIndex` and `endIndex` (or the
-// whole node, if not given). If `sync` is passed, use it to
-// synchronize after every block element.
-ParseContext.prototype.addAll = function addAll (parent, sync, startIndex, endIndex) {
-    var this$1 = this;
-
-  var index = startIndex || 0;
-  for (var dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,
-           end = endIndex == null ? null : parent.childNodes[endIndex];
-       dom != end; dom = dom.nextSibling, ++index) {
-    this$1.findAtPoint(parent, index);
-    this$1.addDOM(dom);
-    if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))
-      { this$1.sync(sync); }
-  }
-  this.findAtPoint(parent, index);
-};
-
-// Try to find a way to fit the given node type into the current
-// context. May add intermediate wrappers and/or leave non-solid
-// nodes that we're in.
-ParseContext.prototype.findPlace = function findPlace (node) {
-    var this$1 = this;
-
-  var route, sync;
-  for (var depth = this.open; depth >= 0; depth--) {
-    var cx = this$1.nodes[depth];
-    var found = cx.findWrapping(node);
-    if (found && (!route || route.length > found.length)) {
-      route = found;
-      sync = cx;
-      if (!found.length) { break }
-    }
-    if (cx.solid) { break }
-  }
-  if (!route) { return false }
-  this.sync(sync);
-  for (var i = 0; i < route.length; i++)
-    { this$1.enterInner(route[i], null, false); }
-  return true
-};
-
-// : (Node) → ?Node
-// Try to insert the given node, adjusting the context when needed.
-ParseContext.prototype.insertNode = function insertNode (node) {
-  if (node.isInline && this.needsBlock && !this.top.type) {
-    var block = this.textblockFromContext();
-    if (block) { this.enterInner(block); }
-  }
-  if (this.findPlace(node)) {
-    this.closeExtra();
-    var top = this.top;
-    this.applyPendingMarks(top);
-    if (top.match) { top.match = top.match.matchType(node.type); }
-    var marks = top.activeMarks;
-    for (var i = 0; i < node.marks.length; i++)
-      { if (!top.type || top.type.allowsMarkType(node.marks[i].type))
-        { marks = node.marks[i].addToSet(marks); } }
-    top.content.push(node.mark(marks));
-  }
-};
-
-ParseContext.prototype.applyPendingMarks = function applyPendingMarks (top) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.pendingMarks.length; i++) {
-    var mark = this$1.pendingMarks[i];
-    if ((!top.type || top.type.allowsMarkType(mark.type)) && !mark.type.isInSet(top.activeMarks)) {
-      top.activeMarks = mark.addToSet(top.activeMarks);
-      this$1.pendingMarks.splice(i--, 1);
-    }
-  }
-};
-
-// : (NodeType, ?Object) → bool
-// Try to start a node of the given type, adjusting the context when
-// necessary.
-ParseContext.prototype.enter = function enter (type, attrs, preserveWS) {
-  var ok = this.findPlace(type.create(attrs));
-  if (ok) {
-    this.applyPendingMarks(this.top);
-    this.enterInner(type, attrs, true, preserveWS);
-  }
-  return ok
-};
-
-// Open a node of the given type
-ParseContext.prototype.enterInner = function enterInner (type, attrs, solid, preserveWS) {
-  this.closeExtra();
-  var top = this.top;
-  top.match = top.match && top.match.matchType(type, attrs);
-  var options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS);
-  if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) { options |= OPT_OPEN_LEFT; }
-  this.nodes.push(new NodeContext(type, attrs, top.activeMarks, solid, null, options));
-  this.open++;
-};
-
-// Make sure all nodes above this.open are finished and added to
-// their parents
-ParseContext.prototype.closeExtra = function closeExtra (openEnd) {
-    var this$1 = this;
-
-  var i = this.nodes.length - 1;
-  if (i > this.open) {
-    for (; i > this.open; i--) { this$1.nodes[i - 1].content.push(this$1.nodes[i].finish(openEnd)); }
-    this.nodes.length = this.open + 1;
-  }
-};
-
-ParseContext.prototype.finish = function finish () {
-  this.open = 0;
-  this.closeExtra(this.isOpen);
-  return this.nodes[0].finish(this.isOpen || this.options.topOpen)
-};
-
-ParseContext.prototype.sync = function sync (to) {
-    var this$1 = this;
-
-  for (var i = this.open; i >= 0; i--) { if (this$1.nodes[i] == to) {
-    this$1.open = i;
-    return
-  } }
-};
-
-ParseContext.prototype.addPendingMark = function addPendingMark (mark) {
-  this.pendingMarks.push(mark);
-};
-
-ParseContext.prototype.removePendingMark = function removePendingMark (mark) {
-  var found = this.pendingMarks.lastIndexOf(mark);
-  if (found > -1) {
-    this.pendingMarks.splice(found, 1);
-  } else {
-    var top = this.top;
-    top.activeMarks = mark.removeFromSet(top.activeMarks);
-  }
-};
-
-prototypeAccessors$6.currentPos.get = function () {
-    var this$1 = this;
-
-  this.closeExtra();
-  var pos = 0;
-  for (var i = this.open; i >= 0; i--) {
-    var content = this$1.nodes[i].content;
-    for (var j = content.length - 1; j >= 0; j--)
-      { pos += content[j].nodeSize; }
-    if (i) { pos++; }
-  }
-  return pos
-};
-
-ParseContext.prototype.findAtPoint = function findAtPoint (parent, offset) {
-    var this$1 = this;
-
-  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].node == parent && this$1.find[i].offset == offset)
-      { this$1.find[i].pos = this$1.currentPos; }
-  } }
-};
-
-ParseContext.prototype.findInside = function findInside (parent) {
-    var this$1 = this;
-
-  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node))
-      { this$1.find[i].pos = this$1.currentPos; }
-  } }
-};
-
-ParseContext.prototype.findAround = function findAround (parent, content, before) {
-    var this$1 = this;
-
-  if (parent != content && this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node)) {
-      var pos = content.compareDocumentPosition(this$1.find[i].node);
-      if (pos & (before ? 2 : 4))
-        { this$1.find[i].pos = this$1.currentPos; }
-    }
-  } }
-};
-
-ParseContext.prototype.findInText = function findInText (textNode) {
-    var this$1 = this;
-
-  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].node == textNode)
-      { this$1.find[i].pos = this$1.currentPos - (textNode.nodeValue.length - this$1.find[i].offset); }
-  } }
-};
-
-// : (string) → bool
-// Determines whether the given [context
-// string](#ParseRule.context) matches this context.
-ParseContext.prototype.matchesContext = function matchesContext (context) {
-    var this$1 = this;
-
-  if (context.indexOf("|") > -1)
-    { return context.split(/\s*\|\s*/).some(this.matchesContext, this) }
-
-  var parts = context.split("/");
-  var option = this.options.context;
-  var useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);
-  var minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);
-  var match = function (i, depth) {
-    for (; i >= 0; i--) {
-      var part = parts[i];
-      if (part == "") {
-        if (i == parts.length - 1 || i == 0) { continue }
-        for (; depth >= minDepth; depth--)
-          { if (match(i - 1, depth)) { return true } }
-        return false
-      } else {
-        var next = depth > 0 || (depth == 0 && useRoot) ? this$1.nodes[depth].type
-            : option && depth >= minDepth ? option.node(depth - minDepth).type
-            : null;
-        if (!next || (next.name != part && next.groups.indexOf(part) == -1))
-          { return false }
-        depth--;
-      }
-    }
-    return true
-  };
-  return match(parts.length - 1, this.open)
-};
-
-ParseContext.prototype.textblockFromContext = function textblockFromContext () {
-    var this$1 = this;
-
-  var $context = this.options.context;
-  if ($context) { for (var d = $context.depth; d >= 0; d--) {
-    var deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;
-    if (deflt && deflt.isTextblock && deflt.defaultAttrs) { return deflt }
-  } }
-  for (var name in this$1.parser.schema.nodes) {
-    var type = this$1.parser.schema.nodes[name];
-    if (type.isTextblock && type.defaultAttrs) { return type }
-  }
-};
-
-Object.defineProperties( ParseContext.prototype, prototypeAccessors$6 );
-
-// Kludge to work around directly nested list nodes produced by some
-// tools and allowed by browsers to mean that the nested list is
-// actually part of the list item above it.
-function normalizeList(dom) {
-  for (var child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {
-    var name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;
-    if (name && listTags.hasOwnProperty(name) && prevItem) {
-      prevItem.appendChild(child);
-      child = prevItem;
-    } else if (name == "li") {
-      prevItem = child;
-    } else if (name) {
-      prevItem = null;
-    }
-  }
-}
-
-// Apply a CSS selector.
-function matches(dom, selector) {
-  return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)
-}
-
-// : (string) → [string]
-// Tokenize a style attribute into property/value pairs.
-function parseStyles(style) {
-  var re = /\s*([\w-]+)\s*:\s*([^;]+)/g, m, result = [];
-  while (m = re.exec(style)) { result.push(m[1], m[2].trim()); }
-  return result
-}
-
-function copy(obj) {
-  var copy = {};
-  for (var prop in obj) { copy[prop] = obj[prop]; }
-  return copy
-}
-
-// DOMOutputSpec:: interface
-// A description of a DOM structure. Can be either a string, which is
-// interpreted as a text node, a DOM node, which is interpreted as
-// itself, or an array.
-//
-// An array describes a DOM element. The first value in the array
-// should be a string—the name of the DOM element. If the second
-// element is plain object, it is interpreted as a set of attributes
-// for the element. Any elements after that (including the 2nd if it's
-// not an attribute object) are interpreted as children of the DOM
-// elements, and must either be valid `DOMOutputSpec` values, or the
-// number zero.
-//
-// The number zero (pronounced “hole”) is used to indicate the place
-// where a node's child nodes should be inserted. It it occurs in an
-// output spec, it should be the only child element in its parent
-// node.
-
-// ::- A DOM serializer knows how to convert ProseMirror nodes and
-// marks of various types to DOM nodes.
-var DOMSerializer = function DOMSerializer(nodes, marks) {
-  // :: Object<(node: Node) → DOMOutputSpec>
-  // The node serialization functions.
-  this.nodes = nodes || {};
-  // :: Object<?(mark: Mark, inline: bool) → DOMOutputSpec>
-  // The mark serialization functions.
-  this.marks = marks || {};
-};
-
-// :: (Fragment, ?Object) → dom.DocumentFragment
-// Serialize the content of this fragment to a DOM fragment. When
-// not in the browser, the `document` option, containing a DOM
-// document, should be passed so that the serializer can create
-// nodes.
-DOMSerializer.prototype.serializeFragment = function serializeFragment (fragment, options, target) {
-    var this$1 = this;
-    if ( options === void 0 ) { options = {}; }
-
-  if (!target) { target = doc(options).createDocumentFragment(); }
-
-  var top = target, active = null;
-  fragment.forEach(function (node) {
-    if (active || node.marks.length) {
-      if (!active) { active = []; }
-      var keep = 0, rendered = 0;
-      while (keep < active.length && rendered < node.marks.length) {
-        var next = node.marks[rendered];
-        if (!this$1.marks[next.type.name]) { rendered++; continue }
-        if (!next.eq(active[keep])) { break }
-        keep += 2; rendered++;
-      }
-      while (keep < active.length) {
-        top = active.pop();
-        active.pop();
-      }
-      while (rendered < node.marks.length) {
-        var add = node.marks[rendered++];
-        var markDOM = this$1.serializeMark(add, node.isInline, options);
-        if (markDOM) {
-          active.push(add, top);
-          top.appendChild(markDOM.dom);
-          top = markDOM.contentDOM || markDOM.dom;
-        }
-      }
-    }
-    top.appendChild(this$1.serializeNode(node, options));
-  });
-
-  return target
-};
-
-// :: (Node, ?Object) → dom.Node
-// Serialize this node to a DOM node. This can be useful when you
-// need to serialize a part of a document, as opposed to the whole
-// document. To serialize a whole document, use
-// [`serializeFragment`](#model.DOMSerializer.serializeFragment) on
-// its [content](#model.Node.content).
-DOMSerializer.prototype.serializeNode = function serializeNode (node, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var ref =
-      DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));
-    var dom = ref.dom;
-    var contentDOM = ref.contentDOM;
-  if (contentDOM) {
-    if (node.isLeaf)
-      { throw new RangeError("Content hole not allowed in a leaf node spec") }
-    if (options.onContent)
-      { options.onContent(node, contentDOM, options); }
-    else
-      { this.serializeFragment(node.content, options, contentDOM); }
-  }
-  return dom
-};
-
-DOMSerializer.prototype.serializeNodeAndMarks = function serializeNodeAndMarks (node, options) {
-    var this$1 = this;
-    if ( options === void 0 ) { options = {}; }
-
-  var dom = this.serializeNode(node, options);
-  for (var i = node.marks.length - 1; i >= 0; i--) {
-    var wrap = this$1.serializeMark(node.marks[i], node.isInline, options);
-    if (wrap) {
-      (wrap.contentDOM || wrap.dom).appendChild(dom);
-      dom = wrap.dom;
-    }
-  }
-  return dom
-};
-
-DOMSerializer.prototype.serializeMark = function serializeMark (mark, inline, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var toDOM = this.marks[mark.type.name];
-  return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))
-};
-
-// :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}
-// Render an [output spec](#model.DOMOutputSpec) to a DOM node. If
-// the spec has a hole (zero) in it, `contentDOM` will point at the
-// node with the hole.
-DOMSerializer.renderSpec = function renderSpec (doc, structure) {
-  if (typeof structure == "string")
-    { return {dom: doc.createTextNode(structure)} }
-  if (structure.nodeType != null)
-    { return {dom: structure} }
-  var dom = doc.createElement(structure[0]), contentDOM = null;
-  var attrs = structure[1], start = 1;
-  if (attrs && typeof attrs == "object" && attrs.nodeType == null && !Array.isArray(attrs)) {
-    start = 2;
-    for (var name in attrs) {
-      if (name == "style") { dom.style.cssText = attrs[name]; }
-      else if (attrs[name] != null) { dom.setAttribute(name, attrs[name]); }
-    }
-  }
-  for (var i = start; i < structure.length; i++) {
-    var child = structure[i];
-    if (child === 0) {
-      if (i < structure.length - 1 || i > start)
-        { throw new RangeError("Content hole must be the only child of its parent node") }
-      return {dom: dom, contentDOM: dom}
-    } else {
-      var ref = DOMSerializer.renderSpec(doc, child);
-        var inner = ref.dom;
-        var innerContent = ref.contentDOM;
-      dom.appendChild(inner);
-      if (innerContent) {
-        if (contentDOM) { throw new RangeError("Multiple content holes") }
-        contentDOM = innerContent;
-      }
-    }
-  }
-  return {dom: dom, contentDOM: contentDOM}
-};
-
-// :: (Schema) → DOMSerializer
-// Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)
-// properties in a schema's node and mark specs.
-DOMSerializer.fromSchema = function fromSchema (schema) {
-  return schema.cached.domSerializer ||
-    (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))
-};
-
-// : (Schema) → Object<(node: Node) → DOMOutputSpec>
-// Gather the serializers in a schema's node specs into an object.
-// This can be useful as a base to build a custom serializer from.
-DOMSerializer.nodesFromSchema = function nodesFromSchema (schema) {
-  var result = gatherToDOM(schema.nodes);
-  if (!result.text) { result.text = function (node) { return node.text; }; }
-  return result
-};
-
-// : (Schema) → Object<(mark: Mark) → DOMOutputSpec>
-// Gather the serializers in a schema's mark specs into an object.
-DOMSerializer.marksFromSchema = function marksFromSchema (schema) {
-  return gatherToDOM(schema.marks)
-};
-
-function gatherToDOM(obj) {
-  var result = {};
-  for (var name in obj) {
-    var toDOM = obj[name].spec.toDOM;
-    if (toDOM) { result[name] = toDOM; }
-  }
-  return result
-}
-
-function doc(options) {
-  // declare global: window
-  return options.document || window.document
-}
-
-exports.Node = Node;
-exports.ResolvedPos = ResolvedPos;
-exports.NodeRange = NodeRange;
-exports.Fragment = Fragment;
-exports.Slice = Slice;
-exports.ReplaceError = ReplaceError;
-exports.Mark = Mark;
-exports.Schema = Schema;
-exports.NodeType = NodeType;
-exports.MarkType = MarkType;
-exports.ContentMatch = ContentMatch;
-exports.DOMParser = DOMParser;
-exports.DOMSerializer = DOMSerializer;
-
-});
-
-unwrapExports(dist);
-var dist_1 = dist.Node;
-var dist_2 = dist.ResolvedPos;
-var dist_3 = dist.NodeRange;
-var dist_4 = dist.Fragment;
-var dist_5 = dist.Slice;
-var dist_6 = dist.ReplaceError;
-var dist_7 = dist.Mark;
-var dist_8 = dist.Schema;
-var dist_9 = dist.NodeType;
-var dist_10 = dist.MarkType;
-var dist_11 = dist.ContentMatch;
-var dist_12 = dist.DOMParser;
-var dist_13 = dist.DOMSerializer;
-
-var dist$1 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-// Mappable:: interface
-// There are several things that positions can be mapped through.
-// Such objects conform to this interface.
-//
-//   map:: (pos: number, assoc: ?number) → number
-//   Map a position through this object. When given, `assoc` (should
-//   be -1 or 1, defaults to 1) determines with which side the
-//   position is associated, which determines in which direction to
-//   move when a chunk of content is inserted at the mapped position.
-//
-//   mapResult:: (pos: number, assoc: ?number) → MapResult
-//   Map a position, and return an object containing additional
-//   information about the mapping. The result's `deleted` field tells
-//   you whether the position was deleted (completely enclosed in a
-//   replaced range) during the mapping. When content on only one side
-//   is deleted, the position itself is only considered deleted when
-//   `assoc` points in the direction of the deleted content.
-
-// Recovery values encode a range index and an offset. They are
-// represented as numbers, because tons of them will be created when
-// mapping, for example, a large number of decorations. The number's
-// lower 16 bits provide the index, the remaining bits the offset.
-//
-// Note: We intentionally don't use bit shift operators to en- and
-// decode these, since those clip to 32 bits, which we might in rare
-// cases want to overflow. A 64-bit float can represent 48-bit
-// integers precisely.
-
-var lower16 = 0xffff;
-var factor16 = Math.pow(2, 16);
-
-function makeRecover(index, offset) { return index + offset * factor16 }
-function recoverIndex(value) { return value & lower16 }
-function recoverOffset(value) { return (value - (value & lower16)) / factor16 }
-
-// ::- An object representing a mapped position with extra
-// information.
-var MapResult = function MapResult(pos, deleted, recover) {
-  if ( deleted === void 0 ) { deleted = false; }
-  if ( recover === void 0 ) { recover = null; }
-
-  // :: number The mapped version of the position.
-  this.pos = pos;
-  // :: bool Tells you whether the position was deleted, that is,
-  // whether the step removed its surroundings from the document.
-  this.deleted = deleted;
-  this.recover = recover;
-};
-
-// :: class extends Mappable
-// A map describing the deletions and insertions made by a step, which
-// can be used to find the correspondence between positions in the
-// pre-step version of a document and the same position in the
-// post-step version.
-var StepMap = function StepMap(ranges, inverted) {
-  if ( inverted === void 0 ) { inverted = false; }
-
-  this.ranges = ranges;
-  this.inverted = inverted;
-};
-
-StepMap.prototype.recover = function recover (value) {
-    var this$1 = this;
-
-  var diff = 0, index = recoverIndex(value);
-  if (!this.inverted) { for (var i = 0; i < index; i++)
-    { diff += this$1.ranges[i * 3 + 2] - this$1.ranges[i * 3 + 1]; } }
-  return this.ranges[index * 3] + diff + recoverOffset(value)
-};
-
-// : (number, ?number) → MapResult
-StepMap.prototype.mapResult = function mapResult (pos, assoc) {
-  if ( assoc === void 0 ) { assoc = 1; }
- return this._map(pos, assoc, false) };
-
-// : (number, ?number) → number
-StepMap.prototype.map = function map (pos, assoc) {
-  if ( assoc === void 0 ) { assoc = 1; }
- return this._map(pos, assoc, true) };
-
-StepMap.prototype._map = function _map (pos, assoc, simple) {
-    var this$1 = this;
-
-  var diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-  for (var i = 0; i < this.ranges.length; i += 3) {
-    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);
-    if (start > pos) { break }
-    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex], end = start + oldSize;
-    if (pos <= end) {
-      var side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;
-      var result = start + diff + (side < 0 ? 0 : newSize);
-      if (simple) { return result }
-      var recover = makeRecover(i / 3, pos - start);
-      return new MapResult(result, assoc < 0 ? pos != start : pos != end, recover)
-    }
-    diff += newSize - oldSize;
-  }
-  return simple ? pos + diff : new MapResult(pos + diff)
-};
-
-StepMap.prototype.touches = function touches (pos, recover) {
-    var this$1 = this;
-
-  var diff = 0, index = recoverIndex(recover);
-  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-  for (var i = 0; i < this.ranges.length; i += 3) {
-    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);
-    if (start > pos) { break }
-    var oldSize = this$1.ranges[i + oldIndex], end = start + oldSize;
-    if (pos <= end && i == index * 3) { return true }
-    diff += this$1.ranges[i + newIndex] - oldSize;
-  }
-  return false
-};
-
-// :: ((oldStart: number, oldEnd: number, newStart: number, newEnd: number))
-// Calls the given function on each of the changed ranges included in
-// this map.
-StepMap.prototype.forEach = function forEach (f) {
-    var this$1 = this;
-
-  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-  for (var i = 0, diff = 0; i < this.ranges.length; i += 3) {
-    var start = this$1.ranges[i], oldStart = start - (this$1.inverted ? diff : 0), newStart = start + (this$1.inverted ? 0 : diff);
-    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex];
-    f(oldStart, oldStart + oldSize, newStart, newStart + newSize);
-    diff += newSize - oldSize;
-  }
-};
-
-// :: () → StepMap
-// Create an inverted version of this map. The result can be used to
-// map positions in the post-step document to the pre-step document.
-StepMap.prototype.invert = function invert () {
-  return new StepMap(this.ranges, !this.inverted)
-};
-
-StepMap.prototype.toString = function toString () {
-  return (this.inverted ? "-" : "") + JSON.stringify(this.ranges)
-};
-
-// :: (n: number) → StepMap
-// Create a map that moves all positions by offset `n` (which may be
-// negative). This can be useful when applying steps meant for a
-// sub-document to a larger document, or vice-versa.
-StepMap.offset = function offset (n) {
-  return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n])
-};
-
-StepMap.empty = new StepMap([]);
-
-// :: class extends Mappable
-// A mapping represents a pipeline of zero or more [step
-// maps](#transform.StepMap). It has special provisions for losslessly
-// handling mapping positions through a series of steps in which some
-// steps are inverted versions of earlier steps. (This comes up when
-// ‘[rebasing](/docs/guide/#transform.rebasing)’ steps for
-// collaboration or history management.)
-var Mapping = function Mapping(maps, mirror, from, to) {
-  // :: [StepMap]
-  // The step maps in this mapping.
-  this.maps = maps || [];
-  // :: number
-  // The starting position in the `maps` array, used when `map` or
-  // `mapResult` is called.
-  this.from = from || 0;
-  // :: number
-  // The end position in the `maps` array.
-  this.to = to == null ? this.maps.length : to;
-  this.mirror = mirror;
-};
-
-// :: (?number, ?number) → Mapping
-// Create a mapping that maps only through a part of this one.
-Mapping.prototype.slice = function slice (from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.maps.length; }
-
-  return new Mapping(this.maps, this.mirror, from, to)
-};
-
-Mapping.prototype.copy = function copy () {
-  return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to)
-};
-
-// :: (StepMap, ?number)
-// Add a step map to the end of this mapping. If `mirrors` is
-// given, it should be the index of the step map that is the mirror
-// image of this one.
-Mapping.prototype.appendMap = function appendMap (map, mirrors) {
-  this.to = this.maps.push(map);
-  if (mirrors != null) { this.setMirror(this.maps.length - 1, mirrors); }
-};
-
-// :: (Mapping)
-// Add all the step maps in a given mapping to this one (preserving
-// mirroring information).
-Mapping.prototype.appendMapping = function appendMapping (mapping) {
-    var this$1 = this;
-
-  for (var i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {
-    var mirr = mapping.getMirror(i);
-    this$1.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : null);
-  }
-};
-
-// :: (number) → ?number
-// Finds the offset of the step map that mirrors the map at the
-// given offset, in this mapping (as per the second argument to
-// `appendMap`).
-Mapping.prototype.getMirror = function getMirror (n) {
-    var this$1 = this;
-
-  if (this.mirror) { for (var i = 0; i < this.mirror.length; i++)
-    { if (this$1.mirror[i] == n) { return this$1.mirror[i + (i % 2 ? -1 : 1)] } } }
-};
-
-Mapping.prototype.setMirror = function setMirror (n, m) {
-  if (!this.mirror) { this.mirror = []; }
-  this.mirror.push(n, m);
-};
-
-// :: (Mapping)
-// Append the inverse of the given mapping to this one.
-Mapping.prototype.appendMappingInverted = function appendMappingInverted (mapping) {
-    var this$1 = this;
-
-  for (var i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {
-    var mirr = mapping.getMirror(i);
-    this$1.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : null);
-  }
-};
-
-// () → Mapping
-// Create an inverted version of this mapping.
-Mapping.prototype.invert = function invert () {
-  var inverse = new Mapping;
-  inverse.appendMappingInverted(this);
-  return inverse
-};
-
-// : (number, ?number) → number
-// Map a position through this mapping.
-Mapping.prototype.map = function map (pos, assoc) {
-    var this$1 = this;
-    if ( assoc === void 0 ) { assoc = 1; }
-
-  if (this.mirror) { return this._map(pos, assoc, true) }
-  for (var i = this.from; i < this.to; i++)
-    { pos = this$1.maps[i].map(pos, assoc); }
-  return pos
-};
-
-// : (number, ?number) → MapResult
-// Map a position through this mapping, returning a mapping
-// result.
-Mapping.prototype.mapResult = function mapResult (pos, assoc) {
-  if ( assoc === void 0 ) { assoc = 1; }
- return this._map(pos, assoc, false) };
-
-Mapping.prototype._map = function _map (pos, assoc, simple) {
-    var this$1 = this;
-
-  var deleted = false, recoverables = null;
-
-  for (var i = this.from; i < this.to; i++) {
-    var map = this$1.maps[i], rec = recoverables && recoverables[i];
-    if (rec != null && map.touches(pos, rec)) {
-      pos = map.recover(rec);
-      continue
-    }
-
-    var result = map.mapResult(pos, assoc);
-    if (result.recover != null) {
-      var corr = this$1.getMirror(i);
-      if (corr != null && corr > i && corr < this$1.to) {
-        if (result.deleted) {
-          i = corr;
-          pos = this$1.maps[corr].recover(result.recover);
-          continue
-        } else {
-          (recoverables || (recoverables = Object.create(null)))[corr] = result.recover;
-        }
-      }
-    }
-
-    if (result.deleted) { deleted = true; }
-    pos = result.pos;
-  }
-
-  return simple ? pos : new MapResult(pos, deleted)
-};
-
-function TransformError(message) {
-  var err = Error.call(this, message);
-  err.__proto__ = TransformError.prototype;
-  return err
-}
-
-TransformError.prototype = Object.create(Error.prototype);
-TransformError.prototype.constructor = TransformError;
-TransformError.prototype.name = "TransformError";
-
-// ::- Abstraction to build up and track an array of
-// [steps](#transform.Step) representing a document transformation.
-//
-// Most transforming methods return the `Transform` object itself, so
-// that they can be chained.
-var Transform = function Transform(doc) {
-  // :: Node
-  // The current document (the result of applying the steps in the
-  // transform).
-  this.doc = doc;
-  // :: [Step]
-  // The steps in this transform.
-  this.steps = [];
-  // :: [Node]
-  // The documents before each of the steps.
-  this.docs = [];
-  // :: Mapping
-  // A mapping with the maps for each of the steps in this transform.
-  this.mapping = new Mapping;
-};
-
-var prototypeAccessors = { before: {},docChanged: {} };
-
-// :: Node The starting document.
-prototypeAccessors.before.get = function () { return this.docs.length ? this.docs[0] : this.doc };
-
-// :: (step: Step) → this
-// Apply a new step in this transform, saving the result. Throws an
-// error when the step fails.
-Transform.prototype.step = function step (object) {
-  var result = this.maybeStep(object);
-  if (result.failed) { throw new TransformError(result.failed) }
-  return this
-};
-
-// :: (Step) → StepResult
-// Try to apply a step in this transformation, ignoring it if it
-// fails. Returns the step result.
-Transform.prototype.maybeStep = function maybeStep (step) {
-  var result = step.apply(this.doc);
-  if (!result.failed) { this.addStep(step, result.doc); }
-  return result
-};
-
-// :: bool
-// True when the document has been changed (when there are any
-// steps).
-prototypeAccessors.docChanged.get = function () {
-  return this.steps.length > 0
-};
-
-Transform.prototype.addStep = function addStep (step, doc) {
-  this.docs.push(this.doc);
-  this.steps.push(step);
-  this.mapping.appendMap(step.getMap());
-  this.doc = doc;
-};
-
-Object.defineProperties( Transform.prototype, prototypeAccessors );
-
-function mustOverride() { throw new Error("Override me") }
-
-var stepsByID = Object.create(null);
-
-// ::- A step object represents an atomic change. It generally applies
-// only to the document it was created for, since the positions
-// stored in it will only make sense for that document.
-//
-// New steps are defined by creating classes that extend `Step`,
-// overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`
-// methods, and registering your class with a unique
-// JSON-serialization identifier using
-// [`Step.jsonID`](#transform.Step^jsonID).
-var Step = function Step () {};
-
-Step.prototype.apply = function apply (_doc) { return mustOverride() };
-
-// :: () → StepMap
-// Get the step map that represents the changes made by this step,
-// and which can be used to transform between positions in the old
-// and the new document.
-Step.prototype.getMap = function getMap () { return StepMap.empty };
-
-// :: (doc: Node) → Step
-// Create an inverted version of this step. Needs the document as it
-// was before the step as argument.
-Step.prototype.invert = function invert (_doc) { return mustOverride() };
-
-// :: (mapping: Mappable) → ?Step
-// Map this step through a mappable thing, returning either a
-// version of that step with its positions adjusted, or `null` if
-// the step was entirely deleted by the mapping.
-Step.prototype.map = function map (_mapping) { return mustOverride() };
-
-// :: (other: Step) → ?Step
-// Try to merge this step with another one, to be applied directly
-// after it. Returns the merged step when possible, null if the
-// steps can't be merged.
-Step.prototype.merge = function merge (_other) { return null };
-
-// :: () → Object
-// Create a JSON-serializeable representation of this step. When
-// defining this for a custom subclass, make sure the result object
-// includes the step type's [JSON id](#transform.Step^jsonID) under
-// the `stepType` property.
-Step.prototype.toJSON = function toJSON () { return mustOverride() };
-
-// :: (Schema, Object) → Step
-// Deserialize a step from its JSON representation. Will call
-// through to the step class' own implementation of this method.
-Step.fromJSON = function fromJSON (schema, json) {
-  if (!json || !json.stepType) { throw new RangeError("Invalid input for Step.fromJSON") }
-  var type = stepsByID[json.stepType];
-  if (!type) { throw new RangeError(("No step type " + (json.stepType) + " defined")) }
-  return type.fromJSON(schema, json)
-};
-
-// :: (string, constructor<Step>)
-// To be able to serialize steps to JSON, each step needs a string
-// ID to attach to its JSON representation. Use this method to
-// register an ID for your step classes. Try to pick something
-// that's unlikely to clash with steps from other modules.
-Step.jsonID = function jsonID (id, stepClass) {
-  if (id in stepsByID) { throw new RangeError("Duplicate use of step JSON ID " + id) }
-  stepsByID[id] = stepClass;
-  stepClass.prototype.jsonID = id;
-  return stepClass
-};
-
-// ::- The result of [applying](#transform.Step.apply) a step. Contains either a
-// new document or a failure value.
-var StepResult = function StepResult(doc, failed) {
-  // :: ?Node The transformed document.
-  this.doc = doc;
-  // :: ?string Text providing information about a failed step.
-  this.failed = failed;
-};
-
-// :: (Node) → StepResult
-// Create a successful step result.
-StepResult.ok = function ok (doc) { return new StepResult(doc, null) };
-
-// :: (string) → StepResult
-// Create a failed step result.
-StepResult.fail = function fail (message) { return new StepResult(null, message) };
-
-// :: (Node, number, number, Slice) → StepResult
-// Call [`Node.replace`](#model.Node.replace) with the given
-// arguments. Create a successful result if it succeeds, and a
-// failed one if it throws a `ReplaceError`.
-StepResult.fromReplace = function fromReplace (doc, from, to, slice) {
-  try {
-    return StepResult.ok(doc.replace(from, to, slice))
-  } catch (e) {
-    if (e instanceof dist.ReplaceError) { return StepResult.fail(e.message) }
-    throw e
-  }
-};
-
-// ::- Replace a part of the document with a slice of new content.
-var ReplaceStep = (function (Step$$1) {
-  function ReplaceStep(from, to, slice, structure) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.slice = slice;
-    this.structure = !!structure;
-  }
-
-  if ( Step$$1 ) { ReplaceStep.__proto__ = Step$$1; }
-  ReplaceStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  ReplaceStep.prototype.constructor = ReplaceStep;
-
-  ReplaceStep.prototype.apply = function apply (doc) {
-    if (this.structure && contentBetween(doc, this.from, this.to))
-      { return StepResult.fail("Structure replace would overwrite content") }
-    return StepResult.fromReplace(doc, this.from, this.to, this.slice)
-  };
-
-  ReplaceStep.prototype.getMap = function getMap () {
-    return new StepMap([this.from, this.to - this.from, this.slice.size])
-  };
-
-  ReplaceStep.prototype.invert = function invert (doc) {
-    return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))
-  };
-
-  ReplaceStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    if (from.deleted && to.deleted) { return null }
-    return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice)
-  };
-
-  ReplaceStep.prototype.merge = function merge (other) {
-    if (!(other instanceof ReplaceStep) || other.structure != this.structure) { return null }
-
-    if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {
-      var slice = this.slice.size + other.slice.size == 0 ? dist.Slice.empty
-          : new dist.Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);
-      return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure)
-    } else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {
-      var slice$1 = this.slice.size + other.slice.size == 0 ? dist.Slice.empty
-          : new dist.Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);
-      return new ReplaceStep(other.from, this.to, slice$1, this.structure)
-    } else {
-      return null
-    }
-  };
-
-  ReplaceStep.prototype.toJSON = function toJSON () {
-    var json = {stepType: "replace", from: this.from, to: this.to};
-    if (this.slice.size) { json.slice = this.slice.toJSON(); }
-    if (this.structure) { json.structure = true; }
-    return json
-  };
-
-  ReplaceStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number")
-      { throw new RangeError("Invalid input for ReplaceStep.fromJSON") }
-    return new ReplaceStep(json.from, json.to, dist.Slice.fromJSON(schema, json.slice), !!json.structure)
-  };
-
-  return ReplaceStep;
-}(Step));
-
-Step.jsonID("replace", ReplaceStep);
-
-// ::- Replace a part of the document with a slice of content, but
-// preserve a range of the replaced content by moving it into the
-// slice.
-var ReplaceAroundStep = (function (Step$$1) {
-  function ReplaceAroundStep(from, to, gapFrom, gapTo, slice, insert, structure) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.gapFrom = gapFrom;
-    this.gapTo = gapTo;
-    this.slice = slice;
-    this.insert = insert;
-    this.structure = !!structure;
-  }
-
-  if ( Step$$1 ) { ReplaceAroundStep.__proto__ = Step$$1; }
-  ReplaceAroundStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  ReplaceAroundStep.prototype.constructor = ReplaceAroundStep;
-
-  ReplaceAroundStep.prototype.apply = function apply (doc) {
-    if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||
-                           contentBetween(doc, this.gapTo, this.to)))
-      { return StepResult.fail("Structure gap-replace would overwrite content") }
-
-    var gap = doc.slice(this.gapFrom, this.gapTo);
-    if (gap.openStart || gap.openEnd)
-      { return StepResult.fail("Gap is not a flat range") }
-    var inserted = this.slice.insertAt(this.insert, gap.content);
-    if (!inserted) { return StepResult.fail("Content does not fit in gap") }
-    return StepResult.fromReplace(doc, this.from, this.to, inserted)
-  };
-
-  ReplaceAroundStep.prototype.getMap = function getMap () {
-    return new StepMap([this.from, this.gapFrom - this.from, this.insert,
-                        this.gapTo, this.to - this.gapTo, this.slice.size - this.insert])
-  };
-
-  ReplaceAroundStep.prototype.invert = function invert (doc) {
-    var gap = this.gapTo - this.gapFrom;
-    return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap,
-                                 this.from + this.insert, this.from + this.insert + gap,
-                                 doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),
-                                 this.gapFrom - this.from, this.structure)
-  };
-
-  ReplaceAroundStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    var gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);
-    if ((from.deleted && to.deleted) || gapFrom < from.pos || gapTo > to.pos) { return null }
-    return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure)
-  };
-
-  ReplaceAroundStep.prototype.toJSON = function toJSON () {
-    var json = {stepType: "replaceAround", from: this.from, to: this.to,
-                gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert};
-    if (this.slice.size) { json.slice = this.slice.toJSON(); }
-    if (this.structure) { json.structure = true; }
-    return json
-  };
-
-  ReplaceAroundStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number" ||
-        typeof json.gapFrom != "number" || typeof json.gapTo != "number" || typeof json.insert != "number")
-      { throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON") }
-    return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo,
-                                 dist.Slice.fromJSON(schema, json.slice), json.insert, !!json.structure)
-  };
-
-  return ReplaceAroundStep;
-}(Step));
-
-Step.jsonID("replaceAround", ReplaceAroundStep);
-
-function contentBetween(doc, from, to) {
-  var $from = doc.resolve(from), dist$$1 = to - from, depth = $from.depth;
-  while (dist$$1 > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {
-    depth--;
-    dist$$1--;
-  }
-  if (dist$$1 > 0) {
-    var next = $from.node(depth).maybeChild($from.indexAfter(depth));
-    while (dist$$1 > 0) {
-      if (!next || next.isLeaf) { return true }
-      next = next.firstChild;
-      dist$$1--;
-    }
-  }
-  return false
-}
-
-function canCut(node, start, end) {
-  return (start == 0 || node.canReplace(start, node.childCount)) &&
-    (end == node.childCount || node.canReplace(0, end))
-}
-
-// :: (NodeRange) → ?number
-// Try to find a target depth to which the content in the given range
-// can be lifted. Will not go across
-// [isolating](#model.NodeSpec.isolating) parent nodes.
-function liftTarget(range) {
-  var parent = range.parent;
-  var content = parent.content.cutByIndex(range.startIndex, range.endIndex);
-  for (var depth = range.depth;; --depth) {
-    var node = range.$from.node(depth);
-    var index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);
-    if (depth < range.depth && node.canReplace(index, endIndex, content))
-      { return depth }
-    if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex)) { break }
-  }
-}
-
-// :: (NodeRange, number) → this
-// Split the content in the given range off from its parent, if there
-// is sibling content before or after it, and move it up the tree to
-// the depth specified by `target`. You'll probably want to use
-// [`liftTarget`](#transform.liftTarget) to compute `target`, to make
-// sure the lift is valid.
-Transform.prototype.lift = function(range, target) {
-  var $from = range.$from;
-  var $to = range.$to;
-  var depth = range.depth;
-
-  var gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);
-  var start = gapStart, end = gapEnd;
-
-  var before = dist.Fragment.empty, openStart = 0;
-  for (var d = depth, splitting = false; d > target; d--)
-    { if (splitting || $from.index(d) > 0) {
-      splitting = true;
-      before = dist.Fragment.from($from.node(d).copy(before));
-      openStart++;
-    } else {
-      start--;
-    } }
-  var after = dist.Fragment.empty, openEnd = 0;
-  for (var d$1 = depth, splitting$1 = false; d$1 > target; d$1--)
-    { if (splitting$1 || $to.after(d$1 + 1) < $to.end(d$1)) {
-      splitting$1 = true;
-      after = dist.Fragment.from($to.node(d$1).copy(after));
-      openEnd++;
-    } else {
-      end++;
-    } }
-
-  return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,
-                                         new dist.Slice(before.append(after), openStart, openEnd),
-                                         before.size - openStart, true))
-};
-
-// :: (NodeRange, NodeType, ?Object, ?NodeRange) → ?[{type: NodeType, attrs: ?Object}]
-// Try to find a valid way to wrap the content in the given range in a
-// node of the given type. May introduce extra nodes around and inside
-// the wrapper node, if necessary. Returns null if no valid wrapping
-// could be found. When `innerRange` is given, that range's content is
-// used as the content to fit into the wrapping, instead of the
-// content of `range`.
-function findWrapping(range, nodeType, attrs, innerRange) {
-  if ( innerRange === void 0 ) { innerRange = range; }
-
-  var around = findWrappingOutside(range, nodeType);
-  var inner = around && findWrappingInside(innerRange, nodeType);
-  if (!inner) { return null }
-  return around.map(withAttrs).concat({type: nodeType, attrs: attrs}).concat(inner.map(withAttrs))
-}
-
-function withAttrs(type) { return {type: type, attrs: null} }
-
-function findWrappingOutside(range, type) {
-  var parent = range.parent;
-  var startIndex = range.startIndex;
-  var endIndex = range.endIndex;
-  var around = parent.contentMatchAt(startIndex).findWrapping(type);
-  if (!around) { return null }
-  var outer = around.length ? around[0] : type;
-  return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null
-}
-
-function findWrappingInside(range, type) {
-  var parent = range.parent;
-  var startIndex = range.startIndex;
-  var endIndex = range.endIndex;
-  var inner = parent.child(startIndex);
-  var inside = type.contentMatch.findWrapping(inner.type);
-  if (!inside) { return null }
-  var lastType = inside.length ? inside[inside.length - 1] : type;
-  var innerMatch = lastType.contentMatch;
-  for (var i = startIndex; innerMatch && i < endIndex; i++)
-    { innerMatch = innerMatch.matchType(parent.child(i).type); }
-  if (!innerMatch || !innerMatch.validEnd) { return null }
-  return inside
-}
-
-// :: (NodeRange, [{type: NodeType, attrs: ?Object}]) → this
-// Wrap the given [range](#model.NodeRange) in the given set of wrappers.
-// The wrappers are assumed to be valid in this position, and should
-// probably be computed with [`findWrapping`](#transform.findWrapping).
-Transform.prototype.wrap = function(range, wrappers) {
-  var content = dist.Fragment.empty;
-  for (var i = wrappers.length - 1; i >= 0; i--)
-    { content = dist.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }
-
-  var start = range.start, end = range.end;
-  return this.step(new ReplaceAroundStep(start, end, start, end, new dist.Slice(content, 0, 0), wrappers.length, true))
-};
-
-// :: (number, ?number, NodeType, ?Object) → this
-// Set the type of all textblocks (partly) between `from` and `to` to
-// the given node type with the given attributes.
-Transform.prototype.setBlockType = function(from, to, type, attrs) {
-  var this$1 = this;
-  if ( to === void 0 ) { to = from; }
-
-  if (!type.isTextblock) { throw new RangeError("Type given to setBlockType should be a textblock") }
-  var mapFrom = this.steps.length;
-  this.doc.nodesBetween(from, to, function (node, pos) {
-    if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this$1.doc, this$1.mapping.slice(mapFrom).map(pos), type)) {
-      // Ensure all markup that isn't allowed in the new node type is cleared
-      this$1.clearIncompatible(this$1.mapping.slice(mapFrom).map(pos, 1), type);
-      var mapping = this$1.mapping.slice(mapFrom);
-      var startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);
-      this$1.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,
-                                      new dist.Slice(dist.Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));
-      return false
-    }
-  });
-  return this
-};
-
-function canChangeType(doc, pos, type) {
-  var $pos = doc.resolve(pos), index = $pos.index();
-  return $pos.parent.canReplaceWith(index, index + 1, type)
-}
-
-// :: (number, ?NodeType, ?Object, ?[Mark]) → this
-// Change the type, attributes, and/or marks of the node at `pos`.
-// When `type` isn't given, the existing node type is preserved,
-Transform.prototype.setNodeMarkup = function(pos, type, attrs, marks) {
-  var node = this.doc.nodeAt(pos);
-  if (!node) { throw new RangeError("No node at given position") }
-  if (!type) { type = node.type; }
-  var newNode = type.create(attrs, null, marks || node.marks);
-  if (node.isLeaf)
-    { return this.replaceWith(pos, pos + node.nodeSize, newNode) }
-
-  if (!type.validContent(node.content))
-    { throw new RangeError("Invalid content for node type " + type.name) }
-
-  return this.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1,
-                                         new dist.Slice(dist.Fragment.from(newNode), 0, 0), 1, true))
-};
-
-// :: (Node, number, number, ?[?{type: NodeType, attrs: ?Object}]) → bool
-// Check whether splitting at the given position is allowed.
-function canSplit(doc, pos, depth, typesAfter) {
-  if ( depth === void 0 ) { depth = 1; }
-
-  var $pos = doc.resolve(pos), base = $pos.depth - depth;
-  var innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;
-  if (base < 0 || $pos.parent.type.spec.isolating ||
-      !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||
-      !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))
-    { return false }
-  for (var d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {
-    var node = $pos.node(d), index$1 = $pos.index(d);
-    if (node.type.spec.isolating) { return false }
-    var rest = node.content.cutByIndex(index$1, node.childCount);
-    var after = (typesAfter && typesAfter[i]) || node;
-    if (after != node) { rest = rest.replaceChild(0, after.type.create(after.attrs)); }
-    if (!node.canReplace(index$1 + 1, node.childCount) || !after.type.validContent(rest))
-      { return false }
-  }
-  var index = $pos.indexAfter(base);
-  var baseType = typesAfter && typesAfter[0];
-  return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type)
-}
-
-// :: (number, ?number, ?[?{type: NodeType, attrs: ?Object}]) → this
-// Split the node at the given position, and optionally, if `depth` is
-// greater than one, any number of nodes above that. By default, the
-// parts split off will inherit the node type of the original node.
-// This can be changed by passing an array of types and attributes to
-// use after the split.
-Transform.prototype.split = function(pos, depth, typesAfter) {
-  if ( depth === void 0 ) { depth = 1; }
-
-  var $pos = this.doc.resolve(pos), before = dist.Fragment.empty, after = dist.Fragment.empty;
-  for (var d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {
-    before = dist.Fragment.from($pos.node(d).copy(before));
-    var typeAfter = typesAfter && typesAfter[i];
-    after = dist.Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));
-  }
-  return this.step(new ReplaceStep(pos, pos, new dist.Slice(before.append(after), depth, depth, true)))
-};
-
-// :: (Node, number) → bool
-// Test whether the blocks before and after a given position can be
-// joined.
-function canJoin(doc, pos) {
-  var $pos = doc.resolve(pos), index = $pos.index();
-  return joinable($pos.nodeBefore, $pos.nodeAfter) &&
-    $pos.parent.canReplace(index, index + 1)
-}
-
-function joinable(a, b) {
-  return a && b && !a.isLeaf && a.canAppend(b)
-}
-
-// :: (Node, number, ?number) → ?number
-// Find an ancestor of the given position that can be joined to the
-// block before (or after if `dir` is positive). Returns the joinable
-// point, if any.
-function joinPoint(doc, pos, dir) {
-  if ( dir === void 0 ) { dir = -1; }
-
-  var $pos = doc.resolve(pos);
-  for (var d = $pos.depth;; d--) {
-    var before = (void 0), after = (void 0);
-    if (d == $pos.depth) {
-      before = $pos.nodeBefore;
-      after = $pos.nodeAfter;
-    } else if (dir > 0) {
-      before = $pos.node(d + 1);
-      after = $pos.node(d).maybeChild($pos.index(d) + 1);
-    } else {
-      before = $pos.node(d).maybeChild($pos.index(d) - 1);
-      after = $pos.node(d + 1);
-    }
-    if (before && !before.isTextblock && joinable(before, after)) { return pos }
-    if (d == 0) { break }
-    pos = dir < 0 ? $pos.before(d) : $pos.after(d);
-  }
-}
-
-// :: (number, ?number) → this
-// Join the blocks around the given position. If depth is 2, their
-// last and first siblings are also joined, and so on.
-Transform.prototype.join = function(pos, depth) {
-  if ( depth === void 0 ) { depth = 1; }
-
-  var step = new ReplaceStep(pos - depth, pos + depth, dist.Slice.empty, true);
-  return this.step(step)
-};
-
-// :: (Node, number, NodeType) → ?number
-// Try to find a point where a node of the given type can be inserted
-// near `pos`, by searching up the node hierarchy when `pos` itself
-// isn't a valid place but is at the start or end of a node. Return
-// null if no position was found.
-function insertPoint(doc, pos, nodeType) {
-  var $pos = doc.resolve(pos);
-  if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) { return pos }
-
-  if ($pos.parentOffset == 0)
-    { for (var d = $pos.depth - 1; d >= 0; d--) {
-      var index = $pos.index(d);
-      if ($pos.node(d).canReplaceWith(index, index, nodeType)) { return $pos.before(d + 1) }
-      if (index > 0) { return null }
-    } }
-  if ($pos.parentOffset == $pos.parent.content.size)
-    { for (var d$1 = $pos.depth - 1; d$1 >= 0; d$1--) {
-      var index$1 = $pos.indexAfter(d$1);
-      if ($pos.node(d$1).canReplaceWith(index$1, index$1, nodeType)) { return $pos.after(d$1 + 1) }
-      if (index$1 < $pos.node(d$1).childCount) { return null }
-    } }
-}
-
-// :: (Node, number, Slice) → ?number
-// Finds a position at or around the given position where the given
-// slice can be inserted. Will look at parent nodes' nearest boundary
-// and try there, even if the original position wasn't directly at the
-// start or end of that node. Returns null when no position was found.
-function dropPoint(doc, pos, slice) {
-  var $pos = doc.resolve(pos);
-  if (!slice.content.size) { return pos }
-  var content = slice.content;
-  for (var i = 0; i < slice.openStart; i++) { content = content.firstChild.content; }
-  for (var pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {
-    for (var d = $pos.depth; d >= 0; d--) {
-      var bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;
-      var insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);
-      if (pass == 1
-          ? $pos.node(d).canReplace(insertPos, insertPos, content)
-          : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))
-        { return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1) }
-    }
-  }
-  return null
-}
-
-function mapFragment(fragment, f, parent) {
-  var mapped = [];
-  for (var i = 0; i < fragment.childCount; i++) {
-    var child = fragment.child(i);
-    if (child.content.size) { child = child.copy(mapFragment(child.content, f, child)); }
-    if (child.isInline) { child = f(child, parent, i); }
-    mapped.push(child);
-  }
-  return dist.Fragment.fromArray(mapped)
-}
-
-// ::- Add a mark to all inline content between two positions.
-var AddMarkStep = (function (Step$$1) {
-  function AddMarkStep(from, to, mark) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.mark = mark;
-  }
-
-  if ( Step$$1 ) { AddMarkStep.__proto__ = Step$$1; }
-  AddMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  AddMarkStep.prototype.constructor = AddMarkStep;
-
-  AddMarkStep.prototype.apply = function apply (doc) {
-    var this$1 = this;
-
-    var oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);
-    var parent = $from.node($from.sharedDepth(this.to));
-    var slice = new dist.Slice(mapFragment(oldSlice.content, function (node, parent) {
-      if (!parent.type.allowsMarkType(this$1.mark.type)) { return node }
-      return node.mark(this$1.mark.addToSet(node.marks))
-    }, parent), oldSlice.openStart, oldSlice.openEnd);
-    return StepResult.fromReplace(doc, this.from, this.to, slice)
-  };
-
-  AddMarkStep.prototype.invert = function invert () {
-    return new RemoveMarkStep(this.from, this.to, this.mark)
-  };
-
-  AddMarkStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
-    return new AddMarkStep(from.pos, to.pos, this.mark)
-  };
-
-  AddMarkStep.prototype.merge = function merge (other) {
-    if (other instanceof AddMarkStep &&
-        other.mark.eq(this.mark) &&
-        this.from <= other.to && this.to >= other.from)
-      { return new AddMarkStep(Math.min(this.from, other.from),
-                             Math.max(this.to, other.to), this.mark) }
-  };
-
-  AddMarkStep.prototype.toJSON = function toJSON () {
-    return {stepType: "addMark", mark: this.mark.toJSON(),
-            from: this.from, to: this.to}
-  };
-
-  AddMarkStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number")
-      { throw new RangeError("Invalid input for AddMarkStep.fromJSON") }
-    return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
-  };
-
-  return AddMarkStep;
-}(Step));
-
-Step.jsonID("addMark", AddMarkStep);
-
-// ::- Remove a mark from all inline content between two positions.
-var RemoveMarkStep = (function (Step$$1) {
-  function RemoveMarkStep(from, to, mark) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.mark = mark;
-  }
-
-  if ( Step$$1 ) { RemoveMarkStep.__proto__ = Step$$1; }
-  RemoveMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  RemoveMarkStep.prototype.constructor = RemoveMarkStep;
-
-  RemoveMarkStep.prototype.apply = function apply (doc) {
-    var this$1 = this;
-
-    var oldSlice = doc.slice(this.from, this.to);
-    var slice = new dist.Slice(mapFragment(oldSlice.content, function (node) {
-      return node.mark(this$1.mark.removeFromSet(node.marks))
-    }), oldSlice.openStart, oldSlice.openEnd);
-    return StepResult.fromReplace(doc, this.from, this.to, slice)
-  };
-
-  RemoveMarkStep.prototype.invert = function invert () {
-    return new AddMarkStep(this.from, this.to, this.mark)
-  };
-
-  RemoveMarkStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
-    return new RemoveMarkStep(from.pos, to.pos, this.mark)
-  };
-
-  RemoveMarkStep.prototype.merge = function merge (other) {
-    if (other instanceof RemoveMarkStep &&
-        other.mark.eq(this.mark) &&
-        this.from <= other.to && this.to >= other.from)
-      { return new RemoveMarkStep(Math.min(this.from, other.from),
-                                Math.max(this.to, other.to), this.mark) }
-  };
-
-  RemoveMarkStep.prototype.toJSON = function toJSON () {
-    return {stepType: "removeMark", mark: this.mark.toJSON(),
-            from: this.from, to: this.to}
-  };
-
-  RemoveMarkStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number")
-      { throw new RangeError("Invalid input for RemoveMarkStep.fromJSON") }
-    return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
-  };
-
-  return RemoveMarkStep;
-}(Step));
-
-Step.jsonID("removeMark", RemoveMarkStep);
-
-// :: (number, number, Mark) → this
-// Add the given mark to the inline content between `from` and `to`.
-Transform.prototype.addMark = function(from, to, mark) {
-  var this$1 = this;
-
-  var removed = [], added = [], removing = null, adding = null;
-  this.doc.nodesBetween(from, to, function (node, pos, parent) {
-    if (!node.isInline) { return }
-    var marks = node.marks;
-    if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {
-      var start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);
-      var newSet = mark.addToSet(marks);
-
-      for (var i = 0; i < marks.length; i++) {
-        if (!marks[i].isInSet(newSet)) {
-          if (removing && removing.to == start && removing.mark.eq(marks[i]))
-            { removing.to = end; }
-          else
-            { removed.push(removing = new RemoveMarkStep(start, end, marks[i])); }
-        }
-      }
-
-      if (adding && adding.to == start)
-        { adding.to = end; }
-      else
-        { added.push(adding = new AddMarkStep(start, end, mark)); }
-    }
-  });
-
-  removed.forEach(function (s) { return this$1.step(s); });
-  added.forEach(function (s) { return this$1.step(s); });
-  return this
-};
-
-// :: (number, number, ?union<Mark, MarkType>) → this
-// Remove marks from inline nodes between `from` and `to`. When `mark`
-// is a single mark, remove precisely that mark. When it is a mark type,
-// remove all marks of that type. When it is null, remove all marks of
-// any type.
-Transform.prototype.removeMark = function(from, to, mark) {
-  var this$1 = this;
-  if ( mark === void 0 ) { mark = null; }
-
-  var matched = [], step = 0;
-  this.doc.nodesBetween(from, to, function (node, pos) {
-    if (!node.isInline) { return }
-    step++;
-    var toRemove = null;
-    if (mark instanceof dist.MarkType) {
-      var found = mark.isInSet(node.marks);
-      if (found) { toRemove = [found]; }
-    } else if (mark) {
-      if (mark.isInSet(node.marks)) { toRemove = [mark]; }
-    } else {
-      toRemove = node.marks;
-    }
-    if (toRemove && toRemove.length) {
-      var end = Math.min(pos + node.nodeSize, to);
-      for (var i = 0; i < toRemove.length; i++) {
-        var style = toRemove[i], found$1 = (void 0);
-        for (var j = 0; j < matched.length; j++) {
-          var m = matched[j];
-          if (m.step == step - 1 && style.eq(matched[j].style)) { found$1 = m; }
-        }
-        if (found$1) {
-          found$1.to = end;
-          found$1.step = step;
-        } else {
-          matched.push({style: style, from: Math.max(pos, from), to: end, step: step});
-        }
-      }
-    }
-  });
-  matched.forEach(function (m) { return this$1.step(new RemoveMarkStep(m.from, m.to, m.style)); });
-  return this
-};
-
-// :: (number, NodeType, ?ContentMatch) → this
-// Removes all marks and nodes from the content of the node at `pos`
-// that don't match the given new parent node type. Accepts an
-// optional starting [content match](#model.ContentMatch) as third
-// argument.
-Transform.prototype.clearIncompatible = function(pos, parentType, match) {
-  var this$1 = this;
-  if ( match === void 0 ) { match = parentType.contentMatch; }
-
-  var node = this.doc.nodeAt(pos);
-  var delSteps = [], cur = pos + 1;
-  for (var i = 0; i < node.childCount; i++) {
-    var child = node.child(i), end = cur + child.nodeSize;
-    var allowed = match.matchType(child.type, child.attrs);
-    if (!allowed) {
-      delSteps.push(new ReplaceStep(cur, end, dist.Slice.empty));
-    } else {
-      match = allowed;
-      for (var j = 0; j < child.marks.length; j++) { if (!parentType.allowsMarkType(child.marks[j].type))
-        { this$1.step(new RemoveMarkStep(cur, end, child.marks[j])); } }
-    }
-    cur = end;
-  }
-  if (!match.validEnd) {
-    var fill = match.fillBefore(dist.Fragment.empty, true);
-    this.replace(cur, cur, new dist.Slice(fill, 0, 0));
-  }
-  for (var i$1 = delSteps.length - 1; i$1 >= 0; i$1--) { this$1.step(delSteps[i$1]); }
-  return this
-};
-
-// :: (Node, number, ?number, ?Slice) → ?Step
-// ‘Fit’ a slice into a given position in the document, producing a
-// [step](#transform.Step) that inserts it. Will return null if
-// there's no meaningful way to insert the slice here, or inserting it
-// would be a no-op (an empty slice over an empty range).
-function replaceStep(doc, from, to, slice) {
-  if ( to === void 0 ) { to = from; }
-  if ( slice === void 0 ) { slice = dist.Slice.empty; }
-
-  if (from == to && !slice.size) { return null }
-
-  var $from = doc.resolve(from), $to = doc.resolve(to);
-  // Optimization -- avoid work if it's obvious that it's not needed.
-  if (fitsTrivially($from, $to, slice)) { return new ReplaceStep(from, to, slice) }
-  var placed = placeSlice($from, slice);
-
-  var fittedLeft = fitLeft($from, placed);
-  var fitted = fitRight($from, $to, fittedLeft);
-  if (!fitted) { return null }
-  if (fittedLeft.size != fitted.size && canMoveText($from, $to, fittedLeft)) {
-    var d = $to.depth, after = $to.after(d);
-    while (d > 1 && after == $to.end(--d)) { ++after; }
-    var fittedAfter = fitRight($from, doc.resolve(after), fittedLeft);
-    if (fittedAfter)
-      { return new ReplaceAroundStep(from, after, to, $to.end(), fittedAfter, fittedLeft.size) }
-  }
-  return fitted.size || from != to ? new ReplaceStep(from, to, fitted) : null
-}
-
-// :: (number, ?number, ?Slice) → this
-// Replace the part of the document between `from` and `to` with the
-// given `slice`.
-Transform.prototype.replace = function(from, to, slice) {
-  if ( to === void 0 ) { to = from; }
-  if ( slice === void 0 ) { slice = dist.Slice.empty; }
-
-  var step = replaceStep(this.doc, from, to, slice);
-  if (step) { this.step(step); }
-  return this
-};
-
-// :: (number, number, union<Fragment, Node, [Node]>) → this
-// Replace the given range with the given content, which may be a
-// fragment, node, or array of nodes.
-Transform.prototype.replaceWith = function(from, to, content) {
-  return this.replace(from, to, new dist.Slice(dist.Fragment.from(content), 0, 0))
-};
-
-// :: (number, number) → this
-// Delete the content between the given positions.
-Transform.prototype.delete = function(from, to) {
-  return this.replace(from, to, dist.Slice.empty)
-};
-
-// :: (number, union<Fragment, Node, [Node]>) → this
-// Insert the given content at the given position.
-Transform.prototype.insert = function(pos, content) {
-  return this.replaceWith(pos, pos, content)
-};
-
-
-
-function fitLeftInner($from, depth, placed, placedBelow) {
-  var content = dist.Fragment.empty, openEnd = 0, placedHere = placed[depth];
-  if ($from.depth > depth) {
-    var inner = fitLeftInner($from, depth + 1, placed, placedBelow || placedHere);
-    openEnd = inner.openEnd + 1;
-    content = dist.Fragment.from($from.node(depth + 1).copy(inner.content));
-  }
-
-  if (placedHere) {
-    content = content.append(placedHere.content);
-    openEnd = placedHere.openEnd;
-  }
-  if (placedBelow) {
-    content = content.append($from.node(depth).contentMatchAt($from.indexAfter(depth)).fillBefore(dist.Fragment.empty, true));
-    openEnd = 0;
-  }
-
-  return {content: content, openEnd: openEnd}
-}
-
-function fitLeft($from, placed) {
-  var ref = fitLeftInner($from, 0, placed, false);
-  var content = ref.content;
-  var openEnd = ref.openEnd;
-  return new dist.Slice(content, $from.depth, openEnd || 0)
-}
-
-function fitRightJoin(content, parent, $from, $to, depth, openStart, openEnd) {
-  var match, count = content.childCount, matchCount = count - (openEnd > 0 ? 1 : 0);
-  var parentNode = openStart < 0 ? parent : $from.node(depth);
-  if (openStart < 0)
-    { match = parentNode.contentMatchAt(matchCount); }
-  else if (count == 1 && openEnd > 0)
-    { match = parentNode.contentMatchAt(openStart ? $from.index(depth) : $from.indexAfter(depth)); }
-  else
-    { match = parentNode.contentMatchAt($from.indexAfter(depth))
-      .matchFragment(content, count > 0 && openStart ? 1 : 0, matchCount); }
-
-  var toNode = $to.node(depth);
-  if (openEnd > 0 && depth < $to.depth) {
-    var after = toNode.content.cutByIndex($to.indexAfter(depth)).addToStart(content.lastChild);
-    var joinable$1 = match.fillBefore(after, true);
-    // Can't insert content if there's a single node stretched across this gap
-    if (joinable$1 && joinable$1.size && openStart > 0 && count == 1) { joinable$1 = null; }
-
-    if (joinable$1) {
-      var inner = fitRightJoin(content.lastChild.content, content.lastChild, $from, $to,
-                               depth + 1, count == 1 ? openStart - 1 : -1, openEnd - 1);
-      if (inner) {
-        var last = content.lastChild.copy(inner);
-        if (joinable$1.size)
-          { return content.cutByIndex(0, count - 1).append(joinable$1).addToEnd(last) }
-        else
-          { return content.replaceChild(count - 1, last) }
-      }
-    }
-  }
-  if (openEnd > 0)
-    { match = match.matchType((count == 1 && openStart > 0 ? $from.node(depth + 1) : content.lastChild).type); }
-
-  // If we're here, the next level can't be joined, so we see what
-  // happens if we leave it open.
-  var toIndex = $to.index(depth);
-  if (toIndex == toNode.childCount && !toNode.type.compatibleContent(parent.type)) { return null }
-  var joinable = match.fillBefore(toNode.content, true, toIndex);
-  for (var i = toIndex; joinable && i < toNode.content.childCount; i++)
-    { if (!parentNode.type.allowsMarks(toNode.content.child(i).marks)) { joinable = null; } }
-  if (!joinable) { return null }
-
-  if (openEnd > 0) {
-    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
-                                count == 1 ? openStart - 1 : -1);
-    content = content.replaceChild(count - 1, closed);
-  }
-  content = content.append(joinable);
-  if ($to.depth > depth)
-    { content = content.addToEnd(fitRightSeparate($to, depth + 1)); }
-  return content
-}
-
-function fitRightClosed(node, openEnd, $from, depth, openStart) {
-  var match, content = node.content, count = content.childCount;
-  if (openStart >= 0)
-    { match = $from.node(depth).contentMatchAt($from.indexAfter(depth))
-      .matchFragment(content, openStart > 0 ? 1 : 0, count); }
-  else
-    { match = node.contentMatchAt(count); }
-
-  if (openEnd > 0) {
-    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
-                                count == 1 ? openStart - 1 : -1);
-    content = content.replaceChild(count - 1, closed);
-  }
-
-  return node.copy(content.append(match.fillBefore(dist.Fragment.empty, true)))
-}
-
-function fitRightSeparate($to, depth) {
-  var node = $to.node(depth);
-  var fill = node.contentMatchAt(0).fillBefore(node.content, true, $to.index(depth));
-  if ($to.depth > depth) { fill = fill.addToEnd(fitRightSeparate($to, depth + 1)); }
-  return node.copy(fill)
-}
-
-function normalizeSlice(content, openStart, openEnd) {
-  while (openStart > 0 && openEnd > 0 && content.childCount == 1) {
-    content = content.firstChild.content;
-    openStart--;
-    openEnd--;
-  }
-  return new dist.Slice(content, openStart, openEnd)
-}
-
-// : (ResolvedPos, ResolvedPos, number, Slice) → Slice
-function fitRight($from, $to, slice) {
-  var fitted = fitRightJoin(slice.content, $from.node(0), $from, $to, 0, slice.openStart, slice.openEnd);
-  if (!fitted) { return null }
-  return normalizeSlice(fitted, slice.openStart, $to.depth)
-}
-
-function fitsTrivially($from, $to, slice) {
-  return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&
-    $from.parent.canReplace($from.index(), $to.index(), slice.content)
-}
-
-function canMoveText($from, $to, slice) {
-  if (!$to.parent.isTextblock) { return false }
-
-  var parent = slice.openEnd ? nodeRight(slice.content, slice.openEnd)
-      : $from.node($from.depth - (slice.openStart - slice.openEnd));
-  if (!parent.isTextblock) { return false }
-  for (var i = $to.index(); i < $to.parent.childCount; i++)
-    { if (!parent.type.allowsMarks($to.parent.child(i).marks)) { return false } }
-  var match;
-  if (slice.openEnd) {
-    match = parent.contentMatchAt(parent.childCount);
-  } else {
-    match = parent.contentMatchAt(parent.childCount);
-    if (slice.size) { match = match.matchFragment(slice.content, slice.openStart ? 1 : 0); }
-  }
-  match = match.matchFragment($to.parent.content, $to.index());
-  return match && match.validEnd
-}
-
-function nodeRight(content, depth) {
-  for (var i = 1; i < depth; i++) { content = content.lastChild.content; }
-  return content.lastChild
-}
-
-// Algorithm for 'placing' the elements of a slice into a gap:
-//
-// We consider the content of each node that is open to the left to be
-// independently placeable. I.e. in <p("foo"), p("bar")>, when the
-// paragraph on the left is open, "foo" can be placed (somewhere on
-// the left side of the replacement gap) independently from p("bar").
-//
-// So placeSlice splits up a slice into a number of sub-slices,
-// along with information on where they can be placed on the given
-// left-side edge. It works by walking the open side of the slice,
-// from the inside out, and trying to find a landing spot for each
-// element, by simultaneously scanning over the gap side. When no
-// place is found for an open node's content, it is left in that node.
-
-// : (ResolvedPos, Slice) → [{content: Fragment, openEnd: number, depth: number}]
-function placeSlice($from, slice) {
-  var frontier = new Frontier($from);
-  for (var pass = 1; slice.size && pass <= 3; pass++)
-    { slice = frontier.placeSlice(slice.content, slice.openStart, slice.openEnd, pass); }
-  while (frontier.open.length) { frontier.closeNode(); }
-  return frontier.placed
-}
-
-// Helper class that models the open side of the insert position,
-// keeping track of the content match and already inserted content
-// at each depth.
-var Frontier = function Frontier($pos) {
-  var this$1 = this;
-
-  // : [{parent: Node, match: ContentMatch, content: Fragment, wrapper: bool, openEnd: number, depth: number}]
-  this.open = [];
-  for (var d = 0; d <= $pos.depth; d++) {
-    var parent = $pos.node(d), match = parent.contentMatchAt($pos.indexAfter(d));
-    this$1.open.push({parent: parent, match: match, content: dist.Fragment.empty, wrapper: false, openEnd: 0, depth: d});
-  }
-  this.placed = [];
-};
-
-// : (Fragment, number, number, number, ?Node) → Slice
-// Tries to place the content of the given slice, and returns a
-// slice containing unplaced content.
-//
-// pass 1: try to fit directly
-// pass 2: allow wrapper nodes to be introduced
-// pass 3: allow unwrapping of nodes that aren't open
-Frontier.prototype.placeSlice = function placeSlice (fragment, openStart, openEnd, pass, parent) {
-    var this$1 = this;
-
-  if (openStart > 0) {
-    var first = fragment.firstChild;
-    var inner = this.placeSlice(first.content, Math.max(0, openStart - 1),
-                                openEnd && fragment.childCount == 1 ? openEnd - 1 : 0,
-                                pass, first);
-    if (inner.content != first.content) {
-      if (inner.content.size) {
-        fragment = fragment.replaceChild(0, first.copy(inner.content));
-        openStart = inner.openStart + 1;
-      } else {
-        if (fragment.childCount == 1) { openEnd = 0; }
-        fragment = fragment.cutByIndex(1);
-        openStart = 0;
-      }
-    }
-  }
-  var result = this.placeContent(fragment, openStart, openEnd, pass, parent);
-  if (pass > 2 && result.size && openStart == 0) {
-    for (var i = 0; i < result.content.childCount; i++) {
-      var child = result.content.child(i);
-      this$1.placeContent(child.content, 0,
-                        openEnd && i == result.content.childCount.length - 1 ? openEnd - 1 : 0,
-                        pass, child);
-    }
-    result = dist.Fragment.empty;
-  }
-  return result
-};
-
-Frontier.prototype.placeContent = function placeContent (fragment, openStart, openEnd, pass, parent) {
-    var this$1 = this;
-
-  var i = 0;
-  // Go over the fragment's children
-  for (; i < fragment.childCount; i++) {
-    var child = fragment.child(i), placed = false, last = i == fragment.childCount - 1;
-    // Try each open node in turn, starting from the innermost
-    for (var d = this.open.length - 1; d >= 0; d--) {
-      var open = this$1.open[d], wrap = (void 0);
-
-      // If pass > 1, it is allowed to wrap the node to help find a
-      // fit, so if findWrappeing returns something, we add open
-      // nodes to the frontier for that wrapping.
-      if (pass > 1 && (wrap = open.match.findWrapping(child.type)) &&
-          !(parent && wrap.length && wrap[wrap.length - 1] == parent.type)) {
-        while (this.open.length - 1 > d) { this$1.closeNode(); }
-        for (var w = 0; w < wrap.length; w++) {
-          open.match = open.match.matchType(wrap[w]);
-          d++;
-          open = {parent: wrap[w].create(),
-                  match: wrap[w].contentMatch,
-                  content: dist.Fragment.empty, wrapper: true, openEnd: 0, depth: d + w};
-          this$1.open.push(open);
-        }
-      }
-
-      // See if the child fits here
-      var match = open.match.matchType(child.type);
-      if (!match) {
-        var fill = open.match.fillBefore(dist.Fragment.from(child));
-        if (fill) {
-          for (var j = 0; j < fill.childCount; j++) {
-            var ch = fill.child(j);
-            this$1.addNode(open, ch, 0);
-            match = open.match.matchFragment(ch);
-          }
-        } else if (parent && open.match.matchType(parent.type)) {
-          // Don't continue looking further up if the parent node
-          // would fit here.
-          break
-        } else {
-          continue
-        }
-      }
-
-      // Close open nodes above this one, since we're starting to
-      // add to this.
-      while (this.open.length - 1 > d) { this$1.closeNode(); }
-      // Strip marks from the child or close its start when necessary
-      child = child.mark(open.parent.type.allowedMarks(child.marks));
-      if (openStart) {
-        child = closeNodeStart(child, openStart, last ? openEnd : 0);
-        openStart = 0;
-      }
-      // Add the child to this open node and adjust its metadata
-      this$1.addNode(open, child, last ? openEnd : 0);
-      open.match = match;
-      if (last) { openEnd = 0; }
-      placed = true;
-      break
-    }
-    // As soon as we've failed to place a node we stop looking at
-    // later nodes
-    if (!placed) { break }
-  }
-  // Close the current open node if it's not the the root and we
-  // either placed up to the end of the node or the the current
-  // slice depth's node type matches the open node's type
-  if (this.open.length > 1 &&
-      (i > 0 && i == fragment.childCount ||
-       parent && this.open[this.open.length - 1].parent.type == parent.type))
-    { this.closeNode(); }
-
-  return new dist.Slice(fragment.cutByIndex(i), openStart, openEnd)
-};
-
-Frontier.prototype.addNode = function addNode (open, node, openEnd) {
-  open.content = closeFragmentEnd(open.content, open.openEnd).addToEnd(node);
-  open.openEnd = openEnd;
-};
-
-Frontier.prototype.closeNode = function closeNode () {
-  var open = this.open.pop();
-  if (open.content.size == 0) ; else if (open.wrapper) {
-    this.addNode(this.open[this.open.length - 1], open.parent.copy(open.content), open.openEnd + 1);
-  } else {
-    this.placed[open.depth] = {depth: open.depth, content: open.content, openEnd: open.openEnd};
-  }
-};
-
-function closeNodeStart(node, openStart, openEnd) {
-  var content = node.content;
-  if (openStart > 1) {
-    var first = closeNodeStart(node.firstChild, openStart - 1, node.childCount == 1 ? openEnd - 1 : 0);
-    content = node.content.replaceChild(0, first);
-  }
-  var fill = node.type.contentMatch.fillBefore(content, openEnd == 0);
-  return node.copy(fill.append(content))
-}
-
-function closeNodeEnd(node, depth) {
-  var content = node.content;
-  if (depth > 1) {
-    var last = closeNodeEnd(node.lastChild, depth - 1);
-    content = node.content.replaceChild(node.childCount - 1, last);
-  }
-  var fill = node.contentMatchAt(node.childCount).fillBefore(dist.Fragment.empty, true);
-  return node.copy(content.append(fill))
-}
-
-function closeFragmentEnd(fragment, depth) {
-  return depth ? fragment.replaceChild(fragment.childCount - 1, closeNodeEnd(fragment.lastChild, depth)) : fragment
-}
-
-// :: (number, number, Slice) → this
-// Replace a range of the document with a given slice, using `from`,
-// `to`, and the slice's [`openStart`](#model.Slice.openStart) property
-// as hints, rather than fixed start and end points. This method may
-// grow the replaced area or close open nodes in the slice in order to
-// get a fit that is more in line with WYSIWYG expectations, by
-// dropping fully covered parent nodes of the replaced region when
-// they are marked [non-defining](#model.NodeSpec.defining), or
-// including an open parent node from the slice that _is_ marked as
-// [defining](#model.NodeSpec.defining).
-//
-// This is the method, for example, to handle paste. The similar
-// [`replace`](#transform.Transform.replace) method is a more
-// primitive tool which will _not_ move the start and end of its given
-// range, and is useful in situations where you need more precise
-// control over what happens.
-Transform.prototype.replaceRange = function(from, to, slice) {
-  var this$1 = this;
-
-  if (!slice.size) { return this.deleteRange(from, to) }
-
-  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
-  if (fitsTrivially($from, $to, slice))
-    { return this.step(new ReplaceStep(from, to, slice)) }
-
-  var targetDepths = coveredDepths($from, this.doc.resolve(to));
-  // Can't replace the whole document, so remove 0 if it's present
-  if (targetDepths[targetDepths.length - 1] == 0) { targetDepths.pop(); }
-  // Negative numbers represent not expansion over the whole node at
-  // that depth, but replacing from $from.before(-D) to $to.pos.
-  var preferredTarget = -($from.depth + 1);
-  targetDepths.unshift(preferredTarget);
-  // This loop picks a preferred target depth, if one of the covering
-  // depths is not outside of a defining node, and adds negative
-  // depths for any depth that has $from at its start and does not
-  // cross a defining node.
-  for (var d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {
-    var spec = $from.node(d).type.spec;
-    if (spec.defining || spec.isolating) { break }
-    if (targetDepths.indexOf(d) > -1) { preferredTarget = d; }
-    else if ($from.before(d) == pos) { targetDepths.splice(1, 0, -d); }
-  }
-  // Try to fit each possible depth of the slice into each possible
-  // target depth, starting with the preferred depths.
-  var preferredTargetIndex = targetDepths.indexOf(preferredTarget);
-
-  var leftNodes = [], preferredDepth = slice.openStart;
-  for (var content = slice.content, i = 0;; i++) {
-    var node = content.firstChild;
-    leftNodes.push(node);
-    if (i == slice.openStart) { break }
-    content = node.content;
-  }
-  // Back up if the node directly above openStart, or the node above
-  // that separated only by a non-defining textblock node, is defining.
-  if (preferredDepth > 0 && leftNodes[preferredDepth - 1].type.spec.defining &&
-      $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 1].type)
-    { preferredDepth -= 1; }
-  else if (preferredDepth >= 2 && leftNodes[preferredDepth - 1].isTextblock && leftNodes[preferredDepth - 2].type.spec.defining &&
-           $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 2].type)
-    { preferredDepth -= 2; }
-
-  for (var j = slice.openStart; j >= 0; j--) {
-    var openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);
-    var insert = leftNodes[openDepth];
-    if (!insert) { continue }
-    for (var i$1 = 0; i$1 < targetDepths.length; i$1++) {
-      // Loop over possible expansion levels, starting with the
-      // preferred one
-      var targetDepth = targetDepths[(i$1 + preferredTargetIndex) % targetDepths.length], expand = true;
-      if (targetDepth < 0) { expand = false; targetDepth = -targetDepth; }
-      var parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);
-      if (parent.canReplaceWith(index, index, insert.type, insert.marks))
-        { return this$1.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,
-                            new dist.Slice(closeFragment(slice.content, 0, slice.openStart, openDepth),
-                                      openDepth, slice.openEnd)) }
-    }
-  }
-
-  return this.replace(from, to, slice)
-};
-
-function closeFragment(fragment, depth, oldOpen, newOpen, parent) {
-  if (depth < oldOpen) {
-    var first = fragment.firstChild;
-    fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));
-  }
-  if (depth > newOpen)
-    { fragment = parent.contentMatchAt(0).fillBefore(fragment, true).append(fragment); }
-  return fragment
-}
-
-// :: (number, number, Node) → this
-// Replace the given range with a node, but use `from` and `to` as
-// hints, rather than precise positions. When from and to are the same
-// and are at the start or end of a parent node in which the given
-// node doesn't fit, this method may _move_ them out towards a parent
-// that does allow the given node to be placed. When the given range
-// completely covers a parent node, this method may completely replace
-// that parent node.
-Transform.prototype.replaceRangeWith = function(from, to, node) {
-  if (!node.isInline && from == to && this.doc.resolve(from).parent.content.size) {
-    var point = insertPoint(this.doc, from, node.type);
-    if (point != null) { from = to = point; }
-  }
-  return this.replaceRange(from, to, new dist.Slice(dist.Fragment.from(node), 0, 0))
-};
-
-// :: (number, number) → this
-// Delete the given range, expanding it to cover fully covered
-// parent nodes until a valid replace is found.
-Transform.prototype.deleteRange = function(from, to) {
-  var this$1 = this;
-
-  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
-  var covered = coveredDepths($from, $to);
-  for (var i = 0; i < covered.length; i++) {
-    var depth = covered[i], last = i == covered.length - 1;
-    if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)
-      { return this$1.delete($from.start(depth), $to.end(depth)) }
-    if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))
-      { return this$1.delete($from.before(depth), $to.after(depth)) }
-  }
-  for (var d = 1; d <= $from.depth; d++) {
-    if (from - $from.start(d) == $from.depth - d && to > $from.end(d))
-      { return this$1.delete($from.before(d), to) }
-  }
-  return this.delete(from, to)
-};
-
-// : (ResolvedPos, ResolvedPos) → [number]
-// Returns an array of all depths for which $from - $to spans the
-// whole content of the nodes at that depth.
-function coveredDepths($from, $to) {
-  var result = [], minDepth = Math.min($from.depth, $to.depth);
-  for (var d = minDepth; d >= 0; d--) {
-    var start = $from.start(d);
-    if (start < $from.pos - ($from.depth - d) ||
-        $to.end(d) > $to.pos + ($to.depth - d) ||
-        $from.node(d).type.spec.isolating ||
-        $to.node(d).type.spec.isolating) { break }
-    if (start == $to.start(d)) { result.push(d); }
-  }
-  return result
-}
-
-exports.Transform = Transform;
-exports.TransformError = TransformError;
-exports.Step = Step;
-exports.StepResult = StepResult;
-exports.joinPoint = joinPoint;
-exports.canJoin = canJoin;
-exports.canSplit = canSplit;
-exports.insertPoint = insertPoint;
-exports.dropPoint = dropPoint;
-exports.liftTarget = liftTarget;
-exports.findWrapping = findWrapping;
-exports.StepMap = StepMap;
-exports.MapResult = MapResult;
-exports.Mapping = Mapping;
-exports.AddMarkStep = AddMarkStep;
-exports.RemoveMarkStep = RemoveMarkStep;
-exports.ReplaceStep = ReplaceStep;
-exports.ReplaceAroundStep = ReplaceAroundStep;
-exports.replaceStep = replaceStep;
-
-});
-
-unwrapExports(dist$1);
-var dist_1$1 = dist$1.Transform;
-var dist_2$1 = dist$1.TransformError;
-var dist_3$1 = dist$1.Step;
-var dist_4$1 = dist$1.StepResult;
-var dist_5$1 = dist$1.joinPoint;
-var dist_6$1 = dist$1.canJoin;
-var dist_7$1 = dist$1.canSplit;
-var dist_8$1 = dist$1.insertPoint;
-var dist_9$1 = dist$1.dropPoint;
-var dist_10$1 = dist$1.liftTarget;
-var dist_11$1 = dist$1.findWrapping;
-var dist_12$1 = dist$1.StepMap;
-var dist_13$1 = dist$1.MapResult;
-var dist_14 = dist$1.Mapping;
-var dist_15 = dist$1.AddMarkStep;
-var dist_16 = dist$1.RemoveMarkStep;
-var dist_17 = dist$1.ReplaceStep;
-var dist_18 = dist$1.ReplaceAroundStep;
-var dist_19 = dist$1.replaceStep;
-
-var dist$2 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-var classesById = Object.create(null);
-
-// ::- Superclass for editor selections. Every selection type should
-// extend this. Should not be instantiated directly.
-var Selection = function Selection($anchor, $head, ranges) {
-  // :: [SelectionRange]
-  // The ranges covered by the selection.
-  this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];
-  // :: ResolvedPos
-  // The resolved anchor of the selection (the side that stays in
-  // place when the selection is modified).
-  this.$anchor = $anchor;
-  // :: ResolvedPos
-  // The resolved head of the selection (the side that moves when
-  // the selection is modified).
-  this.$head = $head;
-};
-
-var prototypeAccessors = { anchor: {},head: {},from: {},to: {},$from: {},$to: {},empty: {} };
-
-// :: number
-// The selection's anchor, as an unresolved position.
-prototypeAccessors.anchor.get = function () { return this.$anchor.pos };
-
-// :: number
-// The selection's head.
-prototypeAccessors.head.get = function () { return this.$head.pos };
-
-// :: number
-// The lower bound of the selection's main range.
-prototypeAccessors.from.get = function () { return this.$from.pos };
-
-// :: number
-// The upper bound of the selection's main range.
-prototypeAccessors.to.get = function () { return this.$to.pos };
-
-// :: ResolvedPos
-// The resolved lowerbound of the selection's main range.
-prototypeAccessors.$from.get = function () {
-  return this.ranges[0].$from
-};
-
-// :: ResolvedPos
-// The resolved upper bound of the selection's main range.
-prototypeAccessors.$to.get = function () {
-  return this.ranges[0].$to
-};
-
-// :: bool
-// Indicates whether the selection contains any content.
-prototypeAccessors.empty.get = function () {
-  var ranges = this.ranges;
-  for (var i = 0; i < ranges.length; i++)
-    { if (ranges[i].$from.pos != ranges[i].$to.pos) { return false } }
-  return true
-};
-
-// eq:: (Selection) → bool
-// Test whether the selection is the same as another selection.
-
-// map:: (doc: Node, mapping: Mappable) → Selection
-// Map this selection through a [mappable](#transform.Mappable) thing. `doc`
-// should be the new document to which we are mapping.
-
-// :: () → Slice
-// Get the content of this selection as a slice.
-Selection.prototype.content = function content () {
-  return this.$from.node(0).slice(this.from, this.to, true)
-};
-
-// :: (Transaction, ?Slice)
-// Replace the selection with a slice or, if no slice is given,
-// delete the selection. Will append to the given transaction.
-Selection.prototype.replace = function replace (tr, content) {
-    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-  // Put the new selection at the position after the inserted
-  // content. When that ended in an inline node, search backwards,
-  // to get the position after that node. If not, search forward.
-  var lastNode = content.content.lastChild, lastParent = null;
-  for (var i = 0; i < content.openEnd; i++) {
-    lastParent = lastNode;
-    lastNode = lastNode.lastChild;
-  }
-
-  var mapFrom = tr.steps.length, ranges = this.ranges;
-  for (var i$1 = 0; i$1 < ranges.length; i$1++) {
-    var ref = ranges[i$1];
-      var $from = ref.$from;
-      var $to = ref.$to;
-      var mapping = tr.mapping.slice(mapFrom);
-    tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i$1 ? dist.Slice.empty : content);
-    if (i$1 == 0)
-      { selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1); }
-  }
-};
-
-// :: (Transaction, Node)
-// Replace the selection with the given node, appending the changes
-// to the given transaction.
-Selection.prototype.replaceWith = function replaceWith (tr, node) {
-  var mapFrom = tr.steps.length, ranges = this.ranges;
-  for (var i = 0; i < ranges.length; i++) {
-    var ref = ranges[i];
-      var $from = ref.$from;
-      var $to = ref.$to;
-      var mapping = tr.mapping.slice(mapFrom);
-    var from = mapping.map($from.pos), to = mapping.map($to.pos);
-    if (i) {
-      tr.deleteRange(from, to);
-    } else {
-      tr.replaceRangeWith(from, to, node);
-      selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);
-    }
-  }
-};
-
-// toJSON:: () → Object
-// Convert the selection to a JSON representation. When implementing
-// this for a custom selection class, make sure to give the object a
-// `type` property whose value matches the ID under which you
-// [registered](#state.Selection^jsonID) your class.
-
-// :: (ResolvedPos, number, ?bool) → ?Selection
-// Find a valid cursor or leaf node selection starting at the given
-// position and searching back if `dir` is negative, and forward if
-// positive. When `textOnly` is true, only consider cursor
-// selections. Will return null when no valid selection position is
-// found.
-Selection.findFrom = function findFrom ($pos, dir, textOnly) {
-  var inner = $pos.parent.inlineContent ? new TextSelection($pos)
-      : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);
-  if (inner) { return inner }
-
-  for (var depth = $pos.depth - 1; depth >= 0; depth--) {
-    var found = dir < 0
-        ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)
-        : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);
-    if (found) { return found }
-  }
-};
-
-// :: (ResolvedPos, ?number) → Selection
-// Find a valid cursor or leaf node selection near the given
-// position. Searches forward first by default, but if `bias` is
-// negative, it will search backwards first.
-Selection.near = function near ($pos, bias) {
-    if ( bias === void 0 ) { bias = 1; }
-
-  return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0))
-};
-
-// :: (Node) → Selection
-// Find the cursor or leaf node selection closest to the start of
-// the given document. Will return an
-// [`AllSelection`](#state.AllSelection) if no valid position
-// exists.
-Selection.atStart = function atStart (doc) {
-  return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc)
-};
-
-// :: (Node) → Selection
-// Find the cursor or leaf node selection closest to the end of the
-// given document.
-Selection.atEnd = function atEnd (doc) {
-  return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc)
-};
-
-// :: (Node, Object) → Selection
-// Deserialize the JSON representation of a selection. Must be
-// implemented for custom classes (as a static class method).
-Selection.fromJSON = function fromJSON (doc, json) {
-  if (!json || !json.type) { throw new RangeError("Invalid input for Selection.fromJSON") }
-  var cls = classesById[json.type];
-  if (!cls) { throw new RangeError(("No selection type " + (json.type) + " defined")) }
-  return cls.fromJSON(doc, json)
-};
-
-// :: (string, constructor<Selection>)
-// To be able to deserialize selections from JSON, custom selection
-// classes must register themselves with an ID string, so that they
-// can be disambiguated. Try to pick something that's unlikely to
-// clash with classes from other modules.
-Selection.jsonID = function jsonID (id, selectionClass) {
-  if (id in classesById) { throw new RangeError("Duplicate use of selection JSON ID " + id) }
-  classesById[id] = selectionClass;
-  selectionClass.prototype.jsonID = id;
-  return selectionClass
-};
-
-// :: () → SelectionBookmark
-// Get a [bookmark](#state.SelectionBookmark) for this selection,
-// which is a value that can be mapped without having access to a
-// current document, and later resolved to a real selection for a
-// given document again. (This is used mostly by the history to
-// track and restore old selections.) The default implementation of
-// this method just converts the selection to a text selection and
-// returns the bookmark for that.
-Selection.prototype.getBookmark = function getBookmark () {
-  return TextSelection.between(this.$anchor, this.$head).getBookmark()
-};
-
-Object.defineProperties( Selection.prototype, prototypeAccessors );
-
-// :: bool
-// Controls whether, when a selection of this type is active in the
-// browser, the selected range should be visible to the user. Defaults
-// to `true`.
-Selection.prototype.visible = true;
-
-// SelectionBookmark:: interface
-// A lightweight, document-independent representation of a selection.
-// You can define a custom bookmark type for a custom selection class
-// to make the history handle it well.
-//
-//   map:: (mapping: Mapping) → SelectionBookmark
-//   Map the bookmark through a set of changes.
-//
-//   resolve:: (doc: Node) → Selection
-//   Resolve the bookmark to a real selection again. This may need to
-//   do some error checking and may fall back to a default (usually
-//   [`TextSelection.between`](#state.TextSelection^between)) if
-//   mapping made the bookmark invalid.
-
-// ::- Represents a selected range in a document.
-var SelectionRange = function SelectionRange($from, $to) {
-  // :: ResolvedPos
-  // The lower bound of the range.
-  this.$from = $from;
-  // :: ResolvedPos
-  // The upper bound of the range.
-  this.$to = $to;
-};
-
-// ::- A text selection represents a classical editor selection, with
-// a head (the moving side) and anchor (immobile side), both of which
-// point into textblock nodes. It can be empty (a regular cursor
-// position).
-var TextSelection = (function (Selection) {
-  function TextSelection($anchor, $head) {
-    if ( $head === void 0 ) { $head = $anchor; }
-
-    Selection.call(this, $anchor, $head);
-  }
-
-  if ( Selection ) { TextSelection.__proto__ = Selection; }
-  TextSelection.prototype = Object.create( Selection && Selection.prototype );
-  TextSelection.prototype.constructor = TextSelection;
-
-  var prototypeAccessors$1 = { $cursor: {} };
-
-  // :: ?ResolvedPos
-  // Returns a resolved position if this is a cursor selection (an
-  // empty text selection), and null otherwise.
-  prototypeAccessors$1.$cursor.get = function () { return this.$anchor.pos == this.$head.pos ? this.$head : null };
-
-  TextSelection.prototype.map = function map (doc, mapping) {
-    var $head = doc.resolve(mapping.map(this.head));
-    if (!$head.parent.inlineContent) { return Selection.near($head) }
-    var $anchor = doc.resolve(mapping.map(this.anchor));
-    return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head)
-  };
-
-  TextSelection.prototype.replace = function replace (tr, content) {
-    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-    Selection.prototype.replace.call(this, tr, content);
-    if (content == dist.Slice.empty) {
-      var marks = this.$from.marksAcross(this.$to);
-      if (marks) { tr.ensureMarks(marks); }
-    }
-  };
-
-  TextSelection.prototype.eq = function eq (other) {
-    return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head
-  };
-
-  TextSelection.prototype.getBookmark = function getBookmark () {
-    return new TextBookmark(this.anchor, this.head)
-  };
-
-  TextSelection.prototype.toJSON = function toJSON () {
-    return {type: "text", anchor: this.anchor, head: this.head}
-  };
-
-  TextSelection.fromJSON = function fromJSON (doc, json) {
-    if (typeof json.anchor != "number" || typeof json.head != "number")
-      { throw new RangeError("Invalid input for TextSelection.fromJSON") }
-    return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head))
-  };
-
-  // :: (Node, number, ?number) → TextSelection
-  // Create a text selection from non-resolved positions.
-  TextSelection.create = function create (doc, anchor, head) {
-    if ( head === void 0 ) { head = anchor; }
-
-    var $anchor = doc.resolve(anchor);
-    return new this($anchor, head == anchor ? $anchor : doc.resolve(head))
-  };
-
-  // :: (ResolvedPos, ResolvedPos, ?number) → Selection
-  // Return a text selection that spans the given positions or, if
-  // they aren't text positions, find a text selection near them.
-  // `bias` determines whether the method searches forward (default)
-  // or backwards (negative number) first. Will fall back to calling
-  // [`Selection.near`](#state.Selection^near) when the document
-  // doesn't contain a valid text position.
-  TextSelection.between = function between ($anchor, $head, bias) {
-    var dPos = $anchor.pos - $head.pos;
-    if (!bias || dPos) { bias = dPos >= 0 ? 1 : -1; }
-    if (!$head.parent.inlineContent) {
-      var found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);
-      if (found) { $head = found.$head; }
-      else { return Selection.near($head, bias) }
-    }
-    if (!$anchor.parent.inlineContent) {
-      if (dPos == 0) {
-        $anchor = $head;
-      } else {
-        $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;
-        if (($anchor.pos < $head.pos) != (dPos < 0)) { $anchor = $head; }
-      }
-    }
-    return new TextSelection($anchor, $head)
-  };
-
-  Object.defineProperties( TextSelection.prototype, prototypeAccessors$1 );
-
-  return TextSelection;
-}(Selection));
-
-Selection.jsonID("text", TextSelection);
-
-var TextBookmark = function TextBookmark(anchor, head) {
-  this.anchor = anchor;
-  this.head = head;
-};
-TextBookmark.prototype.map = function map (mapping) {
-  return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head))
-};
-TextBookmark.prototype.resolve = function resolve (doc) {
-  return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head))
-};
-
-// ::- A node selection is a selection that points at a single node.
-// All nodes marked [selectable](#model.NodeSpec.selectable) can be
-// the target of a node selection. In such a selection, `from` and
-// `to` point directly before and after the selected node, `anchor`
-// equals `from`, and `head` equals `to`..
-var NodeSelection = (function (Selection) {
-  function NodeSelection($pos) {
-    var node = $pos.nodeAfter;
-    var $end = $pos.node(0).resolve($pos.pos + node.nodeSize);
-    Selection.call(this, $pos, $end);
-    // :: Node The selected node.
-    this.node = node;
-  }
-
-  if ( Selection ) { NodeSelection.__proto__ = Selection; }
-  NodeSelection.prototype = Object.create( Selection && Selection.prototype );
-  NodeSelection.prototype.constructor = NodeSelection;
-
-  NodeSelection.prototype.map = function map (doc, mapping) {
-    var ref = mapping.mapResult(this.anchor);
-    var deleted = ref.deleted;
-    var pos = ref.pos;
-    var $pos = doc.resolve(pos);
-    if (deleted) { return Selection.near($pos) }
-    return new NodeSelection($pos)
-  };
-
-  NodeSelection.prototype.content = function content () {
-    return new dist.Slice(dist.Fragment.from(this.node), 0, 0)
-  };
-
-  NodeSelection.prototype.eq = function eq (other) {
-    return other instanceof NodeSelection && other.anchor == this.anchor
-  };
-
-  NodeSelection.prototype.toJSON = function toJSON () {
-    return {type: "node", anchor: this.anchor}
-  };
-
-  NodeSelection.prototype.getBookmark = function getBookmark () { return new NodeBookmark(this.anchor) };
-
-  NodeSelection.fromJSON = function fromJSON (doc, json) {
-    if (typeof json.anchor != "number")
-      { throw new RangeError("Invalid input for NodeSelection.fromJSON") }
-    return new NodeSelection(doc.resolve(json.anchor))
-  };
-
-  // :: (Node, number) → NodeSelection
-  // Create a node selection from non-resolved positions.
-  NodeSelection.create = function create (doc, from) {
-    return new this(doc.resolve(from))
-  };
-
-  // :: (Node) → bool
-  // Determines whether the given node may be selected as a node
-  // selection.
-  NodeSelection.isSelectable = function isSelectable (node) {
-    return !node.isText && node.type.spec.selectable !== false
-  };
-
-  return NodeSelection;
-}(Selection));
-
-NodeSelection.prototype.visible = false;
-
-Selection.jsonID("node", NodeSelection);
-
-var NodeBookmark = function NodeBookmark(anchor) {
-  this.anchor = anchor;
-};
-NodeBookmark.prototype.map = function map (mapping) {
-  var ref = mapping.mapResult(this.anchor);
-    var deleted = ref.deleted;
-    var pos = ref.pos;
-  return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos)
-};
-NodeBookmark.prototype.resolve = function resolve (doc) {
-  var $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;
-  if (node && NodeSelection.isSelectable(node)) { return new NodeSelection($pos) }
-  return Selection.near($pos)
-};
-
-// ::- A selection type that represents selecting the whole document
-// (which can not necessarily be expressed with a text selection, when
-// there are for example leaf block nodes at the start or end of the
-// document).
-var AllSelection = (function (Selection) {
-  function AllSelection(doc) {
-    Selection.call(this, doc.resolve(0), doc.resolve(doc.content.size));
-  }
-
-  if ( Selection ) { AllSelection.__proto__ = Selection; }
-  AllSelection.prototype = Object.create( Selection && Selection.prototype );
-  AllSelection.prototype.constructor = AllSelection;
-
-  AllSelection.prototype.toJSON = function toJSON () { return {type: "all"} };
-
-  AllSelection.fromJSON = function fromJSON (doc) { return new AllSelection(doc) };
-
-  AllSelection.prototype.map = function map (doc) { return new AllSelection(doc) };
-
-  AllSelection.prototype.eq = function eq (other) { return other instanceof AllSelection };
-
-  AllSelection.prototype.getBookmark = function getBookmark () { return AllBookmark };
-
-  return AllSelection;
-}(Selection));
-
-Selection.jsonID("all", AllSelection);
-
-var AllBookmark = {
-  map: function map() { return this },
-  resolve: function resolve(doc) { return new AllSelection(doc) }
-};
-
-// FIXME we'll need some awareness of text direction when scanning for selections
-
-// Try to find a selection inside the given node. `pos` points at the
-// position where the search starts. When `text` is true, only return
-// text selections.
-function findSelectionIn(doc, node, pos, index, dir, text) {
-  if (node.inlineContent) { return TextSelection.create(doc, pos) }
-  for (var i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {
-    var child = node.child(i);
-    if (!child.isAtom) {
-      var inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);
-      if (inner) { return inner }
-    } else if (!text && NodeSelection.isSelectable(child)) {
-      return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0))
-    }
-    pos += child.nodeSize * dir;
-  }
-}
-
-function selectionToInsertionEnd(tr, startLen, bias) {
-  var last = tr.steps.length - 1;
-  if (last < startLen) { return }
-  var step = tr.steps[last];
-  if (!(step instanceof dist$1.ReplaceStep || step instanceof dist$1.ReplaceAroundStep)) { return }
-  var map = tr.mapping.maps[last], end;
-  map.forEach(function (_from, _to, _newFrom, newTo) { if (end == null) { end = newTo; } });
-  tr.setSelection(Selection.near(tr.doc.resolve(end), bias));
-}
-
-var UPDATED_SEL = 1;
-var UPDATED_MARKS = 2;
-var UPDATED_SCROLL = 4;
-
-// ::- An editor state transaction, which can be applied to a state to
-// create an updated state. Use
-// [`EditorState.tr`](#state.EditorState.tr) to create an instance.
-//
-// Transactions track changes to the document (they are a subclass of
-// [`Transform`](#transform.Transform)), but also other state changes,
-// like selection updates and adjustments of the set of [stored
-// marks](#state.EditorState.storedMarks). In addition, you can store
-// metadata properties in a transaction, which are extra pieces of
-// information that client code or plugins can use to describe what a
-// transacion represents, so that they can update their [own
-// state](#state.StateField) accordingly.
-//
-// The [editor view](#view.EditorView) uses a few metadata properties:
-// it will attach a property `"pointer"` with the value `true` to
-// selection transactions directly caused by mouse or touch input, and
-// a `"uiEvent"` property of that may be `"paste"`, `"cut"`, or `"drop"`.
-var Transaction = (function (Transform$$1) {
-  function Transaction(state) {
-    Transform$$1.call(this, state.doc);
-    // :: number
-    // The timestamp associated with this transaction, in the same
-    // format as `Date.now()`.
-    this.time = Date.now();
-    this.curSelection = state.selection;
-    // The step count for which the current selection is valid.
-    this.curSelectionFor = 0;
-    // :: ?[Mark]
-    // The stored marks set by this transaction, if any.
-    this.storedMarks = state.storedMarks;
-    // Bitfield to track which aspects of the state were updated by
-    // this transaction.
-    this.updated = 0;
-    // Object used to store metadata properties for the transaction.
-    this.meta = Object.create(null);
-  }
-
-  if ( Transform$$1 ) { Transaction.__proto__ = Transform$$1; }
-  Transaction.prototype = Object.create( Transform$$1 && Transform$$1.prototype );
-  Transaction.prototype.constructor = Transaction;
-
-  var prototypeAccessors = { selection: {},selectionSet: {},storedMarksSet: {},isGeneric: {},scrolledIntoView: {} };
-
-  // :: Selection
-  // The transaction's current selection. This defaults to the editor
-  // selection [mapped](#state.Selection.map) through the steps in the
-  // transaction, but can be overwritten with
-  // [`setSelection`](#state.Transaction.setSelection).
-  prototypeAccessors.selection.get = function () {
-    if (this.curSelectionFor < this.steps.length) {
-      this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));
-      this.curSelectionFor = this.steps.length;
-    }
-    return this.curSelection
-  };
-
-  // :: (Selection) → Transaction
-  // Update the transaction's current selection. Will determine the
-  // selection that the editor gets when the transaction is applied.
-  Transaction.prototype.setSelection = function setSelection (selection) {
-    this.curSelection = selection;
-    this.curSelectionFor = this.steps.length;
-    this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;
-    this.storedMarks = null;
-    return this
-  };
-
-  // :: bool
-  // Whether the selection was explicitly updated by this transaction.
-  prototypeAccessors.selectionSet.get = function () {
-    return (this.updated & UPDATED_SEL) > 0
-  };
-
-  // :: (?[Mark]) → Transaction
-  // Set the current stored marks.
-  Transaction.prototype.setStoredMarks = function setStoredMarks (marks) {
-    this.storedMarks = marks;
-    this.updated |= UPDATED_MARKS;
-    return this
-  };
-
-  // :: ([Mark]) → Transaction
-  // Make sure the current stored marks or, if that is null, the marks
-  // at the selection, match the given set of marks. Does nothing if
-  // this is already the case.
-  Transaction.prototype.ensureMarks = function ensureMarks (marks) {
-    if (!dist.Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))
-      { this.setStoredMarks(marks); }
-    return this
-  };
-
-  // :: (Mark) → Transaction
-  // Add a mark to the set of stored marks.
-  Transaction.prototype.addStoredMark = function addStoredMark (mark) {
-    return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()))
-  };
-
-  // :: (union<Mark, MarkType>) → Transaction
-  // Remove a mark or mark type from the set of stored marks.
-  Transaction.prototype.removeStoredMark = function removeStoredMark (mark) {
-    return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()))
-  };
-
-  // :: bool
-  // Whether the stored marks were explicitly set for this transaction.
-  prototypeAccessors.storedMarksSet.get = function () {
-    return (this.updated & UPDATED_MARKS) > 0
-  };
-
-  Transaction.prototype.addStep = function addStep (step, doc) {
-    Transform$$1.prototype.addStep.call(this, step, doc);
-    this.updated = this.updated & ~UPDATED_MARKS;
-    this.storedMarks = null;
-  };
-
-  // :: (number) → Transaction
-  // Update the timestamp for the transaction.
-  Transaction.prototype.setTime = function setTime (time) {
-    this.time = time;
-    return this
-  };
-
-  // :: (Slice) → Transaction
-  // Replace the current selection with the given slice.
-  Transaction.prototype.replaceSelection = function replaceSelection (slice) {
-    this.selection.replace(this, slice);
-    return this
-  };
-
-  // :: (Node, ?bool) → Transaction
-  // Replace the selection with the given node. When `inheritMarks` is
-  // true and the content is inline, it inherits the marks from the
-  // place where it is inserted.
-  Transaction.prototype.replaceSelectionWith = function replaceSelectionWith (node, inheritMarks) {
-    var selection = this.selection;
-    if (inheritMarks !== false)
-      { node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || dist.Mark.none))); }
-    selection.replaceWith(this, node);
-    return this
-  };
-
-  // :: () → Transaction
-  // Delete the selection.
-  Transaction.prototype.deleteSelection = function deleteSelection () {
-    this.selection.replace(this);
-    return this
-  };
-
-  // :: (string, from: ?number, to: ?number) → Transaction
-  // Replace the given range, or the selection if no range is given,
-  // with a text node containing the given string.
-  Transaction.prototype.insertText = function insertText (text, from, to) {
-    if ( to === void 0 ) { to = from; }
-
-    var schema = this.doc.type.schema;
-    if (from == null) {
-      if (!text) { return this.deleteSelection() }
-      return this.replaceSelectionWith(schema.text(text), true)
-    } else {
-      if (!text) { return this.deleteRange(from, to) }
-      var marks = this.storedMarks;
-      if (!marks) {
-        var $from = this.doc.resolve(from);
-        marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));
-      }
-      return this.replaceRangeWith(from, to, schema.text(text, marks))
-    }
-  };
-
-  // :: (union<string, Plugin, PluginKey>, any) → Transaction
-  // Store a metadata property in this transaction, keyed either by
-  // name or by plugin.
-  Transaction.prototype.setMeta = function setMeta (key, value) {
-    this.meta[typeof key == "string" ? key : key.key] = value;
-    return this
-  };
-
-  // :: (union<string, Plugin, PluginKey>) → any
-  // Retrieve a metadata property for a given name or plugin.
-  Transaction.prototype.getMeta = function getMeta (key) {
-    return this.meta[typeof key == "string" ? key : key.key]
-  };
-
-  // :: bool
-  // Returns true if this transaction doesn't contain any metadata,
-  // and can thus safely be extended.
-  prototypeAccessors.isGeneric.get = function () {
-    var this$1 = this;
-
-    for (var _ in this$1.meta) { return false }
-    return true
-  };
-
-  // :: () → Transaction
-  // Indicate that the editor should scroll the selection into view
-  // when updated to the state produced by this transaction.
-  Transaction.prototype.scrollIntoView = function scrollIntoView () {
-    this.updated |= UPDATED_SCROLL;
-    return this
-  };
-
-  prototypeAccessors.scrolledIntoView.get = function () {
-    return (this.updated & UPDATED_SCROLL) > 0
-  };
-
-  Object.defineProperties( Transaction.prototype, prototypeAccessors );
-
-  return Transaction;
-}(dist$1.Transform));
-
-function bind(f, self) {
-  return !self || !f ? f : f.bind(self)
-}
-
-var FieldDesc = function FieldDesc(name, desc, self) {
-  this.name = name;
-  this.init = bind(desc.init, self);
-  this.apply = bind(desc.apply, self);
-};
-
-var baseFields = [
-  new FieldDesc("doc", {
-    init: function init(config) { return config.doc || config.schema.topNodeType.createAndFill() },
-    apply: function apply(tr) { return tr.doc }
-  }),
-
-  new FieldDesc("selection", {
-    init: function init(config, instance) { return config.selection || Selection.atStart(instance.doc) },
-    apply: function apply(tr) { return tr.selection }
-  }),
-
-  new FieldDesc("storedMarks", {
-    init: function init(config) { return config.storedMarks || null },
-    apply: function apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }
-  }),
-
-  new FieldDesc("scrollToSelection", {
-    init: function init() { return 0 },
-    apply: function apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev }
-  })
-];
-
-// Object wrapping the part of a state object that stays the same
-// across transactions. Stored in the state's `config` property.
-var Configuration = function Configuration(schema, plugins) {
-  var this$1 = this;
-
-  this.schema = schema;
-  this.fields = baseFields.concat();
-  this.plugins = [];
-  this.pluginsByKey = Object.create(null);
-  if (plugins) { plugins.forEach(function (plugin) {
-    if (this$1.pluginsByKey[plugin.key])
-      { throw new RangeError("Adding different instances of a keyed plugin (" + plugin.key + ")") }
-    this$1.plugins.push(plugin);
-    this$1.pluginsByKey[plugin.key] = plugin;
-    if (plugin.spec.state)
-      { this$1.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin)); }
-  }); }
-};
-
-// ::- The state of a ProseMirror editor is represented by an object
-// of this type. A state is a persistent data structure—it isn't
-// updated, but rather a new state value is computed from an old one
-// using the [`apply`](#state.EditorState.apply) method.
-//
-// A state holds a number of built-in fields, and plugins can
-// [define](#state.PluginSpec.state) additional fields.
-var EditorState = function EditorState(config) {
-  this.config = config;
-};
-
-var prototypeAccessors$1 = { schema: {},plugins: {},tr: {} };
-
-// doc:: Node
-// The current document.
-
-// selection:: Selection
-// The selection.
-
-// storedMarks:: ?[Mark]
-// A set of marks to apply to the next input. Will be null when
-// no explicit marks have been set.
-
-// :: Schema
-// The schema of the state's document.
-prototypeAccessors$1.schema.get = function () {
-  return this.config.schema
-};
-
-// :: [Plugin]
-// The plugins that are active in this state.
-prototypeAccessors$1.plugins.get = function () {
-  return this.config.plugins
-};
-
-// :: (Transaction) → EditorState
-// Apply the given transaction to produce a new state.
-EditorState.prototype.apply = function apply (tr) {
-  return this.applyTransaction(tr).state
-};
-
-// : (Transaction) → ?Transaction
-EditorState.prototype.filterTransaction = function filterTransaction (tr, ignore) {
-    var this$1 = this;
-    if ( ignore === void 0 ) { ignore = -1; }
-
-  for (var i = 0; i < this.config.plugins.length; i++) { if (i != ignore) {
-    var plugin = this$1.config.plugins[i];
-    if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this$1))
-      { return false }
-  } }
-  return true
-};
-
-// :: (Transaction) → {state: EditorState, transactions: [Transaction]}
-// Verbose variant of [`apply`](#state.EditorState.apply) that
-// returns the precise transactions that were applied (which might
-// be influenced by the [transaction
-// hooks](#state.PluginSpec.filterTransaction) of
-// plugins) along with the new state.
-EditorState.prototype.applyTransaction = function applyTransaction (rootTr) {
-    var this$1 = this;
-
-  if (!this.filterTransaction(rootTr)) { return {state: this, transactions: []} }
-
-  var trs = [rootTr], newState = this.applyInner(rootTr), seen = null;
-  // This loop repeatedly gives plugins a chance to respond to
-  // transactions as new transactions are added, making sure to only
-  // pass the transactions the plugin did not see before.
-  outer: for (;;) {
-    var haveNew = false;
-    for (var i = 0; i < this.config.plugins.length; i++) {
-      var plugin = this$1.config.plugins[i];
-      if (plugin.spec.appendTransaction) {
-        var n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this$1;
-        var tr = n < trs.length &&
-            plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);
-        if (tr && newState.filterTransaction(tr, i)) {
-          tr.setMeta("appendedTransaction", rootTr);
-          if (!seen) {
-            seen = [];
-            for (var j = 0; j < this.config.plugins.length; j++)
-              { seen.push(j < i ? {state: newState, n: trs.length} : {state: this$1, n: 0}); }
-          }
-          trs.push(tr);
-          newState = newState.applyInner(tr);
-          haveNew = true;
-        }
-        if (seen) { seen[i] = {state: newState, n: trs.length}; }
-      }
-    }
-    if (!haveNew) { return {state: newState, transactions: trs} }
-  }
-};
-
-// : (Transaction) → EditorState
-EditorState.prototype.applyInner = function applyInner (tr) {
-    var this$1 = this;
-
-  if (!tr.before.eq(this.doc)) { throw new RangeError("Applying a mismatched transaction") }
-  var newInstance = new EditorState(this.config), fields = this.config.fields;
-  for (var i = 0; i < fields.length; i++) {
-    var field = fields[i];
-    newInstance[field.name] = field.apply(tr, this$1[field.name], this$1, newInstance);
-  }
-  for (var i$1 = 0; i$1 < applyListeners.length; i$1++) { applyListeners[i$1](this$1, tr, newInstance); }
-  return newInstance
-};
-
-// :: Transaction
-// Start a [transaction](#state.Transaction) from this state.
-prototypeAccessors$1.tr.get = function () { return new Transaction(this) };
-
-// :: (Object) → EditorState
-// Create a new state.
-//
-// config::- Configuration options. Must contain `schema` or `doc` (or both).
-//
-//    schema:: ?Schema
-//    The schema to use.
-//
-//    doc:: ?Node
-//    The starting document.
-//
-//    selection:: ?Selection
-//    A valid selection in the document.
-//
-//    storedMarks:: ?[Mark]
-//    The initial set of [stored marks](#state.EditorState.storedMarks).
-//
-//    plugins:: ?[Plugin]
-//    The plugins that should be active in this state.
-EditorState.create = function create (config) {
-  var $config = new Configuration(config.schema || config.doc.type.schema, config.plugins);
-  var instance = new EditorState($config);
-  for (var i = 0; i < $config.fields.length; i++)
-    { instance[$config.fields[i].name] = $config.fields[i].init(config, instance); }
-  return instance
-};
-
-// :: (Object) → EditorState
-// Create a new state based on this one, but with an adjusted set of
-// active plugins. State fields that exist in both sets of plugins
-// are kept unchanged. Those that no longer exist are dropped, and
-// those that are new are initialized using their
-// [`init`](#state.StateField.init) method, passing in the new
-// configuration object..
-//
-// config::- configuration options
-//
-//   schema:: ?Schema
-//   New schema to use.
-//
-//   plugins:: ?[Plugin]
-//   New set of active plugins.
-EditorState.prototype.reconfigure = function reconfigure (config) {
-    var this$1 = this;
-
-  var $config = new Configuration(config.schema || this.schema, config.plugins);
-  var fields = $config.fields, instance = new EditorState($config);
-  for (var i = 0; i < fields.length; i++) {
-    var name = fields[i].name;
-    instance[name] = this$1.hasOwnProperty(name) ? this$1[name] : fields[i].init(config, instance);
-  }
-  return instance
-};
-
-// :: (?union<Object<Plugin>, string, number>) → Object
-// Serialize this state to JSON. If you want to serialize the state
-// of plugins, pass an object mapping property names to use in the
-// resulting JSON object to plugin objects. The argument may also be
-// a string or number, in which case it is ignored, to support the
-// way `JSON.stringify` calls `toString` methods.
-EditorState.prototype.toJSON = function toJSON (pluginFields) {
-    var this$1 = this;
-
-  var result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()};
-  if (this.storedMarks) { result.storedMarks = this.storedMarks.map(function (m) { return m.toJSON(); }); }
-  if (pluginFields && typeof pluginFields == 'object') { for (var prop in pluginFields) {
-    if (prop == "doc" || prop == "selection")
-      { throw new RangeError("The JSON fields `doc` and `selection` are reserved") }
-    var plugin = pluginFields[prop], state = plugin.spec.state;
-    if (state && state.toJSON) { result[prop] = state.toJSON.call(plugin, this$1[plugin.key]); }
-  } }
-  return result
-};
-
-// :: (Object, Object, ?Object<Plugin>) → EditorState
-// Deserialize a JSON representation of a state. `config` should
-// have at least a `schema` field, and should contain array of
-// plugins to initialize the state with. `pluginFields` can be used
-// to deserialize the state of plugins, by associating plugin
-// instances with the property names they use in the JSON object.
-//
-// config::- configuration options
-//
-//   schema:: Schema
-//   The schema to use.
-//
-//   plugins:: ?[Plugin]
-//   The set of active plugins.
-EditorState.fromJSON = function fromJSON (config, json, pluginFields) {
-  if (!json) { throw new RangeError("Invalid input for EditorState.fromJSON") }
-  if (!config.schema) { throw new RangeError("Required config field 'schema' missing") }
-  var $config = new Configuration(config.schema, config.plugins);
-  var instance = new EditorState($config);
-  $config.fields.forEach(function (field) {
-    if (field.name == "doc") {
-      instance.doc = dist.Node.fromJSON(config.schema, json.doc);
-    } else if (field.name == "selection") {
-      instance.selection = Selection.fromJSON(instance.doc, json.selection);
-    } else if (field.name == "storedMarks") {
-      if (json.storedMarks) { instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON); }
-    } else {
-      if (pluginFields) { for (var prop in pluginFields) {
-        var plugin = pluginFields[prop], state = plugin.spec.state;
-        if (plugin.key == field.name && state && state.fromJSON &&
-            Object.prototype.hasOwnProperty.call(json, prop)) {
-          // This field belongs to a plugin mapped to a JSON field, read it from there.
-          instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);
-          return
-        }
-      } }
-      instance[field.name] = field.init(config, instance);
-    }
-  });
-  return instance
-};
-
-// Kludge to allow the view to track mappings between different
-// instances of a state.
-EditorState.addApplyListener = function addApplyListener (f) {
-  applyListeners.push(f);
-};
-EditorState.removeApplyListener = function removeApplyListener (f) {
-  var found = applyListeners.indexOf(f);
-  if (found > -1) { applyListeners.splice(found, 1); }
-};
-
-Object.defineProperties( EditorState.prototype, prototypeAccessors$1 );
-
-var applyListeners = [];
-
-// PluginSpec:: interface
-//
-// This is the type passed to the [`Plugin`](#state.Plugin)
-// constructor. It provides a definition for a plugin.
-//
-//   props:: ?EditorProps
-//   The [view props](#view.EditorProps) added by this plugin. Props
-//   that are functions will be bound to have the plugin instance as
-//   their `this` binding.
-//
-//   state:: ?StateField<any>
-//   Allows a plugin to define a [state field](#state.StateField), an
-//   extra slot in the state object in which it can keep its own data.
-//
-//   key:: ?PluginKey
-//   Can be used to make this a keyed plugin. You can have only one
-//   plugin with a given key in a given state, but it is possible to
-//   access the plugin's configuration and state through the key,
-//   without having access to the plugin instance object.
-//
-//   view:: ?(EditorView) → Object
-//   When the plugin needs to interact with the editor view, or
-//   set something up in the DOM, use this field. The function
-//   will be called when the plugin's state is associated with an
-//   editor view.
-//
-//     return::-
-//     Should return an object with the following optional
-//     properties:
-//
-//       update:: ?(view: EditorView, prevState: EditorState)
-//       Called whenever the view's state is updated.
-//
-//       destroy:: ?()
-//       Called when the view is destroyed or receives a state
-//       with different plugins.
-//
-//   filterTransaction:: ?(Transaction, EditorState) → bool
-//   When present, this will be called before a transaction is
-//   applied by the state, allowing the plugin to cancel it (by
-//   returning false).
-//
-//   appendTransaction:: ?(transactions: [Transaction], oldState: EditorState, newState: EditorState) → ?Transaction
-//   Allows the plugin to append another transaction to be applied
-//   after the given array of transactions. When another plugin
-//   appends a transaction after this was called, it is called again
-//   with the new state and new transactions—but only the new
-//   transactions, i.e. it won't be passed transactions that it
-//   already saw.
-
-function bindProps(obj, self, target) {
-  for (var prop in obj) {
-    var val = obj[prop];
-    if (val instanceof Function) { val = val.bind(self); }
-    else if (prop == "handleDOMEvents") { val = bindProps(val, self, {}); }
-    target[prop] = val;
-  }
-  return target
-}
-
-// ::- Plugins bundle functionality that can be added to an editor.
-// They are part of the [editor state](#state.EditorState) and
-// may influence that state and the view that contains it.
-var Plugin = function Plugin(spec) {
-  // :: EditorProps
-  // The [props](#view.EditorProps) exported by this plugin.
-  this.props = {};
-  if (spec.props) { bindProps(spec.props, this, this.props); }
-  // :: Object
-  // The plugin's [spec object](#state.PluginSpec).
-  this.spec = spec;
-  this.key = spec.key ? spec.key.key : createKey("plugin");
-};
-
-// :: (EditorState) → any
-// Extract the plugin's state field from an editor state.
-Plugin.prototype.getState = function getState (state) { return state[this.key] };
-
-// StateField:: interface<T>
-// A plugin spec may provide a state field (under its
-// [`state`](#state.PluginSpec.state) property) of this type, which
-// describes the state it wants to keep. Functions provided here are
-// always called with the plugin instance as their `this` binding.
-//
-//   init:: (config: Object, instance: EditorState) → T
-//   Initialize the value of the field. `config` will be the object
-//   passed to [`EditorState.create`](#state.EditorState^create). Note
-//   that `instance` is a half-initialized state instance, and will
-//   not have values for plugin fields initialized after this one.
-//
-//   apply:: (tr: Transaction, value: T, oldState: EditorState, newState: EditorState) → T
-//   Apply the given transaction to this state field, producing a new
-//   field value. Note that the `newState` argument is again a partially
-//   constructed state does not yet contain the state from plugins
-//   coming after this one.
-//
-//   toJSON:: ?(value: T) → *
-//   Convert this field to JSON. Optional, can be left off to disable
-//   JSON serialization for the field.
-//
-//   fromJSON:: ?(config: Object, value: *, state: EditorState) → T
-//   Deserialize the JSON representation of this field. Note that the
-//   `state` argument is again a half-initialized state.
-
-var keys = Object.create(null);
-
-function createKey(name) {
-  if (name in keys) { return name + "$" + ++keys[name] }
-  keys[name] = 0;
-  return name + "$"
-}
-
-// ::- A key is used to [tag](#state.PluginSpec.key)
-// plugins in a way that makes it possible to find them, given an
-// editor state. Assigning a key does mean only one plugin of that
-// type can be active in a state.
-var PluginKey = function PluginKey(name) {
-if ( name === void 0 ) { name = "key"; }
- this.key = createKey(name); };
-
-// :: (EditorState) → ?Plugin
-// Get the active plugin with this key, if any, from an editor
-// state.
-PluginKey.prototype.get = function get (state) { return state.config.pluginsByKey[this.key] };
-
-// :: (EditorState) → ?any
-// Get the plugin's state from an editor state.
-PluginKey.prototype.getState = function getState (state) { return state[this.key] };
-
-exports.Selection = Selection;
-exports.SelectionRange = SelectionRange;
-exports.TextSelection = TextSelection;
-exports.NodeSelection = NodeSelection;
-exports.AllSelection = AllSelection;
-exports.Transaction = Transaction;
-exports.EditorState = EditorState;
-exports.Plugin = Plugin;
-exports.PluginKey = PluginKey;
-
-});
-
-unwrapExports(dist$2);
-var dist_1$2 = dist$2.Selection;
-var dist_2$2 = dist$2.SelectionRange;
-var dist_3$2 = dist$2.TextSelection;
-var dist_4$2 = dist$2.NodeSelection;
-var dist_5$2 = dist$2.AllSelection;
-var dist_6$2 = dist$2.Transaction;
-var dist_7$2 = dist$2.EditorState;
-var dist_8$2 = dist$2.Plugin;
-var dist_9$2 = dist$2.PluginKey;
-
-var dist$3 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-var result = {};
-if (typeof navigator != "undefined" && typeof document != "undefined") {
-  var ie_edge = /Edge\/(\d+)/.exec(navigator.userAgent);
-  var ie_upto10 = /MSIE \d/.test(navigator.userAgent);
-  var ie_11up = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);
-
-  result.mac = /Mac/.test(navigator.platform);
-  var ie = result.ie = !!(ie_upto10 || ie_11up || ie_edge);
-  result.ie_version = ie_upto10 ? document.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : null;
-  result.gecko = !ie && /gecko\/(\d+)/i.test(navigator.userAgent);
-  result.gecko_version = result.gecko && +(/Firefox\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1];
-  var chrome = !ie && /Chrome\/(\d+)/.exec(navigator.userAgent);
-  result.chrome = !!chrome;
-  result.chrome_version = chrome && +chrome[1];
-  result.ios = !ie && /AppleWebKit/.test(navigator.userAgent) && /Mobile\/\w+/.test(navigator.userAgent);
-  result.android = /Android \d/.test(navigator.userAgent);
-  result.webkit = !ie && 'WebkitAppearance' in document.documentElement.style;
-  result.safari = /Apple Computer/.test(navigator.vendor);
-  result.webkit_version = result.webkit && +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1];
-}
-
-var domIndex = function(node) {
-  for (var index = 0;; index++) {
-    node = node.previousSibling;
-    if (!node) { return index }
-  }
-};
-
-var parentNode = function(node) {
-  var parent = node.parentNode;
-  return parent && parent.nodeType == 11 ? parent.host : parent
-};
-
-var textRange = function(node, from, to) {
-  var range = document.createRange();
-  range.setEnd(node, to == null ? node.nodeValue.length : to);
-  range.setStart(node, from || 0);
-  return range
-};
-
-// Scans forward and backward through DOM positions equivalent to the
-// given one to see if the two are in the same place (i.e. after a
-// text node vs at the end of that text node)
-var isEquivalentPosition = function(node, off, targetNode, targetOff) {
-  return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||
-                        scanFor(node, off, targetNode, targetOff, 1))
-};
-
-var atomElements = /^(img|br|input|textarea|hr)$/i;
-
-function scanFor(node, off, targetNode, targetOff, dir) {
-  for (;;) {
-    if (node == targetNode && off == targetOff) { return true }
-    if (off == (dir < 0 ? 0 : nodeSize(node)) || node.nodeType == 3 && node.nodeValue == "\ufeff") {
-      var parent = node.parentNode;
-      if (parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName)) { return false }
-      off = domIndex(node) + (dir < 0 ? 0 : 1);
-      node = parent;
-    } else if (node.nodeType == 1) {
-      node = node.childNodes[off + (dir < 0 ? -1 : 0)];
-      off = dir < 0 ? nodeSize(node) : 0;
-    } else {
-      return false
-    }
-  }
-}
-
-function nodeSize(node) {
-  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length
-}
-
-function hasBlockDesc(dom) {
-  var desc = dom.pmViewDesc;
-  return desc && desc.node && desc.node.isBlock
-}
-
-// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523
-// (isCollapsed inappropriately returns true in shadow dom)
-var selectionCollapsed = function(domSel) {
-  var collapsed = domSel.isCollapsed;
-  if (collapsed && result.chrome && domSel.rangeCount && !domSel.getRangeAt(0).collapsed)
-    { collapsed = false; }
-  return collapsed
-};
-
-function windowRect(win) {
-  return {left: 0, right: win.innerWidth,
-          top: 0, bottom: win.innerHeight}
-}
-
-function scrollRectIntoView(view, rect) {
-  var scrollThreshold = view.someProp("scrollThreshold") || 0, scrollMargin = view.someProp("scrollMargin");
-  var doc = view.dom.ownerDocument, win = doc.defaultView;
-  if (scrollMargin == null) { scrollMargin = 5; }
-  for (var parent = view.dom;; parent = parentNode(parent)) {
-    if (!parent) { break }
-    var atTop = parent == doc.body || parent.nodeType != 1;
-    var bounding = atTop ? windowRect(win) : parent.getBoundingClientRect();
-    var moveX = 0, moveY = 0;
-    if (rect.top < bounding.top + scrollThreshold)
-      { moveY = -(bounding.top - rect.top + scrollMargin); }
-    else if (rect.bottom > bounding.bottom - scrollThreshold)
-      { moveY = rect.bottom - bounding.bottom + scrollMargin; }
-    if (rect.left < bounding.left + scrollThreshold)
-      { moveX = -(bounding.left - rect.left + scrollMargin); }
-    else if (rect.right > bounding.right - scrollThreshold)
-      { moveX = rect.right - bounding.right + scrollMargin; }
-    if (moveX || moveY) {
-      if (atTop) {
-        win.scrollBy(moveX, moveY);
-      } else {
-        if (moveY) { parent.scrollTop += moveY; }
-        if (moveX) { parent.scrollLeft += moveX; }
-      }
-    }
-    if (atTop) { break }
-  }
-}
-
-// Store the scroll position of the editor's parent nodes, along with
-// the top position of an element near the top of the editor, which
-// will be used to make sure the visible viewport remains stable even
-// when the size of the content above changes.
-function storeScrollPos(view) {
-  var rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top);
-  var doc = view.dom.ownerDocument;
-  var refDOM, refTop;
-  for (var x = (rect.left + rect.right) / 2, y = startY + 1;
-       y < Math.min(innerHeight, rect.bottom); y += 5) {
-    var dom = view.root.elementFromPoint(x, y);
-    if (dom == view.dom || !view.dom.contains(dom)) { continue }
-    var localRect = dom.getBoundingClientRect();
-    if (localRect.top >= startY - 20) {
-      refDOM = dom;
-      refTop = localRect.top;
-      break
-    }
-  }
-  var stack = [];
-  for (var dom$1 = view.dom; dom$1; dom$1 = parentNode(dom$1)) {
-    stack.push({dom: dom$1, top: dom$1.scrollTop, left: dom$1.scrollLeft});
-    if (dom$1 == doc.body) { break }
-  }
-  return {refDOM: refDOM, refTop: refTop, stack: stack}
-}
-
-// Reset the scroll position of the editor's parent nodes to that what
-// it was before, when storeScrollPos was called.
-function resetScrollPos(ref) {
-  var refDOM = ref.refDOM;
-  var refTop = ref.refTop;
-  var stack = ref.stack;
-
-  var newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;
-  var dTop = newRefTop == 0 ? 0 : newRefTop - refTop;
-  for (var i = 0; i < stack.length; i++) {
-    var ref$1 = stack[i];
-    var dom = ref$1.dom;
-    var top = ref$1.top;
-    var left = ref$1.left;
-    if (dom.scrollTop != top + dTop) { dom.scrollTop = top + dTop; }
-    if (dom.scrollLeft != left) { dom.scrollLeft = left; }
-  }
-}
-
-function findOffsetInNode(node, coords) {
-  var closest, dxClosest = 2e8, coordsClosest, offset = 0;
-  var rowBot = coords.top, rowTop = coords.top;
-  for (var child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {
-    var rects = (void 0);
-    if (child.nodeType == 1) { rects = child.getClientRects(); }
-    else if (child.nodeType == 3) { rects = textRange(child).getClientRects(); }
-    else { continue }
-
-    for (var i = 0; i < rects.length; i++) {
-      var rect = rects[i];
-      if (rect.top <= rowBot && rect.bottom >= rowTop) {
-        rowBot = Math.max(rect.bottom, rowBot);
-        rowTop = Math.min(rect.top, rowTop);
-        var dx = rect.left > coords.left ? rect.left - coords.left
-            : rect.right < coords.left ? coords.left - rect.right : 0;
-        if (dx < dxClosest) {
-          closest = child;
-          dxClosest = dx;
-          coordsClosest = dx && closest.nodeType == 3 ? {left: rect.right < coords.left ? rect.right : rect.left, top: coords.top} : coords;
-          if (child.nodeType == 1 && dx)
-            { offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0); }
-          continue
-        }
-      }
-      if (!closest && (coords.left >= rect.right && coords.top >= rect.top ||
-                       coords.left >= rect.left && coords.top >= rect.bottom))
-        { offset = childIndex + 1; }
-    }
-  }
-  if (closest && closest.nodeType == 3) { return findOffsetInText(closest, coordsClosest) }
-  if (!closest || (dxClosest && closest.nodeType == 1)) { return {node: node, offset: offset} }
-  return findOffsetInNode(closest, coordsClosest)
-}
-
-function findOffsetInText(node, coords) {
-  var len = node.nodeValue.length;
-  var range = document.createRange();
-  for (var i = 0; i < len; i++) {
-    range.setEnd(node, i + 1);
-    range.setStart(node, i);
-    var rect = singleRect(range, 1);
-    if (rect.top == rect.bottom) { continue }
-    if (rect.left - 1 <= coords.left && rect.right + 1 >= coords.left &&
-        rect.top - 1 <= coords.top && rect.bottom + 1 >= coords.top)
-      { return {node: node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0)} }
-  }
-  return {node: node, offset: 0}
-}
-
-function targetKludge(dom, coords) {
-  var parent = dom.parentNode;
-  if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left)
-    { return parent }
-  return dom
-}
-
-function posFromElement(view, elt, coords) {
-  if (!view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) { return null }
-
-  var ref = findOffsetInNode(elt, coords);
-  var node = ref.node;
-  var offset = ref.offset;
-  var bias = -1;
-  if (node.nodeType == 1 && !node.firstChild) {
-    var rect = node.getBoundingClientRect();
-    bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1;
-  }
-  return view.docView.posFromDOM(node, offset, bias)
-}
-
-function posFromCaret(view, node, offset, coords) {
-  // Browser (in caretPosition/RangeFromPoint) will agressively
-  // normalize towards nearby inline nodes. Since we are interested in
-  // positions between block nodes too, we first walk up the hierarchy
-  // of nodes to see if there are block nodes that the coordinates
-  // fall outside of. If so, we take the position before/after that
-  // block. If not, we call `posFromDOM` on the raw node/offset.
-  var outside = -1;
-  for (var cur = node;;) {
-    if (cur == view.dom) { break }
-    var desc = view.docView.nearestDesc(cur, true);
-    if (!desc) { return null }
-    if (desc.node.isBlock && desc.parent) {
-      var rect = desc.dom.getBoundingClientRect();
-      if (rect.left > coords.left || rect.top > coords.top) { outside = desc.posBefore; }
-      else if (rect.right < coords.left || rect.bottom < coords.top) { outside = desc.posAfter; }
-      else { break }
-    }
-    cur = desc.dom.parentNode;
-  }
-  return outside > -1 ? outside : view.docView.posFromDOM(node, offset)
-}
-
-// Given an x,y position on the editor, get the position in the document.
-function posAtCoords(view, coords) {
-  var root = view.root, node, offset;
-  if (root.caretPositionFromPoint) {
-    var pos$1 = root.caretPositionFromPoint(coords.left, coords.top);
-    if (pos$1) { var assign;
-      ((assign = pos$1, node = assign.offsetNode, offset = assign.offset)); }
-  }
-  if (!node && root.caretRangeFromPoint) {
-    var range = root.caretRangeFromPoint(coords.left, coords.top);
-    if (range) { var assign$1;
-      ((assign$1 = range, node = assign$1.startContainer, offset = assign$1.startOffset)); }
-  }
-
-  var elt = root.elementFromPoint(coords.left, coords.top + 1), pos;
-  if (!elt) { return null }
-  elt = targetKludge(elt, coords);
-  if (node) {
-    // Suspiciously specific kludge to work around caret*FromPoint
-    // never returning a position at the end of the document
-    if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 &&
-        coords.top > node.lastChild.getBoundingClientRect().bottom)
-      { pos = view.state.doc.content.size; }
-    // Ignore positions directly after a BR, since caret*FromPoint
-    // 'round up' positions that would be more accurately places
-    // before the BR node.
-    else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != "BR")
-      { pos = posFromCaret(view, node, offset, coords); }
-  }
-  if (pos == null) {
-    pos = posFromElement(view, elt, coords);
-    if (pos == null) { return null }
-  }
-
-  var desc = view.docView.nearestDesc(elt, true);
-  return {pos: pos, inside: desc ? desc.posAtStart - desc.border : -1}
-}
-
-function singleRect(object, bias) {
-  var rects = object.getClientRects();
-  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1]
-}
-
-// : (EditorView, number) → {left: number, top: number, right: number, bottom: number}
-// Given a position in the document model, get a bounding box of the
-// character at that position, relative to the window.
-function coordsAtPos(view, pos) {
-  var ref = view.docView.domFromPos(pos);
-  var node = ref.node;
-  var offset = ref.offset;
-  var side, rect;
-  if (node.nodeType == 3) {
-    if (offset < node.nodeValue.length) {
-      rect = singleRect(textRange(node, offset, offset + 1), -1);
-      side = "left";
-    }
-    if ((!rect || rect.left == rect.right) && offset) {
-      rect = singleRect(textRange(node, offset - 1, offset), 1);
-      side = "right";
-    }
-  } else if (node.firstChild) {
-    if (offset < node.childNodes.length) {
-      var child = node.childNodes[offset];
-      rect = singleRect(child.nodeType == 3 ? textRange(child) : child, -1);
-      side = "left";
-    }
-    if ((!rect || rect.top == rect.bottom) && offset) {
-      var child$1 = node.childNodes[offset - 1];
-      rect = singleRect(child$1.nodeType == 3 ? textRange(child$1) : child$1, 1);
-      side = "right";
-    }
-  } else {
-    rect = node.getBoundingClientRect();
-    side = "left";
-  }
-  var x = rect[side];
-  return {top: rect.top, bottom: rect.bottom, left: x, right: x}
-}
-
-function withFlushedState(view, state, f) {
-  var viewState = view.state, active = view.root.activeElement;
-  if (viewState != state || !view.inDOMChange) { view.updateState(state); }
-  if (active != view.dom) { view.focus(); }
-  try {
-    return f()
-  } finally {
-    if (viewState != state) { view.updateState(viewState); }
-    if (active != view.dom) { active.focus(); }
-  }
-}
-
-// : (EditorView, number, number)
-// Whether vertical position motion in a given direction
-// from a position would leave a text block.
-function endOfTextblockVertical(view, state, dir) {
-  var sel = state.selection;
-  var $pos = dir == "up" ? sel.$anchor.min(sel.$head) : sel.$anchor.max(sel.$head);
-  if (!$pos.depth) { return false }
-  return withFlushedState(view, state, function () {
-    var dom = view.docView.domAfterPos($pos.before());
-    var coords = coordsAtPos(view, $pos.pos);
-    for (var child = dom.firstChild; child; child = child.nextSibling) {
-      var boxes = (void 0);
-      if (child.nodeType == 1) { boxes = child.getClientRects(); }
-      else if (child.nodeType == 3) { boxes = textRange(child, 0, child.nodeValue.length).getClientRects(); }
-      else { continue }
-      for (var i = 0; i < boxes.length; i++) {
-        var box = boxes[i];
-        if (box.bottom > box.top && (dir == "up" ? box.bottom < coords.top + 1 : box.top > coords.bottom - 1))
-          { return false }
-      }
-    }
-    return true
-  })
-}
-
-var maybeRTL = /[\u0590-\u08ac]/;
-
-function endOfTextblockHorizontal(view, state, dir) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  if (!$head.parent.isTextblock || !$head.depth) { return false }
-  var offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size;
-  var sel = getSelection();
-  // If the textblock is all LTR, or the browser doesn't support
-  // Selection.modify (Edge), fall back to a primitive approach
-  if (!maybeRTL.test($head.parent.textContent) || !sel.modify)
-    { return dir == "left" || dir == "backward" ? atStart : atEnd }
-
-  return withFlushedState(view, state, function () {
-    // This is a huge hack, but appears to be the best we can
-    // currently do: use `Selection.modify` to move the selection by
-    // one character, and see if that moves the cursor out of the
-    // textblock (or doesn't move it at all, when at the start/end of
-    // the document).
-    var oldRange = sel.getRangeAt(0), oldNode = sel.focusNode, oldOff = sel.focusOffset;
-    sel.modify("move", dir, "character");
-    var parentDOM = view.docView.domAfterPos($head.before());
-    var result = !parentDOM.contains(sel.focusNode.nodeType == 1 ? sel.focusNode : sel.focusNode.parentNode) ||
-        (oldNode == sel.focusNode && oldOff == sel.focusOffset);
-    // Restore the previous selection
-    sel.removeAllRanges();
-    sel.addRange(oldRange);
-    return result
-  })
-}
-
-var cachedState = null;
-var cachedDir = null;
-var cachedResult = false;
-function endOfTextblock(view, state, dir) {
-  if (cachedState == state && cachedDir == dir) { return cachedResult }
-  cachedState = state; cachedDir = dir;
-  return cachedResult = dir == "up" || dir == "down"
-    ? endOfTextblockVertical(view, state, dir)
-    : endOfTextblockHorizontal(view, state, dir)
-}
-
-// NodeView:: interface
-//
-// By default, document nodes are rendered using the result of the
-// [`toDOM`](#model.NodeSpec.toDOM) method of their spec, and managed
-// entirely by the editor. For some use cases, such as embedded
-// node-specific editing interfaces, you want more control over
-// the behavior of a node's in-editor representation, and need to
-// [define](#view.EditorProps.nodeViews) a custom node view.
-//
-// Objects returned as node views must conform to this interface.
-//
-//   dom:: ?dom.Node
-//   The outer DOM node that represents the document node. When not
-//   given, the default strategy is used to create a DOM node.
-//
-//   contentDOM:: ?dom.Node
-//   The DOM node that should hold the node's content. Only meaningful
-//   if the node view also defines a `dom` property and if its node
-//   type is not a leaf node type. When this is present, ProseMirror
-//   will take care of rendering the node's children into it. When it
-//   is not present, the node view itself is responsible for rendering
-//   (or deciding not to render) its child nodes.
-//
-//   update:: ?(node: Node, decorations: [Decoration]) → bool
-//   When given, this will be called when the view is updating itself.
-//   It will be given a node (possibly of a different type), and an
-//   array of active decorations (which are automatically drawn, and
-//   the node view may ignore if it isn't interested in them), and
-//   should return true if it was able to update to that node, and
-//   false otherwise. If the node view has a `contentDOM` property (or
-//   no `dom` property), updating its child nodes will be handled by
-//   ProseMirror.
-//
-//   selectNode:: ?()
-//   Can be used to override the way the node's selected status (as a
-//   node selection) is displayed.
-//
-//   deselectNode:: ?()
-//   When defining a `selectNode` method, you should also provide a
-//   `deselectNode` method to remove the effect again.
-//
-//   setSelection:: ?(anchor: number, head: number, root: dom.Document)
-//   This will be called to handle setting the selection inside the
-//   node. The `anchor` and `head` positions are relative to the start
-//   of the node. By default, a DOM selection will be created between
-//   the DOM positions corresponding to those positions, but if you
-//   override it you can do something else.
-//
-//   stopEvent:: ?(event: dom.Event) → bool
-//   Can be used to prevent the editor view from trying to handle some
-//   or all DOM events that bubble up from the node view. Events for
-//   which this returns true are not handled by the editor.
-//
-//   ignoreMutation:: ?(dom.MutationRecord) → bool
-//   Called when a DOM
-//   [mutation](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver)
-//   happens within the view. Return false if the editor should
-//   re-parse the range around the mutation, true if it can safely be
-//   ignored.
-//
-//   destroy:: ?()
-//   Called when the node view is removed from the editor or the whole
-//   editor is destroyed.
-
-// View descriptions are data structures that describe the DOM that is
-// used to represent the editor's content. They are used for:
-//
-// - Incremental redrawing when the document changes
-//
-// - Figuring out what part of the document a given DOM position
-//   corresponds to
-//
-// - Wiring in custom implementations of the editing interface for a
-//   given node
-//
-// They form a doubly-linked mutable tree, starting at `view.docView`.
-
-var NOT_DIRTY = 0;
-var CHILD_DIRTY = 1;
-var CONTENT_DIRTY = 2;
-var NODE_DIRTY = 3;
-
-// Superclass for the various kinds of descriptions. Defines their
-// basic structure and shared methods.
-var ViewDesc = function ViewDesc(parent, children, dom, contentDOM) {
-  this.parent = parent;
-  this.children = children;
-  this.dom = dom;
-  // An expando property on the DOM node provides a link back to its
-  // description.
-  dom.pmViewDesc = this;
-  // This is the node that holds the child views. It may be null for
-  // descs that don't have children.
-  this.contentDOM = contentDOM;
-  this.dirty = NOT_DIRTY;
-};
-
-var prototypeAccessors$1 = { beforePosition: {},size: {},border: {},posBefore: {},posAtStart: {},posAfter: {},posAtEnd: {},contentLost: {} };
-
-// Used to check whether a given description corresponds to a
-// widget/mark/node.
-ViewDesc.prototype.matchesWidget = function matchesWidget () { return false };
-ViewDesc.prototype.matchesMark = function matchesMark () { return false };
-ViewDesc.prototype.matchesNode = function matchesNode () { return false };
-ViewDesc.prototype.matchesHack = function matchesHack () { return false };
-
-prototypeAccessors$1.beforePosition.get = function () { return false };
-
-// : () → ?ParseRule
-// When parsing in-editor content (in domchange.js), we allow
-// descriptions to determine the parse rules that should be used to
-// parse them.
-ViewDesc.prototype.parseRule = function parseRule () { return null };
-
-// : (dom.Event) → bool
-// Used by the editor's event handler to ignore events that come
-// from certain descs.
-ViewDesc.prototype.stopEvent = function stopEvent () { return false };
-
-// The size of the content represented by this desc.
-prototypeAccessors$1.size.get = function () {
-    var this$1 = this;
-
-  var size = 0;
-  for (var i = 0; i < this.children.length; i++) { size += this$1.children[i].size; }
-  return size
-};
-
-// For block nodes, this represents the space taken up by their
-// start/end tokens.
-prototypeAccessors$1.border.get = function () { return 0 };
-
-ViewDesc.prototype.destroy = function destroy () {
-    var this$1 = this;
-
-  this.parent = null;
-  if (this.dom.pmViewDesc == this) { this.dom.pmViewDesc = null; }
-  for (var i = 0; i < this.children.length; i++)
-    { this$1.children[i].destroy(); }
-};
-
-ViewDesc.prototype.posBeforeChild = function posBeforeChild (child) {
-    var this$1 = this;
-
-  for (var i = 0, pos = this.posAtStart; i < this.children.length; i++) {
-    var cur = this$1.children[i];
-    if (cur == child) { return pos }
-    pos += cur.size;
-  }
-};
-
-prototypeAccessors$1.posBefore.get = function () {
-  return this.parent.posBeforeChild(this)
-};
-
-prototypeAccessors$1.posAtStart.get = function () {
-  return this.parent ? this.parent.posBeforeChild(this) + this.border : 0
-};
-
-prototypeAccessors$1.posAfter.get = function () {
-  return this.posBefore + this.size
-};
-
-prototypeAccessors$1.posAtEnd.get = function () {
-  return this.posAtStart + this.size - 2 * this.border
-};
-
-// : (dom.Node, number, ?number) → number
-ViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {
-    var this$1 = this;
-
-  // If the DOM position is in the content, use the child desc after
-  // it to figure out a position.
-  if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {
-    if (bias < 0) {
-      var domBefore, desc;
-      if (dom == this.contentDOM) {
-        domBefore = dom.childNodes[offset - 1];
-      } else {
-        while (dom.parentNode != this.contentDOM) { dom = dom.parentNode; }
-        domBefore = dom.previousSibling;
-      }
-      while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this)) { domBefore = domBefore.previousSibling; }
-      return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart
-    } else {
-      var domAfter, desc$1;
-      if (dom == this.contentDOM) {
-        domAfter = dom.childNodes[offset];
-      } else {
-        while (dom.parentNode != this.contentDOM) { dom = dom.parentNode; }
-        domAfter = dom.nextSibling;
-      }
-      while (domAfter && !((desc$1 = domAfter.pmViewDesc) && desc$1.parent == this)) { domAfter = domAfter.nextSibling; }
-      return domAfter ? this.posBeforeChild(desc$1) : this.posAtEnd
-    }
-  }
-  // Otherwise, use various heuristics, falling back on the bias
-  // parameter, to determine whether to return the position at the
-  // start or at the end of this view desc.
-  var atEnd;
-  if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {
-    atEnd = dom.compareDocumentPosition(this.contentDOM) & 2;
-  } else if (this.dom.firstChild) {
-    if (offset == 0) { for (var search = dom;; search = search.parentNode) {
-      if (search == this$1.dom) { atEnd = false; break }
-      if (search.parentNode.firstChild != search) { break }
-    } }
-    if (atEnd == null && offset == dom.childNodes.length) { for (var search$1 = dom;; search$1 = search$1.parentNode) {
-      if (search$1 == this$1.dom) { atEnd = true; break }
-      if (search$1.parentNode.lastChild != search$1) { break }
-    } }
-  }
-  return (atEnd == null ? bias > 0 : atEnd) ? this.posAtEnd : this.posAtStart
-};
-
-// Scan up the dom finding the first desc that is a descendant of
-// this one.
-ViewDesc.prototype.nearestDesc = function nearestDesc (dom, onlyNodes) {
-    var this$1 = this;
-
-  for (var first = true, cur = dom; cur; cur = cur.parentNode) {
-    var desc = this$1.getDesc(cur);
-    if (desc && (!onlyNodes || desc.node)) {
-      // If dom is outside of this desc's nodeDOM, don't count it.
-      if (first && desc.nodeDOM && !(desc.nodeDOM.nodeType == 1 ? desc.nodeDOM.contains(dom) : desc.nodeDOM == dom)) { first = false; }
-      else { return desc }
-    }
-  }
-};
-
-ViewDesc.prototype.getDesc = function getDesc (dom) {
-    var this$1 = this;
-
-  var desc = dom.pmViewDesc;
-  for (var cur = desc; cur; cur = cur.parent) { if (cur == this$1) { return desc } }
-};
-
-ViewDesc.prototype.posFromDOM = function posFromDOM (dom, offset, bias) {
-    var this$1 = this;
-
-  for (var scan = dom;; scan = scan.parentNode) {
-    var desc = this$1.getDesc(scan);
-    if (desc) { return desc.localPosFromDOM(dom, offset, bias) }
-  }
-};
-
-// : (number) → ?NodeViewDesc
-// Find the desc for the node after the given pos, if any. (When a
-// parent node overrode rendering, there might not be one.)
-ViewDesc.prototype.descAt = function descAt (pos) {
-    var this$1 = this;
-
-  for (var i = 0, offset = 0; i < this.children.length; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (offset == pos && end != offset) {
-      while (!child.border && child.children.length) { child = child.children[0]; }
-      return child
-    }
-    if (pos < end) { return child.descAt(pos - offset - child.border) }
-    offset = end;
-  }
-};
-
-// : (number) → {node: dom.Node, offset: number}
-ViewDesc.prototype.domFromPos = function domFromPos (pos) {
-    var this$1 = this;
-
-  if (!this.contentDOM) { return {node: this.dom, offset: 0} }
-  for (var offset = 0, i = 0;; i++) {
-    if (offset == pos) {
-      while (i < this.children.length && this.children[i].beforePosition) { i++; }
-      return {node: this$1.contentDOM, offset: i}
-    }
-    if (i == this$1.children.length) { throw new Error("Invalid position " + pos) }
-    var child = this$1.children[i], end = offset + child.size;
-    if (pos < end) { return child.domFromPos(pos - offset - child.border) }
-    offset = end;
-  }
-};
-
-// Used to find a DOM range in a single parent for a given changed
-// range.
-ViewDesc.prototype.parseRange = function parseRange (from, to, base) {
-    var this$1 = this;
-    if ( base === void 0 ) { base = 0; }
-
-  if (this.children.length == 0)
-    { return {node: this.contentDOM, from: from, to: to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length} }
-
-  var fromOffset = -1, toOffset = -1;
-  for (var offset = 0, i = 0;; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (fromOffset == -1 && from <= end) {
-      var childBase = offset + child.border;
-      // FIXME maybe descend mark views to parse a narrower range?
-      if (from >= childBase && to <= end - child.border && child.node &&
-          child.contentDOM && this$1.contentDOM.contains(child.contentDOM))
-        { return child.parseRange(from - childBase, to - childBase, base + childBase) }
-
-      from = base + offset;
-      for (var j = i; j > 0; j--) {
-        var prev = this$1.children[j - 1];
-        if (prev.size && prev.dom.parentNode == this$1.contentDOM && !prev.emptyChildAt(1)) {
-          fromOffset = domIndex(prev.dom) + 1;
-          break
-        }
-        from -= prev.size;
-      }
-      if (fromOffset == -1) { fromOffset = 0; }
-    }
-    if (fromOffset > -1 && to <= end) {
-      to = base + end;
-      for (var j$1 = i + 1; j$1 < this.children.length; j$1++) {
-        var next = this$1.children[j$1];
-        if (next.size && next.dom.parentNode == this$1.contentDOM && !next.emptyChildAt(-1)) {
-          toOffset = domIndex(next.dom);
-          break
-        }
-        to += next.size;
-      }
-      if (toOffset == -1) { toOffset = this$1.contentDOM.childNodes.length; }
-      break
-    }
-    offset = end;
-  }
-  return {node: this.contentDOM, from: from, to: to, fromOffset: fromOffset, toOffset: toOffset}
-};
-
-ViewDesc.prototype.emptyChildAt = function emptyChildAt (side) {
-  if (this.border || !this.contentDOM || !this.children.length) { return false }
-  var child = this.children[side < 0 ? 0 : this.children.length - 1];
-  return child.size == 0 || child.emptyChildAt(side)
-};
-
-// : (number) → dom.Node
-ViewDesc.prototype.domAfterPos = function domAfterPos (pos) {
-  var ref = this.domFromPos(pos);
-    var node = ref.node;
-    var offset = ref.offset;
-  if (node.nodeType != 1 || offset == node.childNodes.length)
-    { throw new RangeError("No node after pos " + pos) }
-  return node.childNodes[offset]
-};
-
-// : (number, number, dom.Document)
-// View descs are responsible for setting any selection that falls
-// entirely inside of them, so that custom implementations can do
-// custom things with the selection. Note that this falls apart when
-// a selection starts in such a node and ends in another, in which
-// case we just use whatever domFromPos produces as a best effort.
-ViewDesc.prototype.setSelection = function setSelection (anchor, head, root) {
-    var this$1 = this;
-
-  // If the selection falls entirely in a child, give it to that child
-  var from = Math.min(anchor, head), to = Math.max(anchor, head);
-  for (var i = 0, offset = 0; i < this.children.length; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (from > offset && to < end)
-      { return child.setSelection(anchor - offset - child.border, head - offset - child.border, root) }
-    offset = end;
-  }
-
-  var anchorDOM = this.domFromPos(anchor), headDOM = this.domFromPos(head);
-  var domSel = root.getSelection(), range = document.createRange();
-  if (isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset) &&
-      isEquivalentPosition(headDOM.node, headDOM.offset, domSel.focusNode, domSel.focusOffset))
-    { return }
-
-  // Selection.extend can be used to create an 'inverted' selection
-  // (one where the focus is before the anchor), but not all
-  // browsers support it yet.
-  if (domSel.extend) {
-    range.setEnd(anchorDOM.node, anchorDOM.offset);
-    range.collapse(false);
-  } else {
-    if (anchor > head) { var tmp = anchorDOM; anchorDOM = headDOM; headDOM = tmp; }
-    range.setEnd(headDOM.node, headDOM.offset);
-    range.setStart(anchorDOM.node, anchorDOM.offset);
-  }
-  domSel.removeAllRanges();
-  domSel.addRange(range);
-  if (domSel.extend)
-    { domSel.extend(headDOM.node, headDOM.offset); }
-};
-
-// : (dom.MutationRecord) → bool
-ViewDesc.prototype.ignoreMutation = function ignoreMutation (_mutation) {
-  return !this.contentDOM
-};
-
-prototypeAccessors$1.contentLost.get = function () {
-  return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM)
-};
-
-// Remove a subtree of the element tree that has been touched
-// by a DOM change, so that the next update will redraw it.
-ViewDesc.prototype.markDirty = function markDirty (from, to) {
-    var this$1 = this;
-
-  for (var offset = 0, i = 0; i < this.children.length; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (offset == end ? from <= end && to >= offset : from < end && to > offset) {
-      var startInside = offset + child.border, endInside = end - child.border;
-      if (from >= startInside && to <= endInside) {
-        this$1.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;
-        if (from == startInside && to == endInside && child.contentLost) { child.dirty = NODE_DIRTY; }
-        else { child.markDirty(from - startInside, to - startInside); }
-        return
-      } else {
-        child.dirty = NODE_DIRTY;
-      }
-    }
-    offset = end;
-  }
-  this.dirty = CONTENT_DIRTY;
-};
-
-Object.defineProperties( ViewDesc.prototype, prototypeAccessors$1 );
-
-// Reused array to avoid allocating fresh arrays for things that will
-// stay empty anyway.
-var nothing = [];
-
-// A widget desc represents a widget decoration, which is a DOM node
-// drawn between the document nodes.
-var WidgetViewDesc = (function (ViewDesc) {
-  function WidgetViewDesc(parent, widget, view, pos) {
-    var self, dom = widget.type.toDOM;
-    if (typeof dom == "function") { dom = dom(view, function () {
-      if (!self) { return pos }
-      if (self.parent) { return self.parent.posBeforeChild(self) }
-    }); }
-    if (!widget.type.spec.raw) {
-      if (dom.nodeType != 1) {
-        var wrap = document.createElement("span");
-        wrap.appendChild(dom);
-        dom = wrap;
-      }
-      dom.contentEditable = false;
-      dom.classList.add("ProseMirror-widget");
-    }
-    ViewDesc.call(this, parent, nothing, dom, null);
-    this.widget = widget;
-    self = this;
-  }
-
-  if ( ViewDesc ) { WidgetViewDesc.__proto__ = ViewDesc; }
-  WidgetViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  WidgetViewDesc.prototype.constructor = WidgetViewDesc;
-
-  var prototypeAccessors$1 = { beforePosition: {} };
-
-  prototypeAccessors$1.beforePosition.get = function () {
-    return this.widget.type.side < 0
-  };
-
-  WidgetViewDesc.prototype.matchesWidget = function matchesWidget (widget) {
-    return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type)
-  };
-
-  WidgetViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };
-
-  WidgetViewDesc.prototype.stopEvent = function stopEvent (event) {
-    var stop = this.widget.spec.stopEvent;
-    return stop ? stop(event) : false
-  };
-
-  Object.defineProperties( WidgetViewDesc.prototype, prototypeAccessors$1 );
-
-  return WidgetViewDesc;
-}(ViewDesc));
-
-// A cursor wrapper is used to put the cursor in when newly typed text
-// needs to be styled differently from its surrounding text (for
-// example through storedMarks), so that the style of the text doesn't
-// visually 'pop' between typing it and actually updating the view.
-var CursorWrapperDesc = (function (WidgetViewDesc) {
-  function CursorWrapperDesc () {
-    WidgetViewDesc.apply(this, arguments);
-  }
-
-  if ( WidgetViewDesc ) { CursorWrapperDesc.__proto__ = WidgetViewDesc; }
-  CursorWrapperDesc.prototype = Object.create( WidgetViewDesc && WidgetViewDesc.prototype );
-  CursorWrapperDesc.prototype.constructor = CursorWrapperDesc;
-
-  CursorWrapperDesc.prototype.parseRule = function parseRule () {
-    var content;
-    for (var child = this.dom.firstChild; child; child = child.nextSibling) {
-      var add = (void 0);
-      if (child.nodeType == 3) {
-        var text = child.nodeValue.replace(/\ufeff/g, "");
-        if (!text) { continue }
-        add = document.createTextNode(text);
-      } else if (child.textContent == "\ufeff") {
-        continue
-      } else {
-        add = child.cloneNode(true);
-      }
-      if (!content) { content = document.createDocumentFragment(); }
-      content.appendChild(add);
-    }
-    if (content) { return {skip: content} }
-    else { return WidgetViewDesc.prototype.parseRule.call(this) }
-  };
-
-  CursorWrapperDesc.prototype.ignoreMutation = function ignoreMutation () { return false };
-
-  return CursorWrapperDesc;
-}(WidgetViewDesc));
-
-// A mark desc represents a mark. May have multiple children,
-// depending on how the mark is split. Note that marks are drawn using
-// a fixed nesting order, for simplicity and predictability, so in
-// some cases they will be split more often than would appear
-// necessary.
-var MarkViewDesc = (function (ViewDesc) {
-  function MarkViewDesc(parent, mark, dom, contentDOM) {
-    ViewDesc.call(this, parent, [], dom, contentDOM);
-    this.mark = mark;
-  }
-
-  if ( ViewDesc ) { MarkViewDesc.__proto__ = ViewDesc; }
-  MarkViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  MarkViewDesc.prototype.constructor = MarkViewDesc;
-
-  MarkViewDesc.create = function create (parent, mark, inline, view) {
-    var custom = customNodeViews(view)[mark.type.name];
-    var spec = custom && custom(mark, view);
-    if (!spec || !spec.dom)
-      { spec = dist.DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline)); }
-    return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom)
-  };
-
-  MarkViewDesc.prototype.parseRule = function parseRule () { return {mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM} };
-
-  MarkViewDesc.prototype.matchesMark = function matchesMark (mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark) };
-
-  MarkViewDesc.prototype.markDirty = function markDirty (from, to) {
-    ViewDesc.prototype.markDirty.call(this, from, to);
-    // Move dirty info to nearest node view
-    if (this.dirty != NOT_DIRTY) {
-      var parent = this.parent;
-      while (!parent.node) { parent = parent.parent; }
-      if (parent.dirty < this.dirty) { parent.dirty = this.dirty; }
-      this.dirty = NOT_DIRTY;
-    }
-  };
-
-  return MarkViewDesc;
-}(ViewDesc));
-
-// Node view descs are the main, most common type of view desc, and
-// correspond to an actual node in the document. Unlike mark descs,
-// they populate their child array themselves.
-var NodeViewDesc = (function (ViewDesc) {
-  function NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {
-    ViewDesc.call(this, parent, node.isLeaf ? nothing : [], dom, contentDOM);
-    this.nodeDOM = nodeDOM;
-    this.node = node;
-    this.outerDeco = outerDeco;
-    this.innerDeco = innerDeco;
-    if (contentDOM) { this.updateChildren(view, pos); }
-  }
-
-  if ( ViewDesc ) { NodeViewDesc.__proto__ = ViewDesc; }
-  NodeViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  NodeViewDesc.prototype.constructor = NodeViewDesc;
-
-  var prototypeAccessors$2 = { size: {},border: {} };
-
-  // By default, a node is rendered using the `toDOM` method from the
-  // node type spec. But client code can use the `nodeViews` spec to
-  // supply a custom node view, which can influence various aspects of
-  // the way the node works.
-  //
-  // (Using subclassing for this was intentionally decided against,
-  // since it'd require exposing a whole slew of finnicky
-  // implementation details to the user code that they probably will
-  // never need.)
-  NodeViewDesc.create = function create (parent, node, outerDeco, innerDeco, view, pos) {
-    var custom = customNodeViews(view)[node.type.name], descObj;
-    var spec = custom && custom(node, view, function () {
-      // (This is a function that allows the custom view to find its
-      // own position)
-      if (!descObj) { return pos }
-      if (descObj.parent) { return descObj.parent.posBeforeChild(descObj) }
-    }, outerDeco);
-
-    var dom = spec && spec.dom, contentDOM = spec && spec.contentDOM;
-    if (node.isText) {
-      if (!dom) { dom = document.createTextNode(node.text); }
-      else if (dom.nodeType != 3) { throw new RangeError("Text must be rendered as a DOM text node") }
-    } else if (!dom) {
-      var assign;
-      ((assign = dist.DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)), dom = assign.dom, contentDOM = assign.contentDOM));
-    }
-    if (!contentDOM && !node.isText && dom.nodeName != "BR") { // Chrome gets confused by <br contenteditable=false>
-      dom.contentEditable = false;
-      if (node.type.spec.draggable) { dom.draggable = true; }
-    }
-
-    var nodeDOM = dom;
-    dom = applyOuterDeco(dom, outerDeco, node);
-
-    if (spec)
-      { return descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view) }
-    else if (node.isText)
-      { return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) }
-    else
-      { return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos + 1) }
-  };
-
-  NodeViewDesc.prototype.parseRule = function parseRule () {
-    var this$1 = this;
-
-    // Experimental kludge to allow opt-in re-parsing of nodes
-    if (this.node.type.spec.reparseInView) { return null }
-    // FIXME the assumption that this can always return the current
-    // attrs means that if the user somehow manages to change the
-    // attrs in the dom, that won't be picked up. Not entirely sure
-    // whether this is a problem
-    var rule = {node: this.node.type.name, attrs: this.node.attrs};
-    if (this.node.type.spec.code) { rule.preserveWhitespace = "full"; }
-    if (this.contentDOM && !this.contentLost) { rule.contentElement = this.contentDOM; }
-    else { rule.getContent = function () { return this$1.contentDOM ? dist.Fragment.empty : this$1.node.content; }; }
-    return rule
-  };
-
-  NodeViewDesc.prototype.matchesNode = function matchesNode (node, outerDeco, innerDeco) {
-    return this.dirty == NOT_DIRTY && node.eq(this.node) &&
-      sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco)
-  };
-
-  prototypeAccessors$2.size.get = function () { return this.node.nodeSize };
-
-  prototypeAccessors$2.border.get = function () { return this.node.isLeaf ? 0 : 1 };
-
-  // Syncs `this.children` to match `this.node.content` and the local
-  // decorations, possibly introducing nesting for marks. Then, in a
-  // separate step, syncs the DOM inside `this.contentDOM` to
-  // `this.children`.
-  NodeViewDesc.prototype.updateChildren = function updateChildren (view, pos) {
-    var this$1 = this;
-
-    var updater = new ViewTreeUpdater(this), inline = this.node.inlineContent;
-    iterDeco(this.node, this.innerDeco, function (widget, i) {
-      if (widget.spec.marks)
-        { updater.syncToMarks(widget.spec.marks, inline, view); }
-      else if (widget.type.side >= 0)
-        { updater.syncToMarks(i == this$1.node.childCount ? dist.Mark.none : this$1.node.child(i).marks, inline, view); }
-      // If the next node is a desc matching this widget, reuse it,
-      // otherwise insert the widget as a new view desc.
-      updater.placeWidget(widget, view, pos);
-    }, function (child, outerDeco, innerDeco, i) {
-      // Make sure the wrapping mark descs match the node's marks.
-      updater.syncToMarks(child.marks, inline, view);
-      // Either find an existing desc that exactly matches this node,
-      // and drop the descs before it.
-      updater.findNodeMatch(child, outerDeco, innerDeco, i) ||
-        // Or try updating the next desc to reflect this node.
-        updater.updateNextNode(child, outerDeco, innerDeco, view, i) ||
-        // Or just add it as a new desc.
-        updater.addNode(child, outerDeco, innerDeco, view, pos);
-      pos += child.nodeSize;
-    });
-    // Drop all remaining descs after the current position.
-    updater.syncToMarks(nothing, inline, view);
-    if (this.node.isTextblock) { updater.addTextblockHacks(); }
-    updater.destroyRest();
-
-    // Sync the DOM if anything changed
-    if (updater.changed || this.dirty == CONTENT_DIRTY) { this.renderChildren(); }
-  };
-
-  NodeViewDesc.prototype.renderChildren = function renderChildren () {
-    renderDescs(this.contentDOM, this.children, NodeViewDesc.is);
-    if (result.ios) { iosHacks(this.dom); }
-  };
-
-  // : (Node, [Decoration], DecorationSet, EditorView) → bool
-  // If this desc be updated to match the given node decoration,
-  // do so and return true.
-  NodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {
-    if (this.dirty == NODE_DIRTY ||
-        !node.sameMarkup(this.node)) { return false }
-    this.updateInner(node, outerDeco, innerDeco, view);
-    return true
-  };
-
-  NodeViewDesc.prototype.updateInner = function updateInner (node, outerDeco, innerDeco, view) {
-    this.updateOuterDeco(outerDeco);
-    this.node = node;
-    this.innerDeco = innerDeco;
-    if (this.contentDOM) { this.updateChildren(view, this.posAtStart); }
-    this.dirty = NOT_DIRTY;
-  };
-
-  NodeViewDesc.prototype.updateOuterDeco = function updateOuterDeco (outerDeco) {
-    if (sameOuterDeco(outerDeco, this.outerDeco)) { return }
-    var needsWrap = this.nodeDOM.nodeType != 1;
-    var oldDOM = this.dom;
-    this.dom = patchOuterDeco(this.dom, this.nodeDOM,
-                              computeOuterDeco(this.outerDeco, this.node, needsWrap),
-                              computeOuterDeco(outerDeco, this.node, needsWrap));
-    if (this.dom != oldDOM) {
-      oldDOM.pmViewDesc = null;
-      this.dom.pmViewDesc = this;
-    }
-    this.outerDeco = outerDeco;
-  };
-
-  // Mark this node as being the selected node.
-  NodeViewDesc.prototype.selectNode = function selectNode () {
-    this.nodeDOM.classList.add("ProseMirror-selectednode");
-  };
-
-  // Remove selected node marking from this node.
-  NodeViewDesc.prototype.deselectNode = function deselectNode () {
-    this.nodeDOM.classList.remove("ProseMirror-selectednode");
-  };
-
-  Object.defineProperties( NodeViewDesc.prototype, prototypeAccessors$2 );
-
-  return NodeViewDesc;
-}(ViewDesc));
-
-// Create a view desc for the top-level document node, to be exported
-// and used by the view class.
-function docViewDesc(doc, outerDeco, innerDeco, dom, view) {
-  applyOuterDeco(dom, outerDeco, doc, true);
-  return new NodeViewDesc(null, doc, outerDeco, innerDeco, dom, dom, dom, view, 0)
-}
-
-var TextViewDesc = (function (NodeViewDesc) {
-  function TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {
-    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view);
-  }
-
-  if ( NodeViewDesc ) { TextViewDesc.__proto__ = NodeViewDesc; }
-  TextViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );
-  TextViewDesc.prototype.constructor = TextViewDesc;
-
-  TextViewDesc.prototype.parseRule = function parseRule () {
-    var parent = this.nodeDOM.parentNode;
-    return parent ? {skip: parent} : {ignore: true}
-  };
-
-  TextViewDesc.prototype.update = function update (node, outerDeco) {
-    if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) ||
-        !node.sameMarkup(this.node)) { return false }
-    this.updateOuterDeco(outerDeco);
-    if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue)
-      { this.nodeDOM.nodeValue = node.text; }
-    this.node = node;
-    this.dirty = NOT_DIRTY;
-    return true
-  };
-
-  TextViewDesc.prototype.inParent = function inParent () {
-    var parentDOM = this.parent.contentDOM;
-    for (var n = this.nodeDOM; n; n = n.parentNode) { if (n == parentDOM) { return true } }
-    return false
-  };
-
-  TextViewDesc.prototype.domFromPos = function domFromPos (pos) {
-    return {node: this.nodeDOM, offset: pos}
-  };
-
-  TextViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {
-    if (dom == this.nodeDOM) { return this.posAtStart + Math.min(offset, this.node.text.length) }
-    return NodeViewDesc.prototype.localPosFromDOM.call(this, dom, offset, bias)
-  };
-
-  TextViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {
-    return mutation.type != "characterData"
-  };
-
-  return TextViewDesc;
-}(NodeViewDesc));
-
-// A dummy desc used to tag trailing BR or span nodes created to work
-// around contentEditable terribleness.
-var BRHackViewDesc = (function (ViewDesc) {
-  function BRHackViewDesc () {
-    ViewDesc.apply(this, arguments);
-  }
-
-  if ( ViewDesc ) { BRHackViewDesc.__proto__ = ViewDesc; }
-  BRHackViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  BRHackViewDesc.prototype.constructor = BRHackViewDesc;
-
-  BRHackViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };
-  BRHackViewDesc.prototype.matchesHack = function matchesHack () { return this.dirty == NOT_DIRTY };
-
-  return BRHackViewDesc;
-}(ViewDesc));
-
-// A separate subclass is used for customized node views, so that the
-// extra checks only have to be made for nodes that are actually
-// customized.
-var CustomNodeViewDesc = (function (NodeViewDesc) {
-  function CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view) {
-    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view);
-    this.spec = spec;
-  }
-
-  if ( NodeViewDesc ) { CustomNodeViewDesc.__proto__ = NodeViewDesc; }
-  CustomNodeViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );
-  CustomNodeViewDesc.prototype.constructor = CustomNodeViewDesc;
-
-  // A custom `update` method gets to decide whether the update goes
-  // through. If it does, and there's a `contentDOM` node, our logic
-  // updates the children.
-  CustomNodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {
-    if (this.dirty == NODE_DIRTY) { return false }
-    if (this.spec.update) {
-      var result$$1 = this.spec.update(node, outerDeco);
-      if (result$$1) { this.updateInner(node, outerDeco, innerDeco, view); }
-      return result$$1
-    } else if (!this.contentDOM && !node.isLeaf) {
-      return false
-    } else {
-      return NodeViewDesc.prototype.update.call(this, node, outerDeco, innerDeco, view)
-    }
-  };
-
-  CustomNodeViewDesc.prototype.selectNode = function selectNode () {
-    this.spec.selectNode ? this.spec.selectNode() : NodeViewDesc.prototype.selectNode.call(this);
-  };
-
-  CustomNodeViewDesc.prototype.deselectNode = function deselectNode () {
-    this.spec.deselectNode ? this.spec.deselectNode() : NodeViewDesc.prototype.deselectNode.call(this);
-  };
-
-  CustomNodeViewDesc.prototype.setSelection = function setSelection (anchor, head, root) {
-    this.spec.setSelection ? this.spec.setSelection(anchor, head, root) : NodeViewDesc.prototype.setSelection.call(this, anchor, head, root);
-  };
-
-  CustomNodeViewDesc.prototype.destroy = function destroy () {
-    if (this.spec.destroy) { this.spec.destroy(); }
-    NodeViewDesc.prototype.destroy.call(this);
-  };
-
-  CustomNodeViewDesc.prototype.stopEvent = function stopEvent (event) {
-    return this.spec.stopEvent ? this.spec.stopEvent(event) : false
-  };
-
-  CustomNodeViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {
-    return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : NodeViewDesc.prototype.ignoreMutation.call(this, mutation)
-  };
-
-  return CustomNodeViewDesc;
-}(NodeViewDesc));
-
-// : (dom.Node, [ViewDesc])
-// Sync the content of the given DOM node with the nodes associated
-// with the given array of view descs, recursing into mark descs
-// because this should sync the subtree for a whole node at a time.
-function renderDescs(parentDOM, descs) {
-  var dom = parentDOM.firstChild;
-  for (var i = 0; i < descs.length; i++) {
-    var desc = descs[i], childDOM = desc.dom;
-    if (childDOM.parentNode == parentDOM) {
-      while (childDOM != dom) { dom = rm(dom); }
-      dom = dom.nextSibling;
-    } else {
-      parentDOM.insertBefore(childDOM, dom);
-    }
-    if (desc instanceof MarkViewDesc) {
-      var pos = dom ? dom.previousSibling : parentDOM.lastChild;
-      renderDescs(desc.contentDOM, desc.children);
-      dom = pos ? pos.nextSibling : parentDOM.firstChild;
-    }
-  }
-  while (dom) { dom = rm(dom); }
-}
-
-function OuterDecoLevel(nodeName) {
-  if (nodeName) { this.nodeName = nodeName; }
-}
-OuterDecoLevel.prototype = Object.create(null);
-
-var noDeco = [new OuterDecoLevel];
-
-function computeOuterDeco(outerDeco, node, needsWrap) {
-  if (outerDeco.length == 0) { return noDeco }
-
-  var top = needsWrap ? noDeco[0] : new OuterDecoLevel, result$$1 = [top];
-
-  for (var i = 0; i < outerDeco.length; i++) {
-    var attrs = outerDeco[i].type.attrs, cur = top;
-    if (!attrs) { continue }
-    if (attrs.nodeName)
-      { result$$1.push(cur = new OuterDecoLevel(attrs.nodeName)); }
-
-    for (var name in attrs) {
-      var val = attrs[name];
-      if (val == null) { continue }
-      if (needsWrap && result$$1.length == 1)
-        { result$$1.push(cur = top = new OuterDecoLevel(node.isInline ? "span" : "div")); }
-      if (name == "class") { cur.class = (cur.class ? cur.class + " " : "") + val; }
-      else if (name == "style") { cur.style = (cur.style ? cur.style + ";" : "") + val; }
-      else if (name != "nodeName") { cur[name] = val; }
-    }
-  }
-
-  return result$$1
-}
-
-function patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {
-  // Shortcut for trivial case
-  if (prevComputed == noDeco && curComputed == noDeco) { return nodeDOM }
-
-  var curDOM = nodeDOM;
-  for (var i = 0; i < curComputed.length; i++) {
-    var deco = curComputed[i], prev = prevComputed[i];
-    if (i) {
-      var parent = (void 0);
-      if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&
-          (parent = nodeDOM.parentNode) && parent.tagName.toLowerCase() == deco.nodeName) {
-        curDOM = parent;
-      } else {
-        parent = document.createElement(deco.nodeName);
-        parent.appendChild(curDOM);
-        curDOM = parent;
-      }
-    }
-    patchAttributes(curDOM, prev || noDeco[0], deco);
-  }
-  return curDOM
-}
-
-function patchAttributes(dom, prev, cur) {
-  for (var name in prev)
-    { if (name != "class" && name != "style" && name != "nodeName" && !(name in cur))
-      { dom.removeAttribute(name); } }
-  for (var name$1 in cur)
-    { if (name$1 != "class" && name$1 != "style" && name$1 != "nodeName" && cur[name$1] != prev[name$1])
-      { dom.setAttribute(name$1, cur[name$1]); } }
-  if (prev.class != cur.class) {
-    var prevList = prev.class ? prev.class.split(" ") : nothing;
-    var curList = cur.class ? cur.class.split(" ") : nothing;
-    for (var i = 0; i < prevList.length; i++) { if (curList.indexOf(prevList[i]) == -1)
-      { dom.classList.remove(prevList[i]); } }
-    for (var i$1 = 0; i$1 < curList.length; i$1++) { if (prevList.indexOf(curList[i$1]) == -1)
-      { dom.classList.add(curList[i$1]); } }
-  }
-  if (prev.style != cur.style) {
-    if (prev.style) {
-      var prop = /\s*([\w\-\xa1-\uffff]+)\s*:(?:"(?:\\.|[^"])*"|'(?:\\.|[^'])*'|\(.*?\)|[^;])*/g, m;
-      while (m = prop.exec(prev.style))
-        { dom.style[m[1].toLowerCase()] = ""; }
-    }
-    if (cur.style)
-      { dom.style.cssText += cur.style; }
-  }
-}
-
-function applyOuterDeco(dom, deco, node) {
-  return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1))
-}
-
-// : ([Decoration], [Decoration]) → bool
-function sameOuterDeco(a, b) {
-  if (a.length != b.length) { return false }
-  for (var i = 0; i < a.length; i++) { if (!a[i].type.eq(b[i].type)) { return false } }
-  return true
-}
-
-// Remove a DOM node and return its next sibling.
-function rm(dom) {
-  var next = dom.nextSibling;
-  dom.parentNode.removeChild(dom);
-  return next
-}
-
-// Helper class for incrementally updating a tree of mark descs and
-// the widget and node descs inside of them.
-var ViewTreeUpdater = function ViewTreeUpdater(top) {
-  this.top = top;
-  // Index into `this.top`'s child array, represents the current
-  // update position.
-  this.index = 0;
-  // When entering a mark, the current top and index are pushed
-  // onto this.
-  this.stack = [];
-  // Tracks whether anything was changed
-  this.changed = false;
-
-  this.preMatched = preMatch(top.node.content, top.children);
-};
-
-// Destroy and remove the children between the given indices in
-// `this.top`.
-ViewTreeUpdater.prototype.destroyBetween = function destroyBetween (start, end) {
-    var this$1 = this;
-
-  if (start == end) { return }
-  for (var i = start; i < end; i++) { this$1.top.children[i].destroy(); }
-  this.top.children.splice(start, end - start);
-  this.changed = true;
-};
-
-// Destroy all remaining children in `this.top`.
-ViewTreeUpdater.prototype.destroyRest = function destroyRest () {
-  this.destroyBetween(this.index, this.top.children.length);
-};
-
-// : ([Mark], EditorView)
-// Sync the current stack of mark descs with the given array of
-// marks, reusing existing mark descs when possible.
-ViewTreeUpdater.prototype.syncToMarks = function syncToMarks (marks, inline, view) {
-    var this$1 = this;
-
-  var keep = 0, depth = this.stack.length >> 1;
-  var maxKeep = Math.min(depth, marks.length), next;
-  while (keep < maxKeep &&
-         (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1]).matchesMark(marks[keep]))
-    { keep++; }
-
-  while (keep < depth) {
-    this$1.destroyRest();
-    this$1.top.dirty = NOT_DIRTY;
-    this$1.index = this$1.stack.pop();
-    this$1.top = this$1.stack.pop();
-    depth--;
-  }
-  while (depth < marks.length) {
-    this$1.stack.push(this$1.top, this$1.index + 1);
-    if (this$1.index < this$1.top.children.length &&
-        (next = this$1.top.children[this$1.index]).matchesMark(marks[depth])) {
-      this$1.top = next;
-    } else {
-      var markDesc = MarkViewDesc.create(this$1.top, marks[depth], inline, view);
-      this$1.top.children.splice(this$1.index, 0, markDesc);
-      this$1.top = markDesc;
-      this$1.changed = true;
-    }
-    this$1.index = 0;
-    depth++;
-  }
-};
-
-// : (Node, [Decoration], DecorationSet) → bool
-// Try to find a node desc matching the given data. Skip over it and
-// return true when successful.
-ViewTreeUpdater.prototype.findNodeMatch = function findNodeMatch (node, outerDeco, innerDeco, index) {
-    var this$1 = this;
-
-  for (var i = this.index, children = this.top.children, e = Math.min(children.length, i + 5); i < e; i++) {
-    var child = children[i], preMatched = (void 0);
-    if (child.matchesNode(node, outerDeco, innerDeco) &&
-        ((preMatched = this$1.preMatched.indexOf(child)) == -1 || preMatched == index)) {
-      this$1.destroyBetween(this$1.index, i);
-      this$1.index++;
-      return true
-    }
-  }
-  return false
-};
-
-// : (Node, [Decoration], DecorationSet, EditorView, Fragment, number) → bool
-// Try to update the next node, if any, to the given data. Checks
-// pre-matches to avoid overwriting nodes that could still be used.
-ViewTreeUpdater.prototype.updateNextNode = function updateNextNode (node, outerDeco, innerDeco, view, index) {
-  if (this.index == this.top.children.length) { return false }
-  var next = this.top.children[this.index];
-  if (next instanceof NodeViewDesc) {
-    var preMatch = this.preMatched.indexOf(next);
-    if (preMatch > -1 && preMatch != index) { return false }
-    var nextDOM = next.dom;
-    if (next.update(node, outerDeco, innerDeco, view)) {
-      if (next.dom != nextDOM) { this.changed = true; }
-      this.index++;
-      return true
-    }
-  }
-  return false
-};
-
-// : (Node, [Decoration], DecorationSet, EditorView)
-// Insert the node as a newly created node desc.
-ViewTreeUpdater.prototype.addNode = function addNode (node, outerDeco, innerDeco, view, pos) {
-  this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos));
-  this.changed = true;
-};
-
-ViewTreeUpdater.prototype.placeWidget = function placeWidget (widget, view, pos) {
-  if (this.index < this.top.children.length && this.top.children[this.index].matchesWidget(widget)) {
-    this.index++;
-  } else {
-    var desc = new (widget.spec.isCursorWrapper ? CursorWrapperDesc : WidgetViewDesc)(this.top, widget, view, pos);
-    this.top.children.splice(this.index++, 0, desc);
-    this.changed = true;
-  }
-};
-
-// Make sure a textblock looks and behaves correctly in
-// contentEditable.
-ViewTreeUpdater.prototype.addTextblockHacks = function addTextblockHacks () {
-  var lastChild = this.top.children[this.index - 1];
-  while (lastChild instanceof MarkViewDesc) { lastChild = lastChild.children[lastChild.children.length - 1]; }
-
-  if (!lastChild || // Empty textblock
-      !(lastChild instanceof TextViewDesc) ||
-      /\n$/.test(lastChild.node.text)) {
-    if (this.index < this.top.children.length && this.top.children[this.index].matchesHack()) {
-      this.index++;
-    } else {
-      var dom = document.createElement("br");
-      this.top.children.splice(this.index++, 0, new BRHackViewDesc(this.top, nothing, dom, null));
-      this.changed = true;
-    }
-  }
-};
-
-// : (Fragment, [ViewDesc]) → [ViewDesc]
-// Iterate from the end of the fragment and array of descs to find
-// directly matching ones, in order to avoid overeagerly reusing
-// those for other nodes. Returns an array whose positions correspond
-// to node positions in the fragment, and whose elements are either
-// descs matched to the child at that index, or empty.
-function preMatch(frag, descs) {
-  var result$$1 = [], end = frag.childCount;
-  for (var i = descs.length - 1; end > 0 && i >= 0; i--) {
-    var desc = descs[i], node = desc.node;
-    if (!node) { continue }
-    if (node != frag.child(end - 1)) { break }
-    result$$1[--end] = desc;
-  }
-  return result$$1
-}
-
-function compareSide(a, b) { return a.type.side - b.type.side }
-
-// : (ViewDesc, DecorationSet, (Decoration), (Node, [Decoration], DecorationSet, number))
-// This function abstracts iterating over the nodes and decorations in
-// a fragment. Calls `onNode` for each node, with its local and child
-// decorations. Splits text nodes when there is a decoration starting
-// or ending inside of them. Calls `onWidget` for each widget.
-function iterDeco(parent, deco, onWidget, onNode) {
-  var locals = deco.locals(parent), offset = 0;
-  // Simple, cheap variant for when there are no local decorations
-  if (locals.length == 0) {
-    for (var i = 0; i < parent.childCount; i++) {
-      var child = parent.child(i);
-      onNode(child, locals, deco.forChild(offset, child), i);
-      offset += child.nodeSize;
-    }
-    return
-  }
-
-  var decoIndex = 0, active = [], restNode = null;
-  for (var parentIndex = 0;;) {
-    if (decoIndex < locals.length && locals[decoIndex].to == offset) {
-      var widget = locals[decoIndex++], widgets = (void 0);
-      while (decoIndex < locals.length && locals[decoIndex].to == offset)
-        { (widgets || (widgets = [widget])).push(locals[decoIndex++]); }
-      if (widgets) {
-        widgets.sort(compareSide);
-        for (var i$1 = 0; i$1 < widgets.length; i$1++) { onWidget(widgets[i$1], parentIndex); }
-      } else {
-        onWidget(widget, parentIndex);
-      }
-    }
-
-    var child$1 = (void 0);
-    if (restNode) {
-      child$1 = restNode;
-      restNode = null;
-    } else if (parentIndex < parent.childCount) {
-      child$1 = parent.child(parentIndex++);
-    } else {
-      break
-    }
-
-    for (var i$2 = 0; i$2 < active.length; i$2++) { if (active[i$2].to <= offset) { active.splice(i$2--, 1); } }
-    while (decoIndex < locals.length && locals[decoIndex].from == offset) { active.push(locals[decoIndex++]); }
-
-    var end = offset + child$1.nodeSize;
-    if (child$1.isText) {
-      var cutAt = end;
-      if (decoIndex < locals.length && locals[decoIndex].from < cutAt) { cutAt = locals[decoIndex].from; }
-      for (var i$3 = 0; i$3 < active.length; i$3++) { if (active[i$3].to < cutAt) { cutAt = active[i$3].to; } }
-      if (cutAt < end) {
-        restNode = child$1.cut(cutAt - offset);
-        child$1 = child$1.cut(0, cutAt - offset);
-        end = cutAt;
-      }
-    }
-
-    onNode(child$1, active.length ? active.slice() : nothing, deco.forChild(offset, child$1), parentIndex - 1);
-    offset = end;
-  }
-}
-
-// Pre-calculate and cache the set of custom view specs for a given
-// prop object.
-var cachedCustomViews;
-var cachedCustomFor;
-function customNodeViews(view) {
-  if (cachedCustomFor == view._props) { return cachedCustomViews }
-  cachedCustomFor = view._props;
-  return cachedCustomViews = buildCustomViews(view)
-}
-function buildCustomViews(view) {
-  var result$$1 = {};
-  view.someProp("nodeViews", function (obj) {
-    for (var prop in obj) { if (!Object.prototype.hasOwnProperty.call(result$$1, prop))
-      { result$$1[prop] = obj[prop]; } }
-  });
-  return result$$1
-}
-
-// List markers in Mobile Safari will mysteriously disappear
-// sometimes. This works around that.
-function iosHacks(dom) {
-  if (dom.nodeName == "UL" || dom.nodeName == "OL") {
-    var oldCSS = dom.style.cssText;
-    dom.style.cssText = oldCSS + "; list-style: square !important";
-    window.getComputedStyle(dom).listStyle;
-    dom.style.cssText = oldCSS;
-  }
-}
-
-function moveSelectionBlock(state, dir) {
-  var ref = state.selection;
-  var $anchor = ref.$anchor;
-  var $head = ref.$head;
-  var $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);
-  var $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null;
-  return $start && dist$2.Selection.findFrom($start, dir)
-}
-
-function apply(view, sel) {
-  view.dispatch(view.state.tr.setSelection(sel).scrollIntoView());
-  return true
-}
-
-function selectHorizontally(view, dir) {
-  var sel = view.state.selection;
-  if (sel instanceof dist$2.TextSelection) {
-    if (!sel.empty) {
-      return false
-    } else if (view.endOfTextblock(dir > 0 ? "right" : "left")) {
-      var next = moveSelectionBlock(view.state, dir);
-      if (next && (next instanceof dist$2.NodeSelection)) { return apply(view, next) }
-      return false
-    } else {
-      var $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc;
-      if (node && dist$2.NodeSelection.isSelectable(node)) {
-        var nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;
-        if (node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM)
-          { return apply(view, new dist$2.NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head)) }
-      }
-      return false
-    }
-  } else if (sel instanceof dist$2.NodeSelection && sel.node.isInline) {
-    return apply(view, new dist$2.TextSelection(dir > 0 ? sel.$to : sel.$from))
-  } else {
-    var next$1 = moveSelectionBlock(view.state, dir);
-    if (next$1) { return apply(view, next$1) }
-    return false
-  }
-}
-
-function nodeLen(node) {
-  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length
-}
-
-function isIgnorable(dom) {
-  var desc = dom.pmViewDesc;
-  return desc && desc.size == 0 && (dom.nextSibling || dom.nodeName != "BR")
-}
-
-// Make sure the cursor isn't directly after one or more ignored
-// nodes, which will confuse the browser's cursor motion logic.
-function skipIgnoredNodesLeft(view) {
-  var sel = view.root.getSelection();
-  var node = sel.focusNode, offset = sel.focusOffset;
-  if (!node) { return }
-  var moveNode, moveOffset, force = false;
-  // Gecko will do odd things when the selection is directly in front
-  // of a non-editable node, so in that case, move it into the next
-  // node if possible. Issue prosemirror/prosemirror#832.
-  if (result.gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset])) { force = true; }
-  for (;;) {
-    if (offset > 0) {
-      if (node.nodeType != 1) {
-        if (node.nodeType == 3 && node.nodeValue.charAt(offset - 1) == "\ufeff") {
-          // IE11's cursor will still be stuck when placed at the
-          // beginning of the cursor wrapper text node (#807)
-          if (result.ie && result.ie_version <= 11) { force = true; }
-          moveNode = node;
-          moveOffset = --offset;
-        } else { break }
-      } else {
-        var before = node.childNodes[offset - 1];
-        if (isIgnorable(before)) {
-          moveNode = node;
-          moveOffset = --offset;
-        } else if (before.nodeType == 3) {
-          node = before;
-          offset = node.nodeValue.length;
-        } else { break }
-      }
-    } else if (isBlockNode(node)) {
-      break
-    } else {
-      var prev = node.previousSibling;
-      while (prev && isIgnorable(prev)) {
-        moveNode = node.parentNode;
-        moveOffset = domIndex(prev);
-        prev = prev.previousSibling;
-      }
-      if (!prev) {
-        node = node.parentNode;
-        if (node == view.dom) { break }
-        offset = 0;
-      } else {
-        node = prev;
-        offset = nodeLen(node);
-      }
-    }
-  }
-  if (force) { setSelFocus(view, sel, node, offset); }
-  else if (moveNode) { setSelFocus(view, sel, moveNode, moveOffset); }
-}
-
-// Make sure the cursor isn't directly before one or more ignored
-// nodes.
-function skipIgnoredNodesRight(view) {
-  var sel = view.root.getSelection();
-  var node = sel.focusNode, offset = sel.focusOffset;
-  if (!node) { return }
-  var len = nodeLen(node);
-  var moveNode, moveOffset;
-  for (;;) {
-    if (offset < len) {
-      if (node.nodeType != 1) { break }
-      var after = node.childNodes[offset];
-      if (isIgnorable(after)) {
-        moveNode = node;
-        moveOffset = ++offset;
-      }
-      else { break }
-    } else if (isBlockNode(node)) {
-      break
-    } else {
-      var next = node.nextSibling;
-      while (next && isIgnorable(next)) {
-        moveNode = next.parentNode;
-        moveOffset = domIndex(next) + 1;
-        next = next.nextSibling;
-      }
-      if (!next) {
-        node = node.parentNode;
-        if (node == view.dom) { break }
-        offset = len = 0;
-      } else {
-        node = next;
-        offset = 0;
-        len = nodeLen(node);
-      }
-    }
-  }
-  if (moveNode) { setSelFocus(view, sel, moveNode, moveOffset); }
-}
-
-function isBlockNode(dom) {
-  var desc = dom.pmViewDesc;
-  return desc && desc.node && desc.node.isBlock
-}
-
-function setSelFocus(view, sel, node, offset) {
-  if (selectionCollapsed(sel)) {
-    var range = document.createRange();
-    range.setEnd(node, offset);
-    range.setStart(node, offset);
-    sel.removeAllRanges();
-    sel.addRange(range);
-  } else if (sel.extend) {
-    sel.extend(node, offset);
-  }
-  view.selectionReader.storeDOMState(view.selection);
-}
-
-// : (EditorState, number)
-// Check whether vertical selection motion would involve node
-// selections. If so, apply it (if not, the result is left to the
-// browser)
-function selectVertically(view, dir) {
-  var sel = view.state.selection;
-  if (sel instanceof dist$2.TextSelection && !sel.empty) { return false }
-  var $from = sel.$from;
-  var $to = sel.$to;
-
-  if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? "up" : "down")) {
-    var next = moveSelectionBlock(view.state, dir);
-    if (next && (next instanceof dist$2.NodeSelection))
-      { return apply(view, next) }
-  }
-  if (!$from.parent.inlineContent) {
-    var beyond = dist$2.Selection.findFrom(dir < 0 ? $from : $to, dir);
-    return beyond ? apply(view, beyond) : true
-  }
-  return false
-}
-
-function stopNativeHorizontalDelete(view, dir) {
-  if (!(view.state.selection instanceof dist$2.TextSelection)) { return true }
-  var ref = view.state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  var empty = ref.empty;
-  if (!$head.sameParent($anchor)) { return true }
-  if (!empty) { return false }
-  if (view.endOfTextblock(dir > 0 ? "forward" : "backward")) { return true }
-  var nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);
-  if (nextNode && !nextNode.isText) {
-    var tr = view.state.tr;
-    if (dir < 0) { tr.delete($head.pos - nextNode.nodeSize, $head.pos); }
-    else { tr.delete($head.pos, $head.pos + nextNode.nodeSize); }
-    view.dispatch(tr);
-    return true
-  }
-  return false
-}
-
-// A backdrop key mapping used to make sure we always suppress keys
-// that have a dangerous default effect, even if the commands they are
-// bound to return false, and to make sure that cursor-motion keys
-// find a cursor (as opposed to a node selection) when pressed. For
-// cursor-motion keys, the code in the handlers also takes care of
-// block selections.
-
-function getMods(event) {
-  var result$$1 = "";
-  if (event.ctrlKey) { result$$1 += "c"; }
-  if (event.metaKey) { result$$1 += "m"; }
-  if (event.altKey) { result$$1 += "a"; }
-  if (event.shiftKey) { result$$1 += "s"; }
-  return result$$1
-}
-
-function captureKeyDown(view, event) {
-  var code = event.keyCode, mods = getMods(event);
-  if (code == 8 || (result.mac && code == 72 && mods == "c")) { // Backspace, Ctrl-h on Mac
-    return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodesLeft(view)
-  } else if (code == 46 || (result.mac && code == 68 && mods == "c")) { // Delete, Ctrl-d on Mac
-    return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodesRight(view)
-  } else if (code == 13 || code == 27) { // Enter, Esc
-    return true
-  } else if (code == 37) { // Left arrow
-    return selectHorizontally(view, -1) || skipIgnoredNodesLeft(view)
-  } else if (code == 39) { // Right arrow
-    return selectHorizontally(view, 1) || skipIgnoredNodesRight(view)
-  } else if (code == 38) { // Up arrow
-    return selectVertically(view, -1) || skipIgnoredNodesLeft(view)
-  } else if (code == 40) { // Down arrow
-    return selectVertically(view, 1) || skipIgnoredNodesRight(view)
-  } else if (mods == (result.mac ? "m" : "c") &&
-             (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]
-    return true
-  }
-  return false
-}
-
-var TrackedRecord = function TrackedRecord(prev, mapping, state) {
-  this.prev = prev;
-  this.mapping = mapping;
-  this.state = state;
-};
-
-var TrackMappings = function TrackMappings(state) {
-  this.seen = [new TrackedRecord(null, null, state)];
-  // Kludge to listen to state changes globally in order to be able
-  // to find mappings from a given state to another.
-  dist$2.EditorState.addApplyListener(this.track = this.track.bind(this));
-};
-
-TrackMappings.prototype.destroy = function destroy () {
-  dist$2.EditorState.removeApplyListener(this.track);
-};
-
-TrackMappings.prototype.find = function find (state) {
-    var this$1 = this;
-
-  for (var i = this.seen.length - 1; i >= 0; i--) {
-    var record = this$1.seen[i];
-    if (record.state == state) { return record }
-  }
-};
-
-TrackMappings.prototype.track = function track (old, tr, state) {
-  var found = this.seen.length < 200 ? this.find(old) : null;
-  if (found)
-    { this.seen.push(new TrackedRecord(found, tr.docChanged ? tr.mapping : null, state)); }
-};
-
-TrackMappings.prototype.getMapping = function getMapping (state, appendTo) {
-  var found = this.find(state);
-  if (!found) { return null }
-  var mappings = [];
-  for (var rec = found; rec; rec = rec.prev)
-    { if (rec.mapping) { mappings.push(rec.mapping); } }
-  var result = appendTo || new dist$1.Mapping;
-  for (var i = mappings.length - 1; i >= 0; i--)
-    { result.appendMapping(mappings[i]); }
-  return result
-};
-
-// Track the state of the DOM selection, creating transactions to
-// update the selection state when necessary.
-var SelectionReader = function SelectionReader(view) {
-  var this$1 = this;
-
-  this.view = view;
-
-  // Track the state of the DOM selection.
-  this.lastAnchorNode = this.lastHeadNode = this.lastAnchorOffset = this.lastHeadOffset = null;
-  this.lastSelection = view.state.selection;
-  this.ignoreUpdates = false;
-  this.suppressUpdates = false;
-  this.poller = poller(this);
-
-  view.dom.addEventListener("focus", function () { return this$1.poller.start(hasFocusAndSelection(this$1.view)); });
-  view.dom.addEventListener("blur", function () { return this$1.poller.stop(); });
-
-  if (!view.editable) { this.poller.start(false); }
-};
-
-SelectionReader.prototype.destroy = function destroy () { this.poller.stop(); };
-
-SelectionReader.prototype.poll = function poll (origin) { this.poller.poll(origin); };
-
-SelectionReader.prototype.editableChanged = function editableChanged () {
-  if (!this.view.editable) { this.poller.start(); }
-  else if (!hasFocusAndSelection(this.view)) { this.poller.stop(); }
-};
-
-// : () → bool
-// Whether the DOM selection has changed from the last known state.
-SelectionReader.prototype.domChanged = function domChanged () {
-  var sel = this.view.root.getSelection();
-  return sel.anchorNode != this.lastAnchorNode || sel.anchorOffset != this.lastAnchorOffset ||
-    sel.focusNode != this.lastHeadNode || sel.focusOffset != this.lastHeadOffset
-};
-
-// Store the current state of the DOM selection.
-SelectionReader.prototype.storeDOMState = function storeDOMState (selection) {
-  var sel = this.view.root.getSelection();
-  this.lastAnchorNode = sel.anchorNode; this.lastAnchorOffset = sel.anchorOffset;
-  this.lastHeadNode = sel.focusNode; this.lastHeadOffset = sel.focusOffset;
-  this.lastSelection = selection;
-};
-
-SelectionReader.prototype.clearDOMState = function clearDOMState () {
-  this.lastAnchorNode = this.lastSelection = null;
-};
-
-// : (?string)
-// When the DOM selection changes in a notable manner, modify the
-// current selection state to match.
-SelectionReader.prototype.readFromDOM = function readFromDOM (origin) {
-  if (this.ignoreUpdates || !this.domChanged() || !hasFocusAndSelection(this.view)) { return }
-  if (this.suppressUpdates) { return selectionToDOM(this.view) }
-  if (!this.view.inDOMChange) { this.view.domObserver.flush(); }
-  if (this.view.inDOMChange) { return }
-
-  var domSel = this.view.root.getSelection(), doc = this.view.state.doc;
-  var nearestDesc = this.view.docView.nearestDesc(domSel.focusNode), inWidget = nearestDesc && nearestDesc.size == 0;
-  var head = this.view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset);
-  var $head = doc.resolve(head), $anchor, selection;
-  if (selectionCollapsed(domSel)) {
-    $anchor = $head;
-    while (nearestDesc && !nearestDesc.node) { nearestDesc = nearestDesc.parent; }
-    if (nearestDesc && nearestDesc.node.isAtom && dist$2.NodeSelection.isSelectable(nearestDesc.node) && nearestDesc.parent) {
-      var pos = nearestDesc.posBefore;
-      selection = new dist$2.NodeSelection(head == pos ? $head : doc.resolve(pos));
-    }
-  } else {
-    $anchor = doc.resolve(this.view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset));
-  }
-
-  if (!selection) {
-    var bias = origin == "pointer" || (this.view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;
-    selection = selectionBetween(this.view, $anchor, $head, bias);
-  }
-  if (!this.view.state.selection.eq(selection)) {
-    var tr = this.view.state.tr.setSelection(selection);
-    if (origin == "pointer") { tr.setMeta("pointer", true); }
-    this.view.dispatch(tr);
-  } else {
-    selectionToDOM(this.view);
-  }
-};
-
-// There's two polling models. On browsers that support the
-// selectionchange event (everything except Firefox < 52, basically), we
-// register a listener for that whenever the editor is focused.
-var SelectionChangePoller = function SelectionChangePoller(reader) {
-  var this$1 = this;
-
-  this.listening = false;
-  this.curOrigin = null;
-  this.originTime = 0;
-  this.reader = reader;
-
-  this.readFunc = function () { return reader.readFromDOM(this$1.originTime > Date.now() - 50 ? this$1.curOrigin : null); };
-};
-
-SelectionChangePoller.prototype.poll = function poll (origin) {
-  this.curOrigin = origin;
-  this.originTime = Date.now();
-};
-
-SelectionChangePoller.prototype.start = function start (andRead) {
-  if (!this.listening) {
-    var doc = this.reader.view.dom.ownerDocument;
-    doc.addEventListener("selectionchange", this.readFunc);
-    this.listening = true;
-    if (andRead) { this.readFunc(); }
-  }
-};
-
-SelectionChangePoller.prototype.stop = function stop () {
-  if (this.listening) {
-    var doc = this.reader.view.dom.ownerDocument;
-    doc.removeEventListener("selectionchange", this.readFunc);
-    this.listening = false;
-  }
-};
-
-// On Browsers that don't support the selectionchange event,
-// we use timeout-based polling.
-var TimeoutPoller = function TimeoutPoller(reader) {
-  // The timeout ID for the poller when active.
-  this.polling = null;
-  this.reader = reader;
-  this.pollFunc = this.doPoll.bind(this, null);
-};
-
-TimeoutPoller.prototype.doPoll = function doPoll (origin) {
-  var view = this.reader.view;
-  if (view.focused || !view.editable) {
-    this.reader.readFromDOM(origin);
-    this.polling = setTimeout(this.pollFunc, 100);
-  } else {
-    this.polling = null;
-  }
-};
-
-TimeoutPoller.prototype.poll = function poll (origin) {
-  clearTimeout(this.polling);
-  this.polling = setTimeout(origin ? this.doPoll.bind(this, origin) : this.pollFunc, 0);
-};
-
-TimeoutPoller.prototype.start = function start () {
-  if (this.polling == null) { this.poll(); }
-};
-
-TimeoutPoller.prototype.stop = function stop () {
-  clearTimeout(this.polling);
-  this.polling = null;
-};
-
-function poller(reader) {
-  return new ("onselectionchange" in document ? SelectionChangePoller : TimeoutPoller)(reader)
-}
-
-function selectionToDOM(view, takeFocus) {
-  var sel = view.state.selection;
-  syncNodeSelection(view, sel);
-
-  if (view.editable && !view.hasFocus()) {
-    if (!takeFocus) { return }
-    // See https://bugzilla.mozilla.org/show_bug.cgi?id=921444
-    if (result.gecko && result.gecko_version <= 55) {
-      view.selectionReader.ignoreUpdates = true;
-      view.dom.focus();
-      view.selectionReader.ignoreUpdates = false;
-    }
-  } else if (!view.editable && !hasSelection(view) && !takeFocus) {
-    return
-  }
-
-  var reader = view.selectionReader;
-  if (reader.lastSelection && reader.lastSelection.eq(sel) && !reader.domChanged()) { return }
-
-  reader.ignoreUpdates = true;
-
-  if (view.cursorWrapper) {
-    selectCursorWrapper(view);
-  } else {
-    var anchor = sel.anchor;
-    var head = sel.head;
-    var resetEditableFrom, resetEditableTo;
-    if (brokenSelectBetweenUneditable && !(sel instanceof dist$2.TextSelection)) {
-      if (!sel.$from.parent.inlineContent)
-        { resetEditableFrom = temporarilyEditableNear(view, sel.from); }
-      if (!sel.empty && !sel.$from.parent.inlineContent)
-        { resetEditableTo = temporarilyEditableNear(view, sel.to); }
-    }
-    view.docView.setSelection(anchor, head, view.root);
-    if (brokenSelectBetweenUneditable) {
-      if (resetEditableFrom) { resetEditableFrom.contentEditable = "false"; }
-      if (resetEditableTo) { resetEditableTo.contentEditable = "false"; }
-    }
-    if (sel.visible) {
-      view.dom.classList.remove("ProseMirror-hideselection");
-    } else if (anchor != head) {
-      view.dom.classList.add("ProseMirror-hideselection");
-      if ("onselectionchange" in document) { removeClassOnSelectionChange(view); }
-    }
-  }
-
-  reader.storeDOMState(sel);
-  reader.ignoreUpdates = false;
-}
-
-// Kludge to work around Webkit not allowing a selection to start/end
-// between non-editable block nodes. We briefly make something
-// editable, set the selection, then set it uneditable again.
-
-var brokenSelectBetweenUneditable = result.safari || result.chrome && result.chrome_version < 63;
-
-function temporarilyEditableNear(view, pos) {
-  var ref = view.docView.domFromPos(pos);
-  var node = ref.node;
-  var offset = ref.offset;
-  var after = offset < node.childNodes.length ? node.childNodes[offset] : null;
-  var before = offset ? node.childNodes[offset - 1] : null;
-  if ((!after || after.contentEditable == "false") && (!before || before.contentEditable == "false")) {
-    if (after) {
-      after.contentEditable = "true";
-      return after
-    } else if (before) {
-      before.contentEditable = "true";
-      return before
-    }
-  }
-}
-
-function removeClassOnSelectionChange(view) {
-  var doc = view.dom.ownerDocument;
-  doc.removeEventListener("selectionchange", view.hideSelectionGuard);
-  var domSel = view.root.getSelection();
-  var node = domSel.anchorNode, offset = domSel.anchorOffset;
-  doc.addEventListener("selectionchange", view.hideSelectionGuard = function () {
-    if (domSel.anchorNode != node || domSel.anchorOffset != offset) {
-      doc.removeEventListener("selectionchange", view.hideSelectionGuard);
-      view.dom.classList.remove("ProseMirror-hideselection");
-    }
-  });
-}
-
-function selectCursorWrapper(view) {
-  var domSel = view.root.getSelection(), range = document.createRange();
-  var node = view.cursorWrapper.dom;
-  range.setEnd(node, node.childNodes.length);
-  range.collapse(false);
-  domSel.removeAllRanges();
-  domSel.addRange(range);
-  // Kludge to kill 'control selection' in IE11 when selecting an
-  // invisible cursor wrapper, since that would result in those weird
-  // resize handles and a selection that considers the absolutely
-  // positioned wrapper, rather than the root editable node, the
-  // focused element.
-  if (!view.state.selection.visible && result.ie && result.ie_version <= 11) {
-    node.disabled = true;
-    node.disabled = false;
-  }
-}
-
-function syncNodeSelection(view, sel) {
-  if (sel instanceof dist$2.NodeSelection) {
-    var desc = view.docView.descAt(sel.from);
-    if (desc != view.lastSelectedViewDesc) {
-      clearNodeSelection(view);
-      if (desc) { desc.selectNode(); }
-      view.lastSelectedViewDesc = desc;
-    }
-  } else {
-    clearNodeSelection(view);
-  }
-}
-
-// Clear all DOM statefulness of the last node selection.
-function clearNodeSelection(view) {
-  if (view.lastSelectedViewDesc) {
-    view.lastSelectedViewDesc.deselectNode();
-    view.lastSelectedViewDesc = null;
-  }
-}
-
-function selectionBetween(view, $anchor, $head, bias) {
-  return view.someProp("createSelectionBetween", function (f) { return f(view, $anchor, $head); })
-    || dist$2.TextSelection.between($anchor, $head, bias)
-}
-
-function hasFocusAndSelection(view) {
-  if (view.editable && view.root.activeElement != view.dom) { return false }
-  return hasSelection(view)
-}
-
-function hasSelection(view) {
-  var sel = view.root.getSelection();
-  if (!sel.anchorNode) { return false }
-  try {
-    // Firefox will raise 'permission denied' errors when accessing
-    // properties of `sel.anchorNode` when it's in a generated CSS
-    // element.
-    return view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode)
-  } catch(_) {
-    return false
-  }
-}
-
-function nonInclusiveMark(mark) {
-  return mark.type.spec.inclusive === false
-}
-
-function needsCursorWrapper(state) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  var visible = ref.visible;
-  var $pos = $head.pos == $anchor.pos && (!visible || $head.parent.inlineContent) ? $head : null;
-  if ($pos && (!visible || state.storedMarks || $pos.parent.content.length == 0 ||
-               $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.some(nonInclusiveMark)))
-    { return $pos }
-  else
-    { return null }
-}
-
-var DOMChange = function DOMChange(view, composing) {
-  var this$1 = this;
-
-  this.view = view;
-  this.state = view.state;
-  this.composing = composing;
-  this.from = this.to = null;
-  this.typeOver = false;
-  this.timeout = composing ? null : setTimeout(function () { return this$1.finish(); }, DOMChange.commitTimeout);
-  this.trackMappings = new TrackMappings(view.state);
-
-  // If there have been changes since this DOM update started, we must
-  // map our start and end positions, as well as the new selection
-  // positions, through them. This tracks that mapping.
-  this.mapping = new dist$1.Mapping;
-  this.mappingTo = view.state;
-};
-
-DOMChange.prototype.addRange = function addRange (from, to) {
-  if (this.from == null) {
-    this.from = from;
-    this.to = to;
-  } else {
-    this.from = Math.min(from, this.from);
-    this.to = Math.max(to, this.to);
-  }
-};
-
-DOMChange.prototype.changedRange = function changedRange () {
-  if (this.from == null) { return rangeAroundSelection(this.state.selection) }
-  var $from = this.state.doc.resolve(Math.min(this.from, this.state.selection.from)), $to = this.state.doc.resolve(this.to);
-  var shared = $from.sharedDepth(this.to);
-  return {from: $from.before(shared + 1), to: $to.after(shared + 1)}
-};
-
-DOMChange.prototype.markDirty = function markDirty (range) {
-  if (this.from == null) { this.view.docView.markDirty((range = range || this.changedRange()).from, range.to); }
-  else { this.view.docView.markDirty(this.from, this.to); }
-};
-
-DOMChange.prototype.stateUpdated = function stateUpdated (state) {
-  if (this.trackMappings.getMapping(state, this.mapping)) {
-    this.trackMappings.destroy();
-    this.trackMappings = new TrackMappings(state);
-    this.mappingTo = state;
-    return true
-  } else {
-    this.markDirty();
-    this.destroy();
-    return false
-  }
-};
-
-DOMChange.prototype.finish = function finish (force) {
-  clearTimeout(this.timeout);
-  if (this.composing && !force) { return }
-  this.view.domObserver.flush();
-  var range = this.changedRange();
-  this.markDirty(range);
-
-  this.destroy();
-  var sel = this.state.selection, allowTypeOver = this.typeOver && sel instanceof dist$2.TextSelection &&
-      !sel.empty && sel.$head.sameParent(sel.$anchor);
-  readDOMChange(this.view, this.mapping, this.state, range, allowTypeOver);
-
-  // If the reading didn't result in a view update, force one by
-  // resetting the view to its current state.
-  if (this.view.docView.dirty) { this.view.updateState(this.view.state); }
-};
-
-DOMChange.prototype.destroy = function destroy () {
-  clearTimeout(this.timeout);
-  this.trackMappings.destroy();
-  this.view.inDOMChange = null;
-};
-
-DOMChange.prototype.compositionEnd = function compositionEnd () {
-    var this$1 = this;
-
-  if (this.composing) {
-    this.composing = false;
-    this.timeout = setTimeout(function () { return this$1.finish(); }, 50);
-  }
-};
-
-DOMChange.start = function start (view, composing) {
-  if (view.inDOMChange) {
-    if (composing) {
-      clearTimeout(view.inDOMChange.timeout);
-      view.inDOMChange.composing = true;
-    }
-  } else {
-    view.inDOMChange = new DOMChange(view, composing);
-  }
-  return view.inDOMChange
-};
-DOMChange.commitTimeout = 20;
-
-// Note that all referencing and parsing is done with the
-// start-of-operation selection and document, since that's the one
-// that the DOM represents. If any changes came in in the meantime,
-// the modification is mapped over those before it is applied, in
-// readDOMChange.
-
-function parseBetween(view, oldState, range) {
-  var ref = view.docView.parseRange(range.from, range.to);
-  var parent = ref.node;
-  var fromOffset = ref.fromOffset;
-  var toOffset = ref.toOffset;
-  var from = ref.from;
-  var to = ref.to;
-
-  var domSel = view.root.getSelection(), find = null, anchor = domSel.anchorNode;
-  if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {
-    find = [{node: anchor, offset: domSel.anchorOffset}];
-    if (!selectionCollapsed(domSel))
-      { find.push({node: domSel.focusNode, offset: domSel.focusOffset}); }
-  }
-  // Work around issue in Chrome where backspacing sometimes replaces
-  // the deleted content with a random BR node (issues #799, #831)
-  if (result.chrome && view.lastKeyCode === 8) {
-    for (var off = toOffset; off > fromOffset; off--) {
-      var node = parent.childNodes[off - 1], desc = node.pmViewDesc;
-      if (node.nodeType == "BR" && !desc) { toOffset = off; break }
-      if (!desc || desc.size) { break }
-    }
-  }
-  var startDoc = oldState.doc;
-  var parser = view.someProp("domParser") || dist.DOMParser.fromSchema(view.state.schema);
-  var $from = startDoc.resolve(from);
-  var sel = null, doc = parser.parse(parent, {
-    topNode: $from.parent,
-    topMatch: $from.parent.contentMatchAt($from.index()),
-    topOpen: true,
-    from: fromOffset,
-    to: toOffset,
-    preserveWhitespace: $from.parent.type.spec.code ? "full" : true,
-    editableContent: true,
-    findPositions: find,
-    ruleFromNode: ruleFromNode(parser, $from),
-    context: $from
-  });
-  if (find && find[0].pos != null) {
-    var anchor$1 = find[0].pos, head = find[1] && find[1].pos;
-    if (head == null) { head = anchor$1; }
-    sel = {anchor: anchor$1 + from, head: head + from};
-  }
-  return {doc: doc, sel: sel, from: from, to: to}
-}
-
-function ruleFromNode(parser, context) {
-  return function (dom) {
-    var desc = dom.pmViewDesc;
-    if (desc) {
-      return desc.parseRule()
-    } else if (dom.nodeName == "BR" && dom.parentNode) {
-      // Safari replaces the list item with a BR directly in the list node (?!) if you delete the last character in a list item (#708)
-      if (result.safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName))
-        { return parser.matchTag(document.createElement("li"), context) }
-      else if (dom.parentNode.lastChild == dom)
-        { return {ignore: true} }
-    }
-  }
-}
-
-function isAtEnd($pos, depth) {
-  for (var i = depth || 0; i < $pos.depth; i++)
-    { if ($pos.index(i) + 1 < $pos.node(i).childCount) { return false } }
-  return $pos.parentOffset == $pos.parent.content.size
-}
-function isAtStart($pos, depth) {
-  for (var i = depth || 0; i < $pos.depth; i++)
-    { if ($pos.index(0) > 0) { return false } }
-  return $pos.parentOffset == 0
-}
-
-function rangeAroundSelection(selection) {
-  // Intentionally uses $head/$anchor because those will correspond to the DOM selection
-  var $from = selection.$anchor.min(selection.$head), $to = selection.$anchor.max(selection.$head);
-
-  if ($from.sameParent($to) && $from.parent.inlineContent && $from.parentOffset && $to.parentOffset < $to.parent.content.size) {
-    var startOff = Math.max(0, $from.parentOffset);
-    var size = $from.parent.content.size;
-    var endOff = Math.min(size, $to.parentOffset);
-
-    if (startOff > 0)
-      { startOff = $from.parent.childBefore(startOff).offset; }
-    if (endOff < size) {
-      var after = $from.parent.childAfter(endOff);
-      endOff = after.offset + after.node.nodeSize;
-    }
-    var nodeStart = $from.start();
-    return {from: nodeStart + startOff, to: nodeStart + endOff}
-  } else {
-    for (var depth = 0;; depth++) {
-      var fromStart = isAtStart($from, depth + 1), toEnd = isAtEnd($to, depth + 1);
-      if (fromStart || toEnd || $from.index(depth) != $to.index(depth) || $to.node(depth).isTextblock) {
-        var from = $from.before(depth + 1), to = $to.after(depth + 1);
-        if (fromStart && $from.index(depth) > 0)
-          { from -= $from.node(depth).child($from.index(depth) - 1).nodeSize; }
-        if (toEnd && $to.index(depth) + 1 < $to.node(depth).childCount)
-          { to += $to.node(depth).child($to.index(depth) + 1).nodeSize; }
-        return {from: from, to: to}
-      }
-    }
-  }
-}
-
-function keyEvent(keyCode, key) {
-  var event = document.createEvent("Event");
-  event.initEvent("keydown", true, true);
-  event.keyCode = keyCode;
-  event.key = event.code = key;
-  return event
-}
-
-function readDOMChange(view, mapping, oldState, range, allowTypeOver) {
-  var parse = parseBetween(view, oldState, range);
-
-  var doc = oldState.doc, compare = doc.slice(parse.from, parse.to);
-  var preferredPos, preferredSide;
-  // Prefer anchoring to end when Backspace is pressed
-  if (view.lastKeyCode === 8 && Date.now() - 100 < view.lastKeyCodeTime) {
-    preferredPos = oldState.selection.to;
-    preferredSide = "end";
-  } else {
-    preferredPos = oldState.selection.from;
-    preferredSide = "start";
-  }
-  view.lastKeyCode = null;
-
-  var change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);
-  if (!change) {
-    if (allowTypeOver) {
-      var state = view.state, sel = state.selection;
-      view.dispatch(state.tr.replaceSelectionWith(state.schema.text(state.doc.textBetween(sel.from, sel.to)), true).scrollIntoView());
-    } else if (parse.sel) {
-      var sel$1 = resolveSelection(view, view.state.doc, mapping, parse.sel);
-      if (sel$1 && !sel$1.eq(view.state.selection)) { view.dispatch(view.state.tr.setSelection(sel$1)); }
-    }
-    return
-  }
-
-  var $from = parse.doc.resolveNoCache(change.start - parse.from);
-  var $to = parse.doc.resolveNoCache(change.endB - parse.from);
-  var nextSel;
-  // If this looks like the effect of pressing Enter, just dispatch an
-  // Enter key instead.
-  if (!$from.sameParent($to) && $from.pos < parse.doc.content.size &&
-      (nextSel = dist$2.Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&
-      nextSel.head == $to.pos &&
-      view.someProp("handleKeyDown", function (f) { return f(view, keyEvent(13, "Enter")); }))
-    { return }
-  // Same for backspace
-  if (oldState.selection.anchor > change.start &&
-      looksLikeJoin(doc, change.start, change.endA, $from, $to) &&
-      view.someProp("handleKeyDown", function (f) { return f(view, keyEvent(8, "Backspace")); })) {
-    if (result.android && result.chrome) { // #820
-      view.selectionReader.suppressUpdates = true;
-      setTimeout(function () { return view.selectionReader.suppressUpdates = false; }, 50);
-    }
-    return
-  }
-
-  var from = mapping.map(change.start), to = mapping.map(change.endA, -1);
-
-  var tr, storedMarks, markChange, $from1;
-  if ($from.sameParent($to) && $from.parent.inlineContent) {
-    if ($from.pos == $to.pos) { // Deletion
-      tr = view.state.tr.delete(from, to);
-      storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));
-    } else if ( // Adding or removing a mark
-      change.endA == change.endB && ($from1 = doc.resolve(change.start)) &&
-      (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset),
-                                 $from1.parent.content.cut($from1.parentOffset, change.endA - $from1.start())))
-    ) {
-      tr = view.state.tr;
-      if (markChange.type == "add") { tr.addMark(from, to, markChange.mark); }
-      else { tr.removeMark(from, to, markChange.mark); }
-    } else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {
-      // Both positions in the same text node -- simply insert text
-      var text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);
-      if (view.someProp("handleTextInput", function (f) { return f(view, from, to, text); })) { return }
-      tr = view.state.tr.insertText(text, from, to);
-    }
-  }
-
-  if (!tr)
-    { tr = view.state.tr.replace(from, to, parse.doc.slice(change.start - parse.from, change.endB - parse.from)); }
-  if (parse.sel) {
-    var sel$2 = resolveSelection(view, tr.doc, mapping, parse.sel);
-    if (sel$2) { tr.setSelection(sel$2); }
-  }
-  if (storedMarks) { tr.ensureMarks(storedMarks); }
-  view.dispatch(tr.scrollIntoView());
-}
-
-function resolveSelection(view, doc, mapping, parsedSel) {
-  if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size) { return null }
-  return selectionBetween(view, doc.resolve(mapping.map(parsedSel.anchor)),
-                          doc.resolve(mapping.map(parsedSel.head)))
-}
-
-// : (Fragment, Fragment) → ?{mark: Mark, type: string}
-// Given two same-length, non-empty fragments of inline content,
-// determine whether the first could be created from the second by
-// removing or adding a single mark type.
-function isMarkChange(cur, prev) {
-  var curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks;
-  var added = curMarks, removed = prevMarks, type, mark, update;
-  for (var i = 0; i < prevMarks.length; i++) { added = prevMarks[i].removeFromSet(added); }
-  for (var i$1 = 0; i$1 < curMarks.length; i$1++) { removed = curMarks[i$1].removeFromSet(removed); }
-  if (added.length == 1 && removed.length == 0) {
-    mark = added[0];
-    type = "add";
-    update = function (node) { return node.mark(mark.addToSet(node.marks)); };
-  } else if (added.length == 0 && removed.length == 1) {
-    mark = removed[0];
-    type = "remove";
-    update = function (node) { return node.mark(mark.removeFromSet(node.marks)); };
-  } else {
-    return null
-  }
-  var updated = [];
-  for (var i$2 = 0; i$2 < prev.childCount; i$2++) { updated.push(update(prev.child(i$2))); }
-  if (dist.Fragment.from(updated).eq(cur)) { return {mark: mark, type: type} }
-}
-
-function looksLikeJoin(old, start, end, $newStart, $newEnd) {
-  if (!$newStart.parent.isTextblock ||
-      // The content must have shrunk
-      end - start <= $newEnd.pos - $newStart.pos ||
-      // newEnd must point directly at or after the end of the block that newStart points into
-      skipClosingAndOpening($newStart, true, false) < $newEnd.pos)
-    { return false }
-
-  var $start = old.resolve(start);
-  // Start must be at the end of a block
-  if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock)
-    { return false }
-  var $next = old.resolve(skipClosingAndOpening($start, true, true));
-  // The next textblock must start before end and end near it
-  if (!$next.parent.isTextblock || $next.pos > end ||
-      skipClosingAndOpening($next, true, false) < end)
-    { return false }
-
-  // The fragments after the join point must match
-  return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content)
-}
-
-function skipClosingAndOpening($pos, fromEnd, mayOpen) {
-  var depth = $pos.depth, end = fromEnd ? $pos.end() : $pos.pos;
-  while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {
-    depth--;
-    end++;
-    fromEnd = false;
-  }
-  if (mayOpen) {
-    var next = $pos.node(depth).maybeChild($pos.indexAfter(depth));
-    while (next && !next.isLeaf) {
-      next = next.firstChild;
-      end++;
-    }
-  }
-  return end
-}
-
-function findDiff(a, b, pos, preferredPos, preferredSide) {
-  var start = a.findDiffStart(b, pos);
-  if (start == null) { return null }
-  var ref = a.findDiffEnd(b, pos + a.size, pos + b.size);
-  var endA = ref.a;
-  var endB = ref.b;
-  if (preferredSide == "end") {
-    var adjust = Math.max(0, start - Math.min(endA, endB));
-    preferredPos -= endA + adjust - start;
-  }
-  if (endA < start && a.size < b.size) {
-    var move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0;
-    start -= move;
-    endB = start + (endB - endA);
-    endA = start;
-  } else if (endB < start) {
-    var move$1 = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;
-    start -= move$1;
-    endA = start + (endA - endB);
-    endB = start;
-  }
-  return {start: start, endA: endA, endB: endB}
-}
-
-function serializeForClipboard(view, slice) {
-  var context = [];
-  var content = slice.content;
-  var openStart = slice.openStart;
-  var openEnd = slice.openEnd;
-  while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {
-    openStart--;
-    openEnd--;
-    var node = content.firstChild;
-    context.push(node.type.name, node.type.hasRequiredAttrs() ? node.attrs : null);
-    content = node.content;
-  }
-
-  var serializer = view.someProp("clipboardSerializer") || dist.DOMSerializer.fromSchema(view.state.schema);
-  var wrap = document.createElement("div");
-  wrap.appendChild(serializer.serializeFragment(content));
-
-  var firstChild = wrap.firstChild, needsWrap;
-  while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {
-    for (var i = needsWrap.length - 1; i >= 0; i--) {
-      var wrapper = document.createElement(needsWrap[i]);
-      while (wrap.firstChild) { wrapper.appendChild(wrap.firstChild); }
-      wrap.appendChild(wrapper);
-    }
-    firstChild = wrap.firstChild;
-  }
-
-  if (firstChild && firstChild.nodeType == 1)
-    { firstChild.setAttribute("data-pm-slice", (openStart + " " + openEnd + " " + (JSON.stringify(context)))); }
-
-  var text = view.someProp("clipboardTextSerializer", function (f) { return f(slice); }) ||
-      slice.content.textBetween(0, slice.content.size, "\n\n");
-
-  return {dom: wrap, text: text}
-}
-
-// : (EditorView, string, string, ?bool, ResolvedPos) → ?Slice
-// Read a slice of content from the clipboard (or drop data).
-function parseFromClipboard(view, text, html, plainText, $context) {
-  var dom, inCode = $context.parent.type.spec.code, slice;
-  if (!html && !text) { return null }
-  if ((plainText || inCode || !html) && text) {
-    view.someProp("transformPastedText", function (f) { text = f(text); });
-    if (inCode) { return new dist.Slice(dist.Fragment.from(view.state.schema.text(text)), 0, 0) }
-    var parsed = view.someProp("clipboardTextParser", function (f) { return f(text, $context); });
-    if (parsed) {
-      slice = parsed;
-    } else {
-      dom = document.createElement("div");
-      text.trim().split(/(?:\r\n?|\n)+/).forEach(function (block) {
-        dom.appendChild(document.createElement("p")).textContent = block;
-      });
-    }
-  } else {
-    view.someProp("transformPastedHTML", function (f) { return html = f(html); });
-    dom = readHTML(html);
-  }
-
-  if (!slice) {
-    var parser = view.someProp("clipboardParser") || view.someProp("domParser") || dist.DOMParser.fromSchema(view.state.schema);
-    slice = parser.parseSlice(dom, {preserveWhitespace: true, context: $context});
-  }
-  var contextNode = dom && dom.querySelector("[data-pm-slice]");
-  var sliceData = contextNode && /^(\d+) (\d+) (.*)/.exec(contextNode.getAttribute("data-pm-slice"));
-  if (sliceData)
-    { slice = addContext(new dist.Slice(slice.content, Math.min(slice.openStart, +sliceData[1]),
-                                 Math.min(slice.openEnd, +sliceData[2])), sliceData[3]); }
-  else // HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent
-    { slice = dist.Slice.maxOpen(normalizeSiblings(slice.content, $context), false); }
-  view.someProp("transformPasted", function (f) { slice = f(slice); });
-  return slice
-}
-
-// Takes a slice parsed with parseSlice, which means there hasn't been
-// any content-expression checking done on the top nodes, tries to
-// find a parent node in the current context that might fit the nodes,
-// and if successful, rebuilds the slice so that it fits into that parent.
-//
-// This addresses the problem that Transform.replace expects a
-// coherent slice, and will fail to place a set of siblings that don't
-// fit anywhere in the schema.
-function normalizeSiblings(fragment, $context) {
-  if (fragment.childCount < 2) { return fragment }
-  var loop = function ( d ) {
-    var parent = $context.node(d);
-    var match = parent.contentMatchAt($context.index(d));
-    var lastWrap = (void 0), result = [];
-    fragment.forEach(function (node) {
-      if (!result) { return }
-      var wrap = match.findWrapping(node.type), inLast;
-      if (!wrap) { return result = null }
-      if (inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0)) {
-        result[result.length - 1] = inLast;
-      } else {
-        if (result.length) { result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length); }
-        var wrapped = withWrappers(node, wrap);
-        result.push(wrapped);
-        match = match.matchType(wrapped.type, wrapped.attrs);
-        lastWrap = wrap;
-      }
-    });
-    if (result) { return { v: dist.Fragment.from(result) } }
-  };
-
-  for (var d = $context.depth; d >= 0; d--) {
-    var returned = loop( d );
-
-    if ( returned ) { return returned.v; }
-  }
-  return fragment
-}
-
-function withWrappers(node, wrap, from) {
-  if ( from === void 0 ) { from = 0; }
-
-  for (var i = wrap.length - 1; i >= from; i--)
-    { node = wrap[i].create(null, dist.Fragment.from(node)); }
-  return node
-}
-
-// Used to group adjacent nodes wrapped in similar parents by
-// normalizeSiblings into the same parent node
-function addToSibling(wrap, lastWrap, node, sibling, depth) {
-  if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {
-    var inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);
-    if (inner) { return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner)) }
-    var match = sibling.contentMatchAt(sibling.childCount);
-    if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1]))
-      { return sibling.copy(sibling.content.append(dist.Fragment.from(withWrappers(node, wrap, depth + 1)))) }
-  }
-}
-
-function closeRight(node, depth) {
-  if (depth == 0) { return node }
-  var fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));
-  var fill = node.contentMatchAt(node.childCount).fillBefore(dist.Fragment.empty, true);
-  return node.copy(fragment.append(fill))
-}
-
-// Trick from jQuery -- some elements must be wrapped in other
-// elements for innerHTML to work. I.e. if you do `div.innerHTML =
-// "<td>..</td>"` the table cells are ignored.
-var wrapMap = {thead: ["table"], colgroup: ["table"], col: ["table", "colgroup"],
-                 tr: ["table", "tbody"], td: ["table", "tbody", "tr"], th: ["table", "tbody", "tr"]};
-var detachedDoc = null;
-function readHTML(html) {
-  var metas = /(\s*<meta [^>]*>)*/.exec(html);
-  if (metas) { html = html.slice(metas[0].length); }
-  var doc = detachedDoc || (detachedDoc = document.implementation.createHTMLDocument("title"));
-  var elt = doc.createElement("div");
-  var firstTag = /(?:<meta [^>]*>)*<([a-z][^>\s]+)/i.exec(html), wrap, depth = 0;
-  if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()]) {
-    html = wrap.map(function (n) { return "<" + n + ">"; }).join("") + html + wrap.map(function (n) { return "</" + n + ">"; }).reverse().join("");
-    depth = wrap.length;
-  }
-  elt.innerHTML = html;
-  for (var i = 0; i < depth; i++) { elt = elt.firstChild; }
-  return elt
-}
-
-function addContext(slice, context) {
-  if (!slice.size) { return slice }
-  var schema = slice.content.firstChild.type.schema, array;
-  try { array = JSON.parse(context); }
-  catch(e) { return slice }
-  var content = slice.content;
-  var openStart = slice.openStart;
-  var openEnd = slice.openEnd;
-  for (var i = array.length - 2; i >= 0; i -= 2) {
-    var type = schema.nodes[array[i]];
-    if (!type || type.hasRequiredAttrs()) { break }
-    content = dist.Fragment.from(type.create(array[i + 1], content));
-    openStart++; openEnd++;
-  }
-  return new dist.Slice(content, openStart, openEnd)
-}
-
-var observeOptions = {childList: true, characterData: true, attributes: true, subtree: true, characterDataOldValue: true};
-// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified
-var useCharData = result.ie && result.ie_version <= 11;
-
-var DOMObserver = function DOMObserver(view) {
-  var this$1 = this;
-
-  this.view = view;
-  this.observer = window.MutationObserver &&
-    new window.MutationObserver(function (mutations) { return this$1.registerMutations(mutations); });
-  if (useCharData)
-    { this.onCharData = function (e) { return this$1.registerMutation({target: e.target, type: "characterData", oldValue: e.prevValue}); }; }
-};
-
-DOMObserver.prototype.start = function start () {
-  if (this.observer)
-    { this.observer.observe(this.view.dom, observeOptions); }
-  if (useCharData)
-    { this.view.dom.addEventListener("DOMCharacterDataModified", this.onCharData); }
-};
-
-DOMObserver.prototype.stop = function stop () {
-  if (this.observer) {
-    this.flush();
-    this.observer.disconnect();
-  }
-  if (useCharData)
-    { this.view.dom.removeEventListener("DOMCharacterDataModified", this.onCharData); }
-};
-
-DOMObserver.prototype.flush = function flush () {
-  if (this.observer)
-    { this.registerMutations(this.observer.takeRecords()); }
-};
-
-DOMObserver.prototype.registerMutations = function registerMutations (mutations) {
-    var this$1 = this;
-
-  for (var i = 0; i < mutations.length; i++)
-    { this$1.registerMutation(mutations[i]); }
-};
-
-DOMObserver.prototype.registerMutation = function registerMutation (mut) {
-  if (!this.view.editable) { return }
-  var desc = this.view.docView.nearestDesc(mut.target);
-  if (mut.type == "attributes" &&
-      (desc == this.view.docView || mut.attributeName == "contenteditable")) { return }
-  if (!desc || desc.ignoreMutation(mut)) { return }
-
-  var from, to;
-  if (mut.type == "childList") {
-    var fromOffset = mut.previousSibling && mut.previousSibling.parentNode == mut.target
-        ? domIndex(mut.previousSibling) + 1 : 0;
-    if (fromOffset == -1) { return }
-    from = desc.localPosFromDOM(mut.target, fromOffset, -1);
-    var toOffset = mut.nextSibling && mut.nextSibling.parentNode == mut.target
-        ? domIndex(mut.nextSibling) : mut.target.childNodes.length;
-    if (toOffset == -1) { return }
-    to = desc.localPosFromDOM(mut.target, toOffset, 1);
-  } else if (mut.type == "attributes") {
-    from = desc.posAtStart - desc.border;
-    to = desc.posAtEnd + desc.border;
-  } else { // "characterData"
-    from = desc.posAtStart;
-    to = desc.posAtEnd;
-    // An event was generated for a text change that didn't change
-    // any text. Mark the dom change to fall back to assuming the
-    // selection was typed over with an identical value if it can't
-    // find another change.
-    if (mut.target.nodeValue == mut.oldValue) { DOMChange.start(this.view).typeOver = true; }
-  }
-
-  DOMChange.start(this.view).addRange(from, to);
-};
-
-// A collection of DOM events that occur within the editor, and callback functions
-// to invoke when the event fires.
-var handlers = {};
-var editHandlers = {};
-
-function initInput(view) {
-  view.shiftKey = false;
-  view.mouseDown = null;
-  view.inDOMChange = null;
-  view.lastKeyCode = null;
-  view.lastKeyCodeTime = 0;
-  view.domObserver = new DOMObserver(view);
-  view.domObserver.start();
-
-  view.eventHandlers = Object.create(null);
-  var loop = function ( event ) {
-    var handler = handlers[event];
-    view.dom.addEventListener(event, view.eventHandlers[event] = function (event) {
-      if (eventBelongsToView(view, event) && !runCustomHandler(view, event) &&
-          (view.editable || !(event.type in editHandlers)))
-        { handler(view, event); }
-    });
-  };
-
-  for (var event in handlers) { loop( event ); }
-  ensureListeners(view);
-}
-
-function destroyInput(view) {
-  view.domObserver.stop();
-  if (view.inDOMChange) { view.inDOMChange.destroy(); }
-  for (var type in view.eventHandlers)
-    { view.dom.removeEventListener(type, view.eventHandlers[type]); }
-}
-
-function ensureListeners(view) {
-  view.someProp("handleDOMEvents", function (currentHandlers) {
-    for (var type in currentHandlers) { if (!view.eventHandlers[type])
-      { view.dom.addEventListener(type, view.eventHandlers[type] = function (event) { return runCustomHandler(view, event); }); } }
-  });
-}
-
-function runCustomHandler(view, event) {
-  return view.someProp("handleDOMEvents", function (handlers) {
-    var handler = handlers[event.type];
-    return handler ? handler(view, event) || event.defaultPrevented : false
-  })
-}
-
-function eventBelongsToView(view, event) {
-  if (!event.bubbles) { return true }
-  if (event.defaultPrevented) { return false }
-  for (var node = event.target; node != view.dom; node = node.parentNode)
-    { if (!node || node.nodeType == 11 ||
-        (node.pmViewDesc && node.pmViewDesc.stopEvent(event)))
-      { return false } }
-  return true
-}
-
-function dispatchEvent(view, event) {
-  if (!runCustomHandler(view, event) && handlers[event.type] &&
-      (view.editable || !(event.type in editHandlers)))
-    { handlers[event.type](view, event); }
-}
-
-editHandlers.keydown = function (view, event) {
-  view.shiftKey = event.keyCode == 16 || event.shiftKey;
-  if (view.inDOMChange) {
-    if (view.inDOMChange.composing) { return }
-    view.inDOMChange.finish();
-  }
-  view.lastKeyCode = event.keyCode;
-  view.lastKeyCodeTime = Date.now();
-  if (view.someProp("handleKeyDown", function (f) { return f(view, event); }) || captureKeyDown(view, event))
-    { event.preventDefault(); }
-  else
-    { view.selectionReader.poll(); }
-};
-
-editHandlers.keyup = function (view, e) {
-  if (e.keyCode == 16) { view.shiftKey = false; }
-};
-
-editHandlers.keypress = function (view, event) {
-  if (view.inDOMChange || !event.charCode ||
-      event.ctrlKey && !event.altKey || result.mac && event.metaKey) { return }
-
-  if (view.someProp("handleKeyPress", function (f) { return f(view, event); })) {
-    event.preventDefault();
-    return
-  }
-
-  var sel = view.state.selection;
-  if (!(sel instanceof dist$2.TextSelection) || !sel.$from.sameParent(sel.$to)) {
-    var text = String.fromCharCode(event.charCode);
-    if (!view.someProp("handleTextInput", function (f) { return f(view, sel.$from.pos, sel.$to.pos, text); }))
-      { view.dispatch(view.state.tr.insertText(text).scrollIntoView()); }
-    event.preventDefault();
-  }
-};
-
-function eventCoords(event) { return {left: event.clientX, top: event.clientY} }
-
-var lastClick = {time: 0, x: 0, y: 0};
-var oneButLastClick = lastClick;
-
-function isNear(event, click) {
-  var dx = click.x - event.clientX, dy = click.y - event.clientY;
-  return dx * dx + dy * dy < 100
-}
-
-function runHandlerOnContext(view, propName, pos, inside, event) {
-  if (inside == -1) { return false }
-  var $pos = view.state.doc.resolve(inside);
-  var loop = function ( i ) {
-    if (view.someProp(propName, function (f) { return i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true)
-                                                    : f(view, pos, $pos.node(i), $pos.before(i), event, false); }))
-      { return { v: true } }
-  };
-
-  for (var i = $pos.depth + 1; i > 0; i--) {
-    var returned = loop( i );
-
-    if ( returned ) { return returned.v; }
-  }
-  return false
-}
-
-function updateSelection(view, selection, origin) {
-  if (!view.focused) { view.focus(); }
-  var tr = view.state.tr.setSelection(selection);
-  if (origin == "pointer") { tr.setMeta("pointer", true); }
-  view.dispatch(tr);
-}
-
-function selectClickedLeaf(view, inside) {
-  if (inside == -1) { return false }
-  var $pos = view.state.doc.resolve(inside), node = $pos.nodeAfter;
-  if (node && node.isAtom && dist$2.NodeSelection.isSelectable(node)) {
-    updateSelection(view, new dist$2.NodeSelection($pos), "pointer");
-    return true
-  }
-  return false
-}
-
-function selectClickedNode(view, inside) {
-  if (inside == -1) { return false }
-  var sel = view.state.selection, selectedNode, selectAt;
-  if (sel instanceof dist$2.NodeSelection) { selectedNode = sel.node; }
-
-  var $pos = view.state.doc.resolve(inside);
-  for (var i = $pos.depth + 1; i > 0; i--) {
-    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
-    if (dist$2.NodeSelection.isSelectable(node)) {
-      if (selectedNode && sel.$from.depth > 0 &&
-          i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos)
-        { selectAt = $pos.before(sel.$from.depth); }
-      else
-        { selectAt = $pos.before(i); }
-      break
-    }
-  }
-
-  if (selectAt != null) {
-    updateSelection(view, dist$2.NodeSelection.create(view.state.doc, selectAt), "pointer");
-    return true
-  } else {
-    return false
-  }
-}
-
-function handleSingleClick(view, pos, inside, event, selectNode) {
-  return runHandlerOnContext(view, "handleClickOn", pos, inside, event) ||
-    view.someProp("handleClick", function (f) { return f(view, pos, event); }) ||
-    (selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside))
-}
-
-function handleDoubleClick(view, pos, inside, event) {
-  return runHandlerOnContext(view, "handleDoubleClickOn", pos, inside, event) ||
-    view.someProp("handleDoubleClick", function (f) { return f(view, pos, event); })
-}
-
-function handleTripleClick(view, pos, inside, event) {
-  return runHandlerOnContext(view, "handleTripleClickOn", pos, inside, event) ||
-    view.someProp("handleTripleClick", function (f) { return f(view, pos, event); }) ||
-    defaultTripleClick(view, inside)
-}
-
-function defaultTripleClick(view, inside) {
-  var doc = view.state.doc;
-  if (inside == -1) {
-    if (doc.inlineContent) {
-      updateSelection(view, dist$2.TextSelection.create(doc, 0, doc.content.size), "pointer");
-      return true
-    }
-    return false
-  }
-
-  var $pos = doc.resolve(inside);
-  for (var i = $pos.depth + 1; i > 0; i--) {
-    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
-    var nodePos = $pos.before(i);
-    if (node.inlineContent)
-      { updateSelection(view, dist$2.TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size), "pointer"); }
-    else if (dist$2.NodeSelection.isSelectable(node))
-      { updateSelection(view, dist$2.NodeSelection.create(doc, nodePos), "pointer"); }
-    else
-      { continue }
-    return true
-  }
-}
-
-function forceDOMFlush(view) {
-  if (!view.inDOMChange) { return false }
-  view.inDOMChange.finish(true);
-  return true
-}
-
-var selectNodeModifier = result.mac ? "metaKey" : "ctrlKey";
-
-handlers.mousedown = function (view, event) {
-  view.shiftKey = event.shiftKey;
-  var flushed = forceDOMFlush(view);
-  var now = Date.now(), type;
-  if (now - lastClick.time >= 500 || !isNear(event, lastClick) || event[selectNodeModifier]) { type = "singleClick"; }
-  else if (now - oneButLastClick.time >= 600 || !isNear(event, oneButLastClick)) { type = "doubleClick"; }
-  else { type = "tripleClick"; }
-  oneButLastClick = lastClick;
-  lastClick = {time: now, x: event.clientX, y: event.clientY};
-
-  var pos = view.posAtCoords(eventCoords(event));
-  if (!pos) { return }
-
-  if (type == "singleClick")
-    { view.mouseDown = new MouseDown(view, pos, event, flushed); }
-  else if ((type == "doubleClick" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event))
-    { event.preventDefault(); }
-  else
-    { view.selectionReader.poll("pointer"); }
-};
-
-var MouseDown = function MouseDown(view, pos, event, flushed) {
-  var this$1 = this;
-
-  this.view = view;
-  this.pos = pos;
-  this.event = event;
-  this.flushed = flushed;
-  this.selectNode = event[selectNodeModifier];
-  this.allowDefault = event.shiftKey;
-
-  var targetNode, targetPos;
-  if (pos.inside > -1) {
-    targetNode = view.state.doc.nodeAt(pos.inside);
-    targetPos = pos.inside;
-  } else {
-    var $pos = view.state.doc.resolve(pos.pos);
-    targetNode = $pos.parent;
-    targetPos = $pos.depth ? $pos.before() : 0;
-  }
-
-  this.mightDrag = null;
-  this.target = flushed ? null : event.target;
-  if (targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||
-      view.state.selection instanceof dist$2.NodeSelection && targetPos == view.state.selection.from)
-    { this.mightDrag = {node: targetNode,
-                      pos: targetPos,
-                      addAttr: this.target && !this.target.draggable,
-                      setUneditable: this.target && result.gecko && !this.target.hasAttribute("contentEditable")}; }
-
-  if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {
-    this.view.domObserver.stop();
-    if (this.mightDrag.addAttr) { this.target.draggable = true; }
-    if (this.mightDrag.setUneditable)
-      { setTimeout(function () { return this$1.target.setAttribute("contentEditable", "false"); }, 20); }
-    this.view.domObserver.start();
-  }
-
-  view.root.addEventListener("mouseup", this.up = this.up.bind(this));
-  view.root.addEventListener("mousemove", this.move = this.move.bind(this));
-  view.selectionReader.poll("pointer");
-};
-
-MouseDown.prototype.done = function done () {
-  this.view.root.removeEventListener("mouseup", this.up);
-  this.view.root.removeEventListener("mousemove", this.move);
-  if (this.mightDrag && this.target) {
-    this.view.domObserver.stop();
-    if (this.mightDrag.addAttr) { this.target.draggable = false; }
-    if (this.mightDrag.setUneditable) { this.target.removeAttribute("contentEditable"); }
-    this.view.domObserver.start();
-  }
-  this.view.mouseDown = null;
-};
-
-MouseDown.prototype.up = function up (event) {
-  this.done();
-
-  if (!this.view.dom.contains(event.target.nodeType == 3 ? event.target.parentNode : event.target))
-    { return }
-
-  if (this.allowDefault) {
-    // Force a cursor wrapper redraw if this was suppressed (to avoid an issue with IE drag-selection)
-    if (result.ie && needsCursorWrapper(this.view.state)) { this.view.updateState(this.view.state); }
-    this.view.selectionReader.poll("pointer");
-  } else if (handleSingleClick(this.view, this.pos.pos, this.pos.inside, event, this.selectNode)) {
-    event.preventDefault();
-  } else if (this.flushed) {
-    updateSelection(this.view, dist$2.Selection.near(this.view.state.doc.resolve(this.pos.pos)), "pointer");
-    event.preventDefault();
-  } else {
-    this.view.selectionReader.poll("pointer");
-  }
-};
-
-MouseDown.prototype.move = function move (event) {
-  if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 ||
-                             Math.abs(this.event.y - event.clientY) > 4))
-    { this.allowDefault = true; }
-  this.view.selectionReader.poll("pointer");
-};
-
-handlers.touchdown = function (view) {
-  forceDOMFlush(view);
-  view.selectionReader.poll("pointer");
-};
-
-handlers.contextmenu = function (view) { return forceDOMFlush(view); };
-
-// Input compositions are hard. Mostly because the events fired by
-// browsers are A) very unpredictable and inconsistent, and B) not
-// cancelable.
-//
-// ProseMirror has the problem that it must not update the DOM during
-// a composition, or the browser will cancel it. What it does is keep
-// long-running operations (delayed DOM updates) when a composition is
-// active.
-//
-// We _do not_ trust the information in the composition events which,
-// apart from being very uninformative to begin with, is often just
-// plain wrong. Instead, when a composition ends, we parse the dom
-// around the original selection, and derive an update from that.
-
-editHandlers.compositionstart = editHandlers.compositionupdate = function (view) {
-  DOMChange.start(view, true);
-};
-
-editHandlers.compositionend = function (view, e) {
-  if (!view.inDOMChange) {
-    // We received a compositionend without having seen any previous
-    // events for the composition. If there's data in the event
-    // object, we assume that it's a real change, and start a
-    // composition. Otherwise, we just ignore it.
-    if (e.data) { DOMChange.start(view, true); }
-    else { return }
-  }
-
-  view.inDOMChange.compositionEnd();
-};
-
-editHandlers.input = function (view) {
-  var change = DOMChange.start(view);
-  if (!change.composing) { change.finish(); }
-};
-
-function captureCopy(view, dom) {
-  // The extra wrapper is somehow necessary on IE/Edge to prevent the
-  // content from being mangled when it is put onto the clipboard
-  var doc = dom.ownerDocument;
-  var wrap = doc.body.appendChild(doc.createElement("div"));
-  wrap.appendChild(dom);
-  wrap.style.cssText = "position: fixed; left: -10000px; top: 10px";
-  var sel = getSelection(), range = doc.createRange();
-  range.selectNodeContents(dom);
-  // Done because IE will fire a selectionchange moving the selection
-  // to its start when removeAllRanges is called and the editor still
-  // has focus (which will mess up the editor's selection state).
-  view.dom.blur();
-  sel.removeAllRanges();
-  sel.addRange(range);
-  setTimeout(function () {
-    doc.body.removeChild(wrap);
-    view.focus();
-  }, 50);
-}
-
-// This is very crude, but unfortunately both these browsers _pretend_
-// that they have a clipboard API—all the objects and methods are
-// there, they just don't work, and they are hard to test.
-var brokenClipboardAPI = (result.ie && result.ie_version < 15) ||
-      (result.ios && result.webkit_version < 604);
-
-handlers.copy = editHandlers.cut = function (view, e) {
-  var sel = view.state.selection, cut = e.type == "cut";
-  if (sel.empty) { return }
-
-  // IE and Edge's clipboard interface is completely broken
-  var data = brokenClipboardAPI ? null : e.clipboardData;
-  var slice = sel.content();
-  var ref = serializeForClipboard(view, slice);
-  var dom = ref.dom;
-  var text = ref.text;
-  if (data) {
-    e.preventDefault();
-    data.clearData();
-    data.setData("text/html", dom.innerHTML);
-    data.setData("text/plain", text);
-  } else {
-    captureCopy(view, dom);
-  }
-  if (cut) { view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta("uiEvent", "cut")); }
-};
-
-function sliceSingleNode(slice) {
-  return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null
-}
-
-function capturePaste(view, e) {
-  var doc = view.dom.ownerDocument;
-  var plainText = view.shiftKey || view.state.selection.$from.parent.type.spec.code;
-  var target = doc.body.appendChild(doc.createElement(plainText ? "textarea" : "div"));
-  if (!plainText) { target.contentEditable = "true"; }
-  target.style.cssText = "position: fixed; left: -10000px; top: 10px";
-  target.focus();
-  setTimeout(function () {
-    view.focus();
-    doc.body.removeChild(target);
-    if (plainText) { doPaste(view, target.value, null, e); }
-    else { doPaste(view, target.textContent, target.innerHTML, e); }
-  }, 50);
-}
-
-function doPaste(view, text, html, e) {
-  var slice = parseFromClipboard(view, text, html, view.shiftKey, view.state.selection.$from);
-  if (!slice) { return false }
-
-  if (view.someProp("handlePaste", function (f) { return f(view, e, slice); })) { return true }
-
-  var singleNode = sliceSingleNode(slice);
-  var tr = singleNode ? view.state.tr.replaceSelectionWith(singleNode, view.shiftKey) : view.state.tr.replaceSelection(slice);
-  view.dispatch(tr.scrollIntoView().setMeta("paste", true).setMeta("uiEvent", "paste"));
-  return true
-}
-
-editHandlers.paste = function (view, e) {
-  var data = brokenClipboardAPI ? null : e.clipboardData;
-  if (data && doPaste(view, data.getData("text/plain"), data.getData("text/html"), e))
-    { e.preventDefault(); }
-  else
-    { capturePaste(view, e); }
-};
-
-var Dragging = function Dragging(slice, move) {
-  this.slice = slice;
-  this.move = move;
-};
-
-var dragCopyModifier = result.mac ? "altKey" : "ctrlKey";
-
-handlers.dragstart = function (view, e) {
-  var mouseDown = view.mouseDown;
-  if (mouseDown) { mouseDown.done(); }
-  if (!e.dataTransfer) { return }
-
-  var sel = view.state.selection;
-  var pos = sel.empty ? null : view.posAtCoords(eventCoords(e));
-  if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof dist$2.NodeSelection ? sel.to - 1: sel.to)) ; else if (mouseDown && mouseDown.mightDrag) {
-    view.dispatch(view.state.tr.setSelection(dist$2.NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos)));
-  } else if (e.target && e.target.nodeType == 1) {
-    var desc = view.docView.nearestDesc(e.target, true);
-    if (!desc || !desc.node.type.spec.draggable || desc == view.docView) { return }
-    view.dispatch(view.state.tr.setSelection(dist$2.NodeSelection.create(view.state.doc, desc.posBefore)));
-  }
-  var slice = view.state.selection.content();
-  var ref = serializeForClipboard(view, slice);
-  var dom = ref.dom;
-  var text = ref.text;
-  e.dataTransfer.clearData();
-  e.dataTransfer.setData(brokenClipboardAPI ? "Text" : "text/html", dom.innerHTML);
-  if (!brokenClipboardAPI) { e.dataTransfer.setData("text/plain", text); }
-  view.dragging = new Dragging(slice, !e[dragCopyModifier]);
-};
-
-handlers.dragend = function (view) {
-  window.setTimeout(function () { return view.dragging = null; }, 50);
-};
-
-editHandlers.dragover = editHandlers.dragenter = function (_, e) { return e.preventDefault(); };
-
-editHandlers.drop = function (view, e) {
-  var dragging = view.dragging;
-  view.dragging = null;
-
-  if (!e.dataTransfer) { return }
-
-  var eventPos = view.posAtCoords(eventCoords(e));
-  if (!eventPos) { return }
-  var $mouse = view.state.doc.resolve(eventPos.pos);
-  if (!$mouse) { return }
-  var slice = dragging && dragging.slice ||
-      parseFromClipboard(view, e.dataTransfer.getData(brokenClipboardAPI ? "Text" : "text/plain"),
-                         brokenClipboardAPI ? null : e.dataTransfer.getData("text/html"), false, $mouse);
-  if (!slice) { return }
-
-  e.preventDefault();
-  if (view.someProp("handleDrop", function (f) { return f(view, e, slice, dragging && dragging.move); })) { return }
-  var insertPos = slice ? dist$1.dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;
-  if (insertPos == null) { insertPos = $mouse.pos; }
-
-  var tr = view.state.tr;
-  if (dragging && dragging.move) { tr.deleteSelection(); }
-
-  var pos = tr.mapping.map(insertPos);
-  var isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;
-  var beforeInsert = tr.doc;
-  if (isNode)
-    { tr.replaceRangeWith(pos, pos, slice.content.firstChild); }
-  else
-    { tr.replaceRange(pos, pos, slice); }
-  if (tr.doc.eq(beforeInsert)) { return }
-
-  var $pos = tr.doc.resolve(pos);
-  if (isNode && dist$2.NodeSelection.isSelectable(slice.content.firstChild) &&
-      $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild))
-    { tr.setSelection(new dist$2.NodeSelection($pos)); }
-  else
-    { tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(tr.mapping.map(insertPos)))); }
-  view.focus();
-  view.dispatch(tr.setMeta("uiEvent", "drop"));
-};
-
-handlers.focus = function (view) {
-  if (!view.focused) {
-    view.dom.classList.add("ProseMirror-focused");
-    view.focused = true;
-  }
-};
-
-handlers.blur = function (view) {
-  if (view.focused) {
-    view.dom.classList.remove("ProseMirror-focused");
-    view.focused = false;
-  }
-};
-
-// Make sure all handlers get registered
-for (var prop in editHandlers) { handlers[prop] = editHandlers[prop]; }
-
-function compareObjs(a, b) {
-  if (a == b) { return true }
-  for (var p in a) { if (a[p] !== b[p]) { return false } }
-  for (var p$1 in b) { if (!(p$1 in a)) { return false } }
-  return true
-}
-
-var WidgetType = function WidgetType(toDOM, spec) {
-  this.spec = spec || noSpec;
-  this.side = this.spec.side || 0;
-  this.toDOM = toDOM;
-};
-
-WidgetType.prototype.map = function map (mapping, span, offset, oldOffset) {
-  var ref = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);
-    var pos = ref.pos;
-    var deleted = ref.deleted;
-  return deleted ? null : new Decoration(pos - offset, pos - offset, this)
-};
-
-WidgetType.prototype.valid = function valid () { return true };
-
-WidgetType.prototype.eq = function eq (other) {
-  return this == other ||
-    (other instanceof WidgetType &&
-     (this.spec.key && this.spec.key == other.spec.key ||
-      this.toDOM == other.toDOM && compareObjs(this.spec, other.spec)))
-};
-
-var InlineType = function InlineType(attrs, spec) {
-  this.spec = spec || noSpec;
-  this.attrs = attrs;
-};
-
-InlineType.prototype.map = function map (mapping, span, offset, oldOffset) {
-  var from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;
-  var to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;
-  return from >= to ? null : new Decoration(from, to, this)
-};
-
-InlineType.prototype.valid = function valid (_, span) { return span.from < span.to };
-
-InlineType.prototype.eq = function eq (other) {
-  return this == other ||
-    (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&
-     compareObjs(this.spec, other.spec))
-};
-
-InlineType.is = function is (span) { return span.type instanceof InlineType };
-
-var NodeType = function NodeType(attrs, spec) {
-  this.spec = spec || noSpec;
-  this.attrs = attrs;
-};
-
-NodeType.prototype.map = function map (mapping, span, offset, oldOffset) {
-  var from = mapping.mapResult(span.from + oldOffset, 1);
-  if (from.deleted) { return null }
-  var to = mapping.mapResult(span.to + oldOffset, -1);
-  if (to.deleted || to.pos <= from.pos) { return null }
-  return new Decoration(from.pos - offset, to.pos - offset, this)
-};
-
-NodeType.prototype.valid = function valid (node, span) {
-  var ref = node.content.findIndex(span.from);
-    var index = ref.index;
-    var offset = ref.offset;
-  return offset == span.from && offset + node.child(index).nodeSize == span.to
-};
-
-NodeType.prototype.eq = function eq (other) {
-  return this == other ||
-    (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&
-     compareObjs(this.spec, other.spec))
-};
-
-// ::- Decoration objects can be provided to the view through the
-// [`decorations` prop](#view.EditorProps.decorations). They come in
-// several variants—see the static members of this class for details.
-var Decoration = function Decoration(from, to, type) {
-  // :: number
-  // The start position of the decoration.
-  this.from = from;
-  // :: number
-  // The end position. Will be the same as `from` for [widget
-  // decorations](#view.Decoration^widget).
-  this.to = to;
-  this.type = type;
-};
-
-var prototypeAccessors$2 = { spec: {} };
-
-Decoration.prototype.copy = function copy (from, to) {
-  return new Decoration(from, to, this.type)
-};
-
-Decoration.prototype.eq = function eq (other) {
-  return this.type.eq(other.type) && this.from == other.from && this.to == other.to
-};
-
-Decoration.prototype.map = function map (mapping, offset, oldOffset) {
-  return this.type.map(mapping, this, offset, oldOffset)
-};
-
-// :: (number, union<(view: EditorView, getPos: () → number) → dom.Node, dom.Node>, ?Object) → Decoration
-// Creates a widget decoration, which is a DOM node that's shown in
-// the document at the given position. It is recommended that you
-// delay rendering the widget by passing a function that will be
-// called when the widget is actually drawn in a view, but you can
-// also directly pass a DOM node. `getPos` can be used to find the
-// widget's current document position.
-//
-// spec::- These options are supported:
-//
-//   side:: ?number
-//   Controls which side of the document position this widget is
-//   associated with. When negative, it is drawn before a cursor
-//   at its position, and content inserted at that position ends
-//   up after the widget. When zero (the default) or positive, the
-//   widget is drawn after the cursor and content inserted there
-//   ends up before the widget.
-//
-//   When there are multiple widgets at a given position, their
-//   `side` values determine the order in which they appear. Those
-//   with lower values appear first. The ordering of widgets with
-//   the same `side` value is unspecified.
-//
-//   When `marks` is null, `side` also determines the marks that
-//   the widget is wrapped in—those of the node before when
-//   negative, those of the node after when positive.
-//
-//   marks:: ?[Mark]
-//   The precise set of marks to draw around the widget.
-//
-//   stopEvent:: ?(event: dom.Event) → bool
-//   Can be used to control which DOM events, when they bubble out
-//   of this widget, the editor view should ignore.
-//
-//   key:: ?string
-//   When comparing decorations of this type (in order to decide
-//   whether it needs to be redrawn), ProseMirror will by default
-//   compare the widget DOM node by identity. If you pass a key,
-//   that key will be compared instead, which can be useful when
-//   you generate decorations on the fly and don't want to store
-//   and reuse DOM nodes. Make sure that any widgets with the same
-//   key are interchangeable—if widgets differ in, for example,
-//   the behavior of some event handler, they should get
-//   different keys.
-Decoration.widget = function widget (pos, toDOM, spec) {
-  return new Decoration(pos, pos, new WidgetType(toDOM, spec))
-};
-
-// :: (number, number, DecorationAttrs, ?Object) → Decoration
-// Creates an inline decoration, which adds the given attributes to
-// each inline node between `from` and `to`.
-//
-// spec::- These options are recognized:
-//
-//   inclusiveStart:: ?bool
-//   Determines how the left side of the decoration is
-//   [mapped](#transform.Position_Mapping) when content is
-//   inserted directly at that positon. By default, the decoration
-//   won't include the new content, but you can set this to `true`
-//   to make it inclusive.
-//
-//   inclusiveEnd:: ?bool
-//   Determines how the right side of the decoration is mapped.
-//   See
-//   [`inclusiveStart`](#view.Decoration^inline^spec.inclusiveStart).
-Decoration.inline = function inline (from, to, attrs, spec) {
-  return new Decoration(from, to, new InlineType(attrs, spec))
-};
-
-// :: (number, number, DecorationAttrs, ?Object) → Decoration
-// Creates a node decoration. `from` and `to` should point precisely
-// before and after a node in the document. That node, and only that
-// node, will receive the given attributes.
-Decoration.node = function node (from, to, attrs, spec) {
-  return new Decoration(from, to, new NodeType(attrs, spec))
-};
-
-// :: Object
-// The spec provided when creating this decoration. Can be useful
-// if you've stored extra information in that object.
-prototypeAccessors$2.spec.get = function () { return this.type.spec };
-
-Object.defineProperties( Decoration.prototype, prototypeAccessors$2 );
-
-// DecorationAttrs:: interface
-// A set of attributes to add to a decorated node. Most properties
-// simply directly correspond to DOM attributes of the same name,
-// which will be set to the property's value. These are exceptions:
-//
-//   class:: ?string
-//   A CSS class name or a space-separated set of class names to be
-//   _added_ to the classes that the node already had.
-//
-//   style:: ?string
-//   A string of CSS to be _added_ to the node's existing `style` property.
-//
-//   nodeName:: ?string
-//   When non-null, the target node is wrapped in a DOM element of
-//   this type (and the other attributes are applied to this element).
-
-var none = [];
-var noSpec = {};
-
-// ::- A collection of [decorations](#view.Decoration), organized in
-// such a way that the drawing algorithm can efficiently use and
-// compare them. This is a persistent data structure—it is not
-// modified, updates create a new value.
-var DecorationSet = function DecorationSet(local, children) {
-  this.local = local && local.length ? local : none;
-  this.children = children && children.length ? children : none;
-};
-
-// :: (Node, [Decoration]) → DecorationSet
-// Create a set of decorations, using the structure of the given
-// document.
-DecorationSet.create = function create (doc, decorations) {
-  return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty
-};
-
-// :: (?number, ?number, ?(spec: Object) → bool) → [Decoration]
-// Find all decorations in this set which touch the given range
-// (including decorations that start or end directly at the
-// boundaries) and match the given predicate on their spec. When
-// `start` and `end` are omitted, all decorations in the set are
-// considered. When `predicate` isn't given, all decorations are
-// asssumed to match.
-DecorationSet.prototype.find = function find (start, end, predicate) {
-  var result = [];
-  this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);
-  return result
-};
-
-DecorationSet.prototype.findInner = function findInner (start, end, result, offset, predicate) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.local.length; i++) {
-    var span = this$1.local[i];
-    if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec)))
-      { result.push(span.copy(span.from + offset, span.to + offset)); }
-  }
-  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3) {
-    if (this$1.children[i$1] < end && this$1.children[i$1 + 1] > start) {
-      var childOff = this$1.children[i$1] + 1;
-      this$1.children[i$1 + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate);
-    }
-  }
-};
-
-// :: (Mapping, Node, ?Object) → DecorationSet
-// Map the set of decorations in response to a change in the
-// document.
-//
-// options::- An optional set of options.
-//
-//   onRemove:: ?(decorationSpec: Object)
-//   When given, this function will be called for each decoration
-//   that gets dropped as a result of the mapping, passing the
-//   spec of that decoration.
-DecorationSet.prototype.map = function map (mapping, doc, options) {
-  if (this == empty || mapping.maps.length == 0) { return this }
-  return this.mapInner(mapping, doc, 0, 0, options || noSpec)
-};
-
-DecorationSet.prototype.mapInner = function mapInner (mapping, node, offset, oldOffset, options) {
-    var this$1 = this;
-
-  var newLocal;
-  for (var i = 0; i < this.local.length; i++) {
-    var mapped = this$1.local[i].map(mapping, offset, oldOffset);
-    if (mapped && mapped.type.valid(node, mapped)) { (newLocal || (newLocal = [])).push(mapped); }
-    else if (options.onRemove) { options.onRemove(this$1.local[i].spec); }
-  }
-
-  if (this.children.length)
-    { return mapChildren(this.children, newLocal, mapping, node, offset, oldOffset, options) }
-  else
-    { return newLocal ? new DecorationSet(newLocal.sort(byPos)) : empty }
-};
-
-// :: (Node, [Decoration]) → DecorationSet
-// Add the given array of decorations to the ones in the set,
-// producing a new set. Needs access to the current document to
-// create the appropriate tree structure.
-DecorationSet.prototype.add = function add (doc, decorations) {
-  if (!decorations.length) { return this }
-  if (this == empty) { return DecorationSet.create(doc, decorations) }
-  return this.addInner(doc, decorations, 0)
-};
-
-DecorationSet.prototype.addInner = function addInner (doc, decorations, offset) {
-    var this$1 = this;
-
-  var children, childIndex = 0;
-  doc.forEach(function (childNode, childOffset) {
-    var baseOffset = childOffset + offset, found;
-    if (!(found = takeSpansForNode(decorations, childNode, baseOffset))) { return }
-
-    if (!children) { children = this$1.children.slice(); }
-    while (childIndex < children.length && children[childIndex] < childOffset) { childIndex += 3; }
-    if (children[childIndex] == childOffset)
-      { children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1); }
-    else
-      { children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec)); }
-    childIndex += 3;
-  });
-
-  var local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset);
-  return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local,
-                           children || this.children)
-};
-
-// :: ([Decoration]) → DecorationSet
-// Create a new set that contains the decorations in this set, minus
-// the ones in the given array.
-DecorationSet.prototype.remove = function remove (decorations) {
-  if (decorations.length == 0 || this == empty) { return this }
-  return this.removeInner(decorations, 0)
-};
-
-DecorationSet.prototype.removeInner = function removeInner (decorations, offset) {
-    var this$1 = this;
-
-  var children = this.children, local = this.local;
-  for (var i = 0; i < children.length; i += 3) {
-    var found = (void 0), from = children[i] + offset, to = children[i + 1] + offset;
-    for (var j = 0, span = (void 0); j < decorations.length; j++) { if (span = decorations[j]) {
-      if (span.from > from && span.to < to) {
-        decorations[j] = null
-        ;(found || (found = [])).push(span);
-      }
-    } }
-    if (!found) { continue }
-    if (children == this$1.children) { children = this$1.children.slice(); }
-    var removed = children[i + 2].removeInner(found, from + 1);
-    if (removed != empty) {
-      children[i + 2] = removed;
-    } else {
-      children.splice(i, 3);
-      i -= 3;
-    }
-  }
-  if (local.length) { for (var i$1 = 0, span$1 = (void 0); i$1 < decorations.length; i$1++) { if (span$1 = decorations[i$1]) {
-    for (var j$1 = 0; j$1 < local.length; j$1++) { if (local[j$1].type.eq(span$1.type)) {
-      if (local == this$1.local) { local = this$1.local.slice(); }
-      local.splice(j$1--, 1);
-    } }
-  } } }
-  if (children == this.children && local == this.local) { return this }
-  return local.length || children.length ? new DecorationSet(local, children) : empty
-};
-
-DecorationSet.prototype.forChild = function forChild (offset, node) {
-    var this$1 = this;
-
-  if (this == empty) { return this }
-  if (node.isLeaf) { return DecorationSet.empty }
-
-  var child, local;
-  for (var i = 0; i < this.children.length; i += 3) { if (this$1.children[i] >= offset) {
-    if (this$1.children[i] == offset) { child = this$1.children[i + 2]; }
-    break
-  } }
-  var start = offset + 1, end = start + node.content.size;
-  for (var i$1 = 0; i$1 < this.local.length; i$1++) {
-    var dec = this$1.local[i$1];
-    if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {
-      var from = Math.max(start, dec.from) - start, to = Math.min(end, dec.to) - start;
-      if (from < to) { (local || (local = [])).push(dec.copy(from, to)); }
-    }
-  }
-  if (local) {
-    var localSet = new DecorationSet(local.sort(byPos));
-    return child ? new DecorationGroup([localSet, child]) : localSet
-  }
-  return child || empty
-};
-
-DecorationSet.prototype.eq = function eq (other) {
-    var this$1 = this;
-
-  if (this == other) { return true }
-  if (!(other instanceof DecorationSet) ||
-      this.local.length != other.local.length ||
-      this.children.length != other.children.length) { return false }
-  for (var i = 0; i < this.local.length; i++)
-    { if (!this$1.local[i].eq(other.local[i])) { return false } }
-  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3)
-    { if (this$1.children[i$1] != other.children[i$1] ||
-        this$1.children[i$1 + 1] != other.children[i$1 + 1] ||
-        !this$1.children[i$1 + 2].eq(other.children[i$1 + 2])) { return false } }
-  return false
-};
-
-DecorationSet.prototype.locals = function locals (node) {
-  return removeOverlap(this.localsInner(node))
-};
-
-DecorationSet.prototype.localsInner = function localsInner (node) {
-    var this$1 = this;
-
-  if (this == empty) { return none }
-  if (node.inlineContent || !this.local.some(InlineType.is)) { return this.local }
-  var result = [];
-  for (var i = 0; i < this.local.length; i++) {
-    if (!(this$1.local[i].type instanceof InlineType))
-      { result.push(this$1.local[i]); }
-  }
-  return result
-};
-
-var empty = new DecorationSet();
-
-// :: DecorationSet
-// The empty set of decorations.
-DecorationSet.empty = empty;
-
-DecorationSet.removeOverlap = removeOverlap;
-
-// :- An abstraction that allows the code dealing with decorations to
-// treat multiple DecorationSet objects as if it were a single object
-// with (a subset of) the same interface.
-var DecorationGroup = function DecorationGroup(members) {
-  this.members = members;
-};
-
-DecorationGroup.prototype.forChild = function forChild (offset, child) {
-    var this$1 = this;
-
-  if (child.isLeaf) { return DecorationSet.empty }
-  var found = [];
-  for (var i = 0; i < this.members.length; i++) {
-    var result = this$1.members[i].forChild(offset, child);
-    if (result == empty) { continue }
-    if (result instanceof DecorationGroup) { found = found.concat(result.members); }
-    else { found.push(result); }
-  }
-  return DecorationGroup.from(found)
-};
-
-DecorationGroup.prototype.eq = function eq (other) {
-    var this$1 = this;
-
-  if (!(other instanceof DecorationGroup) ||
-      other.members.length != this.members.length) { return false }
-  for (var i = 0; i < this.members.length; i++)
-    { if (!this$1.members[i].eq(other.members[i])) { return false } }
-  return true
-};
-
-DecorationGroup.prototype.locals = function locals (node) {
-    var this$1 = this;
-
-  var result, sorted = true;
-  for (var i = 0; i < this.members.length; i++) {
-    var locals = this$1.members[i].localsInner(node);
-    if (!locals.length) { continue }
-    if (!result) {
-      result = locals;
-    } else {
-      if (sorted) {
-        result = result.slice();
-        sorted = false;
-      }
-      for (var j = 0; j < locals.length; j++) { result.push(locals[j]); }
-    }
-  }
-  return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none
-};
-
-// : ([DecorationSet]) → union<DecorationSet, DecorationGroup>
-// Create a group for the given array of decoration sets, or return
-// a single set when possible.
-DecorationGroup.from = function from (members) {
-  switch (members.length) {
-    case 0: return empty
-    case 1: return members[0]
-    default: return new DecorationGroup(members)
-  }
-};
-
-function mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {
-  var children = oldChildren.slice();
-
-  // Mark the children that are directly touched by changes, and
-  // move those that are after the changes.
-  var shift = function (oldStart, oldEnd, newStart, newEnd) {
-    for (var i = 0; i < children.length; i += 3) {
-      var end = children[i + 1], dSize = (void 0);
-      if (end == -1 || oldStart > end + oldOffset) { continue }
-      if (oldEnd >= children[i] + oldOffset) {
-        children[i + 1] = -1;
-      } else if (dSize = (newEnd - newStart) - (oldEnd - oldStart) + (oldOffset - offset)) {
-        children[i] += dSize;
-        children[i + 1] += dSize;
-      }
-    }
-  };
-  for (var i = 0; i < mapping.maps.length; i++) { mapping.maps[i].forEach(shift); }
-
-  // Find the child nodes that still correspond to a single node,
-  // recursively call mapInner on them and update their positions.
-  var mustRebuild = false;
-  for (var i$1 = 0; i$1 < children.length; i$1 += 3) { if (children[i$1 + 1] == -1) { // Touched nodes
-    var from = mapping.map(children[i$1] + oldOffset), fromLocal = from - offset;
-    if (fromLocal < 0 || fromLocal >= node.content.size) {
-      mustRebuild = true;
-      continue
-    }
-    // Must read oldChildren because children was tagged with -1
-    var to = mapping.map(oldChildren[i$1 + 1] + oldOffset, -1), toLocal = to - offset;
-    var ref = node.content.findIndex(fromLocal);
-    var index = ref.index;
-    var childOffset = ref.offset;
-    var childNode = node.maybeChild(index);
-    if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {
-      var mapped = children[i$1 + 2].mapInner(mapping, childNode, from + 1, children[i$1] + oldOffset + 1, options);
-      if (mapped != empty) {
-        children[i$1] = fromLocal;
-        children[i$1 + 1] = toLocal;
-        children[i$1 + 2] = mapped;
-      } else {
-        children.splice(i$1, 3);
-        i$1 -= 3;
-      }
-    } else {
-      mustRebuild = true;
-    }
-  } }
-
-  // Remaining children must be collected and rebuilt into the appropriate structure
-  if (mustRebuild) {
-    var decorations = mapAndGatherRemainingDecorations(children, newLocal ? moveSpans(newLocal, offset) : [], mapping,
-                                                       offset, oldOffset, options);
-    var built = buildTree(decorations, node, 0, options);
-    newLocal = built.local;
-    for (var i$2 = 0; i$2 < children.length; i$2 += 3) { if (children[i$2 + 1] == -1) {
-      children.splice(i$2, 3);
-      i$2 -= 3;
-    } }
-    for (var i$3 = 0, j = 0; i$3 < built.children.length; i$3 += 3) {
-      var from$1 = built.children[i$3];
-      while (j < children.length && children[j] < from$1) { j += 3; }
-      children.splice(j, 0, built.children[i$3], built.children[i$3 + 1], built.children[i$3 + 2]);
-    }
-  }
-
-  return new DecorationSet(newLocal && newLocal.sort(byPos), children)
-}
-
-function moveSpans(spans, offset) {
-  if (!offset || !spans.length) { return spans }
-  var result = [];
-  for (var i = 0; i < spans.length; i++) {
-    var span = spans[i];
-    result.push(new Decoration(span.from + offset, span.to + offset, span.type));
-  }
-  return result
-}
-
-function mapAndGatherRemainingDecorations(children, decorations, mapping, offset, oldOffset, options) {
-  // Gather all decorations from the remaining marked children
-  function gather(set, oldOffset) {
-    for (var i = 0; i < set.local.length; i++) {
-      var mapped = set.local[i].map(mapping, offset, oldOffset);
-      if (mapped) { decorations.push(mapped); }
-      else if (options.onRemove) { options.onRemove(set.local[i].spec); }
-    }
-    for (var i$1 = 0; i$1 < set.children.length; i$1 += 3)
-      { gather(set.children[i$1 + 2], set.children[i$1] + oldOffset + 1); }
-  }
-  for (var i = 0; i < children.length; i += 3) { if (children[i + 1] == -1)
-    { gather(children[i + 2], children[i] + oldOffset + 1); } }
-
-  return decorations
-}
-
-function takeSpansForNode(spans, node, offset) {
-  if (node.isLeaf) { return null }
-  var end = offset + node.nodeSize, found = null;
-  for (var i = 0, span = (void 0); i < spans.length; i++) {
-    if ((span = spans[i]) && span.from > offset && span.to < end) {
-      (found || (found = [])).push(span);
-      spans[i] = null;
-    }
-  }
-  return found
-}
-
-function withoutNulls(array) {
-  var result = [];
-  for (var i = 0; i < array.length; i++)
-    { if (array[i] != null) { result.push(array[i]); } }
-  return result
-}
-
-// : ([Decoration], Node, number) → DecorationSet
-// Build up a tree that corresponds to a set of decorations. `offset`
-// is a base offset that should be subtractet from the `from` and `to`
-// positions in the spans (so that we don't have to allocate new spans
-// for recursive calls).
-function buildTree(spans, node, offset, options) {
-  var children = [], hasNulls = false;
-  node.forEach(function (childNode, localStart) {
-    var found = takeSpansForNode(spans, childNode, localStart + offset);
-    if (found) {
-      hasNulls = true;
-      var subtree = buildTree(found, childNode, offset + localStart + 1, options);
-      if (subtree != empty)
-        { children.push(localStart, localStart + childNode.nodeSize, subtree); }
-    }
-  });
-  var locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);
-  for (var i = 0; i < locals.length; i++) { if (!locals[i].type.valid(node, locals[i])) {
-    if (options.onRemove) { options.onRemove(locals[i].spec); }
-    locals.splice(i--, 1);
-  } }
-  return locals.length || children.length ? new DecorationSet(locals, children) : empty
-}
-
-// : (Decoration, Decoration) → number
-// Used to sort decorations so that ones with a low start position
-// come first, and within a set with the same start position, those
-// with an smaller end position come first.
-function byPos(a, b) {
-  return a.from - b.from || a.to - b.to
-}
-
-// : ([Decoration]) → [Decoration]
-// Scan a sorted array of decorations for partially overlapping spans,
-// and split those so that only fully overlapping spans are left (to
-// make subsequent rendering easier). Will return the input array if
-// no partially overlapping spans are found (the common case).
-function removeOverlap(spans) {
-  var working = spans;
-  for (var i = 0; i < working.length - 1; i++) {
-    var span = working[i];
-    if (span.from != span.to) { for (var j = i + 1; j < working.length; j++) {
-      var next = working[j];
-      if (next.from == span.from) {
-        if (next.to != span.to) {
-          if (working == spans) { working = spans.slice(); }
-          // Followed by a partially overlapping larger span. Split that
-          // span.
-          working[j] = next.copy(next.from, span.to);
-          insertAhead(working, j + 1, next.copy(span.to, next.to));
-        }
-        continue
-      } else {
-        if (next.from < span.to) {
-          if (working == spans) { working = spans.slice(); }
-          // The end of this one overlaps with a subsequent span. Split
-          // this one.
-          working[i] = span.copy(span.from, next.from);
-          insertAhead(working, j, span.copy(next.from, span.to));
-        }
-        break
-      }
-    } }
-  }
-  return working
-}
-
-function insertAhead(array, i, deco) {
-  while (i < array.length && byPos(deco, array[i]) > 0) { i++; }
-  array.splice(i, 0, deco);
-}
-
-// : (EditorView) → union<DecorationSet, DecorationGroup>
-// Get the decorations associated with the current props of a view.
-function viewDecorations(view) {
-  var found = [];
-  view.someProp("decorations", function (f) {
-    var result = f(view.state);
-    if (result && result != empty) { found.push(result); }
-  });
-  if (view.cursorWrapper)
-    { found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco])); }
-  return DecorationGroup.from(found)
-}
-
-// ::- An editor view manages the DOM structure that represents an
-// editable document. Its state and behavior are determined by its
-// [props](#view.DirectEditorProps).
-var EditorView = function EditorView(place, props) {
-  this._props = props;
-  // :: EditorState
-  // The view's current [state](#state.EditorState).
-  this.state = props.state;
-
-  this.dispatch = this.dispatch.bind(this);
-
-  this._root = null;
-  this.focused = false;
-
-  // :: dom.Element
-  // An editable DOM node containing the document. (You probably
-  // should not directly interfere with its content.)
-  this.dom = (place && place.mount) || document.createElement("div");
-  if (place) {
-    if (place.appendChild) { place.appendChild(this.dom); }
-    else if (place.apply) { place(this.dom); }
-    else if (place.mount) { this.mounted = true; }
-  }
-
-  this.editable = getEditable(this);
-  this.cursorWrapper = null;
-  updateCursorWrapper(this);
-  this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);
-
-  this.lastSelectedViewDesc = null;
-  // :: ?{slice: Slice, move: bool}
-  // When editor content is being dragged, this object contains
-  // information about the dragged slice and whether it is being
-  // copied or moved. At any other time, it is null.
-  this.dragging = null;
-  initInput(this); // Must be done before creating a SelectionReader
-
-  this.selectionReader = new SelectionReader(this);
-
-  this.pluginViews = [];
-  this.updatePluginViews();
-};
-
-var prototypeAccessors = { props: {},root: {} };
-
-// :: DirectEditorProps
-// The view's current [props](#view.EditorProps).
-prototypeAccessors.props.get = function () {
-    var this$1 = this;
-
-  if (this._props.state != this.state) {
-    var prev = this._props;
-    this._props = {};
-    for (var name in prev) { this$1._props[name] = prev[name]; }
-    this._props.state = this.state;
-  }
-  return this._props
-};
-
-// :: (DirectEditorProps)
-// Update the view's props. Will immediately cause an update to
-// the DOM.
-EditorView.prototype.update = function update (props) {
-  if (props.handleDOMEvents != this._props.handleDOMEvents) { ensureListeners(this); }
-  this._props = props;
-  this.updateState(props.state);
-};
-
-// :: (DirectEditorProps)
-// Update the view by updating existing props object with the object
-// given as argument. Equivalent to `view.update(Object.assign({},
-// view.props, props))`.
-EditorView.prototype.setProps = function setProps (props) {
-    var this$1 = this;
-
-  var updated = {};
-  for (var name in this$1._props) { updated[name] = this$1._props[name]; }
-  updated.state = this.state;
-  for (var name$1 in props) { updated[name$1] = props[name$1]; }
-  this.update(updated);
-};
-
-// :: (EditorState)
-// Update the editor's `state` prop, without touching any of the
-// other props.
-EditorView.prototype.updateState = function updateState (state) {
-    var this$1 = this;
-
-  var prev = this.state;
-  this.state = state;
-  if (prev.plugins != state.plugins) { ensureListeners(this); }
-
-  this.domObserver.flush();
-  if (this.inDOMChange && this.inDOMChange.stateUpdated(state)) { return }
-
-  var prevEditable = this.editable;
-  this.editable = getEditable(this);
-  updateCursorWrapper(this);
-  var innerDeco = viewDecorations(this), outerDeco = computeDocDeco(this);
-
-  var scroll = prev.config != state.config ? "reset"
-      : state.scrollToSelection > prev.scrollToSelection ? "to selection" : "preserve";
-  var updateDoc = !this.docView.matchesNode(state.doc, outerDeco, innerDeco);
-  var updateSel = updateDoc || !state.selection.eq(prev.selection) || this.selectionReader.domChanged();
-  var oldScrollPos = scroll == "preserve" && updateSel && storeScrollPos(this);
-
-  if (updateSel) {
-    this.domObserver.stop();
-    if (updateDoc) {
-      if (!this.docView.update(state.doc, outerDeco, innerDeco, this)) {
-        this.docView.destroy();
-        this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);
-      }
-      this.selectionReader.clearDOMState();
-    }
-    selectionToDOM(this);
-    this.domObserver.start();
-  }
-
-  if (prevEditable != this.editable) { this.selectionReader.editableChanged(); }
-  this.updatePluginViews(prev);
-
-  if (scroll == "reset") {
-    this.dom.scrollTop = 0;
-  } else if (scroll == "to selection") {
-    if (this.someProp("handleScrollToSelection", function (f) { return f(this$1); }))
-      ; // Handled
-    else if (state.selection instanceof dist$2.NodeSelection)
-      { scrollRectIntoView(this, this.docView.domAfterPos(state.selection.from).getBoundingClientRect()); }
-    else
-      { scrollRectIntoView(this, this.coordsAtPos(state.selection.head)); }
-  } else if (oldScrollPos) {
-    resetScrollPos(oldScrollPos);
-  }
-};
-
-EditorView.prototype.destroyPluginViews = function destroyPluginViews () {
-  var view;
-  while (view = this.pluginViews.pop()) { if (view.destroy) { view.destroy(); } }
-};
-
-EditorView.prototype.updatePluginViews = function updatePluginViews (prevState) {
-    var this$1 = this;
-
-  var plugins = this.state.plugins;
-  if (!prevState || prevState.plugins != plugins) {
-    this.destroyPluginViews();
-    for (var i = 0; i < plugins.length; i++) {
-      var plugin = plugins[i];
-      if (plugin.spec.view) { this$1.pluginViews.push(plugin.spec.view(this$1)); }
-    }
-  } else {
-    for (var i$1 = 0; i$1 < this.pluginViews.length; i$1++) {
-      var pluginView = this$1.pluginViews[i$1];
-      if (pluginView.update) { pluginView.update(this$1, prevState); }
-    }
-  }
-};
-
-// :: (string, ?(prop: *) → *) → *
-// Goes over the values of a prop, first those provided directly,
-// then those from plugins (in order), and calls `f` every time a
-// non-undefined value is found. When `f` returns a truthy value,
-// that is immediately returned. When `f` isn't provided, it is
-// treated as the identity function (the prop value is returned
-// directly).
-EditorView.prototype.someProp = function someProp (propName, f) {
-  var prop = this._props && this._props[propName], value;
-  if (prop != null && (value = f ? f(prop) : prop)) { return value }
-  var plugins = this.state.plugins;
-  if (plugins) { for (var i = 0; i < plugins.length; i++) {
-    var prop$1 = plugins[i].props[propName];
-    if (prop$1 != null && (value = f ? f(prop$1) : prop$1)) { return value }
-  } }
-};
-
-// :: () → bool
-// Query whether the view has focus.
-EditorView.prototype.hasFocus = function hasFocus () {
-  return this.root.activeElement == this.dom
-};
-
-// :: ()
-// Focus the editor.
-EditorView.prototype.focus = function focus () {
-  this.domObserver.stop();
-  selectionToDOM(this, true);
-  this.domObserver.start();
-  if (this.editable) { this.dom.focus(); }
-};
-
-// :: union<dom.Document, dom.DocumentFragment>
-// Get the document root in which the editor exists. This will
-// usually be the top-level `document`, but might be a [shadow
-// DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)
-// root if the editor is inside one.
-prototypeAccessors.root.get = function () {
-    var this$1 = this;
-
-  var cached = this._root;
-  if (cached == null) { for (var search = this.dom.parentNode; search; search = search.parentNode) {
-    if (search.nodeType == 9 || (search.nodeType == 11 && search.host))
-      { return this$1._root = search }
-  } }
-  return cached || document
-};
-
-// :: ({left: number, top: number}) → ?{pos: number, inside: number}
-// Given a pair of viewport coordinates, return the document
-// position that corresponds to them. May return null if the given
-// coordinates aren't inside of the visible editor. When an object
-// is returned, its `pos` property is the position nearest to the
-// coordinates, and its `inside` property holds the position of the
-// inner node that the position falls inside of, or -1 if it is at
-// the top level, not in any node.
-EditorView.prototype.posAtCoords = function posAtCoords$1 (coords) {
-  var pos = posAtCoords(this, coords);
-  if (this.inDOMChange && pos) {
-    pos.pos = this.inDOMChange.mapping.map(pos.pos);
-    if (pos.inside != -1) { pos.inside = this.inDOMChange.mapping.map(pos.inside); }
-  }
-  return pos
-};
-
-// :: (number) → {left: number, right: number, top: number, bottom: number}
-// Returns the viewport rectangle at a given document position. `left`
-// and `right` will be the same number, as this returns a flat
-// cursor-ish rectangle.
-EditorView.prototype.coordsAtPos = function coordsAtPos$1 (pos) {
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.invert().map(pos); }
-  return coordsAtPos(this, pos)
-};
-
-// :: (number) → {node: dom.Node, offset: number}
-// Find the DOM position that corresponds to the given document
-// position. Note that you should **not** mutate the editor's
-// internal DOM, only inspect it (and even that is usually not
-// necessary).
-EditorView.prototype.domAtPos = function domAtPos (pos) {
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.invert().map(pos); }
-  return this.docView.domFromPos(pos)
-};
-
-// :: (number) → ?dom.Node
-// Find the DOM node that represents the document node after the
-// given position. May return `null` when the position doesn't point
-// in front of a node or if the node is inside an opaque node view.
-//
-// This is intended to be able to call things like
-// `getBoundingClientRect` on that DOM node. Do **not** mutate the
-// editor DOM directly, or add styling this way, since that will be
-// immediately overriden by the editor as it redraws the node.
-EditorView.prototype.nodeDOM = function nodeDOM (pos) {
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.invert().map(pos); }
-  var desc = this.docView.descAt(pos);
-  return desc ? desc.nodeDOM : null
-};
-
-// :: (dom.Node, number, ?number) → number
-// Find the document position that corresponds to a given DOM
-// position. (Whenever possible, it is preferable to inspect the
-// document structure directly, rather than poking around in the
-// DOM, but sometimes—for example when interpreting an event
-// target—you don't have a choice.)
-//
-// The `bias` parameter can be used to influence which side of a DOM
-// node to use when the position is inside a leaf node.
-EditorView.prototype.posAtDOM = function posAtDOM (node, offset, bias) {
-    if ( bias === void 0 ) { bias = -1; }
-
-  var pos = this.docView.posFromDOM(node, offset, bias);
-  if (pos == null) { throw new RangeError("DOM position not inside the editor") }
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.map(pos); }
-  return pos
-};
-
-// :: (union<"up", "down", "left", "right", "forward", "backward">, ?EditorState) → bool
-// Find out whether the selection is at the end of a textblock when
-// moving in a given direction. When, for example, given `"left"`,
-// it will return true if moving left from the current cursor
-// position would leave that position's parent textblock. Will apply
-// to the view's current state by default, but it is possible to
-// pass a different state.
-EditorView.prototype.endOfTextblock = function endOfTextblock$1 (dir, state) {
-  return endOfTextblock(this, state || this.state, dir)
-};
-
-// :: ()
-// Removes the editor from the DOM and destroys all [node
-// views](#view.NodeView).
-EditorView.prototype.destroy = function destroy () {
-  if (!this.docView) { return }
-  destroyInput(this);
-  this.destroyPluginViews();
-  this.selectionReader.destroy();
-  if (this.mounted) {
-    this.docView.update(this.state.doc, [], viewDecorations(this), this);
-    this.dom.textContent = "";
-  } else if (this.dom.parentNode) {
-    this.dom.parentNode.removeChild(this.dom);
-  }
-  this.docView.destroy();
-  this.docView = null;
-};
-
-// Used for testing.
-EditorView.prototype.dispatchEvent = function dispatchEvent$1 (event) {
-  return dispatchEvent(this, event)
-};
-
-// :: (Transaction)
-// Dispatch a transaction. Will call
-// [`dispatchTransaction`](#view.DirectEditorProps.dispatchTransaction)
-// when given, and otherwise defaults to applying the transaction to
-// the current state and calling
-// [`updateState`](#view.EditorView.updateState) with the result.
-// This method is bound to the view instance, so that it can be
-// easily passed around.
-EditorView.prototype.dispatch = function dispatch (tr) {
-  var dispatchTransaction = this._props.dispatchTransaction;
-  if (dispatchTransaction) { dispatchTransaction.call(this, tr); }
-  else { this.updateState(this.state.apply(tr)); }
-};
-
-Object.defineProperties( EditorView.prototype, prototypeAccessors );
-
-function computeDocDeco(view) {
-  var attrs = Object.create(null);
-  attrs.class = "ProseMirror" + (view.focused ? " ProseMirror-focused" : "");
-  attrs.contenteditable = String(view.editable);
-
-  view.someProp("attributes", function (value) {
-    if (typeof value == "function") { value = value(view.state); }
-    if (value) { for (var attr in value) {
-      if (attr == "class")
-        { attrs.class += " " + value[attr]; }
-      else if (!attrs[attr] && attr != "contenteditable" && attr != "nodeName")
-        { attrs[attr] = String(value[attr]); }
-    } }
-  });
-
-  return [Decoration.node(0, view.state.doc.content.size, attrs)]
-}
-
-function cursorWrapperDOM(visible) {
-  var span = document.createElement("span");
-  span.textContent = "\ufeff"; // zero-width non-breaking space
-  if (!visible) {
-    span.style.position = "absolute";
-    span.style.left = "-100000px";
-  }
-  return span
-}
-
-function updateCursorWrapper(view) {
-  var $pos = needsCursorWrapper(view.state);
-  // On IE/Edge, moving the DOM selection will abort a mouse drag, so
-  // there we delay the creation of the wrapper when the mouse is down.
-  if ($pos && !(result.ie && view.mouseDown)) {
-    var visible = view.state.selection.visible;
-    // Needs a cursor wrapper
-    var marks = view.state.storedMarks || $pos.marks(), dom;
-    if (!view.cursorWrapper || !dist.Mark.sameSet(view.cursorWrapper.deco.spec.marks, marks) ||
-        view.cursorWrapper.dom.textContent != "\ufeff" ||
-        view.cursorWrapper.deco.spec.visible != visible)
-      { dom = cursorWrapperDOM(visible); }
-    else if (view.cursorWrapper.deco.pos != $pos.pos)
-      { dom = view.cursorWrapper.dom; }
-    if (dom)
-      { view.cursorWrapper = {dom: dom, deco: Decoration.widget($pos.pos, dom, {isCursorWrapper: true, marks: marks, raw: true, visible: visible})}; }
-  } else {
-    view.cursorWrapper = null;
-  }
-}
-
-function getEditable(view) {
-  return !view.someProp("editable", function (value) { return value(view.state) === false; })
-}
-
-// EditorProps:: interface
-//
-// Props are configuration values that can be passed to an editor view
-// or included in a plugin. This interface lists the supported props.
-//
-// The various event-handling functions may all return `true` to
-// indicate that they handled the given event. The view will then take
-// care to call `preventDefault` on the event, except with
-// `handleDOMEvents`, where the handler itself is responsible for that.
-//
-// How a prop is resolved depends on the prop. Handler functions are
-// called one at a time, starting with the base props and then
-// searching through the plugins (in order of appearance) until one of
-// them returns true. For some props, the first plugin that yields a
-// value gets precedence.
-//
-//   handleDOMEvents:: ?Object<(view: EditorView, event: dom.Event) → bool>
-//   Can be an object mapping DOM event type names to functions that
-//   handle them. Such functions will be called before any handling
-//   ProseMirror does of events fired on the editable DOM element.
-//   Contrary to the other event handling props, when returning true
-//   from such a function, you are responsible for calling
-//   `preventDefault` yourself (or not, if you want to allow the
-//   default behavior).
-//
-//   handleKeyDown:: ?(view: EditorView, event: dom.KeyboardEvent) → bool
-//   Called when the editor receives a `keydown` event.
-//
-//   handleKeyPress:: ?(view: EditorView, event: dom.KeyboardEvent) → bool
-//   Handler for `keypress` events.
-//
-//   handleTextInput:: ?(view: EditorView, from: number, to: number, text: string) → bool
-//   Whenever the user directly input text, this handler is called
-//   before the input is applied. If it returns `true`, the default
-//   behavior of actually inserting the text is suppressed.
-//
-//   handleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-//   Called for each node around a click, from the inside out. The
-//   `direct` flag will be true for the inner node.
-//
-//   handleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-//   Called when the editor is clicked, after `handleClickOn` handlers
-//   have been called.
-//
-//   handleDoubleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-//   Called for each node around a double click.
-//
-//   handleDoubleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-//   Called when the editor is double-clicked, after `handleDoubleClickOn`.
-//
-//   handleTripleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-//   Called for each node around a triple click.
-//
-//   handleTripleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-//   Called when the editor is triple-clicked, after `handleTripleClickOn`.
-//
-//   handlePaste:: ?(view: EditorView, event: dom.Event, slice: Slice) → bool
-//   Can be used to override the behavior of pasting. `slice` is the
-//   pasted content parsed by the editor, but you can directly access
-//   the event to get at the raw content.
-//
-//   handleDrop:: ?(view: EditorView, event: dom.Event, slice: Slice, moved: bool) → bool
-//   Called when something is dropped on the editor. `moved` will be
-//   true if this drop moves from the current selection (which should
-//   thus be deleted).
-//
-//   handleScrollToSelection:: ?(view: EditorView) → bool
-//   Called when the view, after updating its state, tries to scroll
-//   the selection into view. A handler function may return false to
-//   indicate that it did not handle the scrolling and further
-//   handlers or the default behavior should be tried.
-//
-//   createSelectionBetween:: ?(view: EditorView, anchor: ResolvedPos, head: ResolvedPos) → ?Selection
-//   Can be used to override the way a selection is created when
-//   reading a DOM selection between the given anchor and head.
-//
-//   domParser:: ?DOMParser
-//   The [parser](#model.DOMParser) to use when reading editor changes
-//   from the DOM. Defaults to calling
-//   [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) on the
-//   editor's schema.
-//
-//   transformPastedHTML:: ?(html: string) → string
-//   Can be used to transform pasted HTML text, _before_ it is parsed,
-//   for example to clean it up.
-//
-//   clipboardParser:: ?DOMParser
-//   The [parser](#model.DOMParser) to use when reading content from
-//   the clipboard. When not given, the value of the
-//   [`domParser`](#view.EditorProps.domParser) prop is used.
-//
-//   transformPastedText:: ?(text: string) → string
-//   Transform pasted plain text.
-//
-//   clipboardTextParser:: ?(text: string, $context: ResolvedPos) → Slice
-//   A function to parse text from the clipboard into a document
-//   slice. Called after
-//   [`transformPastedText`](#view.EditorProps.transformPastedText).
-//   The default behavior is to split the text into lines, wrap them
-//   in `<p>` tags, and call
-//   [`clipboardParser`](#view.EditorProps.clipboardParser) on it.
-//
-//   transformPasted:: ?(Slice) → Slice
-//   Can be used to transform pasted content before it is applied to
-//   the document.
-//
-//   nodeViews:: ?Object<(node: Node, view: EditorView, getPos: () → number, decorations: [Decoration]) → NodeView>
-//   Allows you to pass custom rendering and behavior logic for nodes
-//   and marks. Should map node and mark names to constructor
-//   functions that produce a [`NodeView`](#view.NodeView) object
-//   implementing the node's display behavior. `getPos` is a function
-//   that can be called to get the node's current position, which can
-//   be useful when creating transactions to update it.
-//
-//   `decorations` is an array of node or inline decorations that are
-//   active around the node. They are automatically drawn in the
-//   normal way, and you will usually just want to ignore this, but
-//   they can also be used as a way to provide context information to
-//   the node view without adding it to the document itself.
-//
-//   clipboardSerializer:: ?DOMSerializer
-//   The DOM serializer to use when putting content onto the
-//   clipboard. If not given, the result of
-//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)
-//   will be used.
-//
-//   clipboardTextSerializer:: ?(Slice) → string
-//   A function that will be called to get the text for the current
-//   selection when copying text to the clipboard. By default, the
-//   editor will use [`textBetween`](#model.Node.textBetween) on the
-//   selected range.
-//
-//   decorations:: ?(state: EditorState) → ?DecorationSet
-//   A set of [document decorations](#view.Decoration) to show in the
-//   view.
-//
-//   editable:: ?(state: EditorState) → bool
-//   When this returns false, the content of the view is not directly
-//   editable.
-//
-//   attributes:: ?union<Object<string>, (EditorState) → ?Object<string>>
-//   Control the DOM attributes of the editable element. May be either
-//   an object or a function going from an editor state to an object.
-//   By default, the element will get a class `"ProseMirror"`, and
-//   will have its `contentEditable` attribute determined by the
-//   [`editable` prop](#view.EditorProps.editable). Additional classes
-//   provided here will be added to the class. For other attributes,
-//   the value provided first (as in
-//   [`someProp`](#view.EditorView.someProp)) will be used.
-//
-//   scrollThreshold:: ?number
-//   Determines the distance (in pixels) between the cursor and the
-//   end of the visible viewport at which point, when scrolling the
-//   cursor into view, scrolling takes place. Defaults to 0.
-//
-//   scrollMargin:: ?number
-//   Determines the extra space (in pixels) that is left above or
-//   below the cursor when it is scrolled into view. Defaults to 5.
-
-// DirectEditorProps:: interface extends EditorProps
-//
-// The props object given directly to the editor view supports two
-// fields that can't be used in plugins:
-//
-//   state:: EditorState
-//   The current state of the editor.
-//
-//   dispatchTransaction:: ?(tr: Transaction)
-//   The callback over which to send transactions (state updates)
-//   produced by the view. If you specify this, you probably want to
-//   make sure this ends up calling the view's
-//   [`updateState`](#view.EditorView.updateState) method with a new
-//   state that has the transaction
-//   [applied](#state.EditorState.apply). The callback will be bound to have
-//   the view instance as its `this` binding.
-
-exports.EditorView = EditorView;
-exports.Decoration = Decoration;
-exports.DecorationSet = DecorationSet;
-exports.__serializeForClipboard = serializeForClipboard;
-exports.__parseFromClipboard = parseFromClipboard;
-
-});
-
-unwrapExports(dist$3);
-var dist_1$3 = dist$3.EditorView;
-var dist_2$3 = dist$3.Decoration;
-var dist_3$3 = dist$3.DecorationSet;
-var dist_4$3 = dist$3.__serializeForClipboard;
-var dist_5$3 = dist$3.__parseFromClipboard;
-
-var dropcursor = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-var gecko = typeof navigator != "undefined" && /gecko\/\d/i.test(navigator.userAgent);
-var linux = typeof navigator != "undefined" && /linux/i.test(navigator.platform);
-
-function dropCursor(options) {
-  function dispatch(view, data) {
-    view.dispatch(view.state.tr.setMeta(plugin, data));
-  }
-
-  var timeout = null;
-  function scheduleRemoval(view, time) {
-    clearTimeout(timeout);
-    timeout = setTimeout(function () {
-      if (plugin.getState(view.state)) { dispatch(view, {type: "remove"}); }
-    }, time);
-  }
-
-  var plugin = new dist$2.Plugin({
-    state: {
-      init: function init() { return null },
-      apply: function apply(tr, prev, state) {
-        // Firefox on Linux gets really confused an breaks dragging when we
-        // mess with the nodes around the target node during a drag. So
-        // disable this plugin there. See https://bugzilla.mozilla.org/show_bug.cgi?id=1323170
-        if (gecko && linux) { return null }
-        var command = tr.getMeta("uiEvent") == "drop" ? {type: "remove"} : tr.getMeta(plugin);
-        if (!command) { return prev }
-        if (command.type == "set") { return pluginStateFor(state, command.pos, options) }
-        return null
-      }
-    },
-    props: {
-      handleDOMEvents: {
-        dragover: function dragover(view, event) {
-          var active = plugin.getState(view.state);
-          var pos = view.posAtCoords({left: event.clientX, top: event.clientY});
-          if (pos) {
-            var target = pos.pos;
-            if (view.dragging && view.dragging.slice) {
-              target = dist$1.dropPoint(view.state.doc, target, view.dragging.slice);
-              if (target == null) { target = pos.pos; }
-            }
-            if (!active || active.pos != target)
-              { dispatch(view, {type: "set", pos: target}); }
-          }
-          scheduleRemoval(view, 5000);
-          return false
-        },
-
-        dragend: function dragend(view) {
-          scheduleRemoval(view, 20);
-          return false
-        },
-
-        drop: function drop(view) {
-          scheduleRemoval(view, 20);
-          return false
-        },
-
-        dragleave: function dragleave(view, event) {
-          if (event.target == view.dom || !view.dom.contains(event.relatedTarget)) { dispatch(view, {type: "remove"}); }
-          return false
-        }
-      },
-      decorations: function decorations(state) {
-        var active = plugin.getState(state);
-        return active && active.deco
-      }
-    }
-  });
-  return plugin
-}
-
-function style(options, side) {
-  var width = (options && options.width) || 1;
-  var color = (options && options.color) || "black";
-  return ("border-" + side + ": " + width + "px solid " + color + "; margin-" + side + ": -" + width + "px")
-}
-
-function pluginStateFor(state, pos, options) {
-  var $pos = state.doc.resolve(pos), deco;
-  if (!$pos.parent.inlineContent) {
-    var before, after;
-    if (before = $pos.nodeBefore)
-      { deco = dist$3.Decoration.node(pos - before.nodeSize, pos, {nodeName: "div", style: style(options, "right")}); }
-    else if (after = $pos.nodeAfter)
-      { deco = dist$3.Decoration.node(pos, pos + after.nodeSize, {nodeName: "div", style: style(options, "left")}); }
-  }
-  if (!deco) {
-    var node = document.createElement("span");
-    node.textContent = "\u200b";
-    node.style.cssText = style(options, "left") + "; display: inline-block; pointer-events: none";
-    deco = dist$3.Decoration.widget(pos, node);
-  }
-  return {pos: pos, deco: dist$3.DecorationSet.create(state.doc, [deco])}
-}
-
-exports.dropCursor = dropCursor;
-
-});
-
-unwrapExports(dropcursor);
-var dropcursor_1 = dropcursor.dropCursor;
-
-var base = {
-  8: "Backspace",
-  9: "Tab",
-  10: "Enter",
-  12: "NumLock",
-  13: "Enter",
-  16: "Shift",
-  17: "Control",
-  18: "Alt",
-  20: "CapsLock",
-  27: "Escape",
-  32: " ",
-  33: "PageUp",
-  34: "PageDown",
-  35: "End",
-  36: "Home",
-  37: "ArrowLeft",
-  38: "ArrowUp",
-  39: "ArrowRight",
-  40: "ArrowDown",
-  44: "PrintScreen",
-  45: "Insert",
-  46: "Delete",
-  59: ";",
-  61: "=",
-  91: "Meta",
-  92: "Meta",
-  106: "*",
-  107: "+",
-  108: ",",
-  109: "-",
-  110: ".",
-  111: "/",
-  144: "NumLock",
-  145: "ScrollLock",
-  160: "Shift",
-  161: "Shift",
-  162: "Control",
-  163: "Control",
-  164: "Alt",
-  165: "Alt",
-  173: "-",
-  186: ";",
-  187: "=",
-  188: ",",
-  189: "-",
-  190: ".",
-  191: "/",
-  192: "`",
-  219: "[",
-  220: "\\",
-  221: "]",
-  222: "'",
-  229: "q"
-};
-var shift = {
-  48: ")",
-  49: "!",
-  50: "@",
-  51: "#",
-  52: "$",
-  53: "%",
-  54: "^",
-  55: "&",
-  56: "*",
-  57: "(",
-  59: ";",
-  61: "+",
-  173: "_",
-  186: ":",
-  187: "+",
-  188: "<",
-  189: "_",
-  190: ">",
-  191: "?",
-  192: "~",
-  219: "{",
-  220: "|",
-  221: "}",
-  222: "\"",
-  229: "Q"
-};
-
-var chrome = typeof navigator != "undefined" && /Chrome\/(\d+)/.exec(navigator.userAgent);
-var safari = typeof navigator != "undefined" && /Apple Computer/.test(navigator.vendor);
-var gecko = typeof navigator != "undefined" && /Gecko\/\d+/.test(navigator.userAgent);
-var mac = typeof navigator != "undefined" && /Mac/.test(navigator.platform);
-var brokenModifierNames = chrome && (mac || +chrome[1] < 57) || gecko && mac;
-
-// Fill in the digit keys
-for (var i = 0; i < 10; i++) { base[48 + i] = base[96 + i] = String(i); }
-
-// The function keys
-for (var i = 1; i <= 24; i++) { base[i + 111] = "F" + i; }
-
-// And the alphabetic keys
-for (var i = 65; i <= 90; i++) {
-  base[i] = String.fromCharCode(i + 32);
-  shift[i] = String.fromCharCode(i);
-}
-
-// For each code that doesn't have a shift-equivalent, copy the base name
-for (var code in base) { if (!shift.hasOwnProperty(code)) { shift[code] = base[code]; } }
-
-function keyName(event) {
-  // Don't trust event.key in Chrome when there are modifiers until
-  // they fix https://bugs.chromium.org/p/chromium/issues/detail?id=633838
-  var ignoreKey = brokenModifierNames && (event.ctrlKey || event.altKey || event.metaKey) ||
-    safari && event.shiftKey && event.key && event.key.length == 1;
-  var name = (!ignoreKey && event.key) ||
-    (event.shiftKey ? shift : base)[event.keyCode] ||
-    event.key || "Unidentified";
-  // Edge sometimes produces wrong names (Issue #3)
-  if (name == "Esc") { name = "Escape"; }
-  if (name == "Del") { name = "Delete"; }
-  // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/
-  if (name == "Left") { name = "ArrowLeft"; }
-  if (name == "Up") { name = "ArrowUp"; }
-  if (name == "Right") { name = "ArrowRight"; }
-  if (name == "Down") { name = "ArrowDown"; }
-  return name
-}
-
-var w3cKeyname = keyName;
-keyName.base = base;
-keyName.shift = shift;
-
-var keymap_1 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var keyName = _interopDefault(w3cKeyname);
-
-
-// declare global: navigator
-
-var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform) : false;
-
-function normalizeKeyName(name) {
-  var parts = name.split(/-(?!$)/), result = parts[parts.length - 1];
-  if (result == "Space") { result = " "; }
-  var alt, ctrl, shift, meta;
-  for (var i = 0; i < parts.length - 1; i++) {
-    var mod = parts[i];
-    if (/^(cmd|meta|m)$/i.test(mod)) { meta = true; }
-    else if (/^a(lt)?$/i.test(mod)) { alt = true; }
-    else if (/^(c|ctrl|control)$/i.test(mod)) { ctrl = true; }
-    else if (/^s(hift)?$/i.test(mod)) { shift = true; }
-    else if (/^mod$/i.test(mod)) { if (mac) { meta = true; } else { ctrl = true; } }
-    else { throw new Error("Unrecognized modifier name: " + mod) }
-  }
-  if (alt) { result = "Alt-" + result; }
-  if (ctrl) { result = "Ctrl-" + result; }
-  if (meta) { result = "Meta-" + result; }
-  if (shift) { result = "Shift-" + result; }
-  return result
-}
-
-function normalize(map) {
-  var copy = Object.create(null);
-  for (var prop in map) { copy[normalizeKeyName(prop)] = map[prop]; }
-  return copy
-}
-
-function modifiers(name, event, shift) {
-  if (event.altKey) { name = "Alt-" + name; }
-  if (event.ctrlKey) { name = "Ctrl-" + name; }
-  if (event.metaKey) { name = "Meta-" + name; }
-  if (shift !== false && event.shiftKey) { name = "Shift-" + name; }
-  return name
-}
-
-// :: (Object) → Plugin
-// Create a keymap plugin for the given set of bindings.
-//
-// Bindings should map key names to [command](#commands)-style
-// functions, which will be called with `(EditorState, dispatch,
-// EditorView)` arguments, and should return true when they've handled
-// the key. Note that the view argument isn't part of the command
-// protocol, but can be used as an escape hatch if a binding needs to
-// directly interact with the UI.
-//
-// Key names may be strings like `"Shift-Ctrl-Enter"`—a key
-// identifier prefixed with zero or more modifiers. Key identifiers
-// are based on the strings that can appear in
-// [`KeyEvent.key`](https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).
-// Use lowercase letters to refer to letter keys (or uppercase letters
-// if you want shift to be held). You may use `"Space"` as an alias
-// for the `" "` name.
-//
-// Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or
-// `a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or
-// `Meta-`) are recognized. For characters that are created by holding
-// shift, the `Shift-` prefix is implied, and should not be added
-// explicitly.
-//
-// You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on
-// other platforms.
-//
-// You can add multiple keymap plugins to an editor. The order in
-// which they appear determines their precedence (the ones early in
-// the array get to dispatch first).
-function keymap(bindings) {
-  return new dist$2.Plugin({props: {handleKeyDown: keydownHandler(bindings)}})
-}
-
-// :: (Object) → (view: EditorView, event: dom.Event) → bool
-// Given a set of bindings (using the same format as
-// [`keymap`](#keymap.keymap), return a [keydown
-// handler](#view.EditorProps.handleKeyDown) handles them.
-function keydownHandler(bindings) {
-  var map = normalize(bindings);
-  return function(view, event) {
-    var name = keyName(event), isChar = name.length == 1 && name != " ", baseName;
-    var direct = map[modifiers(name, event, !isChar)];
-    if (direct && direct(view.state, view.dispatch, view)) { return true }
-    if (isChar && (event.shiftKey || event.altKey || event.metaKey) &&
-        (baseName = keyName.base[event.keyCode]) && baseName != name) {
-      var fromCode = map[modifiers(baseName, event, true)];
-      if (fromCode && fromCode(view.state, view.dispatch, view)) { return true }
-    }
-    return false
-  }
-}
-
-exports.keymap = keymap;
-exports.keydownHandler = keydownHandler;
-
-});
-
-unwrapExports(keymap_1);
-var keymap_2 = keymap_1.keymap;
-var keymap_3 = keymap_1.keydownHandler;
-
-var dist$4 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-
-// ::- Gap cursor selections are represented using this class. Its
-// `$anchor` and `$head` properties both point at the cursor position.
-var GapCursor = (function (Selection$$1) {
-  function GapCursor($pos) {
-    Selection$$1.call(this, $pos, $pos);
-  }
-
-  if ( Selection$$1 ) { GapCursor.__proto__ = Selection$$1; }
-  GapCursor.prototype = Object.create( Selection$$1 && Selection$$1.prototype );
-  GapCursor.prototype.constructor = GapCursor;
-
-  GapCursor.prototype.map = function map (doc, mapping) {
-    var $pos = doc.resolve(mapping.map(this.head));
-    return GapCursor.valid($pos) ? new GapCursor($pos) : Selection$$1.near($pos)
-  };
-
-  GapCursor.prototype.content = function content () { return dist.Slice.empty };
-
-  GapCursor.prototype.eq = function eq (other) {
-    return other instanceof GapCursor && other.head == this.head
-  };
-
-  GapCursor.prototype.toJSON = function toJSON () {
-    return {type: "gapcursor", pos: this.head}
-  };
-
-  GapCursor.fromJSON = function fromJSON (doc, json) {
-    if (typeof json.pos != "number") { throw new RangeError("Invalid input for GapCursor.fromJSON") }
-    return new GapCursor(doc.resolve(json.pos))
-  };
-
-  GapCursor.prototype.getBookmark = function getBookmark () { return new GapBookmark(this.anchor) };
-
-  GapCursor.valid = function valid ($pos) {
-    var parent = $pos.parent;
-    if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos)) { return false }
-    var override = parent.type.spec.allowGapCursor;
-    if (override != null) { return override }
-    var deflt = parent.contentMatchAt($pos.index()).defaultType;
-    return deflt && deflt.isTextblock
-  };
-
-  GapCursor.findFrom = function findFrom ($pos, dir, mustMove) {
-    if (!mustMove && GapCursor.valid($pos)) { return $pos }
-
-    var pos = $pos.pos, next = null;
-    // Scan up from this position
-    for (var d = $pos.depth;; d--) {
-      var parent = $pos.node(d);
-      if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {
-        next = parent.maybeChild(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);
-        break
-      } else if (d == 0) {
-        return null
-      }
-      pos += dir;
-      var $cur = $pos.doc.resolve(pos);
-      if (GapCursor.valid($cur)) { return $cur }
-    }
-
-    // And then down into the next node
-    for (;;) {
-      next = dir > 0 ? next.firstChild : next.lastChild;
-      if (!next) { break }
-      pos += dir;
-      var $cur$1 = $pos.doc.resolve(pos);
-      if (GapCursor.valid($cur$1)) { return $cur$1 }
-    }
-
-    return null
-  };
-
-  return GapCursor;
-}(dist$2.Selection));
-
-GapCursor.prototype.visible = false;
-
-dist$2.Selection.jsonID("gapcursor", GapCursor);
-
-var GapBookmark = function GapBookmark(pos) {
-  this.pos = pos;
-};
-GapBookmark.prototype.map = function map (mapping) {
-  return new GapBookmark(mapping.map(this.pos))
-};
-GapBookmark.prototype.resolve = function resolve (doc) {
-  var $pos = doc.resolve(this.pos);
-  return GapCursor.valid($pos) ? new GapCursor($pos) : dist$2.Selection.near($pos)
-};
-
-function closedBefore($pos) {
-  for (var d = $pos.depth; d >= 0; d--) {
-    var index = $pos.index(d);
-    // At the start of this parent, look at next one
-    if (index == 0) { continue }
-    // See if the node before (or its first ancestor) is closed
-    for (var before = $pos.node(d).child(index - 1);; before = before.lastChild) {
-      if (before.isTextblock) { return false }
-      if (before.childCount == 0 || before.isAtom || before.type.spec.isolating) { return true }
-    }
-  }
-  // Hit start of document
-  return true
-}
-
-function closedAfter($pos) {
-  for (var d = $pos.depth; d >= 0; d--) {
-    var index = $pos.indexAfter(d), parent = $pos.node(d);
-    if (index == parent.childCount) { continue }
-    for (var after = parent.child(index);; after = after.firstChild) {
-      if (after.isTextblock) { return false }
-      if (after.childCount == 0 || after.isAtom || after.type.spec.isolating) { return true }
-    }
-  }
-  return true
-}
-
-// :: () → Plugin
-// Create a gap cursor plugin. When enabled, this will capture clicks
-// near and arrow-key-motion past places that don't have a normally
-// selectable position nearby, and create a gap cursor selection for
-// them. The cursor is drawn as an element with class
-// `ProseMirror-gapcursor`. You can either include
-// `style/gapcursor.css` from the package's directory or add your own
-// styles to make it visible.
-var gapCursor = function() {
-  return new dist$2.Plugin({
-    props: {
-      decorations: drawGapCursor,
-
-      createSelectionBetween: function createSelectionBetween(_view, $anchor, $head) {
-        if ($anchor.pos == $head.pos && GapCursor.valid($head)) { return new GapCursor($head) }
-      },
-
-      handleClick: handleClick,
-      handleKeyDown: handleKeyDown
-    }
-  })
-};
-
-var handleKeyDown = keymap_1.keydownHandler({
-  "ArrowLeft": arrow("horiz", -1),
-  "ArrowRight": arrow("horiz", 1),
-  "ArrowUp": arrow("vert", -1),
-  "ArrowDown": arrow("vert", 1)
-});
-
-function arrow(axis, dir) {
-  var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
-  return function(state, dispatch, view) {
-    var sel = state.selection;
-    var $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;
-    if (sel instanceof dist$2.TextSelection) {
-      if (!view.endOfTextblock(dirStr)) { return false }
-      mustMove = false;
-      $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());
-    }
-    var $found = GapCursor.findFrom($start, dir, mustMove);
-    if (!$found) { return false }
-    if (dispatch) { dispatch(state.tr.setSelection(new GapCursor($found))); }
-    return true
-  }
-}
-
-function handleClick(view, pos, event) {
-  var $pos = view.state.doc.resolve(pos);
-  if (!GapCursor.valid($pos)) { return false }
-  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
-  var inside = ref.inside;
-  if (inside > -1 && dist$2.NodeSelection.isSelectable(view.state.doc.nodeAt(inside))) { return false }
-  view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));
-  return true
-}
-
-function drawGapCursor(state) {
-  if (!(state.selection instanceof GapCursor)) { return null }
-  var node = document.createElement("div");
-  node.className = "ProseMirror-gapcursor";
-  return dist$3.DecorationSet.create(state.doc, [dist$3.Decoration.widget(state.selection.head, node, {key: "gapcursor"})])
-}
-
-exports.gapCursor = gapCursor;
-exports.GapCursor = GapCursor;
-
-});
-
-unwrapExports(dist$4);
-var dist_1$4 = dist$4.gapCursor;
-var dist_2$4 = dist$4.GapCursor;
-
-var GOOD_LEAF_SIZE = 200;
-
-// :: class<T> A rope sequence is a persistent sequence data structure
-// that supports appending, prepending, and slicing without doing a
-// full copy. It is represented as a mostly-balanced tree.
-var RopeSequence = function RopeSequence () {};
-
-RopeSequence.prototype.append = function append (other) {
-  if (!other.length) { return this }
-  other = RopeSequence.from(other);
-
-  return (!this.length && other) ||
-    (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||
-    (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||
-    this.appendInner(other)
-};
-
-// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>
-// Prepend an array or other rope to this one, returning a new rope.
-RopeSequence.prototype.prepend = function prepend (other) {
-  if (!other.length) { return this }
-  return RopeSequence.from(other).append(this)
-};
-
-RopeSequence.prototype.appendInner = function appendInner (other) {
-  return new Append(this, other)
-};
-
-// :: (?number, ?number) → RopeSequence<T>
-// Create a rope repesenting a sub-sequence of this rope.
-RopeSequence.prototype.slice = function slice (from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.length; }
-
-  if (from >= to) { return RopeSequence.empty }
-  return this.sliceInner(Math.max(0, from), Math.min(this.length, to))
-};
-
-// :: (number) → T
-// Retrieve the element at the given position from this rope.
-RopeSequence.prototype.get = function get (i) {
-  if (i < 0 || i >= this.length) { return undefined }
-  return this.getInner(i)
-};
-
-// :: ((element: T, index: number) → ?bool, ?number, ?number)
-// Call the given function for each element between the given
-// indices. This tends to be more efficient than looping over the
-// indices and calling `get`, because it doesn't have to descend the
-// tree for every element.
-RopeSequence.prototype.forEach = function forEach (f, from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.length; }
-
-  if (from <= to)
-    { this.forEachInner(f, from, to, 0); }
-  else
-    { this.forEachInvertedInner(f, from, to, 0); }
-};
-
-// :: ((element: T, index: number) → U, ?number, ?number) → [U]
-// Map the given functions over the elements of the rope, producing
-// a flat array.
-RopeSequence.prototype.map = function map (f, from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.length; }
-
-  var result = [];
-  this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);
-  return result
-};
-
-// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>
-// Create a rope representing the given array, or return the rope
-// itself if a rope was given.
-RopeSequence.from = function from (values) {
-  if (values instanceof RopeSequence) { return values }
-  return values && values.length ? new Leaf(values) : RopeSequence.empty
-};
-
-var Leaf = (function (RopeSequence) {
-  function Leaf(values) {
-    RopeSequence.call(this);
-    this.values = values;
-  }
-
-  if ( RopeSequence ) { Leaf.__proto__ = RopeSequence; }
-  Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );
-  Leaf.prototype.constructor = Leaf;
-
-  var prototypeAccessors = { length: {},depth: {} };
-
-  Leaf.prototype.flatten = function flatten () {
-    return this.values
-  };
-
-  Leaf.prototype.sliceInner = function sliceInner (from, to) {
-    if (from == 0 && to == this.length) { return this }
-    return new Leaf(this.values.slice(from, to))
-  };
-
-  Leaf.prototype.getInner = function getInner (i) {
-    return this.values[i]
-  };
-
-  Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {
-    var this$1 = this;
-
-    for (var i = from; i < to; i++)
-      { if (f(this$1.values[i], start + i) === false) { return false } }
-  };
-
-  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {
-    var this$1 = this;
-
-    for (var i = from - 1; i >= to; i--)
-      { if (f(this$1.values[i], start + i) === false) { return false } }
-  };
-
-  Leaf.prototype.leafAppend = function leafAppend (other) {
-    if (this.length + other.length <= GOOD_LEAF_SIZE)
-      { return new Leaf(this.values.concat(other.flatten())) }
-  };
-
-  Leaf.prototype.leafPrepend = function leafPrepend (other) {
-    if (this.length + other.length <= GOOD_LEAF_SIZE)
-      { return new Leaf(other.flatten().concat(this.values)) }
-  };
-
-  prototypeAccessors.length.get = function () { return this.values.length };
-
-  prototypeAccessors.depth.get = function () { return 0 };
-
-  Object.defineProperties( Leaf.prototype, prototypeAccessors );
-
-  return Leaf;
-}(RopeSequence));
-
-// :: RopeSequence
-// The empty rope sequence.
-RopeSequence.empty = new Leaf([]);
-
-var Append = (function (RopeSequence) {
-  function Append(left, right) {
-    RopeSequence.call(this);
-    this.left = left;
-    this.right = right;
-    this.length = left.length + right.length;
-    this.depth = Math.max(left.depth, right.depth) + 1;
-  }
-
-  if ( RopeSequence ) { Append.__proto__ = RopeSequence; }
-  Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );
-  Append.prototype.constructor = Append;
-
-  Append.prototype.flatten = function flatten () {
-    return this.left.flatten().concat(this.right.flatten())
-  };
-
-  Append.prototype.getInner = function getInner (i) {
-    return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)
-  };
-
-  Append.prototype.forEachInner = function forEachInner (f, from, to, start) {
-    var leftLen = this.left.length;
-    if (from < leftLen &&
-        this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)
-      { return false }
-    if (to > leftLen &&
-        this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)
-      { return false }
-  };
-
-  Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {
-    var leftLen = this.left.length;
-    if (from > leftLen &&
-        this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)
-      { return false }
-    if (to < leftLen &&
-        this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)
-      { return false }
-  };
-
-  Append.prototype.sliceInner = function sliceInner (from, to) {
-    if (from == 0 && to == this.length) { return this }
-    var leftLen = this.left.length;
-    if (to <= leftLen) { return this.left.slice(from, to) }
-    if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }
-    return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))
-  };
-
-  Append.prototype.leafAppend = function leafAppend (other) {
-    var inner = this.right.leafAppend(other);
-    if (inner) { return new Append(this.left, inner) }
-  };
-
-  Append.prototype.leafPrepend = function leafPrepend (other) {
-    var inner = this.left.leafPrepend(other);
-    if (inner) { return new Append(inner, this.right) }
-  };
-
-  Append.prototype.appendInner = function appendInner (other) {
-    if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)
-      { return new Append(this.left, new Append(this.right, other)) }
-    return new Append(this, other)
-  };
-
-  return Append;
-}(RopeSequence));
-
-var dist$5 = RopeSequence;
-
-var history_1 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var RopeSequence = _interopDefault(dist$5);
-
-
-
-// ProseMirror's history isn't simply a way to roll back to a previous
-// state, because ProseMirror supports applying changes without adding
-// them to the history (for example during collaboration).
-//
-// To this end, each 'Branch' (one for the undo history and one for
-// the redo history) keeps an array of 'Items', which can optionally
-// hold a step (an actual undoable change), and always hold a position
-// map (which is needed to move changes below them to apply to the
-// current document).
-//
-// An item that has both a step and a selection bookmark is the start
-// of an 'event' — a group of changes that will be undone or redone at
-// once. (It stores only the bookmark, since that way we don't have to
-// provide a document until the selection is actually applied, which
-// is useful when compressing.)
-
-// Used to schedule history compression
-var max_empty_items = 500;
-
-var Branch = function Branch(items, eventCount) {
-  this.items = items;
-  this.eventCount = eventCount;
-};
-
-// : (Node, bool, ?Item) → ?{transform: Transform, selection: Object}
-// Pop the latest event off the branch's history and apply it
-// to a document transform.
-Branch.prototype.popEvent = function popEvent (state, preserveItems) {
-    var this$1 = this;
-
-  if (this.eventCount == 0) { return null }
-
-  var end = this.items.length;
-  for (;; end--) {
-    var next = this$1.items.get(end - 1);
-    if (next.selection) { --end; break }
-  }
-
-  var remap, mapFrom;
-  if (preserveItems) {
-    remap = this.remapping(end, this.items.length);
-    mapFrom = remap.maps.length;
-  }
-  var transform = state.tr;
-  var selection, remaining;
-  var addAfter = [], addBefore = [];
-
-  this.items.forEach(function (item, i) {
-    if (!item.step) {
-      if (!remap) {
-        remap = this$1.remapping(end, i + 1);
-        mapFrom = remap.maps.length;
-      }
-      mapFrom--;
-      addBefore.push(item);
-      return
-    }
-
-    if (remap) {
-      addBefore.push(new Item(item.map));
-      var step = item.step.map(remap.slice(mapFrom)), map;
-
-      if (step && transform.maybeStep(step).doc) {
-        map = transform.mapping.maps[transform.mapping.maps.length - 1];
-        addAfter.push(new Item(map, null, null, addAfter.length + addBefore.length));
-      }
-      mapFrom--;
-      if (map) { remap.appendMap(map, mapFrom); }
-    } else {
-      transform.maybeStep(item.step);
-    }
-
-    if (item.selection) {
-      selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;
-      remaining = new Branch(this$1.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this$1.eventCount - 1);
-      return false
-    }
-  }, this.items.length, 0);
-
-  return {remaining: remaining, transform: transform, selection: selection}
-};
-
-// : (Transform, Selection, Object)
-// Create a new branch with the given transform added.
-Branch.prototype.addTransform = function addTransform (transform, selection, histOptions, preserveItems) {
-  var newItems = [], eventCount = this.eventCount;
-  var oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;
-
-  for (var i = 0; i < transform.steps.length; i++) {
-    var step = transform.steps[i].invert(transform.docs[i]);
-    var item = new Item(transform.mapping.maps[i], step, selection), merged = (void 0);
-    if (merged = lastItem && lastItem.merge(item)) {
-      item = merged;
-      if (i) { newItems.pop(); }
-      else { oldItems = oldItems.slice(0, oldItems.length - 1); }
-    }
-    newItems.push(item);
-    if (selection) {
-      eventCount++;
-      selection = null;
-    }
-    if (!preserveItems) { lastItem = item; }
-  }
-  var overflow = eventCount - histOptions.depth;
-  if (overflow > DEPTH_OVERFLOW) {
-    oldItems = cutOffEvents(oldItems, overflow);
-    eventCount -= overflow;
-  }
-  return new Branch(oldItems.append(newItems), eventCount)
-};
-
-Branch.prototype.remapping = function remapping (from, to) {
-  var maps = [], mirrors = [];
-  this.items.forEach(function (item, i) {
-    if (item.mirrorOffset != null) {
-      var mirrorPos = i - item.mirrorOffset;
-      if (mirrorPos >= from) { mirrors.push(maps.length - item.mirrorOffset, maps.length); }
-    }
-    maps.push(item.map);
-  }, from, to);
-  return new dist$1.Mapping(maps, mirrors)
-};
-
-Branch.prototype.addMaps = function addMaps (array) {
-  if (this.eventCount == 0) { return this }
-  return new Branch(this.items.append(array.map(function (map) { return new Item(map); })), this.eventCount)
-};
-
-// : ([StepMap], Transform, [number])
-// When the collab module receives remote changes, the history has
-// to know about those, so that it can adjust the steps that were
-// rebased on top of the remote changes, and include the position
-// maps for the remote changes in its array of items.
-Branch.prototype.rebased = function rebased (rebasedTransform, rebasedCount) {
-  if (!this.eventCount) { return this }
-
-  var rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);
-
-  var mapping = rebasedTransform.mapping;
-  var newUntil = rebasedTransform.steps.length;
-  var eventCount = this.eventCount;
-  this.items.forEach(function (item) { if (item.selection) { eventCount--; } }, this.items.length - rebasedCount);
-
-  var iRebased = rebasedCount;
-  this.items.forEach(function (item) {
-    var pos = mapping.getMirror(--iRebased);
-    if (pos == null) { return }
-    newUntil = Math.min(newUntil, pos);
-    var map = mapping.maps[pos];
-    if (item.step) {
-      var step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);
-      var selection = item.selection && item.selection.map(mapping.slice(iRebased, pos));
-      if (selection) { eventCount++; }
-      rebasedItems.push(new Item(map, step, selection));
-    } else {
-      rebasedItems.push(new Item(map));
-    }
-  }, start);
-
-  var newMaps = [];
-  for (var i = rebasedCount; i < newUntil; i++)
-    { newMaps.push(new Item(mapping.maps[i])); }
-  var items = this.items.slice(0, start).append(newMaps).append(rebasedItems);
-  var branch = new Branch(items, eventCount);
-
-  if (branch.emptyItemCount() > max_empty_items)
-    { branch = branch.compress(this.items.length - rebasedItems.length); }
-  return branch
-};
-
-Branch.prototype.emptyItemCount = function emptyItemCount () {
-  var count = 0;
-  this.items.forEach(function (item) { if (!item.step) { count++; } });
-  return count
-};
-
-// Compressing a branch means rewriting it to push the air (map-only
-// items) out. During collaboration, these naturally accumulate
-// because each remote change adds one. The `upto` argument is used
-// to ensure that only the items below a given level are compressed,
-// because `rebased` relies on a clean, untouched set of items in
-// order to associate old items with rebased steps.
-Branch.prototype.compress = function compress (upto) {
-    if ( upto === void 0 ) { upto = this.items.length; }
-
-  var remap = this.remapping(0, upto), mapFrom = remap.maps.length;
-  var items = [], events = 0;
-  this.items.forEach(function (item, i) {
-    if (i >= upto) {
-      items.push(item);
-      if (item.selection) { events++; }
-    } else if (item.step) {
-      var step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();
-      mapFrom--;
-      if (map) { remap.appendMap(map, mapFrom); }
-      if (step) {
-        var selection = item.selection && item.selection.map(remap.slice(mapFrom));
-        if (selection) { events++; }
-        var newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;
-        if (merged = items.length && items[last].merge(newItem))
-          { items[last] = merged; }
-        else
-          { items.push(newItem); }
-      }
-    } else if (item.map) {
-      mapFrom--;
-    }
-  }, this.items.length, 0);
-  return new Branch(RopeSequence.from(items.reverse()), events)
-};
-
-Branch.empty = new Branch(RopeSequence.empty, 0);
-
-function cutOffEvents(items, n) {
-  var cutPoint;
-  items.forEach(function (item, i) {
-    if (item.selection && (n-- == 0)) {
-      cutPoint = i;
-      return false
-    }
-  });
-  return items.slice(cutPoint)
-}
-
-var Item = function Item(map, step, selection, mirrorOffset) {
-  this.map = map;
-  this.step = step;
-  this.selection = selection;
-  this.mirrorOffset = mirrorOffset;
-};
-
-Item.prototype.merge = function merge (other) {
-  if (this.step && other.step && !other.selection) {
-    var step = other.step.merge(this.step);
-    if (step) { return new Item(step.getMap().invert(), step, this.selection) }
-  }
-};
-
-// The value of the state field that tracks undo/redo history for that
-// state. Will be stored in the plugin state when the history plugin
-// is active.
-var HistoryState = function HistoryState(done, undone, prevMap, prevTime) {
-  this.done = done;
-  this.undone = undone;
-  this.prevMap = prevMap;
-  this.prevTime = prevTime;
-};
-
-var DEPTH_OVERFLOW = 20;
-
-// : (EditorState, EditorState, Selection, Object)
-// Record a transformation in undo history.
-function applyTransaction(history, state, tr, options) {
-  var newState = tr.getMeta(historyKey), rebased;
-  if (newState) { return newState }
-
-  if (tr.getMeta(closeHistoryKey)) { history = new HistoryState(history.done, history.undone, null, 0); }
-
-  var appended = tr.getMeta("appendedTransaction");
-  if (tr.steps.length == 0) {
-    return history
-  } else if ((appended || tr).getMeta("addToHistory") !== false) {
-    // Group transforms that occur in quick succession into one event.
-    var newGroup = history.prevTime < (tr.time || 0) - options.newGroupDelay ||
-        !appended && !isAdjacentToLastStep(tr, history.prevMap, history.done);
-    return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : null,
-                                                      options, mustPreserveItems(state)),
-                            Branch.empty, tr.mapping.maps[tr.steps.length - 1], tr.time)
-  } else if (rebased = tr.getMeta("rebased")) {
-    // Used by the collab module to tell the history that some of its
-    // content has been rebased.
-    return new HistoryState(history.done.rebased(tr, rebased),
-                            history.undone.rebased(tr, rebased),
-                            history.prevMap && tr.mapping.maps[tr.steps.length - 1], history.prevTime)
-  } else {
-    return new HistoryState(history.done.addMaps(tr.mapping.maps),
-                            history.undone.addMaps(tr.mapping.maps),
-                            history.prevMap, history.prevTime)
-  }
-}
-
-function isAdjacentToLastStep(transform, prevMap, done) {
-  if (!prevMap) { return false }
-  var firstMap = transform.mapping.maps[0], adjacent = false;
-  if (!firstMap) { return true }
-  firstMap.forEach(function (start, end) {
-    done.items.forEach(function (item) {
-      if (item.step) {
-        prevMap.forEach(function (_start, _end, rStart, rEnd) {
-          if (start <= rEnd && end >= rStart) { adjacent = true; }
-        });
-        return false
-      } else {
-        start = item.map.invert().map(start, -1);
-        end = item.map.invert().map(end, 1);
-      }
-    }, done.items.length, 0);
-  });
-  return adjacent
-}
-
-// : (HistoryState, EditorState, (tr: Transaction), bool)
-// Apply the latest event from one branch to the document and optionally
-// shift the event onto the other branch. Returns true when an event could
-// be shifted.
-function histTransaction(history, state, dispatch, redo) {
-  var preserveItems = mustPreserveItems(state), histOptions = historyKey.get(state).spec.config;
-  var pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);
-  if (!pop) { return }
-
-  var selection = pop.selection.resolve(pop.transform.doc);
-  var added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(),
-                                                                  histOptions, preserveItems);
-
-  var newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0);
-  dispatch(pop.transform.setSelection(selection).setMeta(historyKey, newHist).scrollIntoView());
-}
-
-var cachedPreserveItems = false;
-var cachedPreserveItemsPlugins = null;
-// Check whether any plugin in the given state has a
-// `historyPreserveItems` property in its spec, in which case we must
-// preserve steps exactly as they came in, so that they can be
-// rebased.
-function mustPreserveItems(state) {
-  var plugins = state.plugins;
-  if (cachedPreserveItemsPlugins != plugins) {
-    cachedPreserveItems = false;
-    cachedPreserveItemsPlugins = plugins;
-    for (var i = 0; i < plugins.length; i++) { if (plugins[i].spec.historyPreserveItems) {
-      cachedPreserveItems = true;
-      break
-    } }
-  }
-  return cachedPreserveItems
-}
-
-// :: (Transaction) → Transaction
-// Set a flag on the given transaction that will prevent further steps
-// from being appended to an existing history event (so that they
-// require a separate undo command to undo).
-function closeHistory(tr) {
-  return tr.setMeta(closeHistoryKey, true)
-}
-
-var historyKey = new dist$2.PluginKey("history");
-var closeHistoryKey = new dist$2.PluginKey("closeHistory");
-
-// :: (?Object) → Plugin
-// Returns a plugin that enables the undo history for an editor. The
-// plugin will track undo and redo stacks, which can be used with the
-// [`undo`](#history.undo) and [`redo`](#history.redo) commands.
-//
-// You can set an `"addToHistory"` [metadata
-// property](#state.Transaction.setMeta) of `false` on a transaction
-// to prevent it from being rolled back by undo.
-//
-//   config::-
-//   Supports the following configuration options:
-//
-//     depth:: ?number
-//     The amount of history events that are collected before the
-//     oldest events are discarded. Defaults to 100.
-//
-//     newGroupDelay:: ?number
-//     The delay between changes after which a new group should be
-//     started. Defaults to 500 (milliseconds). Note that when changes
-//     aren't adjacent, a new group is always started.
-function history(config) {
-  config = {depth: config && config.depth || 100,
-            newGroupDelay: config && config.newGroupDelay || 500};
-  return new dist$2.Plugin({
-    key: historyKey,
-
-    state: {
-      init: function init() {
-        return new HistoryState(Branch.empty, Branch.empty, null, 0)
-      },
-      apply: function apply(tr, hist, state) {
-        return applyTransaction(hist, state, tr, config)
-      }
-    },
-
-    config: config
-  })
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// A command function that undoes the last change, if any.
-function undo(state, dispatch) {
-  var hist = historyKey.getState(state);
-  if (!hist || hist.done.eventCount == 0) { return false }
-  if (dispatch) { histTransaction(hist, state, dispatch, false); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// A command function that redoes the last undone change, if any.
-function redo(state, dispatch) {
-  var hist = historyKey.getState(state);
-  if (!hist || hist.undone.eventCount == 0) { return false }
-  if (dispatch) { histTransaction(hist, state, dispatch, true); }
-  return true
-}
-
-// :: (EditorState) → number
-// The amount of undoable events available in a given state.
-function undoDepth(state) {
-  var hist = historyKey.getState(state);
-  return hist ? hist.done.eventCount : 0
-}
-
-// :: (EditorState) → number
-// The amount of redoable events available in a given editor state.
-function redoDepth(state) {
-  var hist = historyKey.getState(state);
-  return hist ? hist.undone.eventCount : 0
-}
-
-exports.HistoryState = HistoryState;
-exports.closeHistory = closeHistory;
-exports.history = history;
-exports.undo = undo;
-exports.redo = redo;
-exports.undoDepth = undoDepth;
-exports.redoDepth = redoDepth;
-
-});
-
-unwrapExports(history_1);
-var history_2 = history_1.HistoryState;
-var history_3 = history_1.closeHistory;
-var history_4 = history_1.history;
-var history_5 = history_1.undo;
-var history_6 = history_1.redo;
-var history_7 = history_1.undoDepth;
-var history_8 = history_1.redoDepth;
-
-var commands = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Delete the selection, if there is one.
-function deleteSelection(state, dispatch) {
-  if (state.selection.empty) { return false }
-  if (dispatch) { dispatch(state.tr.deleteSelection().scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// If the selection is empty and at the start of a textblock, try to
-// reduce the distance between that block and the one before it—if
-// there's a block directly before it that can be joined, join them.
-// If not, try to move the selected block closer to the next one in
-// the document structure by lifting it out of its parent or moving it
-// into a parent of the previous block. Will use the view for accurate
-// (bidi-aware) start-of-textblock detection if given.
-function joinBackward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("backward", state)
-                        : $cursor.parentOffset > 0))
-    { return false }
-
-  var $cut = findCutBefore($cursor);
-
-  // If there is no node before this, try to lift
-  if (!$cut) {
-    var range = $cursor.blockRange(), target = range && dist$1.liftTarget(range);
-    if (target == null) { return false }
-    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-    return true
-  }
-
-  var before = $cut.nodeBefore;
-  // Apply the joining algorithm
-  if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))
-    { return true }
-
-  // If the node below has no content and the node above is
-  // selectable, delete the node below and select the one above.
-  if ($cursor.parent.content.size == 0 &&
-      (textblockAt(before, "end") || dist$2.NodeSelection.isSelectable(before))) {
-    if (dispatch) {
-      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
-      tr.setSelection(textblockAt(before, "end") ? dist$2.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)
-                      : dist$2.NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));
-      dispatch(tr.scrollIntoView());
-    }
-    return true
-  }
-
-  // If the node before is an atom, delete it
-  if (before.isAtom && $cut.depth == $cursor.depth - 1) {
-    if (dispatch) { dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView()); }
-    return true
-  }
-
-  return false
-}
-
-function textblockAt(node, side) {
-  for (; node; node = (side == "start" ? node.firstChild : node.lastChild))
-    { if (node.isTextblock) { return true } }
-  return false
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// When the selection is empty and at the start of a textblock, select
-// the node before that textblock, if possible. This is intended to be
-// bound to keys like backspace, after
-// [`joinBackward`](#commands.joinBackward) or other deleting
-// commands, as a fall-back behavior when the schema doesn't allow
-// deletion at the selected point.
-function selectNodeBackward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("backward", state)
-                        : $cursor.parentOffset > 0))
-    { return false }
-
-  var $cut = findCutBefore($cursor), node = $cut && $cut.nodeBefore;
-  if (!node || !dist$2.NodeSelection.isSelectable(node)) { return false }
-  if (dispatch)
-    { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView()); }
-  return true
-}
-
-function findCutBefore($pos) {
-  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
-    if ($pos.index(i) > 0) { return $pos.doc.resolve($pos.before(i + 1)) }
-    if ($pos.node(i).type.spec.isolating) { break }
-  } }
-  return null
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// If the selection is empty and the cursor is at the end of a
-// textblock, try to reduce or remove the boundary between that block
-// and the one after it, either by joining them or by moving the other
-// block closer to this one in the tree structure. Will use the view
-// for accurate start-of-textblock detection if given.
-function joinForward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("forward", state)
-                        : $cursor.parentOffset < $cursor.parent.content.size))
-    { return false }
-
-  var $cut = findCutAfter($cursor);
-
-  // If there is no node after this, there's nothing to do
-  if (!$cut) { return false }
-
-  var after = $cut.nodeAfter;
-  // Try the joining algorithm
-  if (deleteBarrier(state, $cut, dispatch)) { return true }
-
-  // If the node above has no content and the node below is
-  // selectable, delete the node above and select the one below.
-  if ($cursor.parent.content.size == 0 &&
-      (textblockAt(after, "start") || dist$2.NodeSelection.isSelectable(after))) {
-    if (dispatch) {
-      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
-      tr.setSelection(textblockAt(after, "start") ? dist$2.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)
-                      : dist$2.NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));
-      dispatch(tr.scrollIntoView());
-    }
-    return true
-  }
-
-  // If the next node is an atom, delete it
-  if (after.isAtom && $cut.depth == $cursor.depth - 1) {
-    if (dispatch) { dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView()); }
-    return true
-  }
-
-  return false
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// When the selection is empty and at the end of a textblock, select
-// the node coming after that textblock, if possible. This is intended
-// to be bound to keys like delete, after
-// [`joinForward`](#commands.joinForward) and similar deleting
-// commands, to provide a fall-back behavior when the schema doesn't
-// allow deletion at the selected point.
-function selectNodeForward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("forward", state)
-                        : $cursor.parentOffset < $cursor.parent.content.size))
-    { return false }
-
-  var $cut = findCutAfter($cursor), node = $cut && $cut.nodeAfter;
-  if (!node || !dist$2.NodeSelection.isSelectable(node)) { return false }
-  if (dispatch)
-    { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, $cut.pos)).scrollIntoView()); }
-  return true
-}
-
-function findCutAfter($pos) {
-  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
-    var parent = $pos.node(i);
-    if ($pos.index(i) + 1 < parent.childCount) { return $pos.doc.resolve($pos.after(i + 1)) }
-    if (parent.type.spec.isolating) { break }
-  } }
-  return null
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Join the selected block or, if there is a text selection, the
-// closest ancestor block of the selection that can be joined, with
-// the sibling above it.
-function joinUp(state, dispatch) {
-  var sel = state.selection, nodeSel = sel instanceof dist$2.NodeSelection, point;
-  if (nodeSel) {
-    if (sel.node.isTextblock || !dist$1.canJoin(state.doc, sel.from)) { return false }
-    point = sel.from;
-  } else {
-    point = dist$1.joinPoint(state.doc, sel.from, -1);
-    if (point == null) { return false }
-  }
-  if (dispatch) {
-    var tr = state.tr.join(point);
-    if (nodeSel) { tr.setSelection(dist$2.NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize)); }
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Join the selected block, or the closest ancestor of the selection
-// that can be joined, with the sibling after it.
-function joinDown(state, dispatch) {
-  var sel = state.selection, point;
-  if (sel instanceof dist$2.NodeSelection) {
-    if (sel.node.isTextblock || !dist$1.canJoin(state.doc, sel.to)) { return false }
-    point = sel.to;
-  } else {
-    point = dist$1.joinPoint(state.doc, sel.to, 1);
-    if (point == null) { return false }
-  }
-  if (dispatch)
-    { dispatch(state.tr.join(point).scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Lift the selected block, or the closest ancestor block of the
-// selection that can be lifted, out of its parent node.
-function lift(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var $to = ref.$to;
-  var range = $from.blockRange($to), target = range && dist$1.liftTarget(range);
-  if (target == null) { return false }
-  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// If the selection is in a node whose type has a truthy
-// [`code`](#model.NodeSpec.code) property in its spec, replace the
-// selection with a newline character.
-function newlineInCode(state, dispatch) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
-  if (dispatch) { dispatch(state.tr.insertText("\n").scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// When the selection is in a node with a truthy
-// [`code`](#model.NodeSpec.code) property in its spec, create a
-// default block after the code block, and move the cursor there.
-function exitCode(state, dispatch) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
-  var above = $head.node(-1), after = $head.indexAfter(-1), type = above.contentMatchAt(after).defaultType;
-  if (!above.canReplaceWith(after, after, type)) { return false }
-  if (dispatch) {
-    var pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());
-    tr.setSelection(dist$2.Selection.near(tr.doc.resolve(pos), 1));
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// If a block node is selected, create an empty paragraph before (if
-// it is its parent's first child) or after it.
-function createParagraphNear(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var $to = ref.$to;
-  if ($from.parent.inlineContent || $to.parent.inlineContent) { return false }
-  var type = $from.parent.contentMatchAt($to.indexAfter()).defaultType;
-  if (!type || !type.isTextblock) { return false }
-  if (dispatch) {
-    var side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;
-    var tr = state.tr.insert(side, type.createAndFill());
-    tr.setSelection(dist$2.TextSelection.create(tr.doc, side + 1));
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// If the cursor is in an empty textblock that can be lifted, lift the
-// block.
-function liftEmptyBlock(state, dispatch) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || $cursor.parent.content.size) { return false }
-  if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {
-    var before = $cursor.before();
-    if (dist$1.canSplit(state.doc, before)) {
-      if (dispatch) { dispatch(state.tr.split(before).scrollIntoView()); }
-      return true
-    }
-  }
-  var range = $cursor.blockRange(), target = range && dist$1.liftTarget(range);
-  if (target == null) { return false }
-  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Split the parent block of the selection. If the selection is a text
-// selection, also delete its content.
-function splitBlock(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var $to = ref.$to;
-  if (state.selection instanceof dist$2.NodeSelection && state.selection.node.isBlock) {
-    if (!$from.parentOffset || !dist$1.canSplit(state.doc, $from.pos)) { return false }
-    if (dispatch) { dispatch(state.tr.split($from.pos).scrollIntoView()); }
-    return true
-  }
-
-  if (!$from.parent.isBlock) { return false }
-
-  if (dispatch) {
-    var atEnd = $to.parentOffset == $to.parent.content.size;
-    var tr = state.tr;
-    if (state.selection instanceof dist$2.TextSelection) { tr.deleteSelection(); }
-    var deflt = $from.depth == 0 ? null : $from.node(-1).contentMatchAt($from.indexAfter(-1)).defaultType;
-    var types = atEnd && deflt ? [{type: deflt}] : null;
-    var can = dist$1.canSplit(tr.doc, $from.pos, 1, types);
-    if (!types && !can && dist$1.canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt && [{type: deflt}])) {
-      types = [{type: deflt}];
-      can = true;
-    }
-    if (can) {
-      tr.split(tr.mapping.map($from.pos), 1, types);
-      if (!atEnd && !$from.parentOffset && $from.parent.type != deflt &&
-          $from.node(-1).canReplace($from.index(-1), $from.indexAfter(-1), dist.Fragment.from(deflt.create(), $from.parent)))
-        { tr.setNodeMarkup(tr.mapping.map($from.before()), deflt); }
-    }
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Acts like [`splitBlock`](#commands.splitBlock), but without
-// resetting the set of active marks at the cursor.
-function splitBlockKeepMarks(state, dispatch) {
-  return splitBlock(state, dispatch && (function (tr) {
-    var marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());
-    if (marks) { tr.ensureMarks(marks); }
-    dispatch(tr);
-  }))
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Move the selection to the node wrapping the current selection, if
-// any. (Will not select the document node.)
-function selectParentNode(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var to = ref.to;
-  var pos;
-  var same = $from.sharedDepth(to);
-  if (same == 0) { return false }
-  pos = $from.before(same);
-  if (dispatch) { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, pos))); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Select the whole document.
-function selectAll(state, dispatch) {
-  if (dispatch) { dispatch(state.tr.setSelection(new dist$2.AllSelection(state.doc))); }
-  return true
-}
-
-function joinMaybeClear(state, $pos, dispatch) {
-  var before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();
-  if (!before || !after || !before.type.compatibleContent(after.type)) { return false }
-  if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {
-    if (dispatch) { dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView()); }
-    return true
-  }
-  if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || dist$1.canJoin(state.doc, $pos.pos)))
-    { return false }
-  if (dispatch)
-    { dispatch(state.tr
-             .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))
-             .join($pos.pos)
-             .scrollIntoView()); }
-  return true
-}
-
-function deleteBarrier(state, $cut, dispatch) {
-  var before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;
-  if (before.type.spec.isolating || after.type.spec.isolating) { return false }
-  if (joinMaybeClear(state, $cut, dispatch)) { return true }
-
-  if ($cut.parent.canReplace($cut.index(), $cut.index() + 1) &&
-      (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&
-      match.matchType(conn[0] || after.type).validEnd) {
-    if (dispatch) {
-      var end = $cut.pos + after.nodeSize, wrap = dist.Fragment.empty;
-      for (var i = conn.length - 1; i >= 0; i--)
-        { wrap = dist.Fragment.from(conn[i].create(null, wrap)); }
-      wrap = dist.Fragment.from(before.copy(wrap));
-      var tr = state.tr.step(new dist$1.ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new dist.Slice(wrap, 1, 0), conn.length, true));
-      var joinAt = end + 2 * conn.length;
-      if (dist$1.canJoin(tr.doc, joinAt)) { tr.join(joinAt); }
-      dispatch(tr.scrollIntoView());
-    }
-    return true
-  }
-
-  var selAfter = dist$2.Selection.findFrom($cut, 1);
-  var range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && dist$1.liftTarget(range);
-  if (target != null && target >= $cut.depth) {
-    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-    return true
-  }
-
-  return false
-}
-
-// Parameterized commands
-
-// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Wrap the selection in a node of the given type with the given
-// attributes.
-function wrapIn(nodeType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to), wrapping = range && dist$1.findWrapping(range, nodeType, attrs);
-    if (!wrapping) { return false }
-    if (dispatch) { dispatch(state.tr.wrap(range, wrapping).scrollIntoView()); }
-    return true
-  }
-}
-
-// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command that tries to set the selected textblocks to the
-// given node type with the given attributes.
-function setBlockType(nodeType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var from = ref.from;
-    var to = ref.to;
-    var applicable = false;
-    state.doc.nodesBetween(from, to, function (node, pos) {
-      if (applicable) { return false }
-      if (!node.isTextblock || node.hasMarkup(nodeType, attrs)) { return }
-      if (node.type == nodeType) {
-        applicable = true;
-      } else {
-        var $pos = state.doc.resolve(pos), index = $pos.index();
-        applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);
-      }
-    });
-    if (!applicable) { return false }
-    if (dispatch) { dispatch(state.tr.setBlockType(from, to, nodeType, attrs).scrollIntoView()); }
-    return true
-  }
-}
-
-function markApplies(doc, ranges, type) {
-  var loop = function ( i ) {
-    var ref = ranges[i];
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var can = $from.depth == 0 ? doc.type.allowsMarkType(type) : false;
-    doc.nodesBetween($from.pos, $to.pos, function (node) {
-      if (can) { return false }
-      can = node.inlineContent && node.type.allowsMarkType(type);
-    });
-    if (can) { return { v: true } }
-  };
-
-  for (var i = 0; i < ranges.length; i++) {
-    var returned = loop( i );
-
-    if ( returned ) { return returned.v; }
-  }
-  return false
-}
-
-// :: (MarkType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Create a command function that toggles the given mark with the
-// given attributes. Will return `false` when the current selection
-// doesn't support that mark. This will remove the mark if any marks
-// of that type exist in the selection, or add it otherwise. If the
-// selection is empty, this applies to the [stored
-// marks](#state.EditorState.storedMarks) instead of a range of the
-// document.
-function toggleMark(markType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var empty = ref.empty;
-    var $cursor = ref.$cursor;
-    var ranges = ref.ranges;
-    if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType)) { return false }
-    if (dispatch) {
-      if ($cursor) {
-        if (markType.isInSet(state.storedMarks || $cursor.marks()))
-          { dispatch(state.tr.removeStoredMark(markType)); }
-        else
-          { dispatch(state.tr.addStoredMark(markType.create(attrs))); }
-      } else {
-        var has = false, tr = state.tr;
-        for (var i = 0; !has && i < ranges.length; i++) {
-          var ref$1 = ranges[i];
-          var $from = ref$1.$from;
-          var $to = ref$1.$to;
-          has = state.doc.rangeHasMark($from.pos, $to.pos, markType);
-        }
-        for (var i$1 = 0; i$1 < ranges.length; i$1++) {
-          var ref$2 = ranges[i$1];
-          var $from$1 = ref$2.$from;
-          var $to$1 = ref$2.$to;
-          if (has) { tr.removeMark($from$1.pos, $to$1.pos, markType); }
-          else { tr.addMark($from$1.pos, $to$1.pos, markType.create(attrs)); }
-        }
-        dispatch(tr.scrollIntoView());
-      }
-    }
-    return true
-  }
-}
-
-function wrapDispatchForJoin(dispatch, isJoinable) {
-  return function (tr) {
-    if (!tr.isGeneric) { return dispatch(tr) }
-
-    var ranges = [];
-    for (var i = 0; i < tr.mapping.maps.length; i++) {
-      var map = tr.mapping.maps[i];
-      for (var j = 0; j < ranges.length; j++)
-        { ranges[j] = map.map(ranges[j]); }
-      map.forEach(function (_s, _e, from, to) { return ranges.push(from, to); });
-    }
-
-    // Figure out which joinable points exist inside those ranges,
-    // by checking all node boundaries in their parent nodes.
-    var joinable = [];
-    for (var i$1 = 0; i$1 < ranges.length; i$1 += 2) {
-      var from = ranges[i$1], to = ranges[i$1 + 1];
-      var $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);
-      for (var index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {
-        var after = parent.maybeChild(index);
-        if (!after) { break }
-        if (index && joinable.indexOf(pos) == -1) {
-          var before = parent.child(index - 1);
-          if (before.type == after.type && isJoinable(before, after))
-            { joinable.push(pos); }
-        }
-        pos += after.nodeSize;
-      }
-    }
-    // Join the joinable points
-    joinable.sort(function (a, b) { return a - b; });
-    for (var i$2 = joinable.length - 1; i$2 >= 0; i$2--) {
-      if (dist$1.canJoin(tr.doc, joinable[i$2])) { tr.join(joinable[i$2]); }
-    }
-    dispatch(tr);
-  }
-}
-
-// :: ((state: EditorState, ?(tr: Transaction)) → bool, union<(before: Node, after: Node) → bool, [string]>) → (state: EditorState, ?(tr: Transaction)) → bool
-// Wrap a command so that, when it produces a transform that causes
-// two joinable nodes to end up next to each other, those are joined.
-// Nodes are considered joinable when they are of the same type and
-// when the `isJoinable` predicate returns true for them or, if an
-// array of strings was passed, if their node type name is in that
-// array.
-function autoJoin(command, isJoinable) {
-  if (Array.isArray(isJoinable)) {
-    var types = isJoinable;
-    isJoinable = function (node) { return types.indexOf(node.type.name) > -1; };
-  }
-  return function (state, dispatch) { return command(state, dispatch && wrapDispatchForJoin(dispatch, isJoinable)); }
-}
-
-// :: (...[(EditorState, ?(tr: Transaction), ?EditorView) → bool]) → (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// Combine a number of command functions into a single function (which
-// calls them one by one until one returns true).
-function chainCommands() {
-  var arguments$1 = arguments;
-
-  var commands = [], len = arguments.length;
-  while ( len-- ) { commands[ len ] = arguments$1[ len ]; }
-
-  return function(state, dispatch, view) {
-    for (var i = 0; i < commands.length; i++)
-      { if (commands[i](state, dispatch, view)) { return true } }
-    return false
-  }
-}
-
-var backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);
-var del = chainCommands(deleteSelection, joinForward, selectNodeForward);
-
-// :: Object
-// A basic keymap containing bindings not specific to any schema.
-// Binds the following keys (when multiple commands are listed, they
-// are chained with [`chainCommands`](#commands.chainCommands)):
-//
-// * **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`
-// * **Mod-Enter** to `exitCode`
-// * **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`
-// * **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
-// * **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
-// * **Mod-a** to `selectAll`
-var pcBaseKeymap = {
-  "Enter": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),
-  "Mod-Enter": exitCode,
-  "Backspace": backspace,
-  "Mod-Backspace": backspace,
-  "Delete": del,
-  "Mod-Delete": del,
-  "Mod-a": selectAll
-};
-
-// :: Object
-// A copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,
-// **Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and
-// **Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like
-// Ctrl-Delete.
-var macBaseKeymap = {
-  "Ctrl-h": pcBaseKeymap["Backspace"],
-  "Alt-Backspace": pcBaseKeymap["Mod-Backspace"],
-  "Ctrl-d": pcBaseKeymap["Delete"],
-  "Ctrl-Alt-Backspace": pcBaseKeymap["Mod-Delete"],
-  "Alt-Delete": pcBaseKeymap["Mod-Delete"],
-  "Alt-d": pcBaseKeymap["Mod-Delete"]
-};
-for (var key in pcBaseKeymap) { macBaseKeymap[key] = pcBaseKeymap[key]; }
-
-// declare global: os, navigator
-var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform)
-          : typeof os != "undefined" ? os.platform() == "darwin" : false;
-
-// :: Object
-// Depending on the detected platform, this will hold
-// [`pcBasekeymap`](#commands.pcBaseKeymap) or
-// [`macBaseKeymap`](#commands.macBaseKeymap).
-var baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;
-
-exports.deleteSelection = deleteSelection;
-exports.joinBackward = joinBackward;
-exports.selectNodeBackward = selectNodeBackward;
-exports.joinForward = joinForward;
-exports.selectNodeForward = selectNodeForward;
-exports.joinUp = joinUp;
-exports.joinDown = joinDown;
-exports.lift = lift;
-exports.newlineInCode = newlineInCode;
-exports.exitCode = exitCode;
-exports.createParagraphNear = createParagraphNear;
-exports.liftEmptyBlock = liftEmptyBlock;
-exports.splitBlock = splitBlock;
-exports.splitBlockKeepMarks = splitBlockKeepMarks;
-exports.selectParentNode = selectParentNode;
-exports.selectAll = selectAll;
-exports.wrapIn = wrapIn;
-exports.setBlockType = setBlockType;
-exports.toggleMark = toggleMark;
-exports.autoJoin = autoJoin;
-exports.chainCommands = chainCommands;
-exports.pcBaseKeymap = pcBaseKeymap;
-exports.macBaseKeymap = macBaseKeymap;
-exports.baseKeymap = baseKeymap;
-
-});
-
-unwrapExports(commands);
-var commands_1 = commands.deleteSelection;
-var commands_2 = commands.joinBackward;
-var commands_3 = commands.selectNodeBackward;
-var commands_4 = commands.joinForward;
-var commands_5 = commands.selectNodeForward;
-var commands_6 = commands.joinUp;
-var commands_7 = commands.joinDown;
-var commands_8 = commands.lift;
-var commands_9 = commands.newlineInCode;
-var commands_10 = commands.exitCode;
-var commands_11 = commands.createParagraphNear;
-var commands_12 = commands.liftEmptyBlock;
-var commands_13 = commands.splitBlock;
-var commands_14 = commands.splitBlockKeepMarks;
-var commands_15 = commands.selectParentNode;
-var commands_16 = commands.selectAll;
-var commands_17 = commands.wrapIn;
-var commands_18 = commands.setBlockType;
-var commands_19 = commands.toggleMark;
-var commands_20 = commands.autoJoin;
-var commands_21 = commands.chainCommands;
-var commands_22 = commands.pcBaseKeymap;
-var commands_23 = commands.macBaseKeymap;
-var commands_24 = commands.baseKeymap;
-
-var dist$6 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-// ::- Input rules are regular expressions describing a piece of text
-// that, when typed, causes something to happen. This might be
-// changing two dashes into an emdash, wrapping a paragraph starting
-// with `"> "` into a blockquote, or something entirely different.
-var InputRule = function InputRule(match, handler) {
-  this.match = match;
-  this.handler = typeof handler == "string" ? stringHandler(handler) : handler;
-};
-
-function stringHandler(string) {
-  return function(state, match, start, end) {
-    var insert = string;
-    if (match[1]) {
-      var offset = match[0].lastIndexOf(match[1]);
-      insert += match[0].slice(offset + match[1].length);
-      start += offset;
-      var cutOff = start - end;
-      if (cutOff > 0) {
-        insert = match[0].slice(offset - cutOff, offset) + insert;
-        start = end;
-      }
-    }
-    var marks = state.doc.resolve(start).marks();
-    return state.tr.replaceWith(start, end, state.schema.text(insert, marks))
-  }
-}
-
-var MAX_MATCH = 500;
-
-// :: (config: {rules: [InputRule]}) → Plugin
-// Create an input rules plugin. When enabled, it will cause text
-// input that matches any of the given rules to trigger the rule's
-// action.
-function inputRules(ref) {
-  var rules = ref.rules;
-
-  return new dist$2.Plugin({
-    state: {
-      init: function init() { return null },
-      apply: function apply(tr, prev) {
-        var stored = tr.getMeta(this);
-        if (stored) { return stored }
-        return tr.selectionSet || tr.docChanged ? null : prev
-      }
-    },
-
-    props: {
-      handleTextInput: function handleTextInput(view, from, to, text) {
-        var this$1 = this;
-
-        var state = view.state, $from = state.doc.resolve(from);
-        if ($from.parent.type.spec.code) { return false }
-        var textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset,
-                                                  null, "\ufffc") + text;
-        for (var i = 0; i < rules.length; i++) {
-          var match = rules[i].match.exec(textBefore);
-          var tr = match && rules[i].handler(state, match, from - (match[0].length - text.length), to);
-          if (!tr) { continue }
-          view.dispatch(tr.setMeta(this$1, {transform: tr, from: from, to: to, text: text}));
-          return true
-        }
-        return false
-      }
-    },
-
-    isInputRules: true
-  })
-}
-
-// :: (EditorState, ?(Transaction)) → bool
-// This is a command that will undo an input rule, if applying such a
-// rule was the last thing that the user did.
-function undoInputRule(state, dispatch) {
-  var plugins = state.plugins;
-  for (var i = 0; i < plugins.length; i++) {
-    var plugin = plugins[i], undoable = (void 0);
-    if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {
-      if (dispatch) {
-        var tr = state.tr, toUndo = undoable.transform;
-        for (var j = toUndo.steps.length - 1; j >= 0; j--)
-          { tr.step(toUndo.steps[j].invert(toUndo.docs[j])); }
-        var marks = tr.doc.resolve(undoable.from).marks();
-        dispatch(tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks)));
-      }
-      return true
-    }
-  }
-  return false
-}
-
-// :: InputRule Converts double dashes to an emdash.
-var emDash = new InputRule(/--$/, "—");
-// :: InputRule Converts three dots to an ellipsis character.
-var ellipsis = new InputRule(/\.\.\.$/, "…");
-// :: InputRule “Smart” opening double quotes.
-var openDoubleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(")$/, "“");
-// :: InputRule “Smart” closing double quotes.
-var closeDoubleQuote = new InputRule(/"$/, "”");
-// :: InputRule “Smart” opening single quotes.
-var openSingleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(')$/, "‘");
-// :: InputRule “Smart” closing single quotes.
-var closeSingleQuote = new InputRule(/'$/, "’");
-
-// :: [InputRule] Smart-quote related input rules.
-var smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];
-
-// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>, ?([string], Node) → bool) → InputRule
-// Build an input rule for automatically wrapping a textblock when a
-// given string is typed. The `regexp` argument is
-// directly passed through to the `InputRule` constructor. You'll
-// probably want the regexp to start with `^`, so that the pattern can
-// only occur at the start of a textblock.
-//
-// `nodeType` is the type of node to wrap in. If it needs attributes,
-// you can either pass them directly, or pass a function that will
-// compute them from the regular expression match.
-//
-// By default, if there's a node with the same type above the newly
-// wrapped node, the rule will try to [join](#transform.Transform.join) those
-// two nodes. You can pass a join predicate, which takes a regular
-// expression match and the node before the wrapped node, and can
-// return a boolean to indicate whether a join should happen.
-function wrappingInputRule(regexp, nodeType, getAttrs, joinPredicate) {
-  return new InputRule(regexp, function (state, match, start, end) {
-    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
-    var tr = state.tr.delete(start, end);
-    var $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && dist$1.findWrapping(range, nodeType, attrs);
-    if (!wrapping) { return null }
-    tr.wrap(range, wrapping);
-    var before = tr.doc.resolve(start - 1).nodeBefore;
-    if (before && before.type == nodeType && dist$1.canJoin(tr.doc, start - 1) &&
-        (!joinPredicate || joinPredicate(match, before)))
-      { tr.join(start - 1); }
-    return tr
-  })
-}
-
-// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>) → InputRule
-// Build an input rule that changes the type of a textblock when the
-// matched text is typed into it. You'll usually want to start your
-// regexp with `^` to that it is only matched at the start of a
-// textblock. The optional `getAttrs` parameter can be used to compute
-// the new node's attributes, and works the same as in the
-// `wrappingInputRule` function.
-function textblockTypeInputRule(regexp, nodeType, getAttrs) {
-  return new InputRule(regexp, function (state, match, start, end) {
-    var $start = state.doc.resolve(start);
-    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
-    if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType)) { return null }
-    return state.tr
-      .delete(start, end)
-      .setBlockType(start, start, nodeType, attrs)
-  })
-}
-
-exports.InputRule = InputRule;
-exports.inputRules = inputRules;
-exports.undoInputRule = undoInputRule;
-exports.emDash = emDash;
-exports.ellipsis = ellipsis;
-exports.openDoubleQuote = openDoubleQuote;
-exports.closeDoubleQuote = closeDoubleQuote;
-exports.openSingleQuote = openSingleQuote;
-exports.closeSingleQuote = closeSingleQuote;
-exports.smartQuotes = smartQuotes;
-exports.wrappingInputRule = wrappingInputRule;
-exports.textblockTypeInputRule = textblockTypeInputRule;
-
-});
-
-unwrapExports(dist$6);
-var dist_1$5 = dist$6.InputRule;
-var dist_2$5 = dist$6.inputRules;
-var dist_3$4 = dist$6.undoInputRule;
-var dist_4$4 = dist$6.emDash;
-var dist_5$4 = dist$6.ellipsis;
-var dist_6$3 = dist$6.openDoubleQuote;
-var dist_7$3 = dist$6.closeDoubleQuote;
-var dist_8$3 = dist$6.openSingleQuote;
-var dist_9$3 = dist$6.closeSingleQuote;
-var dist_10$2 = dist$6.smartQuotes;
-var dist_11$2 = dist$6.wrappingInputRule;
-var dist_12$2 = dist$6.textblockTypeInputRule;
-
-function buildMenuActions (ref) {
-	var schema = ref.schema;
-	var state = ref.state;
-	var commands = ref.commands;
-
-
-	var nodes = Object.entries(schema.nodes)
-		.map(function (ref) {
-			var name = ref[0];
-
-			var active = function (attrs) {
-				if ( attrs === void 0 ) attrs = {};
-
-				return nodeIsActive(state, schema.nodes[name], attrs);
-			};
-			var command = commands[name] ? commands[name] : function () {};
-			return { name: name, active: active, command: command }
-		})
-		.reduce(function (actions, ref) {
-			var obj;
-
-			var name = ref.name;
-			var active = ref.active;
-			var command = ref.command;
-			return Object.assign({}, actions, ( obj = {}, obj[name] = {
-				active: active,
-				command: command,
-			}, obj ));
-	}, {});
-		// .reduce((actions, { name, active, command }) => ({
-		// 	...actions,
-		// 	[name]: {
-		// 		active,
-		// 		command,
-		// 	},
-		// }), {})
-
-	var marks = Object.entries(schema.marks)
-		.map(function (ref) {
-			var name = ref[0];
-
-			var active = function () { return markIsActive(state, schema.marks[name]); };
-			var attrs = getMarkAttrs(state, schema.marks[name]);
-			var command = commands[name] ? commands[name] : function () {};
-			return {
-				name: name,
-				active: active,
-				attrs: attrs,
-				command: command,
-			}
-		})
-		.reduce(function (actions, ref) {
-			var obj;
-
-			var name = ref.name;
-			var active = ref.active;
-			var attrs = ref.attrs;
-			var command = ref.command;
-			return Object.assign({}, actions, ( obj = {}, obj[name] = {
-				active: active,
-				attrs: attrs,
-				command: command,
-			}, obj ));
-	}, {});
-		// .reduce((actions, { name, active, attrs, command }) => ({
-		// 	...actions,
-		// 	[name]: {
-		// 		active,
-		// 		attrs,
-		// 		command,
-		// 	},
-		// }), {})
-
-	return {
-		nodes: nodes,
-		marks: marks,
-	}
-
-}
-
-var keymap$$1 = {
-	'Mod-z': history_5,
-	'Shift-Mod-z': history_5,
-	'Mod-BracketLeft': commands_8,
-	Backspace: dist_3$4,
-	Escape: commands_15,
-};
-
-if (!isMac) {
-	keymap$$1['Mod-y'] = history_6;
-}
-
-var ComponentView = function ComponentView(component, ref) {
-	var node = ref.node;
-	var view = ref.view;
-	var getPos = ref.getPos;
-	var decorations = ref.decorations;
-	var editable = ref.editable;
-
-	this.component = component;
-	this.node = node;
-	this.view = view;
-	this.getPos = getPos;
-	this.decorations = decorations;
-	this.editable = editable;
-
-	this.dom = this.createDOM();
-	this.contentDOM = this._vm.$refs.content;
-};
-
-ComponentView.prototype.createDOM = function createDOM () {
-		var this$1 = this;
-
-	var Component = Vue.extend(this.component);
-	this._vm = new Component({
-		propsData: {
-			node: this.node,
-			view: this.view,
-			getPos: this.getPos,
-			decorations: this.decorations,
-			editable: this.editable,
-			updateAttrs: function (attrs) { return this$1.updateAttrs(attrs); },
-			updateContent: function (content) { return this$1.updateContent(content); },
-		},
-	}).$mount();
-	return this._vm.$el
-};
-
-ComponentView.prototype.updateAttrs = function updateAttrs (attrs) {
-	var transaction = this.view.state.tr.setNodeMarkup(this.getPos(), null, Object.assign({}, this.node.attrs,
-		attrs));
-	this.view.dispatch(transaction);
-};
-
-ComponentView.prototype.updateContent = function updateContent (content) {
-	var transaction = this.view.state.tr.setNodeMarkup(this.getPos(), this.node.type, { content: content });
-	this.view.dispatch(transaction);
-};
-
-ComponentView.prototype.ignoreMutation = function ignoreMutation () {
-	return true
-};
-
-ComponentView.prototype.stopEvent = function stopEvent () {
-	return true
-};
-
-ComponentView.prototype.update = function update (node, decorations) {
-	if (node.type !== this.node.type) {
-		return false
-	}
-
-	if (node === this.node && this.decorations === decorations) {
-		return true
-	}
-
-	this.node = node;
-	this.decorations = decorations;
-	this._vm._props.node = node;
-	this._vm._props.decorations = decorations;
-	return true
-};
-
-ComponentView.prototype.destroy = function destroy () {
-	this._vm.$destroy();
-};
-
-function initNodeViews$$1(ref) {
-  var nodes = ref.nodes;
-  var editable = ref.editable;
-
-  var nodeViews = {};
-  Object.keys(nodes).forEach(function (nodeName) {
-    nodeViews[nodeName] = function (node, view, getPos, decorations) {
-      var component = nodes[nodeName];
-      return new ComponentView(component, {
-        node: node,
-        view: view,
-        getPos: getPos,
-        decorations: decorations,
-        editable: editable,
-      })
-    };
-  });
-  return nodeViews
-}
-
-var isMac = typeof navigator !== 'undefined' ? /Mac/.test(navigator.platform) : false;
-
-function getMarkAttrs (state, type) {
-	var ref = state.selection;
-	var from = ref.from;
-	var to = ref.to;
-	var marks = [];
-
-	state.doc.nodesBetween(from, to, function (node) {
-		marks = marks.concat( node.marks);
-	});
-
-	var mark = marks.find(function (mark) { return mark.type.name === type.name; });
-
-	if (mark) {
-		return mark.attrs
-	}
-
-	return {}
-}
-
-function markIsActive (state, type) {
-	var ref = state.selection;
-	var from = ref.from;
-	var $from = ref.$from;
-	var to = ref.to;
-	var empty = ref.empty;
-
-	if (empty) {
-		return !!type.isInSet(state.storedMarks || $from.marks())
-	}
-
-	return !!state.doc.rangeHasMark(from, to, type)
-}
-
-var dist$7 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-
-
-// Because working with row and column-spanning cells is not quite
-// trivial, this code builds up a descriptive structure for a given
-// table node. The structures are cached with the (persistent) table
-// nodes as key, so that they only have to be recomputed when the
-// content of the table changes.
-//
-// This does mean that they have to store table-relative, not
-// document-relative positions. So code that uses them will typically
-// compute the start position of the table and offset positions passed
-// to or gotten from this structure by that amount.
-
-var readFromCache, addToCache;
-// Prefer using a weak map to cache table maps. Fall back on a
-// fixed-size cache if that's not supported.
-if (typeof WeakMap != "undefined") {
-  var cache = new WeakMap;
-  readFromCache = function (key) { return cache.get(key); };
-  addToCache = function (key, value) {
-    cache.set(key, value);
-    return value
-  };
-} else {
-  var cache$1 = [], cacheSize = 10, cachePos = 0;
-  readFromCache = function (key) {
-    for (var i = 0; i < cache$1.length; i += 2)
-      { if (cache$1[i] == key) { return cache$1[i + 1] } }
-  };
-  addToCache = function (key, value) {
-    if (cachePos == cacheSize) { cachePos = 0; }
-    cache$1[cachePos++] = key;
-    return cache$1[cachePos++] = value
-  };
-}
-
-var Rect = function Rect(left, top, right, bottom) {
-  this.left = left; this.top = top; this.right = right; this.bottom = bottom;
-};
-
-// ::- A table map describes the structore of a given table. To avoid
-// recomputing them all the time, they are cached per table node. To
-// be able to do that, positions saved in the map are relative to the
-// start of the table, rather than the start of the document.
-var TableMap = function TableMap(width, height, map, problems) {
-  // :: number The width of the table
-  this.width = width;
-  // :: number The table's height
-  this.height = height;
-  // :: [number] A width * height array with the start position of
-  // the cell covering that part of the table in each slot
-  this.map = map;
-  // An optional array of problems (cell overlap or non-rectangular
-  // shape) for the table, used by the table normalizer.
-  this.problems = problems;
-};
-
-// :: (number) → Rect
-// Find the dimensions of the cell at the given position.
-TableMap.prototype.findCell = function findCell (pos) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.map.length; i++) {
-    var curPos = this$1.map[i];
-    if (curPos != pos) { continue }
-    var left = i % this$1.width, top = (i / this$1.width) | 0;
-    var right = left + 1, bottom = top + 1;
-    for (var j = 1; right < this.width && this.map[i + j] == curPos; j++) { right++; }
-    for (var j$1 = 1; bottom < this.height && this.map[i + (this.width * j$1)] == curPos; j$1++) { bottom++; }
-    return new Rect(left, top, right, bottom)
-  }
-  throw new RangeError("No cell with offset " + pos + " found")
-};
-
-// :: (number) → number
-// Find the left side of the cell at the given position.
-TableMap.prototype.colCount = function colCount (pos) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.map.length; i++)
-    { if (this$1.map[i] == pos) { return i % this$1.width } }
-  throw new RangeError("No cell with offset " + pos + " found")
-};
-
-// :: (number, string, number) → ?number
-// Find the next cell in the given direction, starting from the cell
-// at `pos`, if any.
-TableMap.prototype.nextCell = function nextCell (pos, axis, dir) {
-  var ref = this.findCell(pos);
-    var left = ref.left;
-    var right = ref.right;
-    var top = ref.top;
-    var bottom = ref.bottom;
-  if (axis == "horiz") {
-    if (dir < 0 ? left == 0 : right == this.width) { return null }
-    return this.map[top * this.width + (dir < 0 ? left - 1 : right)]
-  } else {
-    if (dir < 0 ? top == 0 : bottom == this.height) { return null }
-    return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)]
-  }
-};
-
-// :: (number, number) → Rect
-// Get the rectangle spanning the two given cells.
-TableMap.prototype.rectBetween = function rectBetween (a, b) {
-  var ref = this.findCell(a);
-    var leftA = ref.left;
-    var rightA = ref.right;
-    var topA = ref.top;
-    var bottomA = ref.bottom;
-  var ref$1 = this.findCell(b);
-    var leftB = ref$1.left;
-    var rightB = ref$1.right;
-    var topB = ref$1.top;
-    var bottomB = ref$1.bottom;
-  return new Rect(Math.min(leftA, leftB), Math.min(topA, topB),
-                  Math.max(rightA, rightB), Math.max(bottomA, bottomB))
-};
-
-// :: (Rect) → [number]
-// Return the position of all cells that have the top left corner in
-// the given rectangle.
-TableMap.prototype.cellsInRect = function cellsInRect (rect) {
-    var this$1 = this;
-
-  var result = [], seen = [];
-  for (var row = rect.top; row < rect.bottom; row++) {
-    for (var col = rect.left; col < rect.right; col++) {
-      var index = row * this$1.width + col, pos = this$1.map[index];
-      if (seen.indexOf(pos) > -1) { continue }
-      seen.push(pos);
-      if ((col != rect.left || !col || this$1.map[index - 1] != pos) &&
-          (row != rect.top || !row || this$1.map[index - this$1.width] != pos))
-        { result.push(pos); }
-    }
-  }
-  return result
-};
-
-// :: (number, number, Node) → number
-// Return the position at which the cell at the given row and column
-// starts, or would start, if a cell started there.
-TableMap.prototype.positionAt = function positionAt (row, col, table) {
-    var this$1 = this;
-
-  for (var i = 0, rowStart = 0;; i++) {
-    var rowEnd = rowStart + table.child(i).nodeSize;
-    if (i == row) {
-      var index = col + row * this$1.width, rowEndIndex = (row + 1) * this$1.width;
-      // Skip past cells from previous rows (via rowspan)
-      while (index < rowEndIndex && this.map[index] < rowStart) { index++; }
-      return index == rowEndIndex ? rowEnd - 1 : this$1.map[index]
-    }
-    rowStart = rowEnd;
-  }
-};
-
-// :: (Node) → TableMap
-// Find the table map for the given table node.
-TableMap.get = function get (table) {
-  return readFromCache(table) || addToCache(table, computeMap(table))
-};
-
-// Compute a table map.
-function computeMap(table) {
-  if (table.type.spec.tableRole != "table") { throw new RangeError("Not a table node: " + table.type.name) }
-  var width = findWidth(table), height = table.childCount;
-  var map = [], mapPos = 0, problems = null, colWidths = [];
-  for (var i = 0, e = width * height; i < e; i++) { map[i] = 0; }
-
-  for (var row = 0, pos = 0; row < height; row++) {
-    var rowNode = table.child(row);
-    pos++;
-    for (var i$1 = 0;; i$1++) {
-      while (mapPos < map.length && map[mapPos] != 0) { mapPos++; }
-      if (i$1 == rowNode.childCount) { break }
-      var cellNode = rowNode.child(i$1);
-      var ref = cellNode.attrs;
-      var colspan = ref.colspan;
-      var rowspan = ref.rowspan;
-      var colwidth = ref.colwidth;
-      for (var h = 0; h < rowspan; h++) {
-        if (h + row >= height) {
-          (problems || (problems = [])).push({type: "overlong_rowspan", pos: pos, n: rowspan - h});
-          break
-        }
-        var start = mapPos + (h * width);
-        for (var w = 0; w < colspan; w++) {
-          if (map[start + w] == 0)
-            { map[start + w] = pos; }
-          else
-            { (problems || (problems = [])).push({type: "collision", row: row, pos: pos, n: colspan - w}); }
-          var colW = colwidth && colwidth[w];
-          if (colW) {
-            var widthIndex = ((start + w) % width) * 2, prev = colWidths[widthIndex];
-            if (prev == null || (prev != colW && colWidths[widthIndex + 1] == 1)) {
-              colWidths[widthIndex] = colW;
-              colWidths[widthIndex + 1] = 1;
-            } else if (prev == colW) {
-              colWidths[widthIndex + 1]++;
-            }
-          }
-        }
-      }
-      mapPos += colspan;
-      pos += cellNode.nodeSize;
-    }
-    var expectedPos = (row + 1) * width, missing = 0;
-    while (mapPos < expectedPos) { if (map[mapPos++] == 0) { missing++; } }
-    if (missing) { (problems || (problems = [])).push({type: "missing", row: row, n: missing}); }
-    pos++;
-  }
-
-  var tableMap = new TableMap(width, height, map, problems), badWidths = false;
-
-  // For columns that have defined widths, but whose widths disagree
-  // between rows, fix up the cells whose width doesn't match the
-  // computed one.
-  for (var i$2 = 0; !badWidths && i$2 < colWidths.length; i$2 += 2)
-    { if (colWidths[i$2] != null && colWidths[i$2 + 1] < height) { badWidths = true; } }
-  if (badWidths) { findBadColWidths(tableMap, colWidths, table); }
-
-  return tableMap
-}
-
-function findWidth(table) {
-  var width = -1, hasRowSpan = false;
-  for (var row = 0; row < table.childCount; row++) {
-    var rowNode = table.child(row), rowWidth = 0;
-    if (hasRowSpan) { for (var j = 0; j < row; j++) {
-      var prevRow = table.child(j);
-      for (var i = 0; i < prevRow.childCount; i++) {
-        var cell = prevRow.child(i);
-        if (j + cell.attrs.rowspan > row) { rowWidth += cell.attrs.colspan; }
-      }
-    } }
-    for (var i$1 = 0; i$1 < rowNode.childCount; i$1++) {
-      var cell$1 = rowNode.child(i$1);
-      rowWidth += cell$1.attrs.colspan;
-      if (cell$1.attrs.rowspan > 1) { hasRowSpan = true; }
-    }
-    if (width == -1)
-      { width = rowWidth; }
-    else if (width != rowWidth)
-      { width = Math.max(width, rowWidth); }
-  }
-  return width
-}
-
-function findBadColWidths(map, colWidths, table) {
-  if (!map.problems) { map.problems = []; }
-  for (var i = 0, seen = []; i < map.map.length; i++) {
-    var pos = map.map[i];
-    if (seen.indexOf(pos) > -1) { continue }
-    seen.push(pos);
-    var node = table.nodeAt(pos), updated = null;
-    for (var j = 0; j < node.attrs.colspan; j++) {
-      var col = (i + j) % map.width, colWidth = colWidths[col * 2];
-      if (colWidth != null && (!node.attrs.colwidth || node.attrs.colwidth[j] != colWidth))
-        { (updated || (updated = freshColWidth(node.attrs)))[j] = colWidth; }
-    }
-    if (updated) { map.problems.unshift({type: "colwidth mismatch", pos: pos, colwidth: updated}); }
-  }
-}
-
-function freshColWidth(attrs) {
-  if (attrs.colwidth) { return attrs.colwidth.slice() }
-  var result = [];
-  for (var i = 0; i < attrs.colspan; i++) { result.push(0); }
-  return result
-}
-
-// Various helper function for working with tables
-
-var key = new dist$2.PluginKey("selectingCells");
-
-function cellAround($pos) {
-  for (var d = $pos.depth - 1; d > 0; d--)
-    { if ($pos.node(d).type.spec.tableRole == "row") { return $pos.node(0).resolve($pos.before(d + 1)) } }
-  return null
-}
-
-function cellWrapping($pos) {
-  for (var d = $pos.depth - 1; d > 0; d--) {
-    var role = $pos.node(d).type.spec.tableRole;
-    if (role === "cell" || role === 'header_cell') { return $pos.node(d) }
-  }
-  return null
-}
-
-function isInTable(state) {
-  var $head = state.selection.$head;
-  for (var d = $head.depth; d > 0; d--) { if ($head.node(d).type.spec.tableRole == "row") { return true } }
-  return false
-}
-
-function selectionCell(state) {
-  var sel = state.selection;
-  if (sel.$anchorCell) {
-    return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;
-  } else if (sel.node && sel.node.type.spec.tableRole == "cell") {
-    return sel.$anchor
-  }
-  return cellAround(sel.$head) || cellNear(sel.$head)
-}
-
-function cellNear($pos) {
-  for (var after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {
-    var role = after.type.spec.tableRole;
-    if (role == "cell" || role == "header_cell") { return $pos.doc.resolve(pos) }
-  }
-  for (var before = $pos.nodeBefore, pos$1 = $pos.pos; before; before = before.lastChild, pos$1--) {
-    var role$1 = before.type.spec.tableRole;
-    if (role$1 == "cell" || role$1 == "header_cell") { return $pos.doc.resolve(pos$1 - before.nodeSize) }
-  }
-}
-
-function pointsAtCell($pos) {
-  return $pos.parent.type.spec.tableRole == "row" && $pos.nodeAfter
-}
-
-function moveCellForward($pos) {
-  return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize)
-}
-
-function inSameTable($a, $b) {
-  return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1)
-}
-
-function findCell($pos) {
-  return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1))
-}
-
-function colCount($pos) {
-  return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1))
-}
-
-function nextCell($pos, axis, dir) {
-  var start = $pos.start(-1), map = TableMap.get($pos.node(-1));
-  var moved = map.nextCell($pos.pos - start, axis, dir);
-  return moved == null ? null : $pos.node(0).resolve(start + moved)
-}
-
-function setAttr(attrs, name, value) {
-  var result = {};
-  for (var prop in attrs) { result[prop] = attrs[prop]; }
-  result[name] = value;
-  return result
-}
-
-function rmColSpan(attrs, pos, n) {
-  if ( n === void 0 ) { n=1; }
-
-  var result = setAttr(attrs, "colspan", attrs.colspan - n);
-  if (result.colwidth) {
-    result.colwidth = result.colwidth.slice();
-    result.colwidth.splice(pos, n);
-    if (!result.colwidth.some(function (w) { return w > 0; })) { result.colwidth = null; }
-  }
-  return result
-}
-
-function addColSpan(attrs, pos, n) {
-  if ( n === void 0 ) { n=1; }
-
-  var result = setAttr(attrs, "colspan", attrs.colspan + n);
-  if (result.colwidth) {
-    result.colwidth = result.colwidth.slice();
-    for (var i = 0; i < n; i++) { result.colwidth.splice(pos, 0, 0); }
-  }
-  return result
-}
-
-// This file defines a ProseMirror selection subclass that models
-
-// ::- A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)
-// subclass that represents a cell selection spanning part of a table.
-// With the plugin enabled, these will be created when the user
-// selects across cells, and will be drawn by giving selected cells a
-// `selectedCell` CSS class.
-var CellSelection = (function (Selection) {
-  function CellSelection($anchorCell, $headCell) {
-    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-    var table = $anchorCell.node(-1), map = TableMap.get(table), start = $anchorCell.start(-1);
-    var rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start);
-    var doc = $anchorCell.node(0);
-    var cells = map.cellsInRect(rect).filter(function (p) { return p != $headCell.pos - start; });
-    // Make the head cell the first range, so that it counts as the
-    // primary part of the selection
-    cells.unshift($headCell.pos - start);
-    var ranges = cells.map(function (pos) {
-      var cell = table.nodeAt(pos), from = pos + start + 1;
-      return new dist$2.SelectionRange(doc.resolve(from), doc.resolve(from + cell.content.size))
-    });
-    Selection.call(this, ranges[0].$from, ranges[0].$to, ranges);
-    // :: ResolvedPos
-    // A resolved position pointing _in front of_ the anchor cell (the one
-    // that doesn't move when extending the selection).
-    this.$anchorCell = $anchorCell;
-    // :: ResolvedPos
-    // A resolved position pointing in front of the head cell (the one
-    // moves when extending the selection).
-    this.$headCell = $headCell;
-  }
-
-  if ( Selection ) { CellSelection.__proto__ = Selection; }
-  CellSelection.prototype = Object.create( Selection && Selection.prototype );
-  CellSelection.prototype.constructor = CellSelection;
-
-  CellSelection.prototype.map = function map (doc, mapping) {
-    var $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));
-    var $headCell = doc.resolve(mapping.map(this.$headCell.pos));
-    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {
-      var tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);
-      if (tableChanged && this.isRowSelection())
-        { return CellSelection.rowSelection($anchorCell, $headCell) }
-      else if (tableChanged && this.isColSelection())
-        { return CellSelection.colSelection($anchorCell, $headCell) }
-      else
-        { return new CellSelection($anchorCell, $headCell) }
-    }
-    return dist$2.TextSelection.between($anchorCell, $headCell)
-  };
-
-  // :: () → Slice
-  // Returns a rectangular slice of table rows containing the selected
-  // cells.
-  CellSelection.prototype.content = function content () {
-    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
-    var rect = map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start);
-    var seen = [], rows = [];
-    for (var row = rect.top; row < rect.bottom; row++) {
-      var rowContent = [];
-      for (var index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {
-        var pos = map.map[index];
-        if (seen.indexOf(pos) == -1) {
-          seen.push(pos);
-          var cellRect = map.findCell(pos), cell = table.nodeAt(pos);
-          var extraLeft = rect.left - cellRect.left, extraRight = cellRect.right - rect.right;
-          if (extraLeft > 0 || extraRight > 0) {
-            var attrs = cell.attrs;
-            if (extraLeft > 0) { attrs = rmColSpan(attrs, 0, extraLeft); }
-            if (extraRight > 0) { attrs = rmColSpan(attrs, attrs.colspan - extraRight, extraRight); }
-            if (cellRect.left < rect.left) { cell = cell.type.createAndFill(attrs); }
-            else { cell = cell.type.create(attrs, cell.content); }
-          }
-          if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {
-            var attrs$1 = setAttr(cell.attrs, "rowspan", Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top));
-            if (cellRect.top < rect.top) { cell = cell.type.createAndFill(attrs$1); }
-            else { cell = cell.type.create(attrs$1, cell.content); }
-          }
-          rowContent.push(cell);
-        }
-      }
-      rows.push(table.child(row).copy(dist.Fragment.from(rowContent)));
-    }
-
-    var fragment = this.isColSelection() && this.isRowSelection() ? table : rows;
-    return new dist.Slice(dist.Fragment.from(fragment), 1, 1)
-  };
-
-  CellSelection.prototype.replace = function replace (tr, content) {
-    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-    var mapFrom = tr.steps.length, ranges = this.ranges;
-    for (var i = 0; i < ranges.length; i++) {
-      var ref = ranges[i];
-      var $from = ref.$from;
-      var $to = ref.$to;
-      var mapping = tr.mapping.slice(mapFrom);
-      tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? dist.Slice.empty : content);
-    }
-    var sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1);
-    if (sel) { tr.setSelection(sel); }
-  };
-
-  CellSelection.prototype.replaceWith = function replaceWith (tr, node) {
-    this.replace(tr, new dist.Slice(dist.Fragment.from(node), 0, 0));
-  };
-
-  CellSelection.prototype.forEachCell = function forEachCell (f) {
-    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
-    var cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start));
-    for (var i = 0; i < cells.length; i++)
-      { f(table.nodeAt(cells[i]), start + cells[i]); }
-  };
-
-  // :: () → bool
-  // True if this selection goes all the way from the top to the
-  // bottom of the table.
-  CellSelection.prototype.isColSelection = function isColSelection () {
-    var anchorTop = this.$anchorCell.index(-1), headTop = this.$headCell.index(-1);
-    if (Math.min(anchorTop, headTop) > 0) { return false }
-    var anchorBot = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan,
-        headBot = headTop + this.$headCell.nodeAfter.attrs.rowspan;
-    return Math.max(anchorBot, headBot) == this.$headCell.node(-1).childCount
-  };
-
-  // :: (ResolvedPos, ?ResolvedPos) → CellSelection
-  // Returns the smallest column selection that covers the given anchor
-  // and head cell.
-  CellSelection.colSelection = function colSelection ($anchorCell, $headCell) {
-    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
-    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
-    var doc = $anchorCell.node(0);
-    if (anchorRect.top <= headRect.top) {
-      if (anchorRect.top > 0)
-        { $anchorCell = doc.resolve(start + map.map[anchorRect.left]); }
-      if (headRect.bottom < map.height)
-        { $headCell = doc.resolve(start + map.map[map.width * (map.height - 1) + headRect.right - 1]); }
-    } else {
-      if (headRect.top > 0)
-        { $headCell = doc.resolve(start + map.map[headRect.left]); }
-      if (anchorRect.bottom < map.height)
-        { $anchorCell = doc.resolve(start + map.map[map.width * (map.height - 1) + anchorRect.right - 1]); }
-    }
-    return new CellSelection($anchorCell, $headCell)
-  };
-
-  // :: () → bool
-  // True if this selection goes all the way from the left to the
-  // right of the table.
-  CellSelection.prototype.isRowSelection = function isRowSelection () {
-    var map = TableMap.get(this.$anchorCell.node(-1)), start = this.$anchorCell.start(-1);
-    var anchorLeft = map.colCount(this.$anchorCell.pos - start),
-        headLeft = map.colCount(this.$headCell.pos - start);
-    if (Math.min(anchorLeft, headLeft) > 0) { return false }
-    var anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan,
-        headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;
-    return Math.max(anchorRight, headRight) == map.width
-  };
-
-  CellSelection.prototype.eq = function eq (other) {
-    return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos &&
-      other.$headCell.pos == this.$headCell.pos
-  };
-
-  // :: (ResolvedPos, ?ResolvedPos) → CellSelection
-  // Returns the smallest row selection that covers the given anchor
-  // and head cell.
-  CellSelection.rowSelection = function rowSelection ($anchorCell, $headCell) {
-    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
-    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
-    var doc = $anchorCell.node(0);
-    if (anchorRect.left <= headRect.left) {
-      if (anchorRect.left > 0)
-        { $anchorCell = doc.resolve(start + map.map[anchorRect.top * map.width]); }
-      if (headRect.right < map.width)
-        { $headCell = doc.resolve(start + map.map[map.width * (headRect.top + 1) - 1]); }
-    } else {
-      if (headRect.left > 0)
-        { $headCell = doc.resolve(start + map.map[headRect.top * map.width]); }
-      if (anchorRect.right < map.width)
-        { $anchorCell = doc.resolve(start + map.map[map.width * (anchorRect.top + 1) - 1]); }
-    }
-    return new CellSelection($anchorCell, $headCell)
-  };
-
-  CellSelection.prototype.toJSON = function toJSON () {
-    return {type: "cell", anchor: this.$anchorCell.pos, head: this.$headCell.pos}
-  };
-
-  CellSelection.fromJSON = function fromJSON (doc, json) {
-    return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head))
-  };
-
-  // :: (Node, number, ?number) → CellSelection
-  CellSelection.create = function create (doc, anchorCell, headCell) {
-    if ( headCell === void 0 ) { headCell = anchorCell; }
-
-    return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell))
-  };
-
-  CellSelection.prototype.getBookmark = function getBookmark () { return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos) };
-
-  return CellSelection;
-}(dist$2.Selection));
-
-CellSelection.prototype.visible = false;
-
-dist$2.Selection.jsonID("cell", CellSelection);
-
-var CellBookmark = function CellBookmark(anchor, head) {
-  this.anchor = anchor;
-  this.head = head;
-};
-CellBookmark.prototype.map = function map (mapping) {
-  return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head))
-};
-CellBookmark.prototype.resolve = function resolve (doc) {
-  var $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);
-  if ($anchorCell.parent.type.spec.tableRole == "row" &&
-      $headCell.parent.type.spec.tableRole == "row" &&
-      $anchorCell.index() < $anchorCell.parent.childCount &&
-      $headCell.index() < $headCell.parent.childCount &&
-      inSameTable($anchorCell, $headCell))
-    { return new CellSelection($anchorCell, $headCell) }
-  else
-    { return dist$2.Selection.near($headCell, 1) }
-};
-
-function drawCellSelection(state) {
-  if (!(state.selection instanceof CellSelection)) { return null }
-  var cells = [];
-  state.selection.forEachCell(function (node, pos) {
-    cells.push(dist$3.Decoration.node(pos, pos + node.nodeSize, {class: "selectedCell"}));
-  });
-  return dist$3.DecorationSet.create(state.doc, cells)
-}
-
-function isCellBoundarySelection(ref) {
-  var $from = ref.$from;
-  var $to = ref.$to;
-
-  if ($from.pos == $to.pos || $from.pos < $from.pos - 6) { return false } // Cheap elimination
-  var afterFrom = $from.pos, beforeTo = $to.pos, depth = $from.depth;
-  for (; depth >= 0; depth--, afterFrom++)
-    { if ($from.after(depth + 1) < $from.end(depth)) { break } }
-  for (var d = $to.depth; d >= 0; d--, beforeTo--)
-    { if ($to.before(d + 1) > $to.start(d)) { break } }
-  return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole)
-}
-
-function normalizeSelection(state, tr) {
-  var sel = (tr || state).selection, doc = (tr || state).doc, normalize, role;
-  if (sel instanceof dist$2.NodeSelection && (role = sel.node.type.spec.tableRole)) {
-    if (role == "cell" || role == "header_cell") {
-      normalize = CellSelection.create(doc, sel.from);
-    } else if (role == "row") {
-      var $cell = doc.resolve(sel.from + 1);
-      normalize = CellSelection.rowSelection($cell, $cell);
-    } else {
-      var map = TableMap.get(sel.node), start = sel.from + 1;
-      var lastCell = start + map.map[map.width * map.height - 1];
-      normalize = CellSelection.create(doc, start + 1, lastCell);
-    }
-  } else if (sel instanceof dist$2.TextSelection && isCellBoundarySelection(sel)) {
-    normalize = dist$2.TextSelection.create(doc, sel.from);
-  }
-  if (normalize)
-    { (tr || (tr = state.tr)).setSelection(normalize); }
-  return tr
-}
-
-// Helper for creating a schema that supports tables.
-
-function getCellAttrs(dom, extraAttrs) {
-  var widthAttr = dom.getAttribute("data-colwidth");
-  var widths = widthAttr && /^\d+(,\d+)*$/.test(widthAttr) ? widthAttr.split(",").map(function (s) { return Number(s); }) : null;
-  var colspan = Number(dom.getAttribute("colspan") || 1);
-  var result = {
-    colspan: colspan,
-    rowspan: Number(dom.getAttribute("rowspan") || 1),
-    colwidth: widths && widths.length == colspan ? widths : null
-  };
-  for (var prop in extraAttrs) {
-    var getter = extraAttrs[prop].getFromDOM;
-    var value = getter && getter(dom);
-    if (value != null) { result[prop] = value; }
-  }
-  return result
-}
-
-function setCellAttrs(node, extraAttrs) {
-  var attrs = {};
-  if (node.attrs.colspan != 1) { attrs.colspan = node.attrs.colspan; }
-  if (node.attrs.rowspan != 1) { attrs.rowspan = node.attrs.rowspan; }
-  if (node.attrs.colwidth)
-    { attrs["data-colwidth"] = node.attrs.colwidth.join(","); }
-  for (var prop in extraAttrs) {
-    var setter = extraAttrs[prop].setDOMAttr;
-    if (setter) { setter(node.attrs[prop], attrs); }
-  }
-  return attrs
-}
-
-// :: (Object) → Object
-//
-// This function creates a set of [node
-// specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for
-// `table`, `table_row`, and `table_cell` nodes types as used by this
-// module. The result can then be added to the set of nodes when
-// creating a a schema.
-//
-//   options::- The following options are understood:
-//
-//     tableGroup:: ?string
-//     A group name (something like `"block"`) to add to the table
-//     node type.
-//
-//     cellContent:: string
-//     The content expression for table cells.
-//
-//     cellAttributes:: ?Object
-//     Additional attributes to add to cells. Maps attribute names to
-//     objects with the following properties:
-//
-//       default:: any
-//       The attribute's default value.
-//
-//       getFromDOM:: ?(dom.Node) → any
-//       A function to read the attribute's value from a DOM node.
-//
-//       setDOMAttr:: ?(value: any, attrs: Object)
-//       A function to add the attribute's value to an attribute
-//       object that's used to render the cell's DOM.
-function tableNodes(options) {
-  var extraAttrs = options.cellAttributes || {};
-  var cellAttrs = {
-    colspan: {default: 1},
-    rowspan: {default: 1},
-    colwidth: {default: null}
-  };
-  for (var prop in extraAttrs)
-    { cellAttrs[prop] = {default: extraAttrs[prop].default}; }
-
-  return {
-    table: {
-      content: "table_row+",
-      tableRole: "table",
-      isolating: true,
-      group: options.tableGroup,
-      parseDOM: [{tag: "table"}],
-      toDOM: function toDOM() { return ["table", ["tbody", 0]] }
-    },
-    table_row: {
-      content: "(table_cell | table_header)*",
-      tableRole: "row",
-      parseDOM: [{tag: "tr"}],
-      toDOM: function toDOM() { return ["tr", 0] }
-    },
-    table_cell: {
-      content: options.cellContent,
-      attrs: cellAttrs,
-      tableRole: "cell",
-      isolating: true,
-      parseDOM: [{tag: "td", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
-      toDOM: function toDOM(node) { return ["td", setCellAttrs(node, extraAttrs), 0] }
-    },
-    table_header: {
-      content: options.cellContent,
-      attrs: cellAttrs,
-      tableRole: "header_cell",
-      isolating: true,
-      parseDOM: [{tag: "th", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
-      toDOM: function toDOM(node) { return ["th", setCellAttrs(node, extraAttrs), 0] }
-    }
-  }
-}
-
-function tableNodeTypes(schema) {
-  var result = schema.cached.tableNodeTypes;
-  if (!result) {
-    result = schema.cached.tableNodeTypes = {};
-    for (var name in schema.nodes) {
-      var type = schema.nodes[name], role = type.spec.tableRole;
-      if (role) { result[role] = type; }
-    }
-  }
-  return result
-}
-
-// Utilities used for copy/paste handling.
-
-// Utilities to help with copying and pasting table cells
-
-// : (Slice) → ?{width: number, height: number, rows: [Fragment]}
-// Get a rectangular area of cells from a slice, or null if the outer
-// nodes of the slice aren't table cells or rows.
-function pastedCells(slice) {
-  if (!slice.size) { return null }
-  var content = slice.content;
-  var openStart = slice.openStart;
-  var openEnd = slice.openEnd;
-  while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.firstChild.type.spec.tableRole == "table")) {
-    openStart--;
-    openEnd--;
-    content = content.firstChild.content;
-  }
-  var first = content.firstChild, role = first.type.spec.tableRole;
-  var schema = first.type.schema, rows = [];
-  if (role == "row") {
-    for (var i = 0; i < content.childCount; i++) {
-      var cells = content.child(i).content;
-      var left = i ? 0 : Math.max(0, openStart - 1);
-      var right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);
-      if (left || right) { cells = fitSlice(tableNodeTypes(schema).row, new dist.Slice(cells, left, right)).content; }
-      rows.push(cells);
-    }
-  } else if (role == "cell" || role == "header_cell") {
-    rows.push(openStart || openEnd ? fitSlice(tableNodeTypes(schema).row, new dist.Slice(content, openStart, openEnd)).content : content);
-  } else {
-    return null
-  }
-  return ensureRectangular(schema, rows)
-}
-
-// : (Schema, [Fragment]) → {width: number, height: number, rows: [Fragment]}
-// Compute the width and height of a set of cells, and make sure each
-// row has the same number of cells.
-function ensureRectangular(schema, rows) {
-  var widths = [];
-  for (var i = 0; i < rows.length; i++) {
-    var row = rows[i];
-    for (var j = row.childCount - 1; j >= 0; j--) {
-      var ref = row.child(j).attrs;
-      var rowspan = ref.rowspan;
-      var colspan = ref.colspan;
-      for (var r = i; r < i + rowspan; r++)
-        { widths[r] = (widths[r] || 0) + colspan; }
-    }
-  }
-  var width = 0;
-  for (var r$1 = 0; r$1 < widths.length; r$1++) { width = Math.max(width, widths[r$1]); }
-  for (var r$2 = 0; r$2 < widths.length; r$2++) {
-    if (r$2 >= rows.length) { rows.push(dist.Fragment.empty); }
-    if (widths[r$2] < width) {
-      var empty = tableNodeTypes(schema).cell.createAndFill(), cells = [];
-      for (var i$1 = widths[r$2]; i$1 < width; i$1++) { cells.push(empty); }
-      rows[r$2] = rows[r$2].append(dist.Fragment.from(cells));
-    }
-  }
-  return {height: rows.length, width: width, rows: rows}
-}
-
-function fitSlice(nodeType, slice) {
-  var node = nodeType.createAndFill();
-  var tr = new dist$1.Transform(node).replace(0, node.content.size, slice);
-  return tr.doc
-}
-
-// : ({width: number, height: number, rows: [Fragment]}, number, number) → {width: number, height: number, rows: [Fragment]}
-// Clip or extend (repeat) the given set of cells to cover the given
-// width and height. Will clip rowspan/colspan cells at the edges when
-// they stick out.
-function clipCells(ref, newWidth, newHeight) {
-  var width = ref.width;
-  var height = ref.height;
-  var rows = ref.rows;
-
-  if (width != newWidth) {
-    var added = [], newRows = [];
-    for (var row = 0; row < rows.length; row++) {
-      var frag = rows[row], cells = [];
-      for (var col = added[row] || 0, i = 0; col < newWidth; i++) {
-        var cell = frag.child(i % frag.childCount);
-        if (col + cell.attrs.colspan > newWidth)
-          { cell = cell.type.create(rmColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content); }
-        cells.push(cell);
-        col += cell.attrs.colspan;
-        for (var j = 1; j < cell.attrs.rowspan; j++)
-          { added[row + j] = (added[row + j] || 0) + cell.attrs.colspan; }
-      }
-      newRows.push(dist.Fragment.from(cells));
-    }
-    rows = newRows;
-    width = newWidth;
-  }
-
-  if (height != newHeight) {
-    var newRows$1 = [];
-    for (var row$1 = 0, i$1 = 0; row$1 < newHeight; row$1++, i$1++) {
-      var cells$1 = [], source = rows[i$1 % height];
-      for (var j$1 = 0; j$1 < source.childCount; j$1++) {
-        var cell$1 = source.child(j$1);
-        if (row$1 + cell$1.attrs.rowspan > newHeight)
-          { cell$1 = cell$1.type.create(setAttr(cell$1.attrs, "rowspan", newHeight - cell$1.attrs.rowspan), cell$1.content); }
-        cells$1.push(cell$1);
-      }
-      newRows$1.push(dist.Fragment.from(cells$1));
-    }
-    rows = newRows$1;
-    height = newHeight;
-  }
-
-  return {width: width, height: height, rows: rows}
-}
-
-// Make sure a table has at least the given width and height. Return
-// true if something was changed.
-function growTable(tr, map, table, start, width, height, mapFrom) {
-  var schema = tr.doc.type.schema, types = tableNodeTypes(schema), empty, emptyHead;
-  if (width > map.width) {
-    for (var row = 0, rowEnd = 0; row < map.height; row++) {
-      var rowNode = table.child(row);
-      rowEnd += rowNode.nodeSize;
-      var cells = [], add = (void 0);
-      if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)
-        { add = empty || (empty = types.cell.createAndFill()); }
-      else
-        { add = emptyHead || (emptyHead = types.header_cell.createAndFill()); }
-      for (var i = map.width; i < width; i++) { cells.push(add); }
-      tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);
-    }
-  }
-  if (height > map.height) {
-    var cells$1 = [];
-    for (var i$1 = 0, start$1 = (map.height - 1) * map.width; i$1 < Math.max(map.width, width); i$1++) {
-      var header = i$1 >= map.width ? false :
-          table.nodeAt(map.map[start$1 + i$1]).type == types.header_cell;
-      cells$1.push(header
-                 ? (emptyHead || (emptyHead = types.header_cell.createAndFill()))
-                 : (empty || (empty = types.cell.createAndFill())));
-    }
-
-    var emptyRow = types.row.create(null, dist.Fragment.from(cells$1)), rows = [];
-    for (var i$2 = map.height; i$2 < height; i$2++) { rows.push(emptyRow); }
-    tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);
-  }
-  return !!(empty || emptyHead)
-}
-
-// Make sure the given line (left, top) to (right, top) doesn't cross
-// any rowspan cells by splitting cells that cross it. Return true if
-// something changed.
-function isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {
-  if (top == 0 || top == map.height) { return false }
-  var found = false;
-  for (var col = left; col < right; col++) {
-    var index = top * map.width + col, pos = map.map[index];
-    if (map.map[index - map.width] == pos) {
-      found = true;
-      var cell = table.nodeAt(pos);
-      var ref = map.findCell(pos);
-      var cellTop = ref.top;
-      var cellLeft = ref.left;
-      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, setAttr(cell.attrs, "rowspan", top - cellTop));
-      tr.insert(tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),
-                cell.type.createAndFill(setAttr(cell.attrs, "rowspan", (cellTop + cell.attrs.rowspan) - top)));
-      col += cell.attrs.colspan - 1;
-    }
-  }
-  return found
-}
-
-// Make sure the given line (left, top) to (left, bottom) doesn't
-// cross any colspan cells by splitting cells that cross it. Return
-// true if something changed.
-function isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {
-  if (left == 0 || left == map.width) { return false }
-  var found = false;
-  for (var row = top; row < bottom; row++) {
-    var index = row * map.width + left, pos = map.map[index];
-    if (map.map[index - 1] == pos) {
-      found = true;
-      var cell = table.nodeAt(pos), cellLeft = map.colCount(pos);
-      var updatePos = tr.mapping.slice(mapFrom).map(pos + start);
-      tr.setNodeMarkup(updatePos, null, rmColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)));
-      tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(rmColSpan(cell.attrs, 0, left - cellLeft)));
-      row += cell.attrs.rowspan - 1;
-    }
-  }
-  return found
-}
-
-// Insert the given set of cells (as returned by `pastedCells`) into a
-// table, at the position pointed at by rect.
-function insertCells(state, dispatch, tableStart, rect, cells) {
-  var table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc, map = TableMap.get(table);
-  var top = rect.top;
-  var left = rect.left;
-  var right = left + cells.width, bottom = top + cells.height;
-  var tr = state.tr, mapFrom = 0;
-  function recomp() {
-    table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;
-    map = TableMap.get(table);
-    mapFrom = tr.mapping.maps.length;
-  }
-  // Prepare the table to be large enough and not have any cells
-  // crossing the boundaries of the rectangle that we want to
-  // insert into. If anything about it changes, recompute the table
-  // map so that subsequent operations can see the current shape.
-  if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) { recomp(); }
-  if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom)) { recomp(); }
-  if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)) { recomp(); }
-  if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom)) { recomp(); }
-  if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom)) { recomp(); }
-
-  for (var row = top; row < bottom; row++) {
-    var from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);
-    tr.replace(tr.mapping.slice(mapFrom).map(from + tableStart), tr.mapping.slice(mapFrom).map(to + tableStart),
-               new dist.Slice(cells.rows[row - top], 0, 0));
-  }
-  recomp();
-  tr.setSelection(new CellSelection(tr.doc.resolve(tableStart + map.positionAt(top, left, table)),
-                                    tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))));
-  dispatch(tr);
-}
-
-// This file defines a number of helpers for wiring up user input to
-
-var handleKeyDown = keymap_1.keydownHandler({
-  "ArrowLeft": arrow("horiz", -1),
-  "ArrowRight": arrow("horiz", 1),
-  "ArrowUp": arrow("vert", -1),
-  "ArrowDown": arrow("vert", 1),
-
-  "Shift-ArrowLeft": shiftArrow("horiz", -1),
-  "Shift-ArrowRight": shiftArrow("horiz", 1),
-  "Shift-ArrowUp": shiftArrow("vert", -1),
-  "Shift-ArrowDown": shiftArrow("vert", 1),
-
-  "Backspace": deleteCellSelection,
-  "Mod-Backspace": deleteCellSelection,
-  "Delete": deleteCellSelection,
-  "Mod-Delete": deleteCellSelection
-});
-
-function maybeSetSelection(state, dispatch, selection) {
-  if (selection.eq(state.selection)) { return false }
-  if (dispatch) { dispatch(state.tr.setSelection(selection)); }
-  return true
-}
-
-function arrow(axis, dir) {
-  return function (state, dispatch, view) {
-    var sel = state.selection;
-    if (sel instanceof CellSelection) {
-      return maybeSetSelection(state, dispatch, dist$2.Selection.near(sel.$headCell, dir))
-    }
-    if (axis != "horiz" && !sel.empty) { return false }
-    var end = atEndOfCell(view, axis, dir);
-    if (end == null) { return false }
-    if (axis == "horiz") {
-      return maybeSetSelection(state, dispatch, dist$2.Selection.near(state.doc.resolve(sel.head + dir), dir))
-    } else {
-      var $cell = state.doc.resolve(end), $next = nextCell($cell, axis, dir), newSel;
-      if ($next) { newSel = dist$2.Selection.near($next, 1); }
-      else if (dir < 0) { newSel = dist$2.Selection.near(state.doc.resolve($cell.before(-1)), -1); }
-      else { newSel = dist$2.Selection.near(state.doc.resolve($cell.after(-1)), 1); }
-      return maybeSetSelection(state, dispatch, newSel)
-    }
-  }
-}
-
-function shiftArrow(axis, dir) {
-  return function (state, dispatch, view) {
-    var sel = state.selection;
-    if (!(sel instanceof CellSelection)) {
-      var end = atEndOfCell(view, axis, dir);
-      if (end == null) { return false }
-      sel = new CellSelection(state.doc.resolve(end));
-    }
-    var $head = nextCell(sel.$headCell, axis, dir);
-    if (!$head) { return false }
-    return maybeSetSelection(state, dispatch, new CellSelection(sel.$anchorCell, $head))
-  }
-}
-
-function deleteCellSelection(state, dispatch) {
-  var sel = state.selection;
-  if (!(sel instanceof CellSelection)) { return false }
-  if (dispatch) {
-    var tr = state.tr, baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;
-    sel.forEachCell(function (cell, pos) {
-      if (!cell.content.eq(baseContent))
-        { tr.replace(tr.mapping.map(pos + 1), tr.mapping.map(pos + cell.nodeSize - 1),
-                   new dist.Slice(baseContent, 0, 0)); }
-    });
-    if (tr.docChanged) { dispatch(tr); }
-  }
-  return true
-}
-
-function handleTripleClick(view, pos) {
-  var doc = view.state.doc, $cell = cellAround(doc.resolve(pos));
-  if (!$cell) { return false }
-  view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));
-  return true
-}
-
-function handlePaste(view, _, slice) {
-  if (!isInTable(view.state)) { return false }
-  var cells = pastedCells(slice), sel = view.state.selection;
-  if (sel instanceof CellSelection) {
-    if (!cells) { cells = {width: 1, height: 1, rows: [dist.Fragment.from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]}; }
-    var table = sel.$anchorCell.node(-1), start = sel.$anchorCell.start(-1);
-    var rect = TableMap.get(table).rectBetween(sel.$anchorCell.pos - start, sel.$headCell.pos - start);
-    cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);
-    insertCells(view.state, view.dispatch, start, rect, cells);
-    return true
-  } else if (cells) {
-    var $cell = selectionCell(view.state), start$1 = $cell.start(-1);
-    insertCells(view.state, view.dispatch, start$1, TableMap.get($cell.node(-1)).findCell($cell.pos - start$1), cells);
-    return true
-  } else {
-    return false
-  }
-}
-
-function handleMouseDown(view, startEvent) {
-  if (startEvent.ctrlKey || startEvent.metaKey) { return }
-
-  var startDOMCell = domInCell(view, startEvent.target), $anchor;
-  if (startEvent.shiftKey && (view.state.selection instanceof CellSelection)) {
-    // Adding to an existing cell selection
-    setCellSelection(view.state.selection.$anchorCell, startEvent);
-    startEvent.preventDefault();
-  } else if (startEvent.shiftKey && startDOMCell &&
-             ($anchor = cellAround(view.state.selection.$anchor)) != null &&
-             cellUnderMouse(view, startEvent).pos != $anchor.pos) {
-    // Adding to a selection that starts in another cell (causing a
-    // cell selection to be created).
-    setCellSelection($anchor, startEvent);
-    startEvent.preventDefault();
-  } else if (!startDOMCell) {
-    // Not in a cell, let the default behavior happen.
-    return
-  }
-
-  // Create and dispatch a cell selection between the given anchor and
-  // the position under the mouse.
-  function setCellSelection($anchor, event) {
-    var $head = cellUnderMouse(view, event);
-    var starting = key.getState(view.state) == null;
-    if (!$head || !inSameTable($anchor, $head)) {
-      if (starting) { $head = $anchor; }
-      else { return }
-    }
-    var selection = new CellSelection($anchor, $head);
-    if (starting || !view.state.selection.eq(selection)) {
-      var tr = view.state.tr.setSelection(selection);
-      if (starting) { tr.setMeta(key, $anchor.pos); }
-      view.dispatch(tr);
-    }
-  }
-
-  // Stop listening to mouse motion events.
-  function stop() {
-    view.root.removeEventListener("mouseup", stop);
-    view.root.removeEventListener("dragstart", stop);
-    view.root.removeEventListener("mousemove", move);
-    if (key.getState(view.state) != null) { view.dispatch(view.state.tr.setMeta(key, -1)); }
-  }
-
-  function move(event) {
-    var anchor = key.getState(view.state), $anchor;
-    if (anchor != null) {
-      // Continuing an existing cross-cell selection
-      $anchor = view.state.doc.resolve(anchor);
-    } else if (domInCell(view, event.target) != startDOMCell) {
-      // Moving out of the initial cell -- start a new cell selection
-      $anchor = cellUnderMouse(view, startEvent);
-      if (!$anchor) { return stop() }
-    }
-    if ($anchor) { setCellSelection($anchor, event); }
-  }
-  view.root.addEventListener("mouseup", stop);
-  view.root.addEventListener("dragstart", stop);
-  view.root.addEventListener("mousemove", move);
-}
-
-// Check whether the cursor is at the end of a cell (so that further
-// motion would move out of the cell)
-function atEndOfCell(view, axis, dir) {
-  if (!(view.state.selection instanceof dist$2.TextSelection)) { return null }
-  var ref = view.state.selection;
-  var $head = ref.$head;
-  for (var d = $head.depth - 1; d >= 0; d--) {
-    var parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d);
-    if (index != (dir < 0 ? 0 : parent.childCount)) { return null }
-    if (parent.type.spec.tableRole == "cell" || parent.type.spec.tableRole == "header_cell") {
-      var cellPos = $head.before(d);
-      var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
-      return view.endOfTextblock(dirStr) ? cellPos : null
-    }
-  }
-  return null
-}
-
-function domInCell(view, dom) {
-  for (; dom && dom != view.dom; dom = dom.parentNode)
-    { if (dom.nodeName == "TD" || dom.nodeName == "TH") { return dom } }
-}
-
-function cellUnderMouse(view, event) {
-  var mousePos = view.posAtCoords({left: event.clientX, top: event.clientY});
-  if (!mousePos) { return null }
-  return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null
-}
-
-// This file defines helpers for normalizing tables, making sure no
-
-// Helper for iterating through the nodes in a document that changed
-// compared to the given previous document. Useful for avoiding
-// duplicate work on each transaction.
-function changedDescendants(old, cur, offset, f) {
-  var oldSize = old.childCount, curSize = cur.childCount;
-  outer: for (var i = 0, j = 0; i < curSize; i++) {
-    var child = cur.child(i);
-    for (var scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {
-      if (old.child(scan) == child) {
-        j = scan + 1;
-        offset += child.nodeSize;
-        continue outer
-      }
-    }
-    f(child, offset);
-    if (j < oldSize && old.child(j).sameMarkup(child))
-      { changedDescendants(old.child(j), child, offset + 1, f); }
-    else
-      { child.nodesBetween(0, child.content.size, f, offset + 1); }
-    offset += child.nodeSize;
-  }
-}
-
-// :: (EditorState, ?EditorState) → ?Transaction
-// Inspect all tables in the given state's document and return a
-// transaction that fixes them, if necessary. If `oldState` was
-// provided, that is assumed to hold a previous, known-good state,
-// which will be used to avoid re-scanning unchanged parts of the
-// document.
-function fixTables(state, oldState) {
-  var tr, check = function (node, pos) {
-    if (node.type.spec.tableRole == "table") { tr = fixTable(state, node, pos, tr); }
-  };
-  if (!oldState) { state.doc.descendants(check); }
-  else if (oldState.doc != state.doc) { changedDescendants(oldState.doc, state.doc, 0, check); }
-  return tr
-}
-
-// : (EditorState, Node, number, ?Transaction) → ?Transaction
-// Fix the given table, if necessary. Will append to the transaction
-// it was given, if non-null, or create a new one if necessary.
-function fixTable(state, table, tablePos, tr) {
-  var map = TableMap.get(table);
-  if (!map.problems) { return tr }
-  if (!tr) { tr = state.tr; }
-
-  // Track which rows we must add cells to, so that we can adjust that
-  // when fixing collisions.
-  var mustAdd = [];
-  for (var i = 0; i < map.height; i++) { mustAdd.push(0); }
-  for (var i$1 = 0; i$1 < map.problems.length; i$1++) {
-    var prob = map.problems[i$1];
-    if (prob.type == "collision") {
-      var cell = table.nodeAt(prob.pos);
-      for (var j = 0; j < cell.attrs.rowspan; j++) { mustAdd[prob.row + j] += prob.n; }
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, rmColSpan(cell.attrs, cell.attrs.colspan - prob.n, prob.n));
-    } else if (prob.type == "missing") {
-      mustAdd[prob.row] += prob.n;
-    } else if (prob.type == "overlong_rowspan") {
-      var cell$1 = table.nodeAt(prob.pos);
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$1.attrs, "rowspan", cell$1.attrs.rowspan - prob.n));
-    } else if (prob.type == "colwidth mismatch") {
-      var cell$2 = table.nodeAt(prob.pos);
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$2.attrs, "colwidth", prob.colwidth));
-    }
-  }
-  var first, last;
-  for (var i$2 = 0; i$2 < mustAdd.length; i$2++) { if (mustAdd[i$2]) {
-    if (first == null) { first = i$2; }
-    last = i$2;
-  } }
-  // Add the necessary cells, using a heuristic for whether to add the
-  // cells at the start or end of the rows (if it looks like a 'bite'
-  // was taken out of the table, add cells at the start of the row
-  // after the bite. Otherwise add them at the end).
-  for (var i$3 = 0, pos = tablePos + 1; i$3 < map.height; i$3++) {
-    var end = pos + table.child(i$3).nodeSize;
-    var add = mustAdd[i$3];
-    if (add > 0) {
-      var nodes = [];
-      for (var j$1 = 0; j$1 < add; j$1++)
-        { nodes.push(tableNodeTypes(state.schema).cell.createAndFill()); }
-      var side = (i$3 == 0 || first == i$3 - 1) && last == i$3 ? pos + 1 : end - 1;
-      tr.insert(tr.mapping.map(side), nodes);
-    }
-    pos = end;
-  }
-  return tr
-}
-
-// This file defines a number of table-related commands.
-
-// Helper to get the selected rectangle in a table, if any. Adds table
-// map, table node, and table start offset to the object for
-// convenience.
-function selectedRect(state) {
-  var sel = state.selection, $pos = selectionCell(state);
-  var table = $pos.node(-1), tableStart = $pos.start(-1), map = TableMap.get(table);
-  var rect;
-  if (sel instanceof CellSelection)
-    { rect = map.rectBetween(sel.$anchorCell.pos - tableStart, sel.$headCell.pos - tableStart); }
-  else
-    { rect = map.findCell($pos.pos - tableStart); }
-  rect.tableStart = tableStart;
-  rect.map = map;
-  rect.table = table;
-  return rect
-}
-
-function columnIsHeader(map, table, col) {
-  var headerCell = tableNodeTypes(table.type.schema).header_cell;
-  for (var row = 0; row < map.height; row++)
-    { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
-      { return false } }
-  return true
-}
-
-// Add a column at the given position in a table.
-function addColumn(tr, ref, col) {
-  var map = ref.map;
-  var tableStart = ref.tableStart;
-  var table = ref.table;
-
-  var refColumn = col > 0 ? -1 : 0;
-  if (columnIsHeader(map, table, col + refColumn))
-    { refColumn = col == 0 || col == map.width ? null : 0; }
-
-  for (var row = 0; row < map.height; row++) {
-    var index = row * map.width + col;
-    // If this position falls inside a col-spanning cell
-    if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {
-      var pos = map.map[index], cell = table.nodeAt(pos);
-      tr.setNodeMarkup(tr.mapping.map(tableStart + pos), null,
-                       addColSpan(cell.attrs, col - map.colCount(pos)));
-      // Skip ahead if rowspan > 1
-      row += cell.attrs.rowspan - 1;
-    } else {
-      var type = refColumn == null ? tableNodeTypes(table.type.schema).cell
-          : table.nodeAt(map.map[index + refColumn]).type;
-      var pos$1 = map.positionAt(row, col, table);
-      tr.insert(tr.mapping.map(tableStart + pos$1), type.createAndFill());
-    }
-  }
-  return tr
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Command to add a column before the column with the selection.
-function addColumnBefore(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addColumn(state.tr, rect, rect.left));
-  }
-  return true
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Command to add a column after the column with the selection.
-function addColumnAfter(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addColumn(state.tr, rect, rect.right));
-  }
-  return true
-}
-
-function removeColumn(tr, ref, col) {
-  var map = ref.map;
-  var table = ref.table;
-  var tableStart = ref.tableStart;
-
-  var mapStart = tr.mapping.maps.length;
-  for (var row = 0; row < map.height;) {
-    var index = row * map.width + col, pos = map.map[index], cell = table.nodeAt(pos);
-    // If this is part of a col-spanning cell
-    if ((col > 0 && map.map[index - 1] == pos) || (col < map.width - 1 && map.map[index + 1] == pos)) {
-      tr.setNodeMarkup(tr.mapping.slice(mapStart).map(tableStart + pos), null,
-                       rmColSpan(cell.attrs, col - map.colCount(pos)));
-    } else {
-      var start = tr.mapping.slice(mapStart).map(tableStart + pos);
-      tr.delete(start, start + cell.nodeSize);
-    }
-    row += cell.attrs.rowspan;
-  }
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Command function that removes the selected columns from a table.
-function deleteColumn(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state), tr = state.tr;
-    if (rect.left == 0 && rect.right == rect.map.width) { return false }
-    for (var i = rect.right - 1;; i--) {
-      removeColumn(tr, rect, i);
-      if (i == rect.left) { break }
-      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
-      rect.map = TableMap.get(rect.table);
-    }
-    dispatch(tr);
-  }
-  return true
-}
-
-function rowIsHeader(map, table, row) {
-  var headerCell = tableNodeTypes(table.type.schema).header_cell;
-  for (var col = 0; col < map.width; col++)
-    { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
-      { return false } }
-  return true
-}
-
-function addRow(tr, ref, row) {
-  var map = ref.map;
-  var tableStart = ref.tableStart;
-  var table = ref.table;
-
-  var rowPos = tableStart;
-  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
-  var cells = [], refRow = row > 0 ? -1 : 0;
-  if (rowIsHeader(map, table, row + refRow))
-    { refRow = row == 0 || row == map.height ? null : 0; }
-  for (var col = 0, index = map.width * row; col < map.width; col++, index++) {
-    // Covered by a rowspan cell
-    if (row > 0 && row < map.height && map.map[index] == map.map[index - map.width]) {
-      var pos = map.map[index], attrs = table.nodeAt(pos).attrs;
-      tr.setNodeMarkup(tableStart + pos, null, setAttr(attrs, "rowspan", attrs.rowspan + 1));
-      col += attrs.colspan - 1;
-    } else {
-      var type = refRow == null ? tableNodeTypes(table.type.schema).cell
-          : table.nodeAt(map.map[index + refRow * map.width]).type;
-      cells.push(type.createAndFill());
-    }
-  }
-  tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells));
-  return tr
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Add a table row before the selection.
-function addRowBefore(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addRow(state.tr, rect, rect.top));
-  }
-  return true
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Add a table row after the selection.
-function addRowAfter(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addRow(state.tr, rect, rect.bottom));
-  }
-  return true
-}
-
-function removeRow(tr, ref, row) {
-  var map = ref.map;
-  var table = ref.table;
-  var tableStart = ref.tableStart;
-
-  var rowPos = 0;
-  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
-  var nextRow = rowPos + table.child(row).nodeSize;
-
-  var mapFrom = tr.mapping.maps.length;
-  tr.delete(rowPos + tableStart, nextRow + tableStart);
-
-  for (var col = 0, index = row * map.width; col < map.width; col++, index++) {
-    var pos = map.map[index];
-    if (row > 0 && pos == map.map[index - map.width]) {
-      // If this cell starts in the row above, simply reduce its rowspan
-      var attrs = table.nodeAt(pos).attrs;
-      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + tableStart), null, setAttr(attrs, "rowspan", attrs.rowspan - 1));
-      col += attrs.colspan - 1;
-    } else if (row < map.width && pos == map.map[index + map.width]) {
-      // Else, if it continues in the row below, it has to be moved down
-      var cell = table.nodeAt(pos);
-      var copy = cell.type.create(setAttr(cell.attrs, "rowspan", cell.attrs.rowspan - 1), cell.content);
-      var newPos = map.positionAt(row + 1, col, table);
-      tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy);
-      col += cell.attrs.colspan - 1;
-    }
-  }
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Remove the selected rows from a table.
-function deleteRow(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state), tr = state.tr;
-    if (rect.top == 0 && rect.bottom == rect.map.height) { return false }
-    for (var i = rect.bottom - 1;; i--) {
-      removeRow(tr, rect, i);
-      if (i == rect.top) { break }
-      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
-      rect.map = TableMap.get(rect.table);
-    }
-    dispatch(tr);
-  }
-  return true
-}
-
-function isEmpty(cell) {
-  var c = cell.content;
-  return c.childCount == 1 && c.firstChild.isTextblock && c.firstChild.childCount == 0
-}
-
-function cellsOverlapRectangle(ref, rect) {
-  var width = ref.width;
-  var height = ref.height;
-  var map = ref.map;
-
-  var indexTop = rect.top * width + rect.left, indexLeft = indexTop;
-  var indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1);
-  for (var i = rect.top; i < rect.bottom; i++) {
-    if (rect.left > 0 && map[indexLeft] == map[indexLeft - 1] ||
-        rect.right < width && map[indexRight] == map[indexRight + 1]) { return true }
-    indexLeft += width; indexRight += width;
-  }
-  for (var i$1 = rect.left; i$1 < rect.right; i$1++) {
-    if (rect.top > 0 && map[indexTop] == map[indexTop - width] ||
-        rect.bottom < height && map[indexBottom] == map[indexBottom + width]) { return true }
-    indexTop++; indexBottom++;
-  }
-  return false
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Merge the selected cells into a single cell. Only available when
-// the selected cells' outline forms a rectangle.
-function mergeCells(state, dispatch) {
-  var sel = state.selection;
-  if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos) { return false }
-  var rect = selectedRect(state);
-  var map = rect.map;
-  if (cellsOverlapRectangle(map, rect)) { return false }
-  if (dispatch) {
-    var tr = state.tr, seen = [], content = dist.Fragment.empty, mergedPos, mergedCell;
-    for (var row = rect.top; row < rect.bottom; row++) {
-      for (var col = rect.left; col < rect.right; col++) {
-        var cellPos = map.map[row * map.width + col], cell = rect.table.nodeAt(cellPos);
-        if (seen.indexOf(cellPos) > -1) { continue }
-        seen.push(cellPos);
-        if (mergedPos == null) {
-          mergedPos = cellPos;
-          mergedCell = cell;
-        } else {
-          if (!isEmpty(cell)) { content = content.append(cell.content); }
-          var mapped = tr.mapping.map(cellPos + rect.tableStart);
-          tr.delete(mapped, mapped + cell.nodeSize);
-        }
-      }
-    }
-    tr.setNodeMarkup(mergedPos + rect.tableStart, null,
-                     setAttr(addColSpan(mergedCell.attrs, mergedCell.attrs.colspan, (rect.right - rect.left) - mergedCell.attrs.colspan),
-                             "rowspan", rect.bottom - rect.top));
-    if (content.size) {
-      var end = mergedPos + 1 + mergedCell.content.size;
-      var start = isEmpty(mergedCell) ? mergedPos + 1 : end;
-      tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content);
-    }
-    tr.setSelection(new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart)));
-    dispatch(tr);
-  }
-  return true
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Split a selected cell, whose rowpan or colspan is greater than one,
-// into smaller cells.
-function splitCell(state, dispatch) {
-  var sel = state.selection;
-  var cellNode, cellPos;
-  if (!(sel instanceof CellSelection)) {
-    cellNode = cellWrapping(sel.$from);
-    if (!cellNode) { return false }
-    cellPos = cellAround(sel.$from).pos;
-  } else {
-    if (sel.$anchorCell.pos != sel.$headCell.pos) { return false }
-    cellNode = sel.$anchorCell.nodeAfter;
-    cellPos = sel.$anchorCell.pos;
-  }
-  if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {return false}
-  if (dispatch) {
-    var baseAttrs = cellNode.attrs, attrs = [], colwidth = baseAttrs.colwidth;
-    if (baseAttrs.rowspan > 1) { baseAttrs = setAttr(baseAttrs, "rowspan", 1); }
-    if (baseAttrs.colspan > 1) { baseAttrs = setAttr(baseAttrs, "colspan", 1); }
-    var rect = selectedRect(state), tr = state.tr;
-    for (var i = 0; i < rect.right - rect.left; i++)
-      { attrs.push(colwidth ? setAttr(baseAttrs, "colwidth", colwidth && colwidth[i] ? [colwidth[i]] : null) : baseAttrs); }
-    var lastCell, cellType = tableNodeTypes(state.schema)[cellNode.type.spec.tableRole];
-    for (var row = 0; row < rect.bottom; row++) {
-      if (row >= rect.top) {
-        var pos = rect.map.positionAt(row, rect.left, rect.table);
-        if (row == rect.top) { pos += cellNode.nodeSize; }
-        for (var col = rect.left, i$1 = 0; col < rect.right; col++, i$1++) {
-          if (col == rect.left && row == rect.top) { continue }
-          tr.insert(lastCell = tr.mapping.map(pos + rect.tableStart, 1), cellType.createAndFill(attrs[i$1]));
-        }
-      }
-    }
-    tr.setNodeMarkup(cellPos, null, attrs[0]);
-    if (sel instanceof CellSelection)
-      { tr.setSelection(new CellSelection(tr.doc.resolve(sel.$anchorCell.pos),
-                                        lastCell && tr.doc.resolve(lastCell))); }
-    dispatch(tr);
-  }
-  return true
-}
-
-// :: (string, any) → (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command that sets the given attribute to the given value,
-// and is only available when the currently selected cell doesn't
-// already have that attribute set to that value.
-function setCellAttr(name, value) {
-  return function(state, dispatch) {
-    if (!isInTable(state)) { return false }
-    var $cell = selectionCell(state);
-    if ($cell.nodeAfter.attrs[name] === value) { return false }
-    if (dispatch) {
-      var tr = state.tr;
-      if (state.selection instanceof CellSelection)
-        { state.selection.forEachCell(function (node, pos) {
-          if (node.attrs[name] !== value)
-            { tr.setNodeMarkup(pos, null, setAttr(node.attrs, name, value)); }
-        }); }
-      else
-        { tr.setNodeMarkup($cell.pos, null, setAttr($cell.nodeAfter.attrs, name, value)); }
-      dispatch(tr);
-    }
-    return true
-  }
-}
-
-function toggleHeader(type) {
-  return function(state, dispatch) {
-    if (!isInTable(state)) { return false }
-    if (dispatch) {
-      var types = tableNodeTypes(state.schema);
-      var rect = selectedRect(state), tr = state.tr;
-      var cells = rect.map.cellsInRect(type == "column" ? new Rect(rect.left, 0, rect.right, rect.map.height) :
-                                       type == "row" ? new Rect(0, rect.top, rect.map.width, rect.bottom) : rect);
-      var nodes = cells.map(function (pos) { return rect.table.nodeAt(pos); });
-      for (var i = 0; i < cells.length; i++) // Remove headers, if any
-        { if (nodes[i].type == types.header_cell)
-          { tr.setNodeMarkup(rect.tableStart + cells[i], types.cell, nodes[i].attrs); } }
-      if (tr.steps.length == 0) { for (var i$1 = 0; i$1 < cells.length; i$1++) // No headers removed, add instead
-        { tr.setNodeMarkup(rect.tableStart + cells[i$1], types.header_cell, nodes[i$1].attrs); } }
-      dispatch(tr);
-    }
-    return true
-  }
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Toggles whether the selected row contains header cells.
-var toggleHeaderRow = toggleHeader("row");
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Toggles whether the selected column contains header cells.
-var toggleHeaderColumn = toggleHeader("column");
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Toggles whether the selected cells are header cells.
-var toggleHeaderCell = toggleHeader("cell");
-
-function findNextCell($cell, dir) {
-  if (dir < 0) {
-    var before = $cell.nodeBefore;
-    if (before) { return $cell.pos - before.nodeSize }
-    for (var row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {
-      var rowNode = $cell.node(-1).child(row);
-      if (rowNode.childCount) { return rowEnd - 1 - rowNode.lastChild.nodeSize }
-      rowEnd -= rowNode.nodeSize;
-    }
-  } else {
-    if ($cell.index() < $cell.parent.childCount - 1) { return $cell.pos + $cell.nodeAfter.nodeSize }
-    var table = $cell.node(-1);
-    for (var row$1 = $cell.indexAfter(-1), rowStart = $cell.after(); row$1 < table.childCount; row$1++) {
-      var rowNode$1 = table.child(row$1);
-      if (rowNode$1.childCount) { return rowStart + 1 }
-      rowStart += rowNode$1.nodeSize;
-    }
-  }
-}
-
-// :: (number) → (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command for selecting the next (direction=1) or previous
-// (direction=-1) cell in a table.
-function goToNextCell(direction) {
-  return function(state, dispatch) {
-    if (!isInTable(state)) { return false }
-    var cell = findNextCell(selectionCell(state), direction);
-    if (cell == null) { return }
-    if (dispatch) {
-      var $cell = state.doc.resolve(cell);
-      dispatch(state.tr.setSelection(dist$2.TextSelection.between($cell, moveCellForward($cell))).scrollIntoView());
-    }
-    return true
-  }
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Deletes the table around the selection, if any.
-function deleteTable(state, dispatch) {
-  var $pos = state.selection.$anchor;
-  for (var d = $pos.depth; d > 0; d--) {
-    var node = $pos.node(d);
-    if (node.type.spec.tableRole == "table") {
-      if (dispatch) { dispatch(state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView()); }
-      return true
-    }
-  }
-  return false
-}
-
-var TableView = function TableView(node, cellMinWidth) {
-  this.node = node;
-  this.cellMinWidth = cellMinWidth;
-  this.dom = document.createElement("div");
-  this.dom.className = "tableWrapper";
-  this.table = this.dom.appendChild(document.createElement("table"));
-  this.colgroup = this.table.appendChild(document.createElement("colgroup"));
-  updateColumns(node, this.colgroup, this.table, cellMinWidth);
-  this.contentDOM = this.table.appendChild(document.createElement("tbody"));
-};
-
-TableView.prototype.update = function update (node) {
-  if (node.type != this.node.type) { return false }
-  this.node = node;
-  updateColumns(node, this.colgroup, this.table, this.cellMinWidth);
-  return true
-};
-
-TableView.prototype.ignoreMutation = function ignoreMutation (record) {
-  return record.type == "attributes" && (record.target == this.table || this.colgroup.contains(record.target))
-};
-
-function updateColumns(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {
-  var totalWidth = 0, fixedWidth = true;
-  var nextDOM = colgroup.firstChild, row = node.firstChild;
-  for (var i = 0, col = 0; i < row.childCount; i++) {
-    var ref = row.child(i).attrs;
-    var colspan = ref.colspan;
-    var colwidth = ref.colwidth;
-    for (var j = 0; j < colspan; j++, col++) {
-      var hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j];
-      var cssWidth = hasWidth ? hasWidth + "px" : "";
-      totalWidth += hasWidth || cellMinWidth;
-      if (!hasWidth) { fixedWidth = false; }
-      if (!nextDOM) {
-        colgroup.appendChild(document.createElement("col")).style.width = cssWidth;
-      } else {
-        if (nextDOM.style.width != cssWidth) { nextDOM.style.width = cssWidth; }
-        nextDOM = nextDOM.nextSibling;
-      }
-    }
-  }
-
-  while (nextDOM) {
-    var after = nextDOM.nextSibling;
-    nextDOM.parentNode.removeChild(nextDOM);
-    nextDOM = after;
-  }
-
-  if (fixedWidth) {
-    table.style.width = totalWidth + "px";
-    table.style.minWidth = "";
-  } else {
-    table.style.width = "";
-    table.style.minWidth = totalWidth + "px";
-  }
-}
-
-var key$1 = new dist$2.PluginKey("tableColumnResizing");
-
-function columnResizing(ref) {
-  if ( ref === void 0 ) { ref = {}; }
-  var handleWidth = ref.handleWidth; if ( handleWidth === void 0 ) { handleWidth = 5; }
-  var cellMinWidth = ref.cellMinWidth; if ( cellMinWidth === void 0 ) { cellMinWidth = 25; }
-  var View = ref.View; if ( View === void 0 ) { View = TableView; }
-  var lastColumnResizable = ref.lastColumnResizable; if ( lastColumnResizable === void 0 ) { lastColumnResizable = true; }
-
-  var plugin = new dist$2.Plugin({
-    key: key$1,
-    state: {
-      init: function init(_, state) {
-        this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] =
-          function (node, view) { return new View(node, cellMinWidth, view); };
-        return new ResizeState(-1, false)
-      },
-      apply: function apply(tr, prev) {
-        return prev.apply(tr)
-      }
-    },
-    props: {
-      attributes: function attributes(state) {
-        var pluginState = key$1.getState(state);
-        return pluginState.activeHandle > -1 ? {class: "resize-cursor"} : null
-      },
-
-      handleDOMEvents: {
-        mousemove: function mousemove(view, event) { handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable); },
-        mouseleave: function mouseleave(view) { handleMouseLeave(view); },
-        mousedown: function mousedown(view, event) { handleMouseDown$1(view, event, cellMinWidth); }
-      },
-
-      decorations: function decorations(state) {
-        var pluginState = key$1.getState(state);
-        if (pluginState.activeHandle > -1) { return handleDecorations(state, pluginState.activeHandle) }
-      },
-
-      nodeViews: {}
-    }
-  });
-  return plugin
-}
-
-var ResizeState = function ResizeState(activeHandle, dragging) {
-  this.activeHandle = activeHandle;
-  this.dragging = dragging;
-};
-
-ResizeState.prototype.apply = function apply (tr) {
-  var state = this, action = tr.getMeta(key$1);
-  if (action && action.setHandle != null)
-    { return new ResizeState(action.setHandle, null) }
-  if (action && action.setDragging !== undefined)
-    { return new ResizeState(state.activeHandle, action.setDragging) }
-  if (state.activeHandle > -1 && tr.docChanged) {
-    var handle = tr.mapping.map(state.activeHandle, -1);
-    if (!pointsAtCell(tr.doc.resolve(handle))) { handle = null; }
-    state = new ResizeState(handle, state.dragging);
-  }
-  return state
-};
-
-function handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {
-  var pluginState = key$1.getState(view.state);
-
-  if (!pluginState.dragging) {
-    var target = domCellAround(event.target), cell = -1;
-    if (target) {
-      var ref = target.getBoundingClientRect();
-      var left = ref.left;
-      var right = ref.right;
-      if (event.clientX - left <= handleWidth)
-        { cell = edgeCell(view, event, "left"); }
-      else if (right - event.clientX <= handleWidth)
-        { cell = edgeCell(view, event, "right"); }
-    }
-
-    if (cell != pluginState.activeHandle) {
-      if (!lastColumnResizable && cell !== -1) {
-        var $cell = view.state.doc.resolve(cell);
-        var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-        var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-
-        if (col == map.width - 1) {
-          return
-        }
-      }
-
-      updateHandle(view, cell);
-    }
-  }
-}
-
-function handleMouseLeave(view) {
-  var pluginState = key$1.getState(view.state);
-  if (pluginState.activeHandle > -1 && !pluginState.dragging) { updateHandle(view, -1); }
-}
-
-function handleMouseDown$1(view, event, cellMinWidth) {
-  var pluginState = key$1.getState(view.state);
-  if (pluginState.activeHandle == -1 || pluginState.dragging) { return false }
-
-  var cell = view.state.doc.nodeAt(pluginState.activeHandle);
-  var width = currentColWidth(view, pluginState.activeHandle, cell.attrs);
-  view.dispatch(view.state.tr.setMeta(key$1, {setDragging: {startX: event.clientX, startWidth: width}}));
-
-  function finish(event) {
-    window.removeEventListener("mouseup", finish);
-    window.removeEventListener("mousemove", move);
-    var pluginState = key$1.getState(view.state);
-    if (pluginState.dragging) {
-      updateColumnWidth(view, pluginState.activeHandle, draggedWidth(pluginState.dragging, event, cellMinWidth));
-      view.dispatch(view.state.tr.setMeta(key$1, {setDragging: null}));
-    }
-  }
-  function move(event) {
-    if (!event.which) { return finish(event) }
-    var pluginState = key$1.getState(view.state);
-    var dragged = draggedWidth(pluginState.dragging, event, cellMinWidth);
-    displayColumnWidth(view, pluginState.activeHandle, dragged, cellMinWidth);
-  }
-
-  window.addEventListener("mouseup", finish);
-  window.addEventListener("mousemove", move);
-  event.preventDefault();
-  return true
-}
-
-function currentColWidth(view, cellPos, ref) {
-  var colspan = ref.colspan;
-  var colwidth = ref.colwidth;
-
-  var width = colwidth && colwidth[colwidth.length - 1];
-  if (width) { return width }
-  // Not fixed, read current width from DOM
-  var domWidth = view.domAtPos(cellPos + 1).node.offsetWidth, parts = colspan;
-  if (colwidth) { for (var i = 0; i < colspan; i++) { if (colwidth[i]) {
-    domWidth -= colwidth[i];
-    parts--;
-  } } }
-  return domWidth / parts
-}
-
-function domCellAround(target) {
-  while (target && target.nodeName != "TD" && target.nodeName != "TH")
-    { target = target.classList.contains("ProseMirror") ? null : target.parentNode; }
-  return target
-}
-
-function edgeCell(view, event, side) {
-  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
-  var pos = ref.pos;
-  var $cell = cellAround(view.state.doc.resolve(pos));
-  if (!$cell) { return -1 }
-  if (side == "right") { return $cell.pos }
-  var map = TableMap.get($cell.node(-1)), start = $cell.start(-1);
-  var index = map.map.indexOf($cell.pos - start);
-  return index % map.width == 0 ? -1 : start + map.map[index - 1]
-}
-
-function draggedWidth(dragging, event, cellMinWidth) {
-  var offset = event.clientX - dragging.startX;
-  return Math.max(cellMinWidth, dragging.startWidth + offset)
-}
-
-function updateHandle(view, value) {
-  view.dispatch(view.state.tr.setMeta(key$1, {setHandle: value}));
-}
-
-function updateColumnWidth(view, cell, width) {
-  var $cell = view.state.doc.resolve(cell);
-  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-  var tr = view.state.tr;
-  for (var row = 0; row < map.height; row++) {
-    var mapIndex = row * map.width + col;
-    // Rowspanning cell that has already been handled
-    if (row && map.map[mapIndex] == map.map[mapIndex - map.width]) { continue }
-    var pos = map.map[mapIndex];
-    var ref = table.nodeAt(pos);
-    var attrs = ref.attrs;
-    var index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);
-    if (attrs.colwidth && attrs.colwidth[index] == width) { continue }
-    var colwidth = attrs.colwidth ? attrs.colwidth.slice() : zeroes(attrs.colspan);
-    colwidth[index] = width;
-    tr.setNodeMarkup(start + pos, null, setAttr(attrs, "colwidth", colwidth));
-  }
-  if (tr.docChanged) { view.dispatch(tr); }
-}
-
-function displayColumnWidth(view, cell, width, cellMinWidth) {
-  var $cell = view.state.doc.resolve(cell);
-  var table = $cell.node(-1), start = $cell.start(-1);
-  var col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-  var dom = view.domAtPos($cell.start(-1)).node;
-  while (dom.nodeName != "TABLE") { dom = dom.parentNode; }
-  updateColumns(table, dom.firstChild, dom, cellMinWidth, col, width);
-}
-
-function zeroes(n) {
-  var result = [];
-  for (var i = 0; i < n; i++) { result.push(0); }
-  return result
-}
-
-function handleDecorations(state, cell) {
-  var decorations = [];
-  var $cell = state.doc.resolve(cell);
-  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;
-  for (var row = 0; row < map.height; row++) {
-    var index = col + row * map.width - 1;
-    // For positions that are have either a different cell or the end
-    // of the table to their right, and either the top of the table or
-    // a different cell above them, add a decoration
-    if ((col == map.width || map.map[index] != map.map[index + 1]) &&
-        (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])) {
-      var cellPos = map.map[index];
-      var pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;
-      var dom = document.createElement("div");
-      dom.className = "column-resize-handle";
-      decorations.push(dist$3.Decoration.widget(pos, dom));
-    }
-  }
-  return dist$3.DecorationSet.create(state.doc, decorations)
-}
-
-// This file defines a plugin that handles the drawing of cell
-
-// :: () → Plugin
-//
-// Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)
-// that, when added to an editor, enables cell-selection, handles
-// cell-based copy/paste, and makes sure tables stay well-formed (each
-// row has the same width, and cells don't overlap).
-//
-// You should probably put this plugin near the end of your array of
-// plugins, since it handles mouse and arrow key events in tables
-// rather broadly, and other plugins, like the gap cursor or the
-// column-width dragging plugin, might want to get a turn first to
-// perform more specific behavior.
-function tableEditing() {
-  return new dist$2.Plugin({
-    key: key,
-
-    // This piece of state is used to remember when a mouse-drag
-    // cell-selection is happening, so that it can continue even as
-    // transactions (which might move its anchor cell) come in.
-    state: {
-      init: function init() { return null },
-      apply: function apply(tr, cur) {
-        var set = tr.getMeta(key);
-        if (set != null) { return set == -1 ? null : set }
-        if (cur == null || !tr.docChanged) { return cur }
-        var ref = tr.mapping.mapResult(cur);
-        var deleted = ref.deleted;
-        var pos = ref.pos;
-        return deleted ? null : pos
-      }
-    },
-
-    props: {
-      decorations: drawCellSelection,
-
-      handleDOMEvents: {
-        mousedown: handleMouseDown
-      },
-
-      createSelectionBetween: function createSelectionBetween(view) {
-        if (key.getState(view.state) != null) { return view.state.selection }
-      },
-
-      handleTripleClick: handleTripleClick,
-
-      handleKeyDown: handleKeyDown,
-
-      handlePaste: handlePaste
-    },
-
-    appendTransaction: function appendTransaction(_, oldState, state) {
-      return normalizeSelection(state, fixTables(state, oldState))
-    }
-  })
-}
-
-exports.tableEditing = tableEditing;
-exports.fixTables = fixTables;
-exports.handlePaste = handlePaste;
-exports.cellAround = cellAround;
-exports.isInTable = isInTable;
-exports.selectionCell = selectionCell;
-exports.moveCellForward = moveCellForward;
-exports.inSameTable = inSameTable;
-exports.findCell = findCell;
-exports.colCount = colCount;
-exports.nextCell = nextCell;
-exports.tableNodes = tableNodes;
-exports.CellSelection = CellSelection;
-exports.TableMap = TableMap;
-exports.columnResizing = columnResizing;
-exports.columnResizingPluginKey = key$1;
-exports.updateColumnsOnResize = updateColumns;
-exports.__pastedCells = pastedCells;
-exports.__insertCells = insertCells;
-exports.__clipCells = clipCells;
-exports.addColumn = addColumn;
-exports.addColumnBefore = addColumnBefore;
-exports.addColumnAfter = addColumnAfter;
-exports.removeColumn = removeColumn;
-exports.deleteColumn = deleteColumn;
-exports.addRow = addRow;
-exports.addRowBefore = addRowBefore;
-exports.addRowAfter = addRowAfter;
-exports.removeRow = removeRow;
-exports.deleteRow = deleteRow;
-exports.mergeCells = mergeCells;
-exports.splitCell = splitCell;
-exports.setCellAttr = setCellAttr;
-exports.toggleHeaderRow = toggleHeaderRow;
-exports.toggleHeaderColumn = toggleHeaderColumn;
-exports.toggleHeaderCell = toggleHeaderCell;
-exports.goToNextCell = goToNextCell;
-exports.deleteTable = deleteTable;
-
-});
-
-unwrapExports(dist$7);
-var dist_1$6 = dist$7.tableEditing;
-var dist_2$6 = dist$7.fixTables;
-var dist_3$5 = dist$7.handlePaste;
-var dist_4$5 = dist$7.cellAround;
-var dist_5$5 = dist$7.isInTable;
-var dist_6$4 = dist$7.selectionCell;
-var dist_7$4 = dist$7.moveCellForward;
-var dist_8$4 = dist$7.inSameTable;
-var dist_9$4 = dist$7.findCell;
-var dist_10$3 = dist$7.colCount;
-var dist_11$3 = dist$7.nextCell;
-var dist_12$3 = dist$7.tableNodes;
-var dist_13$2 = dist$7.CellSelection;
-var dist_14$1 = dist$7.TableMap;
-var dist_15$1 = dist$7.columnResizing;
-var dist_16$1 = dist$7.columnResizingPluginKey;
-var dist_17$1 = dist$7.updateColumnsOnResize;
-var dist_18$1 = dist$7.__pastedCells;
-var dist_19$1 = dist$7.__insertCells;
-var dist_20 = dist$7.__clipCells;
-var dist_21 = dist$7.addColumn;
-var dist_22 = dist$7.addColumnBefore;
-var dist_23 = dist$7.addColumnAfter;
-var dist_24 = dist$7.removeColumn;
-var dist_25 = dist$7.deleteColumn;
-var dist_26 = dist$7.addRow;
-var dist_27 = dist$7.addRowBefore;
-var dist_28 = dist$7.addRowAfter;
-var dist_29 = dist$7.removeRow;
-var dist_30 = dist$7.deleteRow;
-var dist_31 = dist$7.mergeCells;
-var dist_32 = dist$7.splitCell;
-var dist_33 = dist$7.setCellAttr;
-var dist_34 = dist$7.toggleHeaderRow;
-var dist_35 = dist$7.toggleHeaderColumn;
-var dist_36 = dist$7.toggleHeaderCell;
-var dist_37 = dist$7.goToNextCell;
-var dist_38 = dist$7.deleteTable;
-
-var dist$8 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a node of a given `nodeType`. It will return an original transaction if parent node hasn't been found.
-//
-// ```javascript
-// dispatch(
-//   removeParentNodeOfType(schema.nodes.table)(tr)
-// );
-// ```
-var removeParentNodeOfType = function removeParentNodeOfType(nodeType) {
-  return function (tr) {
-    var parent = findParentNodeOfType(nodeType)(tr.selection);
-    if (parent) {
-      return removeNodeAtPos(parent.pos)(tr);
-    }
-    return tr;
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction
-// Returns a new transaction that replaces parent node of a given `nodeType` with the given `content`. It will return an original transaction if either parent node hasn't been found or replacing is not possible.
-//
-// ```javascript
-// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
-//
-// dispatch(
-//  replaceParentNodeOfType(schema.nodes.table, node)(tr)
-// );
-// ```
-var replaceParentNodeOfType = function replaceParentNodeOfType(nodeType, content) {
-  return function (tr) {
-    if (!Array.isArray(nodeType)) {
-      nodeType = [nodeType];
-    }
-    for (var i = 0, count = nodeType.length; i < count; i++) {
-      var parent = findParentNodeOfType(nodeType[i])(tr.selection);
-      if (parent) {
-        var newTr = replaceNodeAtPos(parent.pos, content)(tr);
-        if (newTr !== tr) {
-          return newTr;
-        }
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes selected node. It will return an original transaction if current selection is not a `NodeSelection`.
-//
-// ```javascript
-// dispatch(
-//   removeSelectedNode(tr)
-// );
-// ```
-var removeSelectedNode = function removeSelectedNode(tr) {
-  if (isNodeSelection(tr.selection)) {
-    var from = tr.selection.$from.pos;
-    var to = tr.selection.$to.pos;
-    return cloneTr(tr.delete(from, to));
-  }
-  return tr;
-};
-
-// :: (node: ProseMirrorNode) → (tr: Transaction) → Transaction
-// Returns a new transaction that replaces selected node with a given `node`.
-// It will return the original transaction if either current selection is not a NodeSelection or replacing is not possible.
-//
-// ```javascript
-// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
-// dispatch(
-//   replaceSelectedNode(node)(tr)
-// );
-// ```
-var replaceSelectedNode = function replaceSelectedNode(node) {
-  return function (tr) {
-    if (isNodeSelection(tr.selection)) {
-      var _tr$selection = tr.selection,
-          $from = _tr$selection.$from,
-          $to = _tr$selection.$to;
-
-      if ($from.parent.canReplaceWith($from.index(), $from.indexAfter(), node.type)) {
-        return cloneTr(tr.replaceWith($from.pos, $to.pos, node));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (position: number, dir: ?number) → (tr: Transaction) → Transaction
-// Returns a new transaction that tries to find a valid cursor selection starting at the given `position`
-// and searching back if `dir` is negative, and forward if positive.
-// If a valid cursor position hasn't been found, it will return the original transaction.
-//
-// ```javascript
-// dispatch(
-//   setTextSelection(5)(tr)
-// );
-// ```
-var setTextSelection = function setTextSelection(position) {
-  var dir = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
-  return function (tr) {
-    var nextSelection = dist$2.Selection.findFrom(tr.doc.resolve(position), dir, true);
-    if (nextSelection) {
-      return tr.setSelection(nextSelection);
-    }
-    return tr;
-  };
-};
-
-// :: (content: union<ProseMirrorNode, Fragment>, position: ?number) → (tr: Transaction) → Transaction
-// Returns a new transaction that inserts a given `content` at the current cursor position, or at a given `position`, if it is allowed by schema. If schema restricts such nesting, it will try to find an appropriate place for a given node in the document, looping through parent nodes up until the root document node.
-// If cursor is inside of an empty paragraph, it will try to replace that paragraph with the given content. If insertion is successful and inserted node has content, it will set cursor inside of that content.
-// It will return an original transaction if the place for insertion hasn't been found.
-//
-// ```javascript
-// const node = schema.nodes.extension.createChecked({});
-// dispatch(
-//   safeInsert(node)(tr)
-// );
-// ```
-var safeInsert = function safeInsert(content, position) {
-  return function (tr) {
-    var hasPosition = typeof position === 'number';
-    var $from = tr.selection.$from;
-
-    var $insertPos = hasPosition ? tr.doc.resolve(position) : isNodeSelection(tr.selection) ? tr.doc.resolve($from.pos + 1) : $from;
-    var parent = $insertPos.parent,
-        depth = $insertPos.depth;
-
-    // try to replace an empty paragraph
-
-    if (isEmptyParagraph(parent)) {
-      var oldTr = tr;
-      tr = replaceParentNodeOfType(parent.type, content)(tr);
-      if (oldTr !== tr) {
-        return setTextSelection($insertPos.pos)(tr);
-      }
-    }
-
-    // given node is allowed at the current cursor position
-    if (canInsert($insertPos, content)) {
-      tr.insert($insertPos.pos, content);
-      return cloneTr(setTextSelection(hasPosition ? $insertPos.pos : tr.selection.$anchor.pos)(tr));
-    }
-
-    // looking for a place in the doc where the node is allowed
-    for (var i = $insertPos.depth; i > 0; i--) {
-      var pos = $insertPos.after(i);
-      var $pos = tr.doc.resolve(pos);
-      if (canInsert($pos, content)) {
-        tr.insert(pos, content);
-        return cloneTr(setTextSelection(pos)(tr));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>, type: ?union<NodeType, null>, attrs: ?union<Object, null>, marks?: [Mark]) → (tr: Transaction) → Transaction
-// Returns a transaction that changes the type, attributes, and/or marks of the parent node of a given `nodeType`.
-//
-// ```javascript
-// const node = schema.nodes.extension.createChecked({});
-// dispatch(
-//   setParentNodeMarkup(schema.nodes.panel, null, { panelType })(tr);
-// );
-// ```
-var setParentNodeMarkup = function setParentNodeMarkup(nodeType, type, attrs, marks) {
-  return function (tr) {
-    var parent = findParentNodeOfType(nodeType)(tr.selection);
-    if (parent) {
-      return cloneTr(tr.setNodeMarkup(parent.pos, type, Object.assign({}, parent.node.attrs, attrs), marks));
-    }
-    return tr;
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction
-// Returns a new transaction that sets a `NodeSelection` on a parent node of a `given nodeType`.
-//
-// ```javascript
-// dispatch(
-//   selectParentNodeOfType([tableCell, tableHeader])(state.tr)
-// );
-// ```
-var selectParentNodeOfType = function selectParentNodeOfType(nodeType) {
-  return function (tr) {
-    if (!isNodeSelection(tr.selection)) {
-      var parent = findParentNodeOfType(nodeType)(tr.selection);
-      if (parent) {
-        return cloneTr(tr.setSelection(dist$2.NodeSelection.create(tr.doc, parent.pos)));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that deletes previous node.
-//
-// ```javascript
-// dispatch(
-//   removeNodeBefore(state.tr)
-// );
-// ```
-var removeNodeBefore = function removeNodeBefore(tr) {
-  var position = findPositionOfNodeBefore(tr.selection);
-  if (typeof position === 'number') {
-    return removeNodeAtPos(position)(tr);
-  }
-  return tr;
-};
-
-// :: (selection: Selection) → boolean
-// Checks if current selection is a `NodeSelection`.
-//
-// ```javascript
-// if (isNodeSelection(tr.selection)) {
-//   // ...
-// }
-// ```
-var isNodeSelection = function isNodeSelection(selection) {
-  return selection instanceof dist$2.NodeSelection;
-};
-
-// (nodeType: union<NodeType, [NodeType]>) → boolean
-// Checks if the type a given `node` equals to a given `nodeType`.
-var equalNodeType = function equalNodeType(nodeType, node) {
-  return Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1 || node.type === nodeType;
-};
-
-// (tr: Transaction) → Transaction
-// Creates a new transaction object from a given transaction
-var cloneTr = function cloneTr(tr) {
-  return Object.assign(Object.create(tr), tr).setTime(Date.now());
-};
-
-// (position: number, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction
-// Returns a `replace` transaction that replaces a node at a given position with the given `content`.
-// It will return the original transaction if replacing is not possible.
-// `position` should point at the position immediately before the node.
-var replaceNodeAtPos = function replaceNodeAtPos(position, content) {
-  return function (tr) {
-    var node = tr.doc.nodeAt(position);
-    var $pos = tr.doc.resolve(position);
-    if (canReplace($pos, content)) {
-      tr = tr.replaceWith(position, position + node.nodeSize, content);
-      var start = tr.selection.$from.pos - 1;
-      // put cursor inside of the inserted node
-      tr = setTextSelection(Math.max(start, 0), -1)(tr);
-      // move cursor to the start of the node
-      tr = setTextSelection(tr.selection.$from.start())(tr);
-      return cloneTr(tr);
-    }
-    return tr;
-  };
-};
-
-// ($pos: ResolvedPos, doc: ProseMirrorNode, content: union<ProseMirrorNode, Fragment>, ) → boolean
-// Checks if replacing a node at a given `$pos` inside of the `doc` node with the given `content` is possible.
-var canReplace = function canReplace($pos, content) {
-  var node = $pos.node($pos.depth);
-  return node && node.type.validContent(content instanceof dist.Fragment ? content : dist.Fragment.from(content));
-};
-
-// (position: number) → (tr: Transaction) → Transaction
-// Returns a `delete` transaction that removes a node at a given position with the given `node`.
-// `position` should point at the position immediately before the node.
-var removeNodeAtPos = function removeNodeAtPos(position) {
-  return function (tr) {
-    var node = tr.doc.nodeAt(position);
-    return cloneTr(tr.delete(position, position + node.nodeSize));
-  };
-};
-
-// (schema: Schema) → {[key: string]: NodeType}
-// Returns a map where keys are tableRoles and values are NodeTypes.
-var tableNodeTypes = function tableNodeTypes(schema) {
-  if (schema.cached.tableNodeTypes) {
-    return schema.cached.tableNodeTypes;
-  }
-  var roles = {};
-  Object.keys(schema.nodes).forEach(function (type) {
-    var nodeType = schema.nodes[type];
-    if (nodeType.spec.tableRole) {
-      roles[nodeType.spec.tableRole] = nodeType;
-    }
-  });
-  schema.cached.tableNodeTypes = roles;
-  return roles;
-};
-
-// :: ($pos: ResolvedPos, content: union<ProseMirrorNode, Fragment>) → boolean
-// Checks if a given `content` can be inserted at the given `$pos`
-//
-// ```javascript
-// const { selection: { $from } } = state;
-// const node = state.schema.nodes.atom.createChecked();
-// if (canInsert($from, node)) {
-//   // ...
-// }
-// ```
-var canInsert = function canInsert($pos, content) {
-  var index = $pos.index();
-
-  if (content instanceof dist.Fragment) {
-    return $pos.parent.canReplace(index, index, content);
-  } else if (content instanceof dist.Node) {
-    return $pos.parent.canReplaceWith(index, index, content.type);
-  }
-  return false;
-};
-
-// (node: ProseMirrorNode) → boolean
-// Checks if a given `node` is an empty paragraph
-var isEmptyParagraph = function isEmptyParagraph(node) {
-  return !node || node.type.name === 'paragraph' && node.nodeSize === 2;
-};
-
-// ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning a table node closest to a given `$pos`.
-//
-// ```javascript
-// const table = findTableClosestToPos(state.doc.resolve(10));
-// ```
-var findTableClosestToPos = function findTableClosestToPos($pos) {
-  var predicate = function predicate(node) {
-    return node.type.spec.tableRole && /table/i.test(node.type.spec.tableRole);
-  };
-  return findParentNodeClosestToPos($pos, predicate);
-};
-
-// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const predicate = node => node.type === schema.nodes.blockquote;
-// const parent = findParentNode(predicate)(selection);
-// ```
-var findParentNode = function findParentNode(predicate) {
-  return function (selection) {
-    var $from = selection.$from;
-
-    for (var i = $from.depth; i > 0; i--) {
-      var node = $from.node(i);
-      if (predicate(node)) {
-        return {
-          pos: i > 0 ? $from.before(i) : 0,
-          start: $from.start(i),
-          node: node
-        };
-      }
-    }
-  };
-};
-
-// :: ($pos: ResolvedPos, predicate: (node: ProseMirrorNode) → boolean) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes starting from the given `$pos`, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const predicate = node => node.type === schema.nodes.blockquote;
-// const parent = findParentNodeClosestToPos(state.doc.resolve(5), predicate);
-// ```
-var findParentNodeClosestToPos = function findParentNodeClosestToPos($pos, predicate) {
-  for (var i = $pos.depth; i > 0; i--) {
-    var node = $pos.node(i);
-    if (predicate(node)) {
-      return {
-        pos: i > 0 ? $pos.before(i) : 0,
-        start: $pos.start(i),
-        node: node
-      };
-    }
-  }
-};
-
-// :: (predicate: (node: ProseMirrorNode) → boolean, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
-// Iterates over parent nodes, returning DOM reference of the closest node `predicate` returns truthy for.
-//
-// ```javascript
-// const domAtPos = view.domAtPos.bind(view);
-// const predicate = node => node.type === schema.nodes.table;
-// const parent = findParentDomRef(predicate, domAtPos)(selection); // <table>
-// ```
-var findParentDomRef = function findParentDomRef(predicate, domAtPos) {
-  return function (selection) {
-    var parent = findParentNode(predicate)(selection);
-    if (parent) {
-      return findDomRefAtPos(parent.pos, domAtPos);
-    }
-  };
-};
-
-// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → boolean
-// Checks if there's a parent node `predicate` returns truthy for.
-//
-// ```javascript
-// if (hasParentNode(node => node.type === schema.nodes.table)(selection)) {
-//   // ....
-// }
-// ```
-var hasParentNode = function hasParentNode(predicate) {
-  return function (selection) {
-    return !!findParentNode(predicate)(selection);
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const parent = findParentNodeOfType(schema.nodes.paragraph)(selection);
-// ```
-var findParentNodeOfType = function findParentNodeOfType(nodeType) {
-  return function (selection) {
-    return findParentNode(function (node) {
-      return equalNodeType(nodeType, node);
-    })(selection);
-  };
-};
-
-// :: ($pos: ResolvedPos, nodeType: union<NodeType, [NodeType]>) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes starting from the given `$pos`, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const parent = findParentNodeOfTypeClosestToPos(state.doc.resolve(10), schema.nodes.paragraph);
-// ```
-var findParentNodeOfTypeClosestToPos = function findParentNodeOfTypeClosestToPos($pos, nodeType) {
-  return findParentNodeClosestToPos($pos, function (node) {
-    return equalNodeType(nodeType, node);
-  });
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → boolean
-// Checks if there's a parent node of a given `nodeType`.
-//
-// ```javascript
-// if (hasParentNodeOfType(schema.nodes.table)(selection)) {
-//   // ....
-// }
-// ```
-var hasParentNodeOfType = function hasParentNodeOfType(nodeType) {
-  return function (selection) {
-    return hasParentNode(function (node) {
-      return equalNodeType(nodeType, node);
-    })(selection);
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
-// Iterates over parent nodes, returning DOM reference of the closest node of a given `nodeType`.
-//
-// ```javascript
-// const domAtPos = view.domAtPos.bind(view);
-// const parent = findParentDomRefOfType(schema.nodes.codeBlock, domAtPos)(selection); // <pre>
-// ```
-var findParentDomRefOfType = function findParentDomRefOfType(nodeType, domAtPos) {
-  return function (selection) {
-    return findParentDomRef(function (node) {
-      return equalNodeType(nodeType, node);
-    }, domAtPos)(selection);
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Returns a node of a given `nodeType` if it is selected. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const { extension, inlineExtension, bodiedExtension } = schema.nodes;
-// const selectedNode = findSelectedNodeOfType([
-//   extension,
-//   inlineExtension,
-//   bodiedExtension,
-// ])(selection);
-// ```
-var findSelectedNodeOfType = function findSelectedNodeOfType(nodeType) {
-  return function (selection) {
-    if (isNodeSelection(selection)) {
-      var node = selection.node,
-          $from = selection.$from;
-
-      if (equalNodeType(nodeType, node)) {
-        return { node: node, pos: $from.pos };
-      }
-    }
-  };
-};
-
-// :: (selection: Selection) → ?number
-// Returns position of the previous node.
-//
-// ```javascript
-// const pos = findPositionOfNodeBefore(tr.selection);
-// ```
-var findPositionOfNodeBefore = function findPositionOfNodeBefore(selection) {
-  var nodeBefore = selection.$from.nodeBefore;
-
-  var maybeSelection = dist$2.Selection.findFrom(selection.$from, -1);
-  if (maybeSelection && nodeBefore) {
-    // leaf node
-    var parent = findParentNodeOfType(nodeBefore.type)(maybeSelection);
-    if (parent) {
-      return parent.pos;
-    }
-    return maybeSelection.$from.pos;
-  }
-};
-
-// :: (position: number, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → dom.Node
-// Returns DOM reference of a node at a given `position`.
-//
-// ```javascript
-// const domAtPos = view.domAtPos.bind(view);
-// const ref = findDomRefAtPos($from.pos, domAtPos);
-// ```
-var findDomRefAtPos = function findDomRefAtPos(position, domAtPos) {
-  var dom = domAtPos(position);
-  var node = dom.node.childNodes[dom.offset];
-  return node ? node : dom.node;
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Flattens descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const children = flatten(node);
-// ```
-var flatten = function flatten(node) {
-  var descend = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
-
-  if (!node) {
-    throw new Error('Invalid "node" parameter');
-  }
-  var result = [];
-  node.descendants(function (child, pos) {
-    result.push({ node: child, pos: pos });
-    if (!descend) {
-      return false;
-    }
-  });
-  return result;
-};
-
-// :: (node: ProseMirrorNode, predicate: (node: ProseMirrorNode) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const textNodes = findChildren(node, child => child.isText, false);
-// ```
-var findChildren = function findChildren(node, predicate, descend) {
-  if (!node) {
-    throw new Error('Invalid "node" parameter');
-  } else if (!predicate) {
-    throw new Error('Invalid "predicate" parameter');
-  }
-  return flatten(node, descend).filter(function (child) {
-    return predicate(child.node);
-  });
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Returns text nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const textNodes = findTextNodes(node);
-// ```
-var findTextNodes = function findTextNodes(node, descend) {
-  return findChildren(node, function (child) {
-    return child.isText;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Returns inline nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const inlineNodes = findInlineNodes(node);
-// ```
-var findInlineNodes = function findInlineNodes(node, descend) {
-  return findChildren(node, function (child) {
-    return child.isInline;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Returns block descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const blockNodes = findBlockNodes(node);
-// ```
-var findBlockNodes = function findBlockNodes(node, descend) {
-  return findChildren(node, function (child) {
-    return child.isBlock;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, predicate: (attrs: ?Object) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const mergedCells = findChildrenByAttr(table, attrs => attrs.colspan === 2);
-// ```
-var findChildrenByAttr = function findChildrenByAttr(node, predicate, descend) {
-  return findChildren(node, function (child) {
-    return !!predicate(child.attrs);
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, nodeType: NodeType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes of a given nodeType. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const cells = findChildrenByType(table, schema.nodes.tableCell);
-// ```
-var findChildrenByType = function findChildrenByType(node, nodeType, descend) {
-  return findChildren(node, function (child) {
-    return child.type === nodeType;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, markType: markType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes that have a mark of a given markType. It doesn't descend into a `node` when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const nodes = findChildrenByMark(state.doc, schema.marks.strong);
-// ```
-var findChildrenByMark = function findChildrenByMark(node, markType, descend) {
-  return findChildren(node, function (child) {
-    return markType.isInSet(child.marks);
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, nodeType: NodeType) → boolean
-// Returns `true` if a given node contains nodes of a given `nodeType`
-//
-// ```javascript
-// if (contains(panel, schema.nodes.listItem)) {
-//   // ...
-// }
-// ```
-var contains = function contains(node, nodeType) {
-  return !!findChildrenByType(node, nodeType).length;
-};
-
-function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
-
-// :: (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning the closest table node.
-//
-// ```javascript
-// const table = findTable(selection);
-// ```
-var findTable = function findTable(selection) {
-  return findParentNode(function (node) {
-    return node.type.spec.tableRole && node.type.spec.tableRole === 'table';
-  })(selection);
-};
-
-// :: (selection: Selection) → boolean
-// Checks if current selection is a `CellSelection`.
-//
-// ```javascript
-// if (isCellSelection(selection)) {
-//   // ...
-// }
-// ```
-var isCellSelection = function isCellSelection(selection) {
-  return selection instanceof dist$7.CellSelection;
-};
-
-// :: (columnIndex: number) → (selection: Selection) → boolean
-// Checks if entire column at index `columnIndex` is selected.
-//
-// ```javascript
-// const className = isColumnSelected(i)(selection) ? 'selected' : '';
-// ```
-var isColumnSelected = function isColumnSelected(columnIndex) {
-  return function (selection) {
-    if (isCellSelection(selection)) {
-      var $anchorCell = selection.$anchorCell,
-          $headCell = selection.$headCell;
-
-      var start = $anchorCell.start(-1);
-      var map = dist$7.TableMap.get($anchorCell.node(-1));
-      var anchor = map.colCount($anchorCell.pos - start);
-      var head = map.colCount($headCell.pos - start);
-
-      return selection.isColSelection() && columnIndex <= Math.max(anchor, head) && columnIndex >= Math.min(anchor, head);
-    }
-
-    return false;
-  };
-};
-
-// :: (rowIndex: number) → (selection: Selection) → boolean
-// Checks if entire row at index `rowIndex` is selected.
-//
-// ```javascript
-// const className = isRowSelected(i)(selection) ? 'selected' : '';
-// ```
-var isRowSelected = function isRowSelected(rowIndex) {
-  return function (selection) {
-    if (isCellSelection(selection)) {
-      var $anchorCell = selection.$anchorCell,
-          $headCell = selection.$headCell;
-
-      var anchor = $anchorCell.index(-1);
-      var head = $headCell.index(-1);
-
-      return selection.isRowSelection() && rowIndex <= Math.max(anchor, head) && rowIndex >= Math.min(anchor, head);
-    }
-
-    return false;
-  };
-};
-
-// :: (selection: Selection) → boolean
-// Checks if entire table is selected
-//
-// ```javascript
-// const className = isTableSelected(selection) ? 'selected' : '';
-// ```
-var isTableSelected = function isTableSelected(selection) {
-  if (isCellSelection(selection)) {
-    return selection.isColSelection() && selection.isRowSelection();
-  }
-
-  return false;
-};
-
-// :: (columnIndex: number) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-// Returns an array of cells in a column at index `columnIndex`.
-//
-// ```javascript
-// const cells = getCellsInColumn(i)(selection); // [{node, pos}, {node, pos}]
-// ```
-var getCellsInColumn = function getCellsInColumn(columnIndex) {
-  return function (selection) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (columnIndex >= 0 && columnIndex <= map.width - 1) {
-        var cells = map.cellsInRect({
-          left: columnIndex,
-          right: columnIndex + 1,
-          top: 0,
-          bottom: map.height
-        });
-        return cells.map(function (nodePos) {
-          var node = table.node.nodeAt(nodePos);
-          var pos = nodePos + table.start;
-          return { pos: pos, start: pos + 1, node: node };
-        });
-      }
-    }
-  };
-};
-
-// :: (rowIndex: number) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-// Returns an array of cells in a row at index `rowIndex`.
-//
-// ```javascript
-// const cells = getCellsInRow(i)(selection); // [{node, pos}, {node, pos}]
-// ```
-var getCellsInRow = function getCellsInRow(rowIndex) {
-  return function (selection) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (rowIndex >= 0 && rowIndex <= map.height - 1) {
-        var cells = map.cellsInRect({
-          left: 0,
-          right: map.width,
-          top: rowIndex,
-          bottom: rowIndex + 1
-        });
-        return cells.map(function (nodePos) {
-          var node = table.node.nodeAt(nodePos);
-          var pos = nodePos + table.start;
-          return { pos: pos, start: pos + 1, node: node };
-        });
-      }
-    }
-  };
-};
-
-// :: (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-// Returns an array of all cells in a table.
-//
-// ```javascript
-// const cells = getCellsInTable(selection); // [{node, pos}, {node, pos}]
-// ```
-var getCellsInTable = function getCellsInTable(selection) {
-  var table = findTable(selection);
-  if (table) {
-    var map = dist$7.TableMap.get(table.node);
-    var cells = map.cellsInRect({
-      left: 0,
-      right: map.width,
-      top: 0,
-      bottom: map.height
-    });
-    return cells.map(function (nodePos) {
-      var node = table.node.nodeAt(nodePos);
-      var pos = nodePos + table.start;
-      return { pos: pos, start: pos + 1, node: node };
-    });
-  }
-};
-
-// :: (columnIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that creates a `CellSelection` on a column at index `columnIndex`.
-//
-// ```javascript
-// dispatch(
-//   selectColumn(i)(state.tr)
-// );
-// ```
-var selectColumn = function selectColumn(columnIndex) {
-  return function (tr) {
-    var cells = getCellsInColumn(columnIndex)(tr.selection);
-    if (cells) {
-      var $anchor = tr.doc.resolve(cells[0].pos);
-      var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-      return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that creates a `CellSelection` on a column at index `rowIndex`.
-//
-// ```javascript
-// dispatch(
-//   selectRow(i)(state.tr)
-// );
-// ```
-var selectRow = function selectRow(rowIndex) {
-  return function (tr) {
-    var cells = getCellsInRow(rowIndex)(tr.selection);
-    if (cells) {
-      var $anchor = tr.doc.resolve(cells[0].pos);
-      var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-      return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-    }
-    return tr;
-  };
-};
-
-// :: (selection: Selection) → (tr: Transaction) → Transaction
-// Returns a new transaction that creates a `CellSelection` on the entire table.
-//
-// ```javascript
-// dispatch(
-//   selectTable(i)(state.tr)
-// );
-// ```
-var selectTable = function selectTable(tr) {
-  var cells = getCellsInTable(tr.selection);
-  if (cells) {
-    var $anchor = tr.doc.resolve(cells[0].pos);
-    var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-    return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-  }
-  return tr;
-};
-
-// :: (cell: {pos: number, node: ProseMirrorNode}, schema: Schema) → (tr: Transaction) → Transaction
-// Returns a new transaction that clears the content of a given `cell`.
-//
-// ```javascript
-// const $pos = state.doc.resolve(13);
-// dispatch(
-//   emptyCell(findCellClosestToPos($pos), state.schema)(state.tr)
-// );
-// ```
-var emptyCell = function emptyCell(cell, schema) {
-  return function (tr) {
-    if (cell) {
-      var content = tableNodeTypes(schema).cell.createAndFill().content;
-      if (!cell.node.content.eq(content)) {
-        tr.replaceWith(cell.pos, cell.pos + cell.node.nodeSize - 1, new dist.Slice(content, 0, 0));
-        return cloneTr(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (columnIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that adds a new column at index `columnIndex`.
-//
-// ```javascript
-// dispatch(
-//   addColumnAt(i)(state.tr)
-// );
-// ```
-var addColumnAt = function addColumnAt(columnIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (columnIndex >= 0 && columnIndex <= map.width) {
-        return cloneTr(dist$7.addColumn(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, columnIndex));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number, clonePreviousRow?: boolean) → (tr: Transaction) → Transaction
-// Returns a new transaction that adds a new row at index `rowIndex`. Optionally clone the previous row.
-//
-// ```javascript
-// dispatch(
-//   addRowAt(i)(state.tr)
-// );
-// ```
-//
-// ```javascript
-// dispatch(
-//   addRowAt(i, true)(state.tr)
-// );
-// ```
-var addRowAt = function addRowAt(rowIndex, clonePreviousRow) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      var cloneRowIndex = rowIndex - 1;
-
-      if (clonePreviousRow && cloneRowIndex >= 0) {
-        return cloneTr(cloneRowAt(cloneRowIndex)(tr));
-      }
-
-      if (rowIndex >= 0 && rowIndex <= map.height) {
-        return cloneTr(dist$7.addRow(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, rowIndex));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (cloneRowIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that adds a new row after `cloneRowIndex`, cloning the row attributes at `cloneRowIndex`.
-//
-// ```javascript
-// dispatch(
-//   cloneRowAt(i)(state.tr)
-// );
-// ```
-var cloneRowAt = function cloneRowAt(rowIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-
-      if (rowIndex >= 0 && rowIndex <= map.height) {
-        var tableNode = table.node;
-        var tableNodes = tableNodeTypes(tableNode.type.schema);
-
-        var rowPos = table.start;
-        for (var i = 0; i < rowIndex + 1; i++) {
-          rowPos += tableNode.child(i).nodeSize;
-        }
-
-        var cloneRow = tableNode.child(rowIndex);
-        // Re-create the same nodes with same attrs, dropping the node content.
-        var cells = [];
-        var rowWidth = 0;
-        cloneRow.forEach(function (cell) {
-          // If we're copying a row with rowspan somewhere, we dont want to copy that cell
-          // We'll increment its span below.
-          if (cell.attrs.rowspan === 1) {
-            rowWidth += cell.attrs.colspan;
-            cells.push(tableNodes[cell.type.spec.tableRole].createAndFill(cell.attrs, cell.marks));
-          }
-        });
-
-        // If a higher row spans past our clone row, bump the higher row to cover this new row too.
-        if (rowWidth < map.width) {
-          var rowSpanCells = [];
-
-          var _loop = function _loop(_i) {
-            var foundCells = filterCellsInRow(_i, function (cell, tr) {
-              var rowspan = cell.node.attrs.rowspan;
-              var spanRange = _i + rowspan;
-              return rowspan > 1 && spanRange > rowIndex;
-            })(tr);
-            rowSpanCells.push.apply(rowSpanCells, _toConsumableArray(foundCells));
-          };
-
-          for (var _i = rowIndex; _i >= 0; _i--) {
-            _loop(_i);
-          }
-
-          if (rowSpanCells.length) {
-            rowSpanCells.forEach(function (cell) {
-              tr = setCellAttrs(cell, {
-                rowspan: cell.node.attrs.rowspan + 1
-              })(tr);
-            });
-          }
-        }
-
-        return safeInsert(tableNodes.row.create(cloneRow.attrs, cells), rowPos)(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (columnIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a column at index `columnIndex`. If there is only one column left, it will remove the entire table.
-//
-// ```javascript
-// dispatch(
-//   removeColumnAt(i)(state.tr)
-// );
-// ```
-var removeColumnAt = function removeColumnAt(columnIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (columnIndex === 0 && map.width === 1) {
-        return removeTable(tr);
-      } else if (columnIndex >= 0 && columnIndex <= map.width) {
-        dist$7.removeColumn(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, columnIndex);
-        return cloneTr(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a row at index `rowIndex`. If there is only one row left, it will remove the entire table.
-//
-// ```javascript
-// dispatch(
-//   removeRowAt(i)(state.tr)
-// );
-// ```
-var removeRowAt = function removeRowAt(rowIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (rowIndex === 0 && map.height === 1) {
-        return removeTable(tr);
-      } else if (rowIndex >= 0 && rowIndex <= map.height) {
-        dist$7.removeRow(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, rowIndex);
-        return cloneTr(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes a table node if the cursor is inside of it.
-//
-// ```javascript
-// dispatch(
-//   removeTable(state.tr)
-// );
-// ```
-var removeTable = function removeTable(tr) {
-  var $from = tr.selection.$from;
-
-  for (var depth = $from.depth; depth > 0; depth--) {
-    var node = $from.node(depth);
-    if (node.type.spec.tableRole === 'table') {
-      return cloneTr(tr.delete($from.before(depth), $from.after(depth)));
-    }
-  }
-  return tr;
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes selected columns.
-//
-// ```javascript
-// dispatch(
-//   removeSelectedColumns(state.tr)
-// );
-// ```
-var removeSelectedColumns = function removeSelectedColumns(tr) {
-  var _tr = tr,
-      selection = _tr.selection;
-
-  if (isTableSelected(selection)) {
-    return removeTable(tr);
-  }
-  if (isCellSelection(selection)) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);
-      for (var i = rect.right - 1; i >= rect.left; i--) {
-        tr = removeColumnAt(i)(tr);
-      }
-      return tr;
-    }
-  }
-  return tr;
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes selected rows.
-//
-// ```javascript
-// dispatch(
-//   removeSelectedRows(state.tr)
-// );
-// ```
-var removeSelectedRows = function removeSelectedRows(tr) {
-  var _tr2 = tr,
-      selection = _tr2.selection;
-
-  if (isTableSelected(selection)) {
-    return removeTable(tr);
-  }
-  if (isCellSelection(selection)) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);
-      for (var i = rect.bottom - 1; i >= rect.top; i--) {
-        tr = removeRowAt(i)(tr);
-      }
-      return tr;
-    }
-  }
-  return tr;
-};
-
-// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a column closest to a given `$pos`.
-//
-// ```javascript
-// dispatch(
-//   removeColumnClosestToPos(state.doc.resolve(3))(state.tr)
-// );
-// ```
-var removeColumnClosestToPos = function removeColumnClosestToPos($pos) {
-  return function (tr) {
-    var rect = findCellRectClosestToPos($pos);
-    if (rect) {
-      return removeColumnAt(rect.left)(setTextSelection($pos.pos)(tr));
-    }
-    return tr;
-  };
-};
-
-// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a row closest to a given `$pos`.
-//
-// ```javascript
-// dispatch(
-//   removeRowClosestToPos(state.doc.resolve(3))(state.tr)
-// );
-// ```
-var removeRowClosestToPos = function removeRowClosestToPos($pos) {
-  return function (tr) {
-    var rect = findCellRectClosestToPos($pos);
-    if (rect) {
-      return removeRowAt(rect.top)(setTextSelection($pos.pos)(tr));
-    }
-    return tr;
-  };
-};
-
-// :: (columnIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction
-// Returns a new transaction that maps a given `cellTransform` function to each cell in a column at a given `columnIndex`.
-// It will set the selection into the last cell of the column if `setCursorToLastCell` param is set to `true`.
-//
-// ```javascript
-// dispatch(
-//   forEachCellInColumn(0, (cell, tr) => emptyCell(cell, state.schema)(tr))(state.tr)
-// );
-// ```
-var forEachCellInColumn = function forEachCellInColumn(columnIndex, cellTransform, setCursorToLastCell) {
-  return function (tr) {
-    var cells = getCellsInColumn(columnIndex)(tr.selection);
-    if (cells) {
-      for (var i = cells.length - 1; i >= 0; i--) {
-        tr = cellTransform(cells[i], tr);
-      }
-      if (setCursorToLastCell) {
-        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));
-        tr.setSelection(dist$2.Selection.near($pos));
-      }
-      return cloneTr(tr);
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction
-// Returns a new transaction that maps a given `cellTransform` function to each cell in a row at a given `rowIndex`.
-// It will set the selection into the last cell of the row if `setCursorToLastCell` param is set to `true`.
-//
-// ```javascript
-// dispatch(
-//   forEachCellInRow(0, (cell, tr) => setCellAttrs(cell, { background: 'red' })(tr))(state.tr)
-// );
-// ```
-var forEachCellInRow = function forEachCellInRow(rowIndex, cellTransform, setCursorToLastCell) {
-  return function (tr) {
-    var cells = getCellsInRow(rowIndex)(tr.selection);
-    if (cells) {
-      for (var i = cells.length - 1; i >= 0; i--) {
-        tr = cellTransform(cells[i], tr);
-      }
-      if (setCursorToLastCell) {
-        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));
-        tr.setSelection(dist$2.Selection.near($pos));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (cell: {pos: number, start: number, node: ProseMirrorNode}, attrs: Object) → (tr: Transaction) → Transaction
-// Returns a new transaction that sets given `attrs` to a given `cell`.
-//
-// ```javascript
-// dispatch(
-//   setCellAttrs(findCellClosestToPos($pos), { background: 'blue' })(tr);
-// );
-// ```
-var setCellAttrs = function setCellAttrs(cell, attrs) {
-  return function (tr) {
-    if (cell) {
-      tr.setNodeMarkup(cell.pos, null, Object.assign({}, cell.node.attrs, attrs));
-      return cloneTr(tr);
-    }
-    return tr;
-  };
-};
-
-// :: (schema: Schema, rowsCount: ?number, colsCount: ?number, withHeaderRow: ?boolean) → Node
-// Returns a table node of a given size.
-// `withHeaderRow` defines whether the first row of the table will be a header row.
-//
-// ```javascript
-// const table = createTable(state.schema); // 3x3 table node
-// dispatch(
-//   tr.replaceSelectionWith(table).scrollIntoView()
-// );
-// ```
-var createTable = function createTable(schema) {
-  var rowsCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 3;
-  var colsCount = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 3;
-  var withHeaderRow = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
-
-  var _tableNodeTypes = tableNodeTypes(schema),
-      tableCell = _tableNodeTypes.cell,
-      tableHeader = _tableNodeTypes.header_cell,
-      tableRow = _tableNodeTypes.row,
-      table = _tableNodeTypes.table;
-
-  var cells = [];
-  for (var i = 0; i < colsCount; i++) {
-    cells.push(tableCell.createAndFill(null));
-  }
-
-  var headerCells = [];
-  if (withHeaderRow) {
-    for (var _i2 = 0; _i2 < colsCount; _i2++) {
-      headerCells.push(tableHeader.createAndFill(null));
-    }
-  }
-
-  var rows = [];
-  for (var _i3 = 0; _i3 < rowsCount; _i3++) {
-    rows.push(tableRow.createChecked(null, withHeaderRow && _i3 === 0 ? headerCells : cells));
-  }
-
-  return table.createChecked(null, rows);
-};
-
-// :: ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning a table cell or a table header node closest to a given `$pos`.
-//
-// ```javascript
-// const cell = findCellClosestToPos(state.selection.$from);
-// ```
-var findCellClosestToPos = function findCellClosestToPos($pos) {
-  var predicate = function predicate(node) {
-    return node.type.spec.tableRole && /cell/i.test(node.type.spec.tableRole);
-  };
-  return findParentNodeClosestToPos($pos, predicate);
-};
-
-// :: ($pos: ResolvedPos) → ?{left: number, top: number, right: number, bottom: number}
-// Returns the rectangle spanning a cell closest to a given `$pos`.
-//
-// ```javascript
-// dispatch(
-//   findCellRectClosestToPos(state.selection.$from)
-// );
-// ```
-var findCellRectClosestToPos = function findCellRectClosestToPos($pos) {
-  var cell = findCellClosestToPos($pos);
-  if (cell) {
-    var table = findTableClosestToPos($pos);
-    var map = dist$7.TableMap.get(table.node);
-    var cellPos = cell.pos - table.start;
-    return map.rectBetween(cellPos, cellPos);
-  }
-};
-
-var filterCellsInRow = function filterCellsInRow(rowIndex, predicate) {
-  return function (tr) {
-    var foundCells = [];
-    var cells = getCellsInRow(rowIndex)(tr.selection);
-    if (cells) {
-      for (var j = cells.length - 1; j >= 0; j--) {
-        if (predicate(cells[j], tr)) {
-          foundCells.push(cells[j]);
-        }
-      }
-    }
-
-    return foundCells;
-  };
-};
-
-exports.isNodeSelection = isNodeSelection;
-exports.canInsert = canInsert;
-exports.findParentNode = findParentNode;
-exports.findParentNodeClosestToPos = findParentNodeClosestToPos;
-exports.findParentDomRef = findParentDomRef;
-exports.hasParentNode = hasParentNode;
-exports.findParentNodeOfType = findParentNodeOfType;
-exports.findParentNodeOfTypeClosestToPos = findParentNodeOfTypeClosestToPos;
-exports.hasParentNodeOfType = hasParentNodeOfType;
-exports.findParentDomRefOfType = findParentDomRefOfType;
-exports.findSelectedNodeOfType = findSelectedNodeOfType;
-exports.findPositionOfNodeBefore = findPositionOfNodeBefore;
-exports.findDomRefAtPos = findDomRefAtPos;
-exports.flatten = flatten;
-exports.findChildren = findChildren;
-exports.findTextNodes = findTextNodes;
-exports.findInlineNodes = findInlineNodes;
-exports.findBlockNodes = findBlockNodes;
-exports.findChildrenByAttr = findChildrenByAttr;
-exports.findChildrenByType = findChildrenByType;
-exports.findChildrenByMark = findChildrenByMark;
-exports.contains = contains;
-exports.findTable = findTable;
-exports.isCellSelection = isCellSelection;
-exports.isColumnSelected = isColumnSelected;
-exports.isRowSelected = isRowSelected;
-exports.isTableSelected = isTableSelected;
-exports.getCellsInColumn = getCellsInColumn;
-exports.getCellsInRow = getCellsInRow;
-exports.getCellsInTable = getCellsInTable;
-exports.selectColumn = selectColumn;
-exports.selectRow = selectRow;
-exports.selectTable = selectTable;
-exports.emptyCell = emptyCell;
-exports.addColumnAt = addColumnAt;
-exports.addRowAt = addRowAt;
-exports.cloneRowAt = cloneRowAt;
-exports.removeColumnAt = removeColumnAt;
-exports.removeRowAt = removeRowAt;
-exports.removeTable = removeTable;
-exports.removeSelectedColumns = removeSelectedColumns;
-exports.removeSelectedRows = removeSelectedRows;
-exports.removeColumnClosestToPos = removeColumnClosestToPos;
-exports.removeRowClosestToPos = removeRowClosestToPos;
-exports.forEachCellInColumn = forEachCellInColumn;
-exports.forEachCellInRow = forEachCellInRow;
-exports.setCellAttrs = setCellAttrs;
-exports.createTable = createTable;
-exports.findCellClosestToPos = findCellClosestToPos;
-exports.findCellRectClosestToPos = findCellRectClosestToPos;
-exports.removeParentNodeOfType = removeParentNodeOfType;
-exports.replaceParentNodeOfType = replaceParentNodeOfType;
-exports.removeSelectedNode = removeSelectedNode;
-exports.replaceSelectedNode = replaceSelectedNode;
-exports.setTextSelection = setTextSelection;
-exports.safeInsert = safeInsert;
-exports.setParentNodeMarkup = setParentNodeMarkup;
-exports.selectParentNodeOfType = selectParentNodeOfType;
-exports.removeNodeBefore = removeNodeBefore;
-
-});
-
-unwrapExports(dist$8);
-var dist_1$7 = dist$8.isNodeSelection;
-var dist_2$7 = dist$8.canInsert;
-var dist_3$6 = dist$8.findParentNode;
-var dist_4$6 = dist$8.findParentNodeClosestToPos;
-var dist_5$6 = dist$8.findParentDomRef;
-var dist_6$5 = dist$8.hasParentNode;
-var dist_7$5 = dist$8.findParentNodeOfType;
-var dist_8$5 = dist$8.findParentNodeOfTypeClosestToPos;
-var dist_9$5 = dist$8.hasParentNodeOfType;
-var dist_10$4 = dist$8.findParentDomRefOfType;
-var dist_11$4 = dist$8.findSelectedNodeOfType;
-var dist_12$4 = dist$8.findPositionOfNodeBefore;
-var dist_13$3 = dist$8.findDomRefAtPos;
-var dist_14$2 = dist$8.flatten;
-var dist_15$2 = dist$8.findChildren;
-var dist_16$2 = dist$8.findTextNodes;
-var dist_17$2 = dist$8.findInlineNodes;
-var dist_18$2 = dist$8.findBlockNodes;
-var dist_19$2 = dist$8.findChildrenByAttr;
-var dist_20$1 = dist$8.findChildrenByType;
-var dist_21$1 = dist$8.findChildrenByMark;
-var dist_22$1 = dist$8.contains;
-var dist_23$1 = dist$8.findTable;
-var dist_24$1 = dist$8.isCellSelection;
-var dist_25$1 = dist$8.isColumnSelected;
-var dist_26$1 = dist$8.isRowSelected;
-var dist_27$1 = dist$8.isTableSelected;
-var dist_28$1 = dist$8.getCellsInColumn;
-var dist_29$1 = dist$8.getCellsInRow;
-var dist_30$1 = dist$8.getCellsInTable;
-var dist_31$1 = dist$8.selectColumn;
-var dist_32$1 = dist$8.selectRow;
-var dist_33$1 = dist$8.selectTable;
-var dist_34$1 = dist$8.emptyCell;
-var dist_35$1 = dist$8.addColumnAt;
-var dist_36$1 = dist$8.addRowAt;
-var dist_37$1 = dist$8.cloneRowAt;
-var dist_38$1 = dist$8.removeColumnAt;
-var dist_39 = dist$8.removeRowAt;
-var dist_40 = dist$8.removeTable;
-var dist_41 = dist$8.removeSelectedColumns;
-var dist_42 = dist$8.removeSelectedRows;
-var dist_43 = dist$8.removeColumnClosestToPos;
-var dist_44 = dist$8.removeRowClosestToPos;
-var dist_45 = dist$8.forEachCellInColumn;
-var dist_46 = dist$8.forEachCellInRow;
-var dist_47 = dist$8.setCellAttrs;
-var dist_48 = dist$8.createTable;
-var dist_49 = dist$8.findCellClosestToPos;
-var dist_50 = dist$8.findCellRectClosestToPos;
-var dist_51 = dist$8.removeParentNodeOfType;
-var dist_52 = dist$8.replaceParentNodeOfType;
-var dist_53 = dist$8.removeSelectedNode;
-var dist_54 = dist$8.replaceSelectedNode;
-var dist_55 = dist$8.setTextSelection;
-var dist_56 = dist$8.safeInsert;
-var dist_57 = dist$8.setParentNodeMarkup;
-var dist_58 = dist$8.selectParentNodeOfType;
-var dist_59 = dist$8.removeNodeBefore;
-
-function nodeIsActive (state, type, attrs) {
-	var predicate = function (node) { return node.type === type; };
-	var parent = dist_3$6(predicate)(state.selection);
-
-	if (attrs === {} || !parent) {
-		return !!parent
-	}
-
-	return parent.node.hasMarkup(type, attrs)
-}
-
-var Toolbar = function Toolbar(ref) {
-	var node = ref.node;
-	var editorView = ref.editorView;
-
-	this.editorView = editorView;
-	this.node = node;
-	this.element = this.node.elm;
-	this.element.style.visibility = 'hidden';
-	this.element.style.opacity = 0;
-
-	this.editorView.dom.addEventListener('blur', this.hide.bind(this));
-};
-
-Toolbar.prototype.update = function update (view, lastState) {
-	var state = view.state;
-
-	// Don't do anything if the document/selection didn't change
-	if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {
-		return
-	}
-
-	// Hide the tooltip if the selection is empty
-	if (state.selection.empty) {
-		this.hide();
-		return
-	}
-
-
-	// Otherwise, reposition it and update its content
-	this.show();
-	var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-
-	// These are in screen coordinates
-	var start = view.coordsAtPos(from);
-	var end = view.coordsAtPos(to);
-
-	// The box in which the tooltip is positioned, to use as base
-	var box = this.element.offsetParent.getBoundingClientRect();
-
-	// Find a center-ish x position from the selection endpoints (when
-	// crossing lines, end may be more to the left)
-	var left = Math.max((start.left + end.left) / 2, start.left + 3);
-	this.element.style.left = (left - box.left) + "px";
-	this.element.style.bottom = (box.bottom - start.top) + "px";
-};
-
-Toolbar.prototype.show = function show () {
-	this.element.style.visibility = 'visible';
-	this.element.style.opacity = 1;
-};
-
-Toolbar.prototype.hide = function hide (event) {
-	if (event && event.relatedTarget) {
-		return
-	}
-	this.element.style.visibility = 'hidden';
-	this.element.style.opacity = 0;
-};
-
-Toolbar.prototype.destroy = function destroy () {
-	this.editorView.dom.removeEventListener('blur', this.hide);
-};
-
-function menuBubble (node) {
-	return new dist_8$2({
-		view: function view(editorView) {
-			return new Toolbar({ editorView: editorView, node: node })
-		},
-	})
-}
-
-var Node = function Node(options) {
-	if ( options === void 0 ) options = {};
-
-	this.options = Object.assign({}, this.defaultOptions,
-		options);
-};
-
-var prototypeAccessors = { name: { configurable: true },defaultOptions: { configurable: true },type: { configurable: true },view: { configurable: true },schema: { configurable: true },plugins: { configurable: true } };
-
-prototypeAccessors.name.get = function () {
-	return null
-};
-
-prototypeAccessors.defaultOptions.get = function () {
-	return {}
-};
-
-prototypeAccessors.type.get = function () {
-	return 'node'
-};
-
-prototypeAccessors.view.get = function () {
-	return null
-};
-
-prototypeAccessors.schema.get = function () {
-	return null
-};
-
-prototypeAccessors.plugins.get = function () {
-	return []
-};
-
-Node.prototype.command = function command () {
-	return function () {}
-};
-
-Node.prototype.keys = function keys () {
-	return {}
-};
-
-Node.prototype.inputRules = function inputRules () {
-	return []
-};
-
-Object.defineProperties( Node.prototype, prototypeAccessors );
-
-var Mark = function Mark(options) {
-	if ( options === void 0 ) options = {};
-
-	this.options = Object.assign({}, this.defaultOptions,
-		options);
-};
-
-var prototypeAccessors$1 = { name: { configurable: true },defaultOptions: { configurable: true },type: { configurable: true },view: { configurable: true },schema: { configurable: true },plugins: { configurable: true } };
-
-prototypeAccessors$1.name.get = function () {
-	return null
-};
-
-prototypeAccessors$1.defaultOptions.get = function () {
-	return {}
-};
-
-prototypeAccessors$1.type.get = function () {
-	return 'mark'
-};
-
-prototypeAccessors$1.view.get = function () {
-	return null
-};
-
-prototypeAccessors$1.schema.get = function () {
-	return null
-};
-
-prototypeAccessors$1.plugins.get = function () {
-	return []
-};
-
-Mark.prototype.command = function command () {
-	return function () {}
-};
-
-Mark.prototype.keys = function keys () {
-	return {}
-};
-
-Mark.prototype.inputRules = function inputRules () {
-	return []
-};
-
-Object.defineProperties( Mark.prototype, prototypeAccessors$1 );
-
-var PluginManager = function PluginManager(plugins) {
-	if ( plugins === void 0 ) plugins = [];
-
-	this.plugins = plugins;
-};
-
-var prototypeAccessors$2 = { nodes: { configurable: true },marks: { configurable: true },pluginplugins: { configurable: true },views: { configurable: true } };
-
-prototypeAccessors$2.nodes.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.type === 'node'; })
-		.reduce(function (nodes, ref) {
-				var obj;
-
-				var name = ref.name;
-				var schema = ref.schema;
-				return (Object.assign({}, nodes,
-			( obj = {}, obj[name] = schema, obj )));
-		}, {})
-};
-
-prototypeAccessors$2.marks.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.type === 'mark'; })
-		.reduce(function (marks, ref) {
-				var obj;
-
-				var name = ref.name;
-				var schema = ref.schema;
-				return (Object.assign({}, marks,
-			( obj = {}, obj[name] = schema, obj )));
-		}, {})
-};
-
-prototypeAccessors$2.pluginplugins.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.plugins; })
-		.reduce(function (allPlugins, ref) {
-				var plugins = ref.plugins;
-
-				return (allPlugins.concat( plugins ));
-		}, [])
-};
-
-prototypeAccessors$2.views.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.view; })
-		.reduce(function (views, ref) {
-				var obj;
-
-				var name = ref.name;
-				var view = ref.view;
-				return (Object.assign({}, views,
-			( obj = {}, obj[name] = view, obj )));
-		}, {})
-};
-
-PluginManager.prototype.keymaps = function keymaps (ref) {
-		var schema = ref.schema;
-
-	return this.plugins
-		.filter(function (plugin) { return plugin.keys; })
-		.map(function (plugin) { return plugin.keys({
-			type: schema[((plugin.type) + "s")][plugin.name],
-			schema: schema,
-		}); })
-		.map(function (keys) { return keymap_2(keys); })
-};
-
-PluginManager.prototype.inputRules = function inputRules (ref) {
-		var schema = ref.schema;
-
-	return this.plugins
-		.filter(function (plugin) { return plugin.inputRules; })
-		.map(function (plugin) { return plugin.inputRules({
-			type: schema[((plugin.type) + "s")][plugin.name],
-			schema: schema,
-		}); })
-		.reduce(function (allInputRules, inputRules) { return (allInputRules.concat( inputRules )); }, [])
-};
-
-PluginManager.prototype.commands = function commands (ref) {
-		var schema = ref.schema;
-		var view = ref.view;
-
-	return this.plugins
-		.filter(function (plugin) { return plugin.command; })
-		.reduce(function (commands, ref) {
-				var obj;
-
-				var name = ref.name;
-				var type = ref.type;
-				var command = ref.command;
-				return (Object.assign({}, commands,
-			( obj = {}, obj[name] = function (attrs) {
-				view.focus();
-				command({
-					type: schema[(type + "s")][name],
-					attrs: attrs,
-					schema: schema,
-				})(view.state, view.dispatch, view);
-			}, obj )));
-		}, {})
-};
-
-Object.defineProperties( PluginManager.prototype, prototypeAccessors$2 );
-
-var schemaList = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-var olDOM = ["ol", 0];
-var ulDOM = ["ul", 0];
-var liDOM = ["li", 0];
-
-// :: NodeSpec
-// An ordered list [node spec](#model.NodeSpec). Has a single
-// attribute, `order`, which determines the number at which the list
-// starts counting, and defaults to 1. Represented as an `<ol>`
-// element.
-var orderedList = {
-  attrs: {order: {default: 1}},
-  parseDOM: [{tag: "ol", getAttrs: function getAttrs(dom) {
-    return {order: dom.hasAttribute("start") ? +dom.getAttribute("start") : 1}
-  }}],
-  toDOM: function toDOM(node) {
-    return node.attrs.order == 1 ? olDOM : ["ol", {start: node.attrs.order}, 0]
-  }
-};
-
-// :: NodeSpec
-// A bullet list node spec, represented in the DOM as `<ul>`.
-var bulletList = {
-  parseDOM: [{tag: "ul"}],
-  toDOM: function toDOM() { return ulDOM }
-};
-
-// :: NodeSpec
-// A list item (`<li>`) spec.
-var listItem = {
-  parseDOM: [{tag: "li"}],
-  toDOM: function toDOM() { return liDOM },
-  defining: true
-};
-
-function add(obj, props) {
-  var copy = {};
-  for (var prop in obj) { copy[prop] = obj[prop]; }
-  for (var prop$1 in props) { copy[prop$1] = props[prop$1]; }
-  return copy
-}
-
-// :: (OrderedMap<NodeSpec>, string, ?string) → OrderedMap<NodeSpec>
-// Convenience function for adding list-related node types to a map
-// specifying the nodes for a schema. Adds
-// [`orderedList`](#schema-list.orderedList) as `"ordered_list"`,
-// [`bulletList`](#schema-list.bulletList) as `"bullet_list"`, and
-// [`listItem`](#schema-list.listItem) as `"list_item"`.
-//
-// `itemContent` determines the content expression for the list items.
-// If you want the commands defined in this module to apply to your
-// list structure, it should have a shape like `"paragraph block*"` or
-// `"paragraph (ordered_list | bullet_list)*"`. `listGroup` can be
-// given to assign a group name to the list node types, for example
-// `"block"`.
-function addListNodes(nodes, itemContent, listGroup) {
-  return nodes.append({
-    ordered_list: add(orderedList, {content: "list_item+", group: listGroup}),
-    bullet_list: add(bulletList, {content: "list_item+", group: listGroup}),
-    list_item: add(listItem, {content: itemContent})
-  })
-}
-
-// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command function that wraps the selection in a list with
-// the given type an attributes. If `dispatch` is null, only return a
-// value to indicate whether this is possible, but don't actually
-// perform the change.
-function wrapInList(listType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to), doJoin = false, outerRange = range;
-    if (!range) { return false }
-    // This is at the top of an existing list item
-    if (range.depth >= 2 && $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {
-      // Don't do anything if this is the top of the list
-      if ($from.index(range.depth - 1) == 0) { return false }
-      var $insert = state.doc.resolve(range.start - 2);
-      outerRange = new dist.NodeRange($insert, $insert, range.depth);
-      if (range.endIndex < range.parent.childCount)
-        { range = new dist.NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth); }
-      doJoin = true;
-    }
-    var wrap = dist$1.findWrapping(outerRange, listType, attrs, range);
-    if (!wrap) { return false }
-    if (dispatch) { dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView()); }
-    return true
-  }
-}
-
-function doWrapInList(tr, range, wrappers, joinBefore, listType) {
-  var content = dist.Fragment.empty;
-  for (var i = wrappers.length - 1; i >= 0; i--)
-    { content = dist.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }
-
-  tr.step(new dist$1.ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end,
-                                new dist.Slice(content, 0, 0), wrappers.length, true));
-
-  var found = 0;
-  for (var i$1 = 0; i$1 < wrappers.length; i$1++) { if (wrappers[i$1].type == listType) { found = i$1 + 1; } }
-  var splitDepth = wrappers.length - found;
-
-  var splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;
-  for (var i$2 = range.startIndex, e = range.endIndex, first = true; i$2 < e; i$2++, first = false) {
-    if (!first && dist$1.canSplit(tr.doc, splitPos, splitDepth)) {
-      tr.split(splitPos, splitDepth);
-      splitPos += 2 * splitDepth;
-    }
-    splitPos += parent.child(i$2).nodeSize;
-  }
-  return tr
-}
-
-// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Build a command that splits a non-empty textblock at the top level
-// of a list item by also splitting that list item.
-function splitListItem(itemType) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var node = ref.node;
-    if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to)) { return false }
-    var grandParent = $from.node(-1);
-    if (grandParent.type != itemType) { return false }
-    if ($from.parent.content.size == 0) {
-      // In an empty block. If this is a nested list, the wrapping
-      // list item should be split. Otherwise, bail out and let next
-      // command handle lifting.
-      if ($from.depth == 2 || $from.node(-3).type != itemType ||
-          $from.index(-2) != $from.node(-2).childCount - 1) { return false }
-      if (dispatch) {
-        var wrap = dist.Fragment.empty, keepItem = $from.index(-1) > 0;
-        // Build a fragment containing empty versions of the structure
-        // from the outer list item to the parent node of the cursor
-        for (var d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--)
-          { wrap = dist.Fragment.from($from.node(d).copy(wrap)); }
-        // Add a second list item with an empty default start node
-        wrap = wrap.append(dist.Fragment.from(itemType.createAndFill()));
-        var tr$1 = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new dist.Slice(wrap, keepItem ? 3 : 2, 2));
-        tr$1.setSelection(state.selection.constructor.near(tr$1.doc.resolve($from.pos + (keepItem ? 3 : 2))));
-        dispatch(tr$1.scrollIntoView());
-      }
-      return true
-    }
-    var nextType = $to.pos == $from.end() ? grandParent.defaultContentType(0) : null;
-    var tr = state.tr.delete($from.pos, $to.pos);
-    var types = nextType && [null, {type: nextType}];
-    if (!dist$1.canSplit(tr.doc, $from.pos, 2, types)) { return false }
-    if (dispatch) { dispatch(tr.split($from.pos, 2, types).scrollIntoView()); }
-    return true
-  }
-}
-
-// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Create a command to lift the list item around the selection up into
-// a wrapping list.
-function liftListItem(itemType) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });
-    if (!range) { return false }
-    if (!dispatch) { return true }
-    if ($from.node(range.depth - 1).type == itemType) // Inside a parent list
-      { return liftToOuterList(state, dispatch, itemType, range) }
-    else // Outer list node
-      { return liftOutOfList(state, dispatch, range) }
-  }
-}
-
-function liftToOuterList(state, dispatch, itemType, range) {
-  var tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);
-  if (end < endOfList) {
-    // There are siblings after the lifted items, which must become
-    // children of the last item
-    tr.step(new dist$1.ReplaceAroundStep(end - 1, endOfList, end, endOfList,
-                                  new dist.Slice(dist.Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
-    range = new dist.NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
-  }
-  dispatch(tr.lift(range, dist$1.liftTarget(range)).scrollIntoView());
-  return true
-}
-
-function liftOutOfList(state, dispatch, range) {
-  var tr = state.tr, list = range.parent;
-  // Merge the list items into a single big item
-  for (var pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {
-    pos -= list.child(i).nodeSize;
-    tr.delete(pos - 1, pos + 1);
-  }
-  var $start = tr.doc.resolve(range.start), item = $start.nodeAfter;
-  var atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;
-  var parent = $start.node(-1), indexBefore = $start.index(-1);
-  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1,
-                         item.content.append(atEnd ? dist.Fragment.empty : dist.Fragment.from(list))))
-    { return false }
-  var start = $start.pos, end = start + item.nodeSize;
-  // Strip off the surrounding list. At the sides where we're not at
-  // the end of the list, the existing list is closed. At sides where
-  // this is the end, it is overwritten to its end.
-  tr.step(new dist$1.ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1,
-                                new dist.Slice((atStart ? dist.Fragment.empty : dist.Fragment.from(list.copy(dist.Fragment.empty)))
-                                          .append(atEnd ? dist.Fragment.empty : dist.Fragment.from(list.copy(dist.Fragment.empty))),
-                                          atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));
-  dispatch(tr.scrollIntoView());
-  return true
-}
-
-// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Create a command to sink the list item around the selection down
-// into an inner list.
-function sinkListItem(itemType) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });
-    if (!range) { return false }
-    var startIndex = range.startIndex;
-    if (startIndex == 0) { return false }
-    var parent = range.parent, nodeBefore = parent.child(startIndex - 1);
-    if (nodeBefore.type != itemType) { return false }
-
-    if (dispatch) {
-      var nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;
-      var inner = dist.Fragment.from(nestedBefore ? itemType.create() : null);
-      var slice = new dist.Slice(dist.Fragment.from(itemType.create(null, dist.Fragment.from(parent.copy(inner)))),
-                            nestedBefore ? 3 : 1, 0);
-      var before = range.start, after = range.end;
-      dispatch(state.tr.step(new dist$1.ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after,
-                                                   before, after, slice, 1, true))
-               .scrollIntoView());
-    }
-    return true
-  }
-}
-
-exports.orderedList = orderedList;
-exports.bulletList = bulletList;
-exports.listItem = listItem;
-exports.addListNodes = addListNodes;
-exports.wrapInList = wrapInList;
-exports.splitListItem = splitListItem;
-exports.liftListItem = liftListItem;
-exports.sinkListItem = sinkListItem;
-
-});
-
-unwrapExports(schemaList);
-var schemaList_1 = schemaList.orderedList;
-var schemaList_2 = schemaList.bulletList;
-var schemaList_3 = schemaList.listItem;
-var schemaList_4 = schemaList.addListNodes;
-var schemaList_5 = schemaList.wrapInList;
-var schemaList_6 = schemaList.splitListItem;
-var schemaList_7 = schemaList.liftListItem;
-var schemaList_8 = schemaList.sinkListItem;
-
-function removeMark (type) {
-  return function (state, dispatch) {
-		var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-		return dispatch(state.tr.removeMark(from, to, type))
-	}
-}
-
-function toggleBlockType (type, toggletype, attrs) {
-	if ( attrs === void 0 ) attrs = {};
-
-	return function (state, dispatch, view) {
-		var isActive = nodeIsActive(state, type, attrs);
-
-		if (isActive) {
-			return commands_18(toggletype)(state, dispatch, view)
-		}
-
-		return commands_18(type, attrs)(state, dispatch, view)
-	}
-}
-
-function toggleList$$1(type, itemType) {
-  return function (state, dispatch, view) {
-    var isActive = nodeIsActive(state, type);
-
-    if (isActive) {
-      return schemaList_7(itemType)(state, dispatch, view)
-    }
-
-    return schemaList_5(type)(state, dispatch, view)
-  }
-}
-
-// https://discuss.prosemirror.net/t/list-type-toggle/948
-
-// import { wrapInList, liftListItem } from 'prosemirror-schema-list'
-
-// function isList(node, schema) {
-//   return (node.type === schema.nodes.bullet_list || node.type === schema.nodes.ordered_list)
-// }
-
-// export default function toggleList(listType, schema) {
-//   const lift = liftListItem(schema.nodes.list_item)
-// 	const wrap = wrapInList(listType)
-
-//   return (state, dispatch) => {
-//     const { $from, $to } = state.selection
-//     const range = $from.blockRange($to)
-//     if (!range) {
-//       return false
-// 		}
-
-//     if (range.depth >= 2 && $from.node(range.depth - 1).type === listType) {
-//       return lift(state, dispatch)
-//     } else if (range.depth >= 2 && isList($from.node(range.depth - 1), schema)) {
-//       const tr = state.tr
-// 			const node = $from.before(range.depth - 1)
-// 			console.log({node})
-//       // TODO: how do I pass the node above to `setNodeType`?
-//       // tr.setNodeType(range.start, listType);
-//       if (dispatch) dispatch(tr)
-//       return false
-//     } else {
-//       return wrap(state, dispatch)
-//     }
-//   }
-// }
-
-function updateMark (type, attrs) {
-  return function (state, dispatch) {
-		var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-		return dispatch(state.tr.addMark(from, to, type.create(attrs)))
-	}
-}
-
-var BlockquoteNode = (function (Node$$1) {
-	function BlockquoteNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) BlockquoteNode.__proto__ = Node$$1;
-	BlockquoteNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	BlockquoteNode.prototype.constructor = BlockquoteNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'blockquote'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'block+',
-			group: 'block',
-			defining: true,
-			draggable: false,
-			parseDOM: [
-				{ tag: 'blockquote' } ],
-			toDOM: function () { return ['blockquote', 0]; },
-		}
-	};
-
-	BlockquoteNode.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_18(type)
-	};
-
-	BlockquoteNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Ctrl->': commands_17(type),
-		}
-	};
-
-	BlockquoteNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(/^\s*>\s$/, type) ]
-	};
-
-	Object.defineProperties( BlockquoteNode.prototype, prototypeAccessors );
-
-	return BlockquoteNode;
-}(Node));
-
-var BulletNode = (function (Node$$1) {
-	function BulletNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) BulletNode.__proto__ = Node$$1;
-	BulletNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	BulletNode.prototype.constructor = BulletNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'bullet_list'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'list_item+',
-			group: 'block',
-			parseDOM: [
-				{ tag: 'ul' } ],
-			toDOM: function () { return ['ul', 0]; },
-		}
-	};
-
-	BulletNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-
-		return toggleList$$1(type, schema.nodes.list_item)
-	};
-
-	BulletNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-8': schemaList_5(type),
-		}
-	};
-
-	BulletNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(/^\s*([-+*])\s$/, type) ]
-	};
-
-	Object.defineProperties( BulletNode.prototype, prototypeAccessors );
-
-	return BulletNode;
-}(Node));
-
-var CodeBlockNode = (function (Node$$1) {
-	function CodeBlockNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) CodeBlockNode.__proto__ = Node$$1;
-	CodeBlockNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	CodeBlockNode.prototype.constructor = CodeBlockNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'code_block'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'text*',
-			marks: '',
-			group: 'block',
-			code: true,
-			defining: true,
-			draggable: false,
-			parseDOM: [
-				{ tag: 'pre', preserveWhitespace: 'full' } ],
-			toDOM: function () { return ['pre', ['code', 0]]; },
-		}
-	};
-
-	CodeBlockNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-
-		return toggleBlockType(type, schema.nodes.paragraph)
-	};
-
-	CodeBlockNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-\\': commands_18(type),
-		}
-	};
-
-	CodeBlockNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_12$2(/^```$/, type) ]
-	};
-
-	Object.defineProperties( CodeBlockNode.prototype, prototypeAccessors );
-
-	return CodeBlockNode;
-}(Node));
-
-var DocNode = (function (Node$$1) {
-	function DocNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) DocNode.__proto__ = Node$$1;
-	DocNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	DocNode.prototype.constructor = DocNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'doc'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'block+',
-		}
-	};
-
-	Object.defineProperties( DocNode.prototype, prototypeAccessors );
-
-	return DocNode;
-}(Node));
-
-var HardBreakNode = (function (Node$$1) {
-	function HardBreakNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) HardBreakNode.__proto__ = Node$$1;
-	HardBreakNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	HardBreakNode.prototype.constructor = HardBreakNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'hard_break'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			inline: true,
-			group: 'inline',
-			selectable: false,
-			parseDOM: [
-				{ tag: 'br' } ],
-			toDOM: function () { return ['br']; },
-		}
-	};
-
-	HardBreakNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		var command = commands_21(commands_10, function (state, dispatch) {
-			dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());
-			return true
-		});
-		return {
-			'Mod-Enter': command,
-			'Shift-Enter': command,
-		}
-	};
-
-	Object.defineProperties( HardBreakNode.prototype, prototypeAccessors );
-
-	return HardBreakNode;
-}(Node));
-
-var HeadingNode = (function (Node$$1) {
-	function HeadingNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) HeadingNode.__proto__ = Node$$1;
-	HeadingNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	HeadingNode.prototype.constructor = HeadingNode;
-
-	var prototypeAccessors = { name: { configurable: true },defaultOptions: { configurable: true },levels: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'heading'
-	};
-
-	prototypeAccessors.defaultOptions.get = function () {
-		return {
-			maxLevel: 6,
-		}
-	};
-
-	prototypeAccessors.levels.get = function () {
-		return Array.from(new Array(this.options.maxLevel), function (value, index) { return index + 1; })
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				level: {
-					default: 1,
-				},
-			},
-			content: 'inline*',
-			group: 'block',
-			defining: true,
-			draggable: false,
-			parseDOM: this.levels.map(function (level) { return ({ tag: ("h" + level), attrs: { level: level } }); }),
-			toDOM: function (node) { return [("h" + (node.attrs.level)), 0]; },
-		}
-	};
-
-	HeadingNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-		var attrs = ref.attrs;
-
-		return toggleBlockType(type, schema.nodes.paragraph, attrs)
-	};
-
-	HeadingNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return this.levels.reduce(function (items, level) {
-			var obj;
-
-			return (Object.assign({}, items,
-			( obj = {}, obj[("Shift-Ctrl-" + level)] = commands_18(type, { level: level }), obj )));
-		}, {})
-	};
-
-	HeadingNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_12$2(
-				new RegExp(("^(#{1," + (this.options.maxLevel) + "})\\s$")),
-				type,
-				function (match) { return ({ level: match[1].length }); }
-			) ]
-	};
-
-	Object.defineProperties( HeadingNode.prototype, prototypeAccessors );
-
-	return HeadingNode;
-}(Node));
-
-var OrderedListNode = (function (Node$$1) {
-	function OrderedListNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) OrderedListNode.__proto__ = Node$$1;
-	OrderedListNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	OrderedListNode.prototype.constructor = OrderedListNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'list_item'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'paragraph block*',
-			group: 'block',
-			defining: true,
-			draggable: false,
-			parseDOM: [
-				{ tag: 'li' } ],
-			toDOM: function () { return ['li', 0]; },
-		}
-	};
-
-	OrderedListNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			Enter: schemaList_6(type),
-			Tab: schemaList_8(type),
-			'Shift-Tab': schemaList_7(type),
-		}
-	};
-
-	Object.defineProperties( OrderedListNode.prototype, prototypeAccessors );
-
-	return OrderedListNode;
-}(Node));
-
-var OrderedListNode$1 = (function (Node$$1) {
-	function OrderedListNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) OrderedListNode.__proto__ = Node$$1;
-	OrderedListNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	OrderedListNode.prototype.constructor = OrderedListNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'ordered_list'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				order: {
-					default: 1,
-				},
-			},
-			content: 'list_item+',
-			group: 'block',
-			parseDOM: [
-				{
-					tag: 'ol',
-					getAttrs: function (dom) { return ({
-						order: dom.hasAttribute('start') ? +dom.getAttribute('start') : 1,
-					}); },
-				} ],
-			toDOM: function (node) { return (node.attrs.order === 1 ? ['ol', 0] : ['ol', { start: node.attrs.order }, 0]); },
-		}
-	};
-
-	OrderedListNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-
-		return toggleList$$1(type, schema.nodes.list_item)
-	};
-
-	OrderedListNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-9': schemaList_5(type),
-		}
-	};
-
-	OrderedListNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(
-				/^(\d+)\.\s$/,
-				type,
-				function (match) { return ({ order: +match[1] }); },
-				function (match, node) { return node.childCount + node.attrs.order === +match[1]; }
-			) ]
-	};
-
-	Object.defineProperties( OrderedListNode.prototype, prototypeAccessors );
-
-	return OrderedListNode;
-}(Node));
-
-var ParagraphNode = (function (Node$$1) {
-	function ParagraphNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) ParagraphNode.__proto__ = Node$$1;
-	ParagraphNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	ParagraphNode.prototype.constructor = ParagraphNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'paragraph'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'inline*',
-			group: 'block',
-			draggable: false,
-			parseDOM: [{
-				tag: 'p',
-			}],
-			toDOM: function () { return ['p', 0]; },
-		}
-	};
-
-	ParagraphNode.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_18(type)
-	};
-
-	ParagraphNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-0': commands_18(type),
-		}
-	};
-
-	Object.defineProperties( ParagraphNode.prototype, prototypeAccessors );
-
-	return ParagraphNode;
-}(Node));
-
-var TextNode = (function (Node$$1) {
-	function TextNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) TextNode.__proto__ = Node$$1;
-	TextNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	TextNode.prototype.constructor = TextNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'text'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			group: 'inline',
-		}
-	};
-
-	Object.defineProperties( TextNode.prototype, prototypeAccessors );
-
-	return TextNode;
-}(Node));
-
-var BulletNode$1 = (function (Node$$1) {
-	function BulletNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) BulletNode.__proto__ = Node$$1;
-	BulletNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	BulletNode.prototype.constructor = BulletNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'todo_list'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			group: 'block',
-			content: 'todo_item+',
-			toDOM: function () { return ['ul', { 'data-type': 'todo_list' }, 0]; },
-			parseDOM: [{
-				priority: 51,
-				tag: '[data-type="todo_list"]',
-			}],
-		}
-	};
-
-	BulletNode.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return schemaList_5(type)
-	};
-
-	BulletNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(/^\s*(\[ \])\s$/, type) ]
-	};
-
-	Object.defineProperties( BulletNode.prototype, prototypeAccessors );
-
-	return BulletNode;
-}(Node));
-
-var TodoItemNode = (function (Node$$1) {
-	function TodoItemNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) TodoItemNode.__proto__ = Node$$1;
-	TodoItemNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	TodoItemNode.prototype.constructor = TodoItemNode;
-
-	var prototypeAccessors = { name: { configurable: true },view: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'todo_item'
-	};
-
-	prototypeAccessors.view.get = function () {
-		return {
-			props: ['node', 'updateAttrs', 'editable'],
-			methods: {
-				onChange: function onChange() {
-					if (!this.editable) {
-						return
-					}
-					this.updateAttrs({
-						done: !this.node.attrs.done,
-					});
-				},
-			},
-			template: "\n\t\t\t\t<li data-type=\"todo_item\" :data-done=\"node.attrs.done.toString()\">\n\t\t\t\t\t<span class=\"todo-checkbox\" contenteditable=\"false\" @click=\"onChange\"></span>\n\t\t\t\t\t<div class=\"todo-content\" ref=\"content\" :contenteditable=\"editable.toString()\"></div>\n\t\t\t\t</li>\n\t\t\t",
-		}
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				done: {
-					default: false,
-				},
-			},
-			draggable: false,
-			content: 'paragraph',
-			toDOM: function toDOM(node) {
-				var ref = node.attrs;
-				var done = ref.done;
-
-				return ['li', {
-						'data-type': 'todo_item',
-						'data-done': done.toString(),
-					},
-					['span', { class: 'todo-checkbox', contenteditable: 'false' }],
-					['div', { class: 'todo-content' }, 0] ]
-			},
-			parseDOM: [{
-				priority: 51,
-				tag: '[data-type="todo_item"]',
-				getAttrs: function (dom) { return ({
-					done: dom.getAttribute('data-done') === 'true',
-				}); },
-			}],
-		}
-	};
-
-	TodoItemNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			Enter: schemaList_6(type),
-			'Shift-Tab': schemaList_7(type),
-		}
-	};
-
-	Object.defineProperties( TodoItemNode.prototype, prototypeAccessors );
-
-	return TodoItemNode;
-}(Node));
-
-var builtInNodes = [
-	// essentials
-	new DocNode(),
-	new ParagraphNode(),
-	new TextNode(),
-
-	new BlockquoteNode(),
-	new CodeBlockNode(),
-	new HeadingNode({ maxLevel: 3 }),
-	new HardBreakNode(),
-	new OrderedListNode$1(),
-	new BulletNode(),
-	new OrderedListNode(),
-	new BulletNode$1(),
-	new TodoItemNode() ];
-
-var CodeMark = (function (Mark$$1) {
-	function CodeMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) CodeMark.__proto__ = Mark$$1;
-	CodeMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	CodeMark.prototype.constructor = CodeMark;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'code'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			parseDOM: [
-				{ tag: 'code' } ],
-			toDOM: function () { return ['code', 0]; },
-		}
-	};
-
-	CodeMark.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Mod-`': commands_19(type),
-		}
-	};
-
-	CodeMark.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_19(type)
-	};
-
-	Object.defineProperties( CodeMark.prototype, prototypeAccessors );
-
-	return CodeMark;
-}(Mark));
-
-var ItalicMark = (function (Mark$$1) {
-	function ItalicMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) ItalicMark.__proto__ = Mark$$1;
-	ItalicMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	ItalicMark.prototype.constructor = ItalicMark;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'italic'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			parseDOM: [
-				{ tag: 'i' },
-				{ tag: 'em' },
-				{ style: 'font-style=italic' } ],
-			toDOM: function () { return ['em', 0]; },
-		}
-	};
-
-	ItalicMark.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Mod-i': commands_19(type),
-		}
-	};
-
-	ItalicMark.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_19(type)
-	};
-
-	Object.defineProperties( ItalicMark.prototype, prototypeAccessors );
-
-	return ItalicMark;
-}(Mark));
-
-var LinkMark = (function (Mark$$1) {
-	function LinkMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) LinkMark.__proto__ = Mark$$1;
-	LinkMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	LinkMark.prototype.constructor = LinkMark;
-
-	var prototypeAccessors = { name: { configurable: true },view: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'link'
-	};
-
-	prototypeAccessors.view.get = function () {
-		return {
-			props: ['node'],
-			methods: {
-				onClick: function onClick() {
-					console.log('click on link');
-				},
-			},
-			template: "\n\t\t\t\t<a :href=\"node.attrs.href\" rel=\"noopener noreferrer nofollow\" ref=\"content\" @click=\"onClick\"></a>\n\t\t\t",
-		}
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				href: {
-					default: null,
-				},
-			},
-			inclusive: false,
-			parseDOM: [
-				{
-					tag: 'a[href]',
-					getAttrs: function (dom) { return ({
-						href: dom.getAttribute('href'),
-					}); },
-				} ],
-			toDOM: function (node) { return ['a', Object.assign({}, node.attrs,
-				{rel: 'noopener noreferrer nofollow'}), 0]; },
-		}
-	};
-
-	LinkMark.prototype.command = function command (ref) {
-		var type = ref.type;
-		var attrs = ref.attrs;
-
-		if (attrs.href) {
-			return updateMark(type, attrs)
-		}
-
-		return removeMark(type)
-	};
-
-	Object.defineProperties( LinkMark.prototype, prototypeAccessors );
-
-	return LinkMark;
-}(Mark));
-
-var BoldMark = (function (Mark$$1) {
-	function BoldMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) BoldMark.__proto__ = Mark$$1;
-	BoldMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	BoldMark.prototype.constructor = BoldMark;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'bold'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			parseDOM: [
-				{
-					tag: 'strong',
-				},
-				{
-					tag: 'b',
-					getAttrs: function (node) { return node.style.fontWeight != 'normal' && null; },
-				},
-				{
-					style: 'font-weight',
-					getAttrs: function (value) { return /^(bold(er)?|[5-9]\d{2,})$/.test(value) && null; },
-				} ],
-			toDOM: function () { return ['strong', 0]; },
-		}
-	};
-
-	BoldMark.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Mod-b': commands_19(type),
-		}
-	};
-
-	BoldMark.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_19(type)
-	};
-
-	Object.defineProperties( BoldMark.prototype, prototypeAccessors );
-
-	return BoldMark;
-}(Mark));
-
-var builtInMarks = [
-	new CodeMark(),
-	new ItalicMark(),
-	new LinkMark(),
-	new BoldMark() ];
-
-var editor = {
-
-	props: {
-		doc: {
-			type: Object,
-			required: false,
-			default: null,
-		},
-		extensions: {
-			type: Array,
-			required: false,
-			default: function () { return []; },
-		},
-		editable: {
-			type: Boolean,
-			default: true,
-		},
-	},
-
-	data: function data() {
-		var plugins = new PluginManager(builtInNodes.concat( builtInMarks,
-			this.extensions ));
-		var nodes = plugins.nodes;
-		var marks = plugins.marks;
-		var views = plugins.views;
-
-		return {
-			state: null,
-			view: null,
-			pluginplugins: [],
-			plugins: plugins,
-			schema: null,
-			nodes: nodes,
-			marks: marks,
-			views: views,
-			keymaps: [],
-			commands: {},
-			menuActions: null,
-		}
-	},
-
-	render: function render(createElement) {
-		var this$1 = this;
-
-		var slots = [];
-
-		Object
-			.entries(this.$scopedSlots)
-			.forEach(function (ref) {
-				var name = ref[0];
-				var slot = ref[1];
-
-				if (name === 'content') {
-					this$1.contentNode = slot({});
-					slots.push(this$1.contentNode);
-				} else if (name === 'menubar') {
-					this$1.menubarNode = slot({
-						nodes: this$1.menuActions ? this$1.menuActions.nodes : null,
-						marks: this$1.menuActions ? this$1.menuActions.marks : null,
-						focused: this$1.view ? this$1.view.focused : false,
-						focus: function () { return this$1.view.focus(); },
-					});
-					slots.push(this$1.menubarNode);
-				} else if (name === 'menububble') {
-					this$1.menububbleNode = slot({
-						nodes: this$1.menuActions ? this$1.menuActions.nodes : null,
-						marks: this$1.menuActions ? this$1.menuActions.marks : null,
-						focused: this$1.view ? this$1.view.focused : false,
-						focus: function () { return this$1.view.focus(); },
-					});
-					slots.push(this$1.menububbleNode);
-				}
-			});
-
-		return createElement('div', {
-			class: 'vue-editor',
-		}, slots)
-	},
-
-	methods: {
-		initEditor: function initEditor() {
-			this.schema = this.createSchema();
-			this.pluginplugins = this.createPlugins();
-			this.keymaps = this.createKeymaps();
-			this.inputRules = this.createInputRules();
-			this.state = this.createState();
-			this.clearSlot();
-			this.view = this.createView();
-			this.commands = this.createCommands();
-			this.updateMenuActions();
-		},
-
-		createSchema: function createSchema() {
-			return new dist_8({
-				nodes: this.nodes,
-				marks: this.marks,
-			})
-		},
-
-		createPlugins: function createPlugins() {
-			return this.plugins.pluginplugins
-		},
-
-		createKeymaps: function createKeymaps() {
-			return this.plugins.keymaps({
-				schema: this.schema,
-			})
-		},
-
-		createInputRules: function createInputRules() {
-			return this.plugins.inputRules({
-				schema: this.schema,
-			})
-		},
-
-		createCommands: function createCommands() {
-			return this.plugins.commands({
-				schema: this.schema,
-				view: this.view,
-			})
-		},
-
-		createState: function createState() {
-			return dist_7$2.create({
-				schema: this.schema,
-				doc: this.getDocument(),
-				plugins: this.pluginplugins.concat( this.getPlugins() ),
-			})
-		},
-
-		getDocument: function getDocument() {
-			if (this.doc) {
-				return this.schema.nodeFromJSON(this.doc)
-			}
-
-			return dist_12.fromSchema(this.schema).parse(this.contentNode.elm)
-		},
-
-		clearSlot: function clearSlot() {
-			this.contentNode.elm.innerHTML = '';
-		},
-
-		getPlugins: function getPlugins() {
-			var this$1 = this;
-
-			var plugins = [
-				dist_2$5({
-					rules: this.inputRules,
-				}) ].concat( this.keymaps,
-				[keymap_2(keymap$$1)],
-				[keymap_2(commands_24)],
-				[dropcursor_1()],
-				[dist_1$4()],
-				[history_4()],
-				[new dist_8$2({
-					props: {
-						editable: function () { return this$1.editable; },
-					},
-				})] );
-
-			if (this.menububbleNode) {
-				plugins.push(menuBubble(this.menububbleNode));
-			}
-
-			return plugins
-		},
-
-		createView: function createView() {
-			return new dist_1$3(this.contentNode.elm, {
-				state: this.state,
-				dispatchTransaction: this.dispatchTransaction,
-				nodeViews: initNodeViews$$1({
-					nodes: this.views,
-					editable: this.editable,
-				}),
-			})
-		},
-
-		updateMenuActions: function updateMenuActions() {
-			this.menuActions = buildMenuActions({
-				schema: this.schema,
-				state: this.view.state,
-				commands: this.commands,
-			});
-		},
-
-		dispatchTransaction: function dispatchTransaction(transaction) {
-			this.state = this.state.apply(transaction);
-			this.view.updateState(this.state);
-			this.$emit('update', this.state);
-			this.updateMenuActions();
-		},
-	},
-
-	mounted: function mounted() {
-		this.initEditor();
-	},
-
-};
-
-exports.Editor = editor;
diff --git a/packages/tiptap/dist/tiptap.esm.js b/packages/tiptap/dist/tiptap.esm.js
deleted file mode 100644
index 99ccdc6d..00000000
--- a/packages/tiptap/dist/tiptap.esm.js
+++ /dev/null
@@ -1,26836 +0,0 @@
-
-	/*!
-  * tiptap vundefined
-  * (c) 2018 Scrumpy UG (limited liability)
-  * @license MIT
-  */
-
-function unwrapExports (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
-function createCommonjsModule(fn, module) {
-	return module = { exports: {} }, fn(module, module.exports), module.exports;
-}
-
-// ::- Persistent data structure representing an ordered mapping from
-// strings to values, with some convenient update methods.
-function OrderedMap(content) {
-  this.content = content;
-}
-
-OrderedMap.prototype = {
-  constructor: OrderedMap,
-
-  find: function(key) {
-    var this$1 = this;
-
-    for (var i = 0; i < this.content.length; i += 2)
-      { if (this$1.content[i] === key) { return i } }
-    return -1
-  },
-
-  // :: (string) → ?any
-  // Retrieve the value stored under `key`, or return undefined when
-  // no such key exists.
-  get: function(key) {
-    var found = this.find(key);
-    return found == -1 ? undefined : this.content[found + 1]
-  },
-
-  // :: (string, any, ?string) → OrderedMap
-  // Create a new map by replacing the value of `key` with a new
-  // value, or adding a binding to the end of the map. If `newKey` is
-  // given, the key of the binding will be replaced with that key.
-  update: function(key, value, newKey) {
-    var self = newKey && newKey != key ? this.remove(newKey) : this;
-    var found = self.find(key), content = self.content.slice();
-    if (found == -1) {
-      content.push(newKey || key, value);
-    } else {
-      content[found + 1] = value;
-      if (newKey) { content[found] = newKey; }
-    }
-    return new OrderedMap(content)
-  },
-
-  // :: (string) → OrderedMap
-  // Return a map with the given key removed, if it existed.
-  remove: function(key) {
-    var found = this.find(key);
-    if (found == -1) { return this }
-    var content = this.content.slice();
-    content.splice(found, 2);
-    return new OrderedMap(content)
-  },
-
-  // :: (string, any) → OrderedMap
-  // Add a new key to the start of the map.
-  addToStart: function(key, value) {
-    return new OrderedMap([key, value].concat(this.remove(key).content))
-  },
-
-  // :: (string, any) → OrderedMap
-  // Add a new key to the end of the map.
-  addToEnd: function(key, value) {
-    var content = this.remove(key).content.slice();
-    content.push(key, value);
-    return new OrderedMap(content)
-  },
-
-  // :: (string, string, any) → OrderedMap
-  // Add a key after the given key. If `place` is not found, the new
-  // key is added to the end.
-  addBefore: function(place, key, value) {
-    var without = this.remove(key), content = without.content.slice();
-    var found = without.find(place);
-    content.splice(found == -1 ? content.length : found, 0, key, value);
-    return new OrderedMap(content)
-  },
-
-  // :: ((key: string, value: any))
-  // Call the given function for each key/value pair in the map, in
-  // order.
-  forEach: function(f) {
-    var this$1 = this;
-
-    for (var i = 0; i < this.content.length; i += 2)
-      { f(this$1.content[i], this$1.content[i + 1]); }
-  },
-
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a new map by prepending the keys in this map that don't
-  // appear in `map` before the keys in `map`.
-  prepend: function(map) {
-    map = OrderedMap.from(map);
-    if (!map.size) { return this }
-    return new OrderedMap(map.content.concat(this.subtract(map).content))
-  },
-
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a new map by appending the keys in this map that don't
-  // appear in `map` after the keys in `map`.
-  append: function(map) {
-    map = OrderedMap.from(map);
-    if (!map.size) { return this }
-    return new OrderedMap(this.subtract(map).content.concat(map.content))
-  },
-
-  // :: (union<Object, OrderedMap>) → OrderedMap
-  // Create a map containing all the keys in this map that don't
-  // appear in `map`.
-  subtract: function(map) {
-    var result = this;
-    map = OrderedMap.from(map);
-    for (var i = 0; i < map.content.length; i += 2)
-      { result = result.remove(map.content[i]); }
-    return result
-  },
-
-  // :: number
-  // The amount of keys in this map.
-  get size() {
-    return this.content.length >> 1
-  }
-};
-
-// :: (?union<Object, OrderedMap>) → OrderedMap
-// Return a map with the given content. If null, create an empty
-// map. If given an ordered map, return that map itself. If given an
-// object, create a map from the object's properties.
-OrderedMap.from = function(value) {
-  if (value instanceof OrderedMap) { return value }
-  var content = [];
-  if (value) { for (var prop in value) { content.push(prop, value[prop]); } }
-  return new OrderedMap(content)
-};
-
-var orderedmap = OrderedMap;
-
-var dist = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var OrderedMap = _interopDefault(orderedmap);
-
-function findDiffStart(a, b, pos) {
-  for (var i = 0;; i++) {
-    if (i == a.childCount || i == b.childCount)
-      { return a.childCount == b.childCount ? null : pos }
-
-    var childA = a.child(i), childB = b.child(i);
-    if (childA == childB) { pos += childA.nodeSize; continue }
-
-    if (!childA.sameMarkup(childB)) { return pos }
-
-    if (childA.isText && childA.text != childB.text) {
-      for (var j = 0; childA.text[j] == childB.text[j]; j++)
-        { pos++; }
-      return pos
-    }
-    if (childA.content.size || childB.content.size) {
-      var inner = findDiffStart(childA.content, childB.content, pos + 1);
-      if (inner != null) { return inner }
-    }
-    pos += childA.nodeSize;
-  }
-}
-
-function findDiffEnd(a, b, posA, posB) {
-  for (var iA = a.childCount, iB = b.childCount;;) {
-    if (iA == 0 || iB == 0)
-      { return iA == iB ? null : {a: posA, b: posB} }
-
-    var childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;
-    if (childA == childB) {
-      posA -= size; posB -= size;
-      continue
-    }
-
-    if (!childA.sameMarkup(childB)) { return {a: posA, b: posB} }
-
-    if (childA.isText && childA.text != childB.text) {
-      var same = 0, minSize = Math.min(childA.text.length, childB.text.length);
-      while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {
-        same++; posA--; posB--;
-      }
-      return {a: posA, b: posB}
-    }
-    if (childA.content.size || childB.content.size) {
-      var inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);
-      if (inner) { return inner }
-    }
-    posA -= size; posB -= size;
-  }
-}
-
-// ::- A fragment represents a node's collection of child nodes.
-//
-// Like nodes, fragments are persistent data structures, and you
-// should not mutate them or their content. Rather, you create new
-// instances whenever needed. The API tries to make this easy.
-var Fragment = function Fragment(content, size) {
-  var this$1 = this;
-
-  this.content = content;
-  // :: number
-  // The size of the fragment, which is the total of the size of its
-  // content nodes.
-  this.size = size || 0;
-  if (size == null) { for (var i = 0; i < content.length; i++)
-    { this$1.size += content[i].nodeSize; } }
-};
-
-var prototypeAccessors$1 = { firstChild: {},lastChild: {},childCount: {} };
-
-// :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)
-// Invoke a callback for all descendant nodes between the given two
-// positions (relative to start of this fragment). Doesn't descend
-// into a node when the callback returns `false`.
-Fragment.prototype.nodesBetween = function nodesBetween (from, to, f, nodeStart, parent) {
-    var this$1 = this;
-    if ( nodeStart === void 0 ) { nodeStart = 0; }
-
-  for (var i = 0, pos = 0; pos < to; i++) {
-    var child = this$1.content[i], end = pos + child.nodeSize;
-    if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {
-      var start = pos + 1;
-      child.nodesBetween(Math.max(0, from - start),
-                         Math.min(child.content.size, to - start),
-                         f, nodeStart + start);
-    }
-    pos = end;
-  }
-};
-
-// :: ((node: Node, pos: number, parent: Node) → ?bool)
-// Call the given callback for every descendant node. The callback
-// may return `false` to prevent traversal of a given node's children.
-Fragment.prototype.descendants = function descendants (f) {
-  this.nodesBetween(0, this.size, f);
-};
-
-// : (number, number, ?string, ?string) → string
-Fragment.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
-  var text = "", separated = true;
-  this.nodesBetween(from, to, function (node, pos) {
-    if (node.isText) {
-      text += node.text.slice(Math.max(from, pos) - pos, to - pos);
-      separated = !blockSeparator;
-    } else if (node.isLeaf && leafText) {
-      text += leafText;
-      separated = !blockSeparator;
-    } else if (!separated && node.isBlock) {
-      text += blockSeparator;
-      separated = true;
-    }
-  }, 0);
-  return text
-};
-
-// :: (Fragment) → Fragment
-// Create a new fragment containing the combined content of this
-// fragment and the other.
-Fragment.prototype.append = function append (other) {
-  if (!other.size) { return this }
-  if (!this.size) { return other }
-  var last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;
-  if (last.isText && last.sameMarkup(first)) {
-    content[content.length - 1] = last.withText(last.text + first.text);
-    i = 1;
-  }
-  for (; i < other.content.length; i++) { content.push(other.content[i]); }
-  return new Fragment(content, this.size + other.size)
-};
-
-// :: (number, ?number) → Fragment
-// Cut out the sub-fragment between the two given positions.
-Fragment.prototype.cut = function cut (from, to) {
-    var this$1 = this;
-
-  if (to == null) { to = this.size; }
-  if (from == 0 && to == this.size) { return this }
-  var result = [], size = 0;
-  if (to > from) { for (var i = 0, pos = 0; pos < to; i++) {
-    var child = this$1.content[i], end = pos + child.nodeSize;
-    if (end > from) {
-      if (pos < from || end > to) {
-        if (child.isText)
-          { child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos)); }
-        else
-          { child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1)); }
-      }
-      result.push(child);
-      size += child.nodeSize;
-    }
-    pos = end;
-  } }
-  return new Fragment(result, size)
-};
-
-Fragment.prototype.cutByIndex = function cutByIndex (from, to) {
-  if (from == to) { return Fragment.empty }
-  if (from == 0 && to == this.content.length) { return this }
-  return new Fragment(this.content.slice(from, to))
-};
-
-// :: (number, Node) → Fragment
-// Create a new fragment in which the node at the given index is
-// replaced by the given node.
-Fragment.prototype.replaceChild = function replaceChild (index, node) {
-  var current = this.content[index];
-  if (current == node) { return this }
-  var copy = this.content.slice();
-  var size = this.size + node.nodeSize - current.nodeSize;
-  copy[index] = node;
-  return new Fragment(copy, size)
-};
-
-// : (Node) → Fragment
-// Create a new fragment by prepending the given node to this
-// fragment.
-Fragment.prototype.addToStart = function addToStart (node) {
-  return new Fragment([node].concat(this.content), this.size + node.nodeSize)
-};
-
-// : (Node) → Fragment
-// Create a new fragment by appending the given node to this
-// fragment.
-Fragment.prototype.addToEnd = function addToEnd (node) {
-  return new Fragment(this.content.concat(node), this.size + node.nodeSize)
-};
-
-// :: (Fragment) → bool
-// Compare this fragment to another one.
-Fragment.prototype.eq = function eq (other) {
-    var this$1 = this;
-
-  if (this.content.length != other.content.length) { return false }
-  for (var i = 0; i < this.content.length; i++)
-    { if (!this$1.content[i].eq(other.content[i])) { return false } }
-  return true
-};
-
-// :: ?Node
-// The first child of the fragment, or `null` if it is empty.
-prototypeAccessors$1.firstChild.get = function () { return this.content.length ? this.content[0] : null };
-
-// :: ?Node
-// The last child of the fragment, or `null` if it is empty.
-prototypeAccessors$1.lastChild.get = function () { return this.content.length ? this.content[this.content.length - 1] : null };
-
-// :: number
-// The number of child nodes in this fragment.
-prototypeAccessors$1.childCount.get = function () { return this.content.length };
-
-// :: (number) → Node
-// Get the child node at the given index. Raise an error when the
-// index is out of range.
-Fragment.prototype.child = function child (index) {
-  var found = this.content[index];
-  if (!found) { throw new RangeError("Index " + index + " out of range for " + this) }
-  return found
-};
-
-// :: (number) → ?Node
-// Get the child node at the given index, if it exists.
-Fragment.prototype.maybeChild = function maybeChild (index) {
-  return this.content[index]
-};
-
-// :: ((node: Node, offset: number, index: number))
-// Call `f` for every child node, passing the node, its offset
-// into this parent node, and its index.
-Fragment.prototype.forEach = function forEach (f) {
-    var this$1 = this;
-
-  for (var i = 0, p = 0; i < this.content.length; i++) {
-    var child = this$1.content[i];
-    f(child, p, i);
-    p += child.nodeSize;
-  }
-};
-
-// :: (Fragment) → ?number
-// Find the first position at which this fragment and another
-// fragment differ, or `null` if they are the same.
-Fragment.prototype.findDiffStart = function findDiffStart$1 (other, pos) {
-    if ( pos === void 0 ) { pos = 0; }
-
-  return findDiffStart(this, other, pos)
-};
-
-// :: (Fragment) → ?{a: number, b: number}
-// Find the first position, searching from the end, at which this
-// fragment and the given fragment differ, or `null` if they are the
-// same. Since this position will not be the same in both nodes, an
-// object with two separate positions is returned.
-Fragment.prototype.findDiffEnd = function findDiffEnd$1 (other, pos, otherPos) {
-    if ( pos === void 0 ) { pos = this.size; }
-    if ( otherPos === void 0 ) { otherPos = other.size; }
-
-  return findDiffEnd(this, other, pos, otherPos)
-};
-
-// : (number, ?number) → {index: number, offset: number}
-// Find the index and inner offset corresponding to a given relative
-// position in this fragment. The result object will be reused
-// (overwritten) the next time the function is called. (Not public.)
-Fragment.prototype.findIndex = function findIndex (pos, round) {
-    var this$1 = this;
-    if ( round === void 0 ) { round = -1; }
-
-  if (pos == 0) { return retIndex(0, pos) }
-  if (pos == this.size) { return retIndex(this.content.length, pos) }
-  if (pos > this.size || pos < 0) { throw new RangeError(("Position " + pos + " outside of fragment (" + (this) + ")")) }
-  for (var i = 0, curPos = 0;; i++) {
-    var cur = this$1.child(i), end = curPos + cur.nodeSize;
-    if (end >= pos) {
-      if (end == pos || round > 0) { return retIndex(i + 1, end) }
-      return retIndex(i, curPos)
-    }
-    curPos = end;
-  }
-};
-
-// :: () → string
-// Return a debugging string that describes this fragment.
-Fragment.prototype.toString = function toString () { return "<" + this.toStringInner() + ">" };
-
-Fragment.prototype.toStringInner = function toStringInner () { return this.content.join(", ") };
-
-// :: () → ?Object
-// Create a JSON-serializeable representation of this fragment.
-Fragment.prototype.toJSON = function toJSON () {
-  return this.content.length ? this.content.map(function (n) { return n.toJSON(); }) : null
-};
-
-// :: (Schema, ?Object) → Fragment
-// Deserialize a fragment from its JSON representation.
-Fragment.fromJSON = function fromJSON (schema, value) {
-  if (!value) { return Fragment.empty }
-  if (!Array.isArray(value)) { throw new RangeError("Invalid input for Fragment.fromJSON") }
-  return new Fragment(value.map(schema.nodeFromJSON))
-};
-
-// :: ([Node]) → Fragment
-// Build a fragment from an array of nodes. Ensures that adjacent
-// text nodes with the same marks are joined together.
-Fragment.fromArray = function fromArray (array) {
-  if (!array.length) { return Fragment.empty }
-  var joined, size = 0;
-  for (var i = 0; i < array.length; i++) {
-    var node = array[i];
-    size += node.nodeSize;
-    if (i && node.isText && array[i - 1].sameMarkup(node)) {
-      if (!joined) { joined = array.slice(0, i); }
-      joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text);
-    } else if (joined) {
-      joined.push(node);
-    }
-  }
-  return new Fragment(joined || array, size)
-};
-
-// :: (?union<Fragment, Node, [Node]>) → Fragment
-// Create a fragment from something that can be interpreted as a set
-// of nodes. For `null`, it returns the empty fragment. For a
-// fragment, the fragment itself. For a node or array of nodes, a
-// fragment containing those nodes.
-Fragment.from = function from (nodes) {
-  if (!nodes) { return Fragment.empty }
-  if (nodes instanceof Fragment) { return nodes }
-  if (Array.isArray(nodes)) { return this.fromArray(nodes) }
-  return new Fragment([nodes], nodes.nodeSize)
-};
-
-Object.defineProperties( Fragment.prototype, prototypeAccessors$1 );
-
-var found = {index: 0, offset: 0};
-function retIndex(index, offset) {
-  found.index = index;
-  found.offset = offset;
-  return found
-}
-
-// :: Fragment
-// An empty fragment. Intended to be reused whenever a node doesn't
-// contain anything (rather than allocating a new empty fragment for
-// each leaf node).
-Fragment.empty = new Fragment([], 0);
-
-function compareDeep(a, b) {
-  if (a === b) { return true }
-  if (!(a && typeof a == "object") ||
-      !(b && typeof b == "object")) { return false }
-  var array = Array.isArray(a);
-  if (Array.isArray(b) != array) { return false }
-  if (array) {
-    if (a.length != b.length) { return false }
-    for (var i = 0; i < a.length; i++) { if (!compareDeep(a[i], b[i])) { return false } }
-  } else {
-    for (var p in a) { if (!(p in b) || !compareDeep(a[p], b[p])) { return false } }
-    for (var p$1 in b) { if (!(p$1 in a)) { return false } }
-  }
-  return true
-}
-
-// ::- A mark is a piece of information that can be attached to a node,
-// such as it being emphasized, in code font, or a link. It has a type
-// and optionally a set of attributes that provide further information
-// (such as the target of the link). Marks are created through a
-// `Schema`, which controls which types exist and which
-// attributes they have.
-var Mark = function Mark(type, attrs) {
-  // :: MarkType
-  // The type of this mark.
-  this.type = type;
-  // :: Object
-  // The attributes associated with this mark.
-  this.attrs = attrs;
-};
-
-// :: ([Mark]) → [Mark]
-// Given a set of marks, create a new set which contains this one as
-// well, in the right position. If this mark is already in the set,
-// the set itself is returned. If any marks that are set to be
-// [exclusive](#model.MarkSpec.excludes) with this mark are present,
-// those are replaced by this one.
-Mark.prototype.addToSet = function addToSet (set) {
-    var this$1 = this;
-
-  var copy, placed = false;
-  for (var i = 0; i < set.length; i++) {
-    var other = set[i];
-    if (this$1.eq(other)) { return set }
-    if (this$1.type.excludes(other.type)) {
-      if (!copy) { copy = set.slice(0, i); }
-    } else if (other.type.excludes(this$1.type)) {
-      return set
-    } else {
-      if (!placed && other.type.rank > this$1.type.rank) {
-        if (!copy) { copy = set.slice(0, i); }
-        copy.push(this$1);
-        placed = true;
-      }
-      if (copy) { copy.push(other); }
-    }
-  }
-  if (!copy) { copy = set.slice(); }
-  if (!placed) { copy.push(this); }
-  return copy
-};
-
-// :: ([Mark]) → [Mark]
-// Remove this mark from the given set, returning a new set. If this
-// mark is not in the set, the set itself is returned.
-Mark.prototype.removeFromSet = function removeFromSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (this$1.eq(set[i]))
-      { return set.slice(0, i).concat(set.slice(i + 1)) } }
-  return set
-};
-
-// :: ([Mark]) → bool
-// Test whether this mark is in the given set of marks.
-Mark.prototype.isInSet = function isInSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (this$1.eq(set[i])) { return true } }
-  return false
-};
-
-// :: (Mark) → bool
-// Test whether this mark has the same type and attributes as
-// another mark.
-Mark.prototype.eq = function eq (other) {
-  return this == other ||
-    (this.type == other.type && compareDeep(this.attrs, other.attrs))
-};
-
-// :: () → Object
-// Convert this mark to a JSON-serializeable representation.
-Mark.prototype.toJSON = function toJSON () {
-    var this$1 = this;
-
-  var obj = {type: this.type.name};
-  for (var _ in this$1.attrs) {
-    obj.attrs = this$1.attrs;
-    break
-  }
-  return obj
-};
-
-// :: (Schema, Object) → Mark
-Mark.fromJSON = function fromJSON (schema, json) {
-  if (!json) { throw new RangeError("Invalid input for Mark.fromJSON") }
-  var type = schema.marks[json.type];
-  if (!type) { throw new RangeError(("There is no mark type " + (json.type) + " in this schema")) }
-  return type.create(json.attrs)
-};
-
-// :: ([Mark], [Mark]) → bool
-// Test whether two sets of marks are identical.
-Mark.sameSet = function sameSet (a, b) {
-  if (a == b) { return true }
-  if (a.length != b.length) { return false }
-  for (var i = 0; i < a.length; i++)
-    { if (!a[i].eq(b[i])) { return false } }
-  return true
-};
-
-// :: (?union<Mark, [Mark]>) → [Mark]
-// Create a properly sorted mark set from null, a single mark, or an
-// unsorted array of marks.
-Mark.setFrom = function setFrom (marks) {
-  if (!marks || marks.length == 0) { return Mark.none }
-  if (marks instanceof Mark) { return [marks] }
-  var copy = marks.slice();
-  copy.sort(function (a, b) { return a.type.rank - b.type.rank; });
-  return copy
-};
-
-// :: [Mark] The empty set of marks.
-Mark.none = [];
-
-// ReplaceError:: class extends Error
-// Error type raised by [`Node.replace`](#model.Node.replace) when
-// given an invalid replacement.
-
-function ReplaceError(message) {
-  var err = Error.call(this, message);
-  err.__proto__ = ReplaceError.prototype;
-  return err
-}
-
-ReplaceError.prototype = Object.create(Error.prototype);
-ReplaceError.prototype.constructor = ReplaceError;
-ReplaceError.prototype.name = "ReplaceError";
-
-// ::- A slice represents a piece cut out of a larger document. It
-// stores not only a fragment, but also the depth up to which nodes on
-// both side are ‘open’ (cut through).
-var Slice = function Slice(content, openStart, openEnd) {
-  // :: Fragment The slice's content.
-  this.content = content;
-  // :: number The open depth at the start.
-  this.openStart = openStart;
-  // :: number The open depth at the end.
-  this.openEnd = openEnd;
-};
-
-var prototypeAccessors$2 = { size: {} };
-
-// :: number
-// The size this slice would add when inserted into a document.
-prototypeAccessors$2.size.get = function () {
-  return this.content.size - this.openStart - this.openEnd
-};
-
-Slice.prototype.insertAt = function insertAt (pos, fragment) {
-  var content = insertInto(this.content, pos + this.openStart, fragment, null);
-  return content && new Slice(content, this.openStart, this.openEnd)
-};
-
-Slice.prototype.removeBetween = function removeBetween (from, to) {
-  return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)
-};
-
-// :: (Slice) → bool
-// Tests whether this slice is equal to another slice.
-Slice.prototype.eq = function eq (other) {
-  return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd
-};
-
-Slice.prototype.toString = function toString () {
-  return this.content + "(" + this.openStart + "," + this.openEnd + ")"
-};
-
-// :: () → ?Object
-// Convert a slice to a JSON-serializable representation.
-Slice.prototype.toJSON = function toJSON () {
-  if (!this.content.size) { return null }
-  var json = {content: this.content.toJSON()};
-  if (this.openStart > 0) { json.openStart = this.openStart; }
-  if (this.openEnd > 0) { json.openEnd = this.openEnd; }
-  return json
-};
-
-// :: (Schema, ?Object) → Slice
-// Deserialize a slice from its JSON representation.
-Slice.fromJSON = function fromJSON (schema, json) {
-  if (!json) { return Slice.empty }
-  var openStart = json.openStart || 0, openEnd = json.openEnd || 0;
-  if (typeof openStart != "number" || typeof openEnd != "number")
-    { throw new RangeError("Invalid input for Slice.fromJSON") }
-  return new Slice(Fragment.fromJSON(schema, json.content), json.openStart || 0, json.openEnd || 0)
-};
-
-// :: (Fragment, ?bool) → Slice
-// Create a slice from a fragment by taking the maximum possible
-// open value on both side of the fragment.
-Slice.maxOpen = function maxOpen (fragment, openIsolating) {
-    if ( openIsolating === void 0 ) { openIsolating=true; }
-
-  var openStart = 0, openEnd = 0;
-  for (var n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) { openStart++; }
-  for (var n$1 = fragment.lastChild; n$1 && !n$1.isLeaf && (openIsolating || !n$1.type.spec.isolating); n$1 = n$1.lastChild) { openEnd++; }
-  return new Slice(fragment, openStart, openEnd)
-};
-
-Object.defineProperties( Slice.prototype, prototypeAccessors$2 );
-
-function removeRange(content, from, to) {
-  var ref = content.findIndex(from);
-  var index = ref.index;
-  var offset = ref.offset;
-  var child = content.maybeChild(index);
-  var ref$1 = content.findIndex(to);
-  var indexTo = ref$1.index;
-  var offsetTo = ref$1.offset;
-  if (offset == from || child.isText) {
-    if (offsetTo != to && !content.child(indexTo).isText) { throw new RangeError("Removing non-flat range") }
-    return content.cut(0, from).append(content.cut(to))
-  }
-  if (index != indexTo) { throw new RangeError("Removing non-flat range") }
-  return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))
-}
-
-function insertInto(content, dist, insert, parent) {
-  var ref = content.findIndex(dist);
-  var index = ref.index;
-  var offset = ref.offset;
-  var child = content.maybeChild(index);
-  if (offset == dist || child.isText) {
-    if (parent && !parent.canReplace(index, index, insert)) { return null }
-    return content.cut(0, dist).append(insert).append(content.cut(dist))
-  }
-  var inner = insertInto(child.content, dist - offset - 1, insert);
-  return inner && content.replaceChild(index, child.copy(inner))
-}
-
-// :: Slice
-// The empty slice.
-Slice.empty = new Slice(Fragment.empty, 0, 0);
-
-function replace($from, $to, slice) {
-  if (slice.openStart > $from.depth)
-    { throw new ReplaceError("Inserted content deeper than insertion position") }
-  if ($from.depth - slice.openStart != $to.depth - slice.openEnd)
-    { throw new ReplaceError("Inconsistent open depths") }
-  return replaceOuter($from, $to, slice, 0)
-}
-
-function replaceOuter($from, $to, slice, depth) {
-  var index = $from.index(depth), node = $from.node(depth);
-  if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {
-    var inner = replaceOuter($from, $to, slice, depth + 1);
-    return node.copy(node.content.replaceChild(index, inner))
-  } else if (!slice.content.size) {
-    return close(node, replaceTwoWay($from, $to, depth))
-  } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case
-    var parent = $from.parent, content = parent.content;
-    return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))
-  } else {
-    var ref = prepareSliceForReplace(slice, $from);
-    var start = ref.start;
-    var end = ref.end;
-    return close(node, replaceThreeWay($from, start, end, $to, depth))
-  }
-}
-
-function checkJoin(main, sub) {
-  if (!sub.type.compatibleContent(main.type))
-    { throw new ReplaceError("Cannot join " + sub.type.name + " onto " + main.type.name) }
-}
-
-function joinable($before, $after, depth) {
-  var node = $before.node(depth);
-  checkJoin(node, $after.node(depth));
-  return node
-}
-
-function addNode(child, target) {
-  var last = target.length - 1;
-  if (last >= 0 && child.isText && child.sameMarkup(target[last]))
-    { target[last] = child.withText(target[last].text + child.text); }
-  else
-    { target.push(child); }
-}
-
-function addRange($start, $end, depth, target) {
-  var node = ($end || $start).node(depth);
-  var startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;
-  if ($start) {
-    startIndex = $start.index(depth);
-    if ($start.depth > depth) {
-      startIndex++;
-    } else if ($start.textOffset) {
-      addNode($start.nodeAfter, target);
-      startIndex++;
-    }
-  }
-  for (var i = startIndex; i < endIndex; i++) { addNode(node.child(i), target); }
-  if ($end && $end.depth == depth && $end.textOffset)
-    { addNode($end.nodeBefore, target); }
-}
-
-function close(node, content) {
-  if (!node.type.validContent(content))
-    { throw new ReplaceError("Invalid content for node " + node.type.name) }
-  return node.copy(content)
-}
-
-function replaceThreeWay($from, $start, $end, $to, depth) {
-  var openStart = $from.depth > depth && joinable($from, $start, depth + 1);
-  var openEnd = $to.depth > depth && joinable($end, $to, depth + 1);
-
-  var content = [];
-  addRange(null, $from, depth, content);
-  if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {
-    checkJoin(openStart, openEnd);
-    addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);
-  } else {
-    if (openStart)
-      { addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content); }
-    addRange($start, $end, depth, content);
-    if (openEnd)
-      { addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content); }
-  }
-  addRange($to, null, depth, content);
-  return new Fragment(content)
-}
-
-function replaceTwoWay($from, $to, depth) {
-  var content = [];
-  addRange(null, $from, depth, content);
-  if ($from.depth > depth) {
-    var type = joinable($from, $to, depth + 1);
-    addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);
-  }
-  addRange($to, null, depth, content);
-  return new Fragment(content)
-}
-
-function prepareSliceForReplace(slice, $along) {
-  var extra = $along.depth - slice.openStart, parent = $along.node(extra);
-  var node = parent.copy(slice.content);
-  for (var i = extra - 1; i >= 0; i--)
-    { node = $along.node(i).copy(Fragment.from(node)); }
-  return {start: node.resolveNoCache(slice.openStart + extra),
-          end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}
-}
-
-// ::- You can [_resolve_](#model.Node.resolve) a position to get more
-// information about it. Objects of this class represent such a
-// resolved position, providing various pieces of context information,
-// and some helper methods.
-//
-// Throughout this interface, methods that take an optional `depth`
-// parameter will interpret undefined as `this.depth` and negative
-// numbers as `this.depth + value`.
-var ResolvedPos = function ResolvedPos(pos, path, parentOffset) {
-  // :: number The position that was resolved.
-  this.pos = pos;
-  this.path = path;
-  // :: number
-  // The number of levels the parent node is from the root. If this
-  // position points directly into the root node, it is 0. If it
-  // points into a top-level paragraph, 1, and so on.
-  this.depth = path.length / 3 - 1;
-  // :: number The offset this position has into its parent node.
-  this.parentOffset = parentOffset;
-};
-
-var prototypeAccessors$3 = { parent: {},doc: {},textOffset: {},nodeAfter: {},nodeBefore: {} };
-
-ResolvedPos.prototype.resolveDepth = function resolveDepth (val) {
-  if (val == null) { return this.depth }
-  if (val < 0) { return this.depth + val }
-  return val
-};
-
-// :: Node
-// The parent node that the position points into. Note that even if
-// a position points into a text node, that node is not considered
-// the parent—text nodes are ‘flat’ in this model, and have no content.
-prototypeAccessors$3.parent.get = function () { return this.node(this.depth) };
-
-// :: Node
-// The root node in which the position was resolved.
-prototypeAccessors$3.doc.get = function () { return this.node(0) };
-
-// :: (?number) → Node
-// The ancestor node at the given level. `p.node(p.depth)` is the
-// same as `p.parent`.
-ResolvedPos.prototype.node = function node (depth) { return this.path[this.resolveDepth(depth) * 3] };
-
-// :: (?number) → number
-// The index into the ancestor at the given level. If this points at
-// the 3rd node in the 2nd paragraph on the top level, for example,
-// `p.index(0)` is 2 and `p.index(1)` is 3.
-ResolvedPos.prototype.index = function index (depth) { return this.path[this.resolveDepth(depth) * 3 + 1] };
-
-// :: (?number) → number
-// The index pointing after this position into the ancestor at the
-// given level.
-ResolvedPos.prototype.indexAfter = function indexAfter (depth) {
-  depth = this.resolveDepth(depth);
-  return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)
-};
-
-// :: (?number) → number
-// The (absolute) position at the start of the node at the given
-// level.
-ResolvedPos.prototype.start = function start (depth) {
-  depth = this.resolveDepth(depth);
-  return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1
-};
-
-// :: (?number) → number
-// The (absolute) position at the end of the node at the given
-// level.
-ResolvedPos.prototype.end = function end (depth) {
-  depth = this.resolveDepth(depth);
-  return this.start(depth) + this.node(depth).content.size
-};
-
-// :: (?number) → number
-// The (absolute) position directly before the wrapping node at the
-// given level, or, when `level` is `this.depth + 1`, the original
-// position.
-ResolvedPos.prototype.before = function before (depth) {
-  depth = this.resolveDepth(depth);
-  if (!depth) { throw new RangeError("There is no position before the top-level node") }
-  return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]
-};
-
-// :: (?number) → number
-// The (absolute) position directly after the wrapping node at the
-// given level, or the original position when `level` is `this.depth + 1`.
-ResolvedPos.prototype.after = function after (depth) {
-  depth = this.resolveDepth(depth);
-  if (!depth) { throw new RangeError("There is no position after the top-level node") }
-  return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize
-};
-
-// :: number
-// When this position points into a text node, this returns the
-// distance between the position and the start of the text node.
-// Will be zero for positions that point between nodes.
-prototypeAccessors$3.textOffset.get = function () { return this.pos - this.path[this.path.length - 1] };
-
-// :: ?Node
-// Get the node directly after the position, if any. If the position
-// points into a text node, only the part of that node after the
-// position is returned.
-prototypeAccessors$3.nodeAfter.get = function () {
-  var parent = this.parent, index = this.index(this.depth);
-  if (index == parent.childCount) { return null }
-  var dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);
-  return dOff ? parent.child(index).cut(dOff) : child
-};
-
-// :: ?Node
-// Get the node directly before the position, if any. If the
-// position points into a text node, only the part of that node
-// before the position is returned.
-prototypeAccessors$3.nodeBefore.get = function () {
-  var index = this.index(this.depth);
-  var dOff = this.pos - this.path[this.path.length - 1];
-  if (dOff) { return this.parent.child(index).cut(0, dOff) }
-  return index == 0 ? null : this.parent.child(index - 1)
-};
-
-// :: () → [Mark]
-// Get the marks at this position, factoring in the surrounding
-// marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the
-// position is at the start of a non-empty node, the marks of the
-// node after it (if any) are returned.
-ResolvedPos.prototype.marks = function marks () {
-  var parent = this.parent, index = this.index();
-
-  // In an empty parent, return the empty array
-  if (parent.content.size == 0) { return Mark.none }
-
-  // When inside a text node, just return the text node's marks
-  if (this.textOffset) { return parent.child(index).marks }
-
-  var main = parent.maybeChild(index - 1), other = parent.maybeChild(index);
-  // If the `after` flag is true of there is no node before, make
-  // the node after this position the main reference.
-  if (!main) { var tmp = main; main = other; other = tmp; }
-
-  // Use all marks in the main node, except those that have
-  // `inclusive` set to false and are not present in the other node.
-  var marks = main.marks;
-  for (var i = 0; i < marks.length; i++)
-    { if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))
-      { marks = marks[i--].removeFromSet(marks); } }
-
-  return marks
-};
-
-// :: (ResolvedPos) → ?[Mark]
-// Get the marks after the current position, if any, except those
-// that are non-inclusive and not present at position `$end`. This
-// is mostly useful for getting the set of marks to preserve after a
-// deletion. Will return `null` if this position is at the end of
-// its parent node or its parent node isn't a textblock (in which
-// case no marks should be preserved).
-ResolvedPos.prototype.marksAcross = function marksAcross ($end) {
-  var after = this.parent.maybeChild(this.index());
-  if (!after || !after.isInline) { return null }
-
-  var marks = after.marks, next = $end.parent.maybeChild($end.index());
-  for (var i = 0; i < marks.length; i++)
-    { if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))
-      { marks = marks[i--].removeFromSet(marks); } }
-  return marks
-};
-
-// :: (number) → number
-// The depth up to which this position and the given (non-resolved)
-// position share the same parent nodes.
-ResolvedPos.prototype.sharedDepth = function sharedDepth (pos) {
-    var this$1 = this;
-
-  for (var depth = this.depth; depth > 0; depth--)
-    { if (this$1.start(depth) <= pos && this$1.end(depth) >= pos) { return depth } }
-  return 0
-};
-
-// :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange
-// Returns a range based on the place where this position and the
-// given position diverge around block content. If both point into
-// the same textblock, for example, a range around that textblock
-// will be returned. If they point into different blocks, the range
-// around those blocks in their shared ancestor is returned. You can
-// pass in an optional predicate that will be called with a parent
-// node to see if a range into that parent is acceptable.
-ResolvedPos.prototype.blockRange = function blockRange (other, pred) {
-    var this$1 = this;
-    if ( other === void 0 ) { other = this; }
-
-  if (other.pos < this.pos) { return other.blockRange(this) }
-  for (var d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)
-    { if (other.pos <= this$1.end(d) && (!pred || pred(this$1.node(d))))
-      { return new NodeRange(this$1, other, d) } }
-};
-
-// :: (ResolvedPos) → bool
-// Query whether the given position shares the same parent node.
-ResolvedPos.prototype.sameParent = function sameParent (other) {
-  return this.pos - this.parentOffset == other.pos - other.parentOffset
-};
-
-// :: (ResolvedPos) → ResolvedPos
-// Return the greater of this and the given position.
-ResolvedPos.prototype.max = function max (other) {
-  return other.pos > this.pos ? other : this
-};
-
-// :: (ResolvedPos) → ResolvedPos
-// Return the smaller of this and the given position.
-ResolvedPos.prototype.min = function min (other) {
-  return other.pos < this.pos ? other : this
-};
-
-ResolvedPos.prototype.toString = function toString () {
-    var this$1 = this;
-
-  var str = "";
-  for (var i = 1; i <= this.depth; i++)
-    { str += (str ? "/" : "") + this$1.node(i).type.name + "_" + this$1.index(i - 1); }
-  return str + ":" + this.parentOffset
-};
-
-ResolvedPos.resolve = function resolve (doc, pos) {
-  if (!(pos >= 0 && pos <= doc.content.size)) { throw new RangeError("Position " + pos + " out of range") }
-  var path = [];
-  var start = 0, parentOffset = pos;
-  for (var node = doc;;) {
-    var ref = node.content.findIndex(parentOffset);
-      var index = ref.index;
-      var offset = ref.offset;
-    var rem = parentOffset - offset;
-    path.push(node, index, start + offset);
-    if (!rem) { break }
-    node = node.child(index);
-    if (node.isText) { break }
-    parentOffset = rem - 1;
-    start += offset + 1;
-  }
-  return new ResolvedPos(pos, path, parentOffset)
-};
-
-ResolvedPos.resolveCached = function resolveCached (doc, pos) {
-  for (var i = 0; i < resolveCache.length; i++) {
-    var cached = resolveCache[i];
-    if (cached.pos == pos && cached.doc == doc) { return cached }
-  }
-  var result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);
-  resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;
-  return result
-};
-
-Object.defineProperties( ResolvedPos.prototype, prototypeAccessors$3 );
-
-var resolveCache = [];
-var resolveCachePos = 0;
-var resolveCacheSize = 12;
-
-// ::- Represents a flat range of content, i.e. one that starts and
-// ends in the same node.
-var NodeRange = function NodeRange($from, $to, depth) {
-  // :: ResolvedPos A resolved position along the start of the
-  // content. May have a `depth` greater than this object's `depth`
-  // property, since these are the positions that were used to
-  // compute the range, not re-resolved positions directly at its
-  // boundaries.
-  this.$from = $from;
-  // :: ResolvedPos A position along the end of the content. See
-  // caveat for [`$from`](#model.NodeRange.$from).
-  this.$to = $to;
-  // :: number The depth of the node that this range points into.
-  this.depth = depth;
-};
-
-var prototypeAccessors$1$1 = { start: {},end: {},parent: {},startIndex: {},endIndex: {} };
-
-// :: number The position at the start of the range.
-prototypeAccessors$1$1.start.get = function () { return this.$from.before(this.depth + 1) };
-// :: number The position at the end of the range.
-prototypeAccessors$1$1.end.get = function () { return this.$to.after(this.depth + 1) };
-
-// :: Node The parent node that the range points into.
-prototypeAccessors$1$1.parent.get = function () { return this.$from.node(this.depth) };
-// :: number The start index of the range in the parent node.
-prototypeAccessors$1$1.startIndex.get = function () { return this.$from.index(this.depth) };
-// :: number The end index of the range in the parent node.
-prototypeAccessors$1$1.endIndex.get = function () { return this.$to.indexAfter(this.depth) };
-
-Object.defineProperties( NodeRange.prototype, prototypeAccessors$1$1 );
-
-var emptyAttrs = Object.create(null);
-
-// ::- This class represents a node in the tree that makes up a
-// ProseMirror document. So a document is an instance of `Node`, with
-// children that are also instances of `Node`.
-//
-// Nodes are persistent data structures. Instead of changing them, you
-// create new ones with the content you want. Old ones keep pointing
-// at the old document shape. This is made cheaper by sharing
-// structure between the old and new data as much as possible, which a
-// tree shape like this (without back pointers) makes easy.
-//
-// **Do not** directly mutate the properties of a `Node` object. See
-// [the guide](/docs/guide/#doc) for more information.
-var Node = function Node(type, attrs, content, marks) {
-  // :: NodeType
-  // The type of node that this is.
-  this.type = type;
-
-  // :: Object
-  // An object mapping attribute names to values. The kind of
-  // attributes allowed and required are
-  // [determined](#model.NodeSpec.attrs) by the node type.
-  this.attrs = attrs;
-
-  // :: Fragment
-  // A container holding the node's children.
-  this.content = content || Fragment.empty;
-
-  // :: [Mark]
-  // The marks (things like whether it is emphasized or part of a
-  // link) applied to this node.
-  this.marks = marks || Mark.none;
-};
-
-var prototypeAccessors = { nodeSize: {},childCount: {},textContent: {},firstChild: {},lastChild: {},isBlock: {},isTextblock: {},inlineContent: {},isInline: {},isText: {},isLeaf: {},isAtom: {} };
-
-// text:: ?string
-// For text nodes, this contains the node's text content.
-
-// :: number
-// The size of this node, as defined by the integer-based [indexing
-// scheme](/docs/guide/#doc.indexing). For text nodes, this is the
-// amount of characters. For other leaf nodes, it is one. For
-// non-leaf nodes, it is the size of the content plus two (the start
-// and end token).
-prototypeAccessors.nodeSize.get = function () { return this.isLeaf ? 1 : 2 + this.content.size };
-
-// :: number
-// The number of children that the node has.
-prototypeAccessors.childCount.get = function () { return this.content.childCount };
-
-// :: (number) → Node
-// Get the child node at the given index. Raises an error when the
-// index is out of range.
-Node.prototype.child = function child (index) { return this.content.child(index) };
-
-// :: (number) → ?Node
-// Get the child node at the given index, if it exists.
-Node.prototype.maybeChild = function maybeChild (index) { return this.content.maybeChild(index) };
-
-// :: ((node: Node, offset: number, index: number))
-// Call `f` for every child node, passing the node, its offset
-// into this parent node, and its index.
-Node.prototype.forEach = function forEach (f) { this.content.forEach(f); };
-
-// :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)
-// Invoke a callback for all descendant nodes recursively between
-// the given two positions that are relative to start of this node's
-// content. The callback is invoked with the node, its
-// parent-relative position, its parent node, and its child index.
-// When the callback returns false for a given node, that node's
-// children will not be recursed over. The last parameter can be
-// used to specify a starting position to count from.
-Node.prototype.nodesBetween = function nodesBetween (from, to, f, startPos) {
-    if ( startPos === void 0 ) { startPos = 0; }
-
-  this.content.nodesBetween(from, to, f, startPos, this);
-};
-
-// :: ((node: Node, pos: number, parent: Node) → ?bool)
-// Call the given callback for every descendant node. Doesn't
-// descend into a node when the callback returns `false`.
-Node.prototype.descendants = function descendants (f) {
-  this.nodesBetween(0, this.content.size, f);
-};
-
-// :: string
-// Concatenates all the text nodes found in this fragment and its
-// children.
-prototypeAccessors.textContent.get = function () { return this.textBetween(0, this.content.size, "") };
-
-// :: (number, number, ?string, ?string) → string
-// Get all text between positions `from` and `to`. When
-// `blockSeparator` is given, it will be inserted whenever a new
-// block node is started. When `leafText` is given, it'll be
-// inserted for every non-text leaf node encountered.
-Node.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
-  return this.content.textBetween(from, to, blockSeparator, leafText)
-};
-
-// :: ?Node
-// Returns this node's first child, or `null` if there are no
-// children.
-prototypeAccessors.firstChild.get = function () { return this.content.firstChild };
-
-// :: ?Node
-// Returns this node's last child, or `null` if there are no
-// children.
-prototypeAccessors.lastChild.get = function () { return this.content.lastChild };
-
-// :: (Node) → bool
-// Test whether two nodes represent the same piece of document.
-Node.prototype.eq = function eq (other) {
-  return this == other || (this.sameMarkup(other) && this.content.eq(other.content))
-};
-
-// :: (Node) → bool
-// Compare the markup (type, attributes, and marks) of this node to
-// those of another. Returns `true` if both have the same markup.
-Node.prototype.sameMarkup = function sameMarkup (other) {
-  return this.hasMarkup(other.type, other.attrs, other.marks)
-};
-
-// :: (NodeType, ?Object, ?[Mark]) → bool
-// Check whether this node's markup correspond to the given type,
-// attributes, and marks.
-Node.prototype.hasMarkup = function hasMarkup (type, attrs, marks) {
-  return this.type == type &&
-    compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&
-    Mark.sameSet(this.marks, marks || Mark.none)
-};
-
-// :: (?Fragment) → Node
-// Create a new node with the same markup as this node, containing
-// the given content (or empty, if no content is given).
-Node.prototype.copy = function copy (content) {
-    if ( content === void 0 ) { content = null; }
-
-  if (content == this.content) { return this }
-  return new this.constructor(this.type, this.attrs, content, this.marks)
-};
-
-// :: ([Mark]) → Node
-// Create a copy of this node, with the given set of marks instead
-// of the node's own marks.
-Node.prototype.mark = function mark (marks) {
-  return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)
-};
-
-// :: (number, ?number) → Node
-// Create a copy of this node with only the content between the
-// given positions. If `to` is not given, it defaults to the end of
-// the node.
-Node.prototype.cut = function cut (from, to) {
-  if (from == 0 && to == this.content.size) { return this }
-  return this.copy(this.content.cut(from, to))
-};
-
-// :: (number, ?number) → Slice
-// Cut out the part of the document between the given positions, and
-// return it as a `Slice` object.
-Node.prototype.slice = function slice (from, to, includeParents) {
-    if ( to === void 0 ) { to = this.content.size; }
-    if ( includeParents === void 0 ) { includeParents = false; }
-
-  if (from == to) { return Slice.empty }
-
-  var $from = this.resolve(from), $to = this.resolve(to);
-  var depth = includeParents ? 0 : $from.sharedDepth(to);
-  var start = $from.start(depth), node = $from.node(depth);
-  var content = node.content.cut($from.pos - start, $to.pos - start);
-  return new Slice(content, $from.depth - depth, $to.depth - depth)
-};
-
-// :: (number, number, Slice) → Node
-// Replace the part of the document between the given positions with
-// the given slice. The slice must 'fit', meaning its open sides
-// must be able to connect to the surrounding content, and its
-// content nodes must be valid children for the node they are placed
-// into. If any of this is violated, an error of type
-// [`ReplaceError`](#model.ReplaceError) is thrown.
-Node.prototype.replace = function replace$1 (from, to, slice) {
-  return replace(this.resolve(from), this.resolve(to), slice)
-};
-
-// :: (number) → ?Node
-// Find the node directly after the given position.
-Node.prototype.nodeAt = function nodeAt (pos) {
-  for (var node = this;;) {
-    var ref = node.content.findIndex(pos);
-      var index = ref.index;
-      var offset = ref.offset;
-    node = node.maybeChild(index);
-    if (!node) { return null }
-    if (offset == pos || node.isText) { return node }
-    pos -= offset + 1;
-  }
-};
-
-// :: (number) → {node: ?Node, index: number, offset: number}
-// Find the (direct) child node after the given offset, if any,
-// and return it along with its index and offset relative to this
-// node.
-Node.prototype.childAfter = function childAfter (pos) {
-  var ref = this.content.findIndex(pos);
-    var index = ref.index;
-    var offset = ref.offset;
-  return {node: this.content.maybeChild(index), index: index, offset: offset}
-};
-
-// :: (number) → {node: ?Node, index: number, offset: number}
-// Find the (direct) child node before the given offset, if any,
-// and return it along with its index and offset relative to this
-// node.
-Node.prototype.childBefore = function childBefore (pos) {
-  if (pos == 0) { return {node: null, index: 0, offset: 0} }
-  var ref = this.content.findIndex(pos);
-    var index = ref.index;
-    var offset = ref.offset;
-  if (offset < pos) { return {node: this.content.child(index), index: index, offset: offset} }
-  var node = this.content.child(index - 1);
-  return {node: node, index: index - 1, offset: offset - node.nodeSize}
-};
-
-// :: (number) → ResolvedPos
-// Resolve the given position in the document, returning an
-// [object](#model.ResolvedPos) with information about its context.
-Node.prototype.resolve = function resolve (pos) { return ResolvedPos.resolveCached(this, pos) };
-
-Node.prototype.resolveNoCache = function resolveNoCache (pos) { return ResolvedPos.resolve(this, pos) };
-
-// :: (number, number, MarkType) → bool
-// Test whether a mark of the given type occurs in this document
-// between the two given positions.
-Node.prototype.rangeHasMark = function rangeHasMark (from, to, type) {
-  var found = false;
-  if (to > from) { this.nodesBetween(from, to, function (node) {
-    if (type.isInSet(node.marks)) { found = true; }
-    return !found
-  }); }
-  return found
-};
-
-// :: bool
-// True when this is a block (non-inline node)
-prototypeAccessors.isBlock.get = function () { return this.type.isBlock };
-
-// :: bool
-// True when this is a textblock node, a block node with inline
-// content.
-prototypeAccessors.isTextblock.get = function () { return this.type.isTextblock };
-
-// :: bool
-// True when this node has inline content.
-prototypeAccessors.inlineContent.get = function () { return this.type.inlineContent };
-
-// :: bool
-// True when this is an inline node (a text node or a node that can
-// appear among text).
-prototypeAccessors.isInline.get = function () { return this.type.isInline };
-
-// :: bool
-// True when this is a text node.
-prototypeAccessors.isText.get = function () { return this.type.isText };
-
-// :: bool
-// True when this is a leaf node.
-prototypeAccessors.isLeaf.get = function () { return this.type.isLeaf };
-
-// :: bool
-// True when this is an atom, i.e. when it does not have directly
-// editable content. This is usually the same as `isLeaf`, but can
-// be configured with the [`atom` property](#model.NodeSpec.atom) on
-// a node's spec (typically used when the node is displayed as an
-// uneditable [node view](#view.NodeView)).
-prototypeAccessors.isAtom.get = function () { return this.type.isAtom };
-
-// :: () → string
-// Return a string representation of this node for debugging
-// purposes.
-Node.prototype.toString = function toString () {
-  if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
-  var name = this.type.name;
-  if (this.content.size)
-    { name += "(" + this.content.toStringInner() + ")"; }
-  return wrapMarks(this.marks, name)
-};
-
-// :: (number) → ContentMatch
-// Get the content match in this node at the given index.
-Node.prototype.contentMatchAt = function contentMatchAt (index) {
-  return this.type.contentMatch.matchFragment(this.content, 0, index)
-};
-
-// :: (number, number, ?Fragment, ?number, ?number) → bool
-// Test whether replacing the range between `from` and `to` (by
-// child index) with the given replacement fragment (which defaults
-// to the empty fragment) would leave the node's content valid. You
-// can optionally pass `start` and `end` indices into the
-// replacement fragment.
-Node.prototype.canReplace = function canReplace (from, to, replacement, start, end) {
-    var this$1 = this;
-    if ( replacement === void 0 ) { replacement = Fragment.empty; }
-    if ( start === void 0 ) { start = 0; }
-    if ( end === void 0 ) { end = replacement.childCount; }
-
-  var one = this.contentMatchAt(from).matchFragment(replacement, start, end);
-  var two = one && one.matchFragment(this.content, to);
-  if (!two || !two.validEnd) { return false }
-  for (var i = start; i < end; i++) { if (!this$1.type.allowsMarks(replacement.child(i).marks)) { return false } }
-  return true
-};
-
-// :: (number, number, NodeType, ?[Mark]) → bool
-// Test whether replacing the range `from` to `to` (by index) with a
-// node of the given type would leave the node's content valid.
-Node.prototype.canReplaceWith = function canReplaceWith (from, to, type, marks) {
-  if (marks && !this.type.allowsMarks(marks)) { return false }
-  var start = this.contentMatchAt(from).matchType(type);
-  var end = start && start.matchFragment(this.content, to);
-  return end ? end.validEnd : false
-};
-
-// :: (Node) → bool
-// Test whether the given node's content could be appended to this
-// node. If that node is empty, this will only return true if there
-// is at least one node type that can appear in both nodes (to avoid
-// merging completely incompatible nodes).
-Node.prototype.canAppend = function canAppend (other) {
-  if (other.content.size) { return this.canReplace(this.childCount, this.childCount, other.content) }
-  else { return this.type.compatibleContent(other.type) }
-};
-
-// Unused. Left for backwards compatibility.
-Node.prototype.defaultContentType = function defaultContentType (at) {
-  return this.contentMatchAt(at).defaultType
-};
-
-// :: ()
-// Check whether this node and its descendants conform to the
-// schema, and raise error when they do not.
-Node.prototype.check = function check () {
-  if (!this.type.validContent(this.content))
-    { throw new RangeError(("Invalid content for node " + (this.type.name) + ": " + (this.content.toString().slice(0, 50)))) }
-  this.content.forEach(function (node) { return node.check(); });
-};
-
-// :: () → Object
-// Return a JSON-serializeable representation of this node.
-Node.prototype.toJSON = function toJSON () {
-    var this$1 = this;
-
-  var obj = {type: this.type.name};
-  for (var _ in this$1.attrs) {
-    obj.attrs = this$1.attrs;
-    break
-  }
-  if (this.content.size)
-    { obj.content = this.content.toJSON(); }
-  if (this.marks.length)
-    { obj.marks = this.marks.map(function (n) { return n.toJSON(); }); }
-  return obj
-};
-
-// :: (Schema, Object) → Node
-// Deserialize a node from its JSON representation.
-Node.fromJSON = function fromJSON (schema, json) {
-  if (!json) { throw new RangeError("Invalid input for Node.fromJSON") }
-  var marks = null;
-  if (json.marks) {
-    if (!Array.isArray(json.marks)) { throw new RangeError("Invalid mark data for Node.fromJSON") }
-    marks = json.marks.map(schema.markFromJSON);
-  }
-  if (json.type == "text") {
-    if (typeof json.text != "string") { throw new RangeError("Invalid text node in JSON") }
-    return schema.text(json.text, marks)
-  }
-  var content = Fragment.fromJSON(schema, json.content);
-  return schema.nodeType(json.type).create(json.attrs, content, marks)
-};
-
-Object.defineProperties( Node.prototype, prototypeAccessors );
-
-var TextNode = (function (Node) {
-  function TextNode(type, attrs, content, marks) {
-    Node.call(this, type, attrs, null, marks);
-
-    if (!content) { throw new RangeError("Empty text nodes are not allowed") }
-
-    this.text = content;
-  }
-
-  if ( Node ) { TextNode.__proto__ = Node; }
-  TextNode.prototype = Object.create( Node && Node.prototype );
-  TextNode.prototype.constructor = TextNode;
-
-  var prototypeAccessors$1 = { textContent: {},nodeSize: {} };
-
-  TextNode.prototype.toString = function toString () {
-    if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
-    return wrapMarks(this.marks, JSON.stringify(this.text))
-  };
-
-  prototypeAccessors$1.textContent.get = function () { return this.text };
-
-  TextNode.prototype.textBetween = function textBetween (from, to) { return this.text.slice(from, to) };
-
-  prototypeAccessors$1.nodeSize.get = function () { return this.text.length };
-
-  TextNode.prototype.mark = function mark (marks) {
-    return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)
-  };
-
-  TextNode.prototype.withText = function withText (text) {
-    if (text == this.text) { return this }
-    return new TextNode(this.type, this.attrs, text, this.marks)
-  };
-
-  TextNode.prototype.cut = function cut (from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.text.length; }
-
-    if (from == 0 && to == this.text.length) { return this }
-    return this.withText(this.text.slice(from, to))
-  };
-
-  TextNode.prototype.eq = function eq (other) {
-    return this.sameMarkup(other) && this.text == other.text
-  };
-
-  TextNode.prototype.toJSON = function toJSON () {
-    var base = Node.prototype.toJSON.call(this);
-    base.text = this.text;
-    return base
-  };
-
-  Object.defineProperties( TextNode.prototype, prototypeAccessors$1 );
-
-  return TextNode;
-}(Node));
-
-function wrapMarks(marks, str) {
-  for (var i = marks.length - 1; i >= 0; i--)
-    { str = marks[i].type.name + "(" + str + ")"; }
-  return str
-}
-
-// ::- Instances of this class represent a match state of a node
-// type's [content expression](#model.NodeSpec.content), and can be
-// used to find out whether further content matches here, and whether
-// a given position is a valid end of the node.
-var ContentMatch = function ContentMatch(validEnd) {
-  // :: bool
-  // True when this match state represents a valid end of the node.
-  this.validEnd = validEnd;
-  this.next = [];
-  this.wrapCache = [];
-};
-
-var prototypeAccessors$5 = { inlineContent: {},defaultType: {},edgeCount: {} };
-
-ContentMatch.parse = function parse (string, nodeTypes) {
-  var stream = new TokenStream(string, nodeTypes);
-  if (stream.next == null) { return ContentMatch.empty }
-  var expr = parseExpr(stream);
-  if (stream.next) { stream.err("Unexpected trailing text"); }
-  var match = dfa(nfa(expr));
-  checkForDeadEnds(match, stream);
-  return match
-};
-
-// :: (NodeType) → ?ContentMatch
-// Match a node type, returning a match after that node if
-// successful.
-ContentMatch.prototype.matchType = function matchType (type) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.next.length; i += 2)
-    { if (this$1.next[i] == type) { return this$1.next[i + 1] } }
-  return null
-};
-
-// :: (Fragment, ?number, ?number) → ?ContentMatch
-// Try to match a fragment. Returns the resulting match when
-// successful.
-ContentMatch.prototype.matchFragment = function matchFragment (frag, start, end) {
-    if ( start === void 0 ) { start = 0; }
-    if ( end === void 0 ) { end = frag.childCount; }
-
-  var cur = this;
-  for (var i = start; cur && i < end; i++)
-    { cur = cur.matchType(frag.child(i).type); }
-  return cur
-};
-
-prototypeAccessors$5.inlineContent.get = function () {
-  var first = this.next[0];
-  return first ? first.isInline : false
-};
-
-// :: ?NodeType
-// Get the first matching node type at this match position that can
-// be generated.
-prototypeAccessors$5.defaultType.get = function () {
-    var this$1 = this;
-
-  for (var i = 0; i < this.next.length; i += 2) {
-    var type = this$1.next[i];
-    if (!(type.isText || type.hasRequiredAttrs())) { return type }
-  }
-};
-
-ContentMatch.prototype.compatible = function compatible (other) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.next.length; i += 2)
-    { for (var j = 0; j < other.next.length; j += 2)
-      { if (this$1.next[i] == other.next[j]) { return true } } }
-  return false
-};
-
-// :: (Fragment, bool, ?number) → ?Fragment
-// Try to match the given fragment, and if that fails, see if it can
-// be made to match by inserting nodes in front of it. When
-// successful, return a fragment of inserted nodes (which may be
-// empty if nothing had to be inserted). When `toEnd` is true, only
-// return a fragment if the resulting match goes to the end of the
-// content expression.
-ContentMatch.prototype.fillBefore = function fillBefore (after, toEnd, startIndex) {
-    if ( toEnd === void 0 ) { toEnd = false; }
-    if ( startIndex === void 0 ) { startIndex = 0; }
-
-  var seen = [this];
-  function search(match, types) {
-    var finished = match.matchFragment(after, startIndex);
-    if (finished && (!toEnd || finished.validEnd))
-      { return Fragment.from(types.map(function (tp) { return tp.createAndFill(); })) }
-
-    for (var i = 0; i < match.next.length; i += 2) {
-      var type = match.next[i], next = match.next[i + 1];
-      if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {
-        seen.push(next);
-        var found = search(next, types.concat(type));
-        if (found) { return found }
-      }
-    }
-  }
-
-  return search(this, [])
-};
-
-// :: (NodeType) → ?[NodeType]
-// Find a set of wrapping node types that would allow a node of the
-// given type to appear at this position. The result may be empty
-// (when it fits directly) and will be null when no such wrapping
-// exists.
-ContentMatch.prototype.findWrapping = function findWrapping (target) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.wrapCache.length; i += 2)
-    { if (this$1.wrapCache[i] == target) { return this$1.wrapCache[i + 1] } }
-  var computed = this.computeWrapping(target);
-  this.wrapCache.push(target, computed);
-  return computed
-};
-
-ContentMatch.prototype.computeWrapping = function computeWrapping (target) {
-  var seen = Object.create(null), active = [{match: this, type: null, via: null}];
-  while (active.length) {
-    var current = active.shift(), match = current.match;
-    if (match.matchType(target)) {
-      var result = [];
-      for (var obj = current; obj.type; obj = obj.via)
-        { result.push(obj.type); }
-      return result.reverse()
-    }
-    for (var i = 0; i < match.next.length; i += 2) {
-      var type = match.next[i];
-      if (!type.isLeaf && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {
-        active.push({match: type.contentMatch, type: type, via: current});
-        seen[type.name] = true;
-      }
-    }
-  }
-};
-
-// :: number
-// The number of outgoing edges this node has in the finite
-// automaton that describes the content expression.
-prototypeAccessors$5.edgeCount.get = function () {
-  return this.next.length >> 1
-};
-
-// :: (number) → {type: NodeType, next: ContentMatch}
-// Get the _n_th outgoing edge from this node in the finite
-// automaton that describes the content expression.
-ContentMatch.prototype.edge = function edge (n) {
-  var i = n << 1;
-  if (i > this.next.length) { throw new RangeError(("There's no " + n + "th edge in this content match")) }
-  return {type: this.next[i], next: this.next[i + 1]}
-};
-
-ContentMatch.prototype.toString = function toString () {
-  var seen = [];
-  function scan(m) {
-    seen.push(m);
-    for (var i = 1; i < m.next.length; i += 2)
-      { if (seen.indexOf(m.next[i]) == -1) { scan(m.next[i]); } }
-  }
-  scan(this);
-  return seen.map(function (m, i) {
-    var out = i + (m.validEnd ? "*" : " ") + " ";
-    for (var i$1 = 0; i$1 < m.next.length; i$1 += 2)
-      { out += (i$1 ? ", " : "") + m.next[i$1].name + "->" + seen.indexOf(m.next[i$1 + 1]); }
-    return out
-  }).join("\n")
-};
-
-Object.defineProperties( ContentMatch.prototype, prototypeAccessors$5 );
-
-ContentMatch.empty = new ContentMatch(true);
-
-var TokenStream = function TokenStream(string, nodeTypes) {
-  this.string = string;
-  this.nodeTypes = nodeTypes;
-  this.inline = null;
-  this.pos = 0;
-  this.tokens = string.split(/\s*(?=\b|\W|$)/);
-  if (this.tokens[this.tokens.length - 1] == "") { this.tokens.pop(); }
-  if (this.tokens[0] == "") { this.tokens.unshift(); }
-};
-
-var prototypeAccessors$1$3 = { next: {} };
-
-prototypeAccessors$1$3.next.get = function () { return this.tokens[this.pos] };
-
-TokenStream.prototype.eat = function eat (tok) { return this.next == tok && (this.pos++ || true) };
-
-TokenStream.prototype.err = function err (str) { throw new SyntaxError(str + " (in content expression '" + this.string + "')") };
-
-Object.defineProperties( TokenStream.prototype, prototypeAccessors$1$3 );
-
-function parseExpr(stream) {
-  var exprs = [];
-  do { exprs.push(parseExprSeq(stream)); }
-  while (stream.eat("|"))
-  return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
-}
-
-function parseExprSeq(stream) {
-  var exprs = [];
-  do { exprs.push(parseExprSubscript(stream)); }
-  while (stream.next && stream.next != ")" && stream.next != "|")
-  return exprs.length == 1 ? exprs[0] : {type: "seq", exprs: exprs}
-}
-
-function parseExprSubscript(stream) {
-  var expr = parseExprAtom(stream);
-  for (;;) {
-    if (stream.eat("+"))
-      { expr = {type: "plus", expr: expr}; }
-    else if (stream.eat("*"))
-      { expr = {type: "star", expr: expr}; }
-    else if (stream.eat("?"))
-      { expr = {type: "opt", expr: expr}; }
-    else if (stream.eat("{"))
-      { expr = parseExprRange(stream, expr); }
-    else { break }
-  }
-  return expr
-}
-
-function parseNum(stream) {
-  if (/\D/.test(stream.next)) { stream.err("Expected number, got '" + stream.next + "'"); }
-  var result = Number(stream.next);
-  stream.pos++;
-  return result
-}
-
-function parseExprRange(stream, expr) {
-  var min = parseNum(stream), max = min;
-  if (stream.eat(",")) {
-    if (stream.next != "}") { max = parseNum(stream); }
-    else { max = -1; }
-  }
-  if (!stream.eat("}")) { stream.err("Unclosed braced range"); }
-  return {type: "range", min: min, max: max, expr: expr}
-}
-
-function resolveName(stream, name) {
-  var types = stream.nodeTypes, type = types[name];
-  if (type) { return [type] }
-  var result = [];
-  for (var typeName in types) {
-    var type$1 = types[typeName];
-    if (type$1.groups.indexOf(name) > -1) { result.push(type$1); }
-  }
-  if (result.length == 0) { stream.err("No node type or group '" + name + "' found"); }
-  return result
-}
-
-function parseExprAtom(stream) {
-  if (stream.eat("(")) {
-    var expr = parseExpr(stream);
-    if (!stream.eat(")")) { stream.err("Missing closing paren"); }
-    return expr
-  } else if (!/\W/.test(stream.next)) {
-    var exprs = resolveName(stream, stream.next).map(function (type) {
-      if (stream.inline == null) { stream.inline = type.isInline; }
-      else if (stream.inline != type.isInline) { stream.err("Mixing inline and block content"); }
-      return {type: "name", value: type}
-    });
-    stream.pos++;
-    return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
-  } else {
-    stream.err("Unexpected token '" + stream.next + "'");
-  }
-}
-
-// The code below helps compile a regular-expression-like language
-// into a deterministic finite automaton. For a good introduction to
-// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html
-
-// : (Object) → [[{term: ?any, to: number}]]
-// Construct an NFA from an expression as returned by the parser. The
-// NFA is represented as an array of states, which are themselves
-// arrays of edges, which are `{term, to}` objects. The first state is
-// the entry state and the last node is the success state.
-//
-// Note that unlike typical NFAs, the edge ordering in this one is
-// significant, in that it is used to contruct filler content when
-// necessary.
-function nfa(expr) {
-  var nfa = [[]];
-  connect(compile(expr, 0), node());
-  return nfa
-
-  function node() { return nfa.push([]) - 1 }
-  function edge(from, to, term) {
-    var edge = {term: term, to: to};
-    nfa[from].push(edge);
-    return edge
-  }
-  function connect(edges, to) { edges.forEach(function (edge) { return edge.to = to; }); }
-
-  function compile(expr, from) {
-    if (expr.type == "choice") {
-      return expr.exprs.reduce(function (out, expr) { return out.concat(compile(expr, from)); }, [])
-    } else if (expr.type == "seq") {
-      for (var i = 0;; i++) {
-        var next = compile(expr.exprs[i], from);
-        if (i == expr.exprs.length - 1) { return next }
-        connect(next, from = node());
-      }
-    } else if (expr.type == "star") {
-      var loop = node();
-      edge(from, loop);
-      connect(compile(expr.expr, loop), loop);
-      return [edge(loop)]
-    } else if (expr.type == "plus") {
-      var loop$1 = node();
-      connect(compile(expr.expr, from), loop$1);
-      connect(compile(expr.expr, loop$1), loop$1);
-      return [edge(loop$1)]
-    } else if (expr.type == "opt") {
-      return [edge(from)].concat(compile(expr.expr, from))
-    } else if (expr.type == "range") {
-      var cur = from;
-      for (var i$1 = 0; i$1 < expr.min; i$1++) {
-        var next$1 = node();
-        connect(compile(expr.expr, cur), next$1);
-        cur = next$1;
-      }
-      if (expr.max == -1) {
-        connect(compile(expr.expr, cur), cur);
-      } else {
-        for (var i$2 = expr.min; i$2 < expr.max; i$2++) {
-          var next$2 = node();
-          edge(cur, next$2);
-          connect(compile(expr.expr, cur), next$2);
-          cur = next$2;
-        }
-      }
-      return [edge(cur)]
-    } else if (expr.type == "name") {
-      return [edge(from, null, expr.value)]
-    }
-  }
-}
-
-function cmp(a, b) { return a - b }
-
-// Get the set of nodes reachable by null edges from `node`. Omit
-// nodes with only a single null-out-edge, since they may lead to
-// needless duplicated nodes.
-function nullFrom(nfa, node) {
-  var result = [];
-  scan(node);
-  return result.sort(cmp)
-
-  function scan(node) {
-    var edges = nfa[node];
-    if (edges.length == 1 && !edges[0].term) { return scan(edges[0].to) }
-    result.push(node);
-    for (var i = 0; i < edges.length; i++) {
-      var ref = edges[i];
-      var term = ref.term;
-      var to = ref.to;
-      if (!term && result.indexOf(to) == -1) { scan(to); }
-    }
-  }
-}
-
-// : ([[{term: ?any, to: number}]]) → ContentMatch
-// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set
-// of state objects (`ContentMatch` instances) with transitions
-// between them.
-function dfa(nfa) {
-  var labeled = Object.create(null);
-  return explore(nullFrom(nfa, 0))
-
-  function explore(states) {
-    var out = [];
-    states.forEach(function (node) {
-      nfa[node].forEach(function (ref) {
-        var term = ref.term;
-        var to = ref.to;
-
-        if (!term) { return }
-        var known = out.indexOf(term), set = known > -1 && out[known + 1];
-        nullFrom(nfa, to).forEach(function (node) {
-          if (!set) { out.push(term, set = []); }
-          if (set.indexOf(node) == -1) { set.push(node); }
-        });
-      });
-    });
-    var state = labeled[states.join(",")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);
-    for (var i = 0; i < out.length; i += 2) {
-      var states$1 = out[i + 1].sort(cmp);
-      state.next.push(out[i], labeled[states$1.join(",")] || explore(states$1));
-    }
-    return state
-  }
-}
-
-function checkForDeadEnds(match, stream) {
-  for (var i = 0, work = [match]; i < work.length; i++) {
-    var state = work[i], dead = !state.validEnd, nodes = [];
-    for (var j = 0; j < state.next.length; j += 2) {
-      var node = state.next[j], next = state.next[j + 1];
-      nodes.push(node.name);
-      if (dead && !(node.isText || node.hasRequiredAttrs())) { dead = false; }
-      if (work.indexOf(next) == -1) { work.push(next); }
-    }
-    if (dead) { stream.err("Only non-generatable nodes (" + nodes.join(", ") + ") in a required position"); }
-  }
-}
-
-// For node types where all attrs have a default value (or which don't
-// have any attributes), build up a single reusable default attribute
-// object, and use it for all nodes that don't specify specific
-// attributes.
-function defaultAttrs(attrs) {
-  var defaults = Object.create(null);
-  for (var attrName in attrs) {
-    var attr = attrs[attrName];
-    if (!attr.hasDefault) { return null }
-    defaults[attrName] = attr.default;
-  }
-  return defaults
-}
-
-function computeAttrs(attrs, value) {
-  var built = Object.create(null);
-  for (var name in attrs) {
-    var given = value && value[name];
-    if (given === undefined) {
-      var attr = attrs[name];
-      if (attr.hasDefault) { given = attr.default; }
-      else { throw new RangeError("No value supplied for attribute " + name) }
-    }
-    built[name] = given;
-  }
-  return built
-}
-
-function initAttrs(attrs) {
-  var result = Object.create(null);
-  if (attrs) { for (var name in attrs) { result[name] = new Attribute(attrs[name]); } }
-  return result
-}
-
-// ::- Node types are objects allocated once per `Schema` and used to
-// [tag](#model.Node.type) `Node` instances. They contain information
-// about the node type, such as its name and what kind of node it
-// represents.
-var NodeType = function NodeType(name, schema, spec) {
-  // :: string
-  // The name the node type has in this schema.
-  this.name = name;
-
-  // :: Schema
-  // A link back to the `Schema` the node type belongs to.
-  this.schema = schema;
-
-  // :: NodeSpec
-  // The spec that this type is based on
-  this.spec = spec;
-
-  this.groups = spec.group ? spec.group.split(" ") : [];
-  this.attrs = initAttrs(spec.attrs);
-
-  this.defaultAttrs = defaultAttrs(this.attrs);
-
-  // :: ContentMatch
-  // The starting match of the node type's content expression.
-  this.contentMatch = null;
-
-  // : ?[MarkType]
-  // The set of marks allowed in this node. `null` means all marks
-  // are allowed.
-  this.markSet = null;
-
-  // :: bool
-  // True if this node type has inline content.
-  this.inlineContent = null;
-
-  // :: bool
-  // True if this is a block type
-  this.isBlock = !(spec.inline || name == "text");
-
-  // :: bool
-  // True if this is the text node type.
-  this.isText = name == "text";
-};
-
-var prototypeAccessors$4 = { isInline: {},isTextblock: {},isLeaf: {},isAtom: {} };
-
-// :: bool
-// True if this is an inline type.
-prototypeAccessors$4.isInline.get = function () { return !this.isBlock };
-
-// :: bool
-// True if this is a textblock type, a block that contains inline
-// content.
-prototypeAccessors$4.isTextblock.get = function () { return this.isBlock && this.inlineContent };
-
-// :: bool
-// True for node types that allow no content.
-prototypeAccessors$4.isLeaf.get = function () { return this.contentMatch == ContentMatch.empty };
-
-// :: bool
-// True when this node is an atom, i.e. when it does not have
-// directly editable content.
-prototypeAccessors$4.isAtom.get = function () { return this.isLeaf || this.spec.atom };
-
-NodeType.prototype.hasRequiredAttrs = function hasRequiredAttrs (ignore) {
-    var this$1 = this;
-
-  for (var n in this$1.attrs)
-    { if (this$1.attrs[n].isRequired && (!ignore || !(n in ignore))) { return true } }
-  return false
-};
-
-NodeType.prototype.compatibleContent = function compatibleContent (other) {
-  return this == other || this.contentMatch.compatible(other.contentMatch)
-};
-
-NodeType.prototype.computeAttrs = function computeAttrs$1 (attrs) {
-  if (!attrs && this.defaultAttrs) { return this.defaultAttrs }
-  else { return computeAttrs(this.attrs, attrs) }
-};
-
-// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-// Create a `Node` of this type. The given attributes are
-// checked and defaulted (you can pass `null` to use the type's
-// defaults entirely, if no required attributes exist). `content`
-// may be a `Fragment`, a node, an array of nodes, or
-// `null`. Similarly `marks` may be `null` to default to the empty
-// set of marks.
-NodeType.prototype.create = function create (attrs, content, marks) {
-  if (this.isText) { throw new Error("NodeType.create can't construct text nodes") }
-  return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))
-};
-
-// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-// Like [`create`](#model.NodeType.create), but check the given content
-// against the node type's content restrictions, and throw an error
-// if it doesn't match.
-NodeType.prototype.createChecked = function createChecked (attrs, content, marks) {
-  content = Fragment.from(content);
-  if (!this.validContent(content))
-    { throw new RangeError("Invalid content for node " + this.name) }
-  return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))
-};
-
-// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → ?Node
-// Like [`create`](#model.NodeType.create), but see if it is necessary to
-// add nodes to the start or end of the given fragment to make it
-// fit the node. If no fitting wrapping can be found, return null.
-// Note that, due to the fact that required nodes can always be
-// created, this will always succeed if you pass null or
-// `Fragment.empty` as content.
-NodeType.prototype.createAndFill = function createAndFill (attrs, content, marks) {
-  attrs = this.computeAttrs(attrs);
-  content = Fragment.from(content);
-  if (content.size) {
-    var before = this.contentMatch.fillBefore(content);
-    if (!before) { return null }
-    content = before.append(content);
-  }
-  var after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true);
-  if (!after) { return null }
-  return new Node(this, attrs, content.append(after), Mark.setFrom(marks))
-};
-
-// :: (Fragment) → bool
-// Returns true if the given fragment is valid content for this node
-// type with the given attributes.
-NodeType.prototype.validContent = function validContent (content) {
-    var this$1 = this;
-
-  var result = this.contentMatch.matchFragment(content);
-  if (!result || !result.validEnd) { return false }
-  for (var i = 0; i < content.childCount; i++)
-    { if (!this$1.allowsMarks(content.child(i).marks)) { return false } }
-  return true
-};
-
-// :: (MarkType) → bool
-// Check whether the given mark type is allowed in this node.
-NodeType.prototype.allowsMarkType = function allowsMarkType (markType) {
-  return this.markSet == null || this.markSet.indexOf(markType) > -1
-};
-
-// :: ([Mark]) → bool
-// Test whether the given set of marks are allowed in this node.
-NodeType.prototype.allowsMarks = function allowsMarks (marks) {
-    var this$1 = this;
-
-  if (this.markSet == null) { return true }
-  for (var i = 0; i < marks.length; i++) { if (!this$1.allowsMarkType(marks[i].type)) { return false } }
-  return true
-};
-
-// :: ([Mark]) → [Mark]
-// Removes the marks that are not allowed in this node from the given set.
-NodeType.prototype.allowedMarks = function allowedMarks (marks) {
-    var this$1 = this;
-
-  if (this.markSet == null) { return marks }
-  var copy;
-  for (var i = 0; i < marks.length; i++) {
-    if (!this$1.allowsMarkType(marks[i].type)) {
-      if (!copy) { copy = marks.slice(0, i); }
-    } else if (copy) {
-      copy.push(marks[i]);
-    }
-  }
-  return !copy ? marks : copy.length ? copy : Mark.empty
-};
-
-NodeType.compile = function compile (nodes, schema) {
-  var result = Object.create(null);
-  nodes.forEach(function (name, spec) { return result[name] = new NodeType(name, schema, spec); });
-
-  var topType = schema.spec.topNode || "doc";
-  if (!result[topType]) { throw new RangeError("Schema is missing its top node type ('" + topType + "')") }
-  if (!result.text) { throw new RangeError("Every schema needs a 'text' type") }
-  for (var _ in result.text.attrs) { throw new RangeError("The text node type should not have attributes") }
-
-  return result
-};
-
-Object.defineProperties( NodeType.prototype, prototypeAccessors$4 );
-
-// Attribute descriptors
-
-var Attribute = function Attribute(options) {
-  this.hasDefault = Object.prototype.hasOwnProperty.call(options, "default");
-  this.default = options.default;
-};
-
-var prototypeAccessors$1$2 = { isRequired: {} };
-
-prototypeAccessors$1$2.isRequired.get = function () {
-  return !this.hasDefault
-};
-
-Object.defineProperties( Attribute.prototype, prototypeAccessors$1$2 );
-
-// Marks
-
-// ::- Like nodes, marks (which are associated with nodes to signify
-// things like emphasis or being part of a link) are
-// [tagged](#model.Mark.type) with type objects, which are
-// instantiated once per `Schema`.
-var MarkType = function MarkType(name, rank, schema, spec) {
-  // :: string
-  // The name of the mark type.
-  this.name = name;
-
-  // :: Schema
-  // The schema that this mark type instance is part of.
-  this.schema = schema;
-
-  // :: MarkSpec
-  // The spec on which the type is based.
-  this.spec = spec;
-
-  this.attrs = initAttrs(spec.attrs);
-
-  this.rank = rank;
-  this.excluded = null;
-  var defaults = defaultAttrs(this.attrs);
-  this.instance = defaults && new Mark(this, defaults);
-};
-
-// :: (?Object) → Mark
-// Create a mark of this type. `attrs` may be `null` or an object
-// containing only some of the mark's attributes. The others, if
-// they have defaults, will be added.
-MarkType.prototype.create = function create (attrs) {
-  if (!attrs && this.instance) { return this.instance }
-  return new Mark(this, computeAttrs(this.attrs, attrs))
-};
-
-MarkType.compile = function compile (marks, schema) {
-  var result = Object.create(null), rank = 0;
-  marks.forEach(function (name, spec) { return result[name] = new MarkType(name, rank++, schema, spec); });
-  return result
-};
-
-// :: ([Mark]) → [Mark]
-// When there is a mark of this type in the given set, a new set
-// without it is returned. Otherwise, the input set is returned.
-MarkType.prototype.removeFromSet = function removeFromSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (set[i].type == this$1)
-      { return set.slice(0, i).concat(set.slice(i + 1)) } }
-  return set
-};
-
-// :: ([Mark]) → ?Mark
-// Tests whether there is a mark of this type in the given set.
-MarkType.prototype.isInSet = function isInSet (set) {
-    var this$1 = this;
-
-  for (var i = 0; i < set.length; i++)
-    { if (set[i].type == this$1) { return set[i] } }
-};
-
-// :: (MarkType) → bool
-// Queries whether a given mark type is
-// [excluded](#model.MarkSpec.excludes) by this one.
-MarkType.prototype.excludes = function excludes (other) {
-  return this.excluded.indexOf(other) > -1
-};
-
-// SchemaSpec:: interface
-// An object describing a schema, as passed to the [`Schema`](#model.Schema)
-// constructor.
-//
-//   nodes:: union<Object<NodeSpec>, OrderedMap<NodeSpec>>
-//   The node types in this schema. Maps names to
-//   [`NodeSpec`](#model.NodeSpec) objects that describe the node type
-//   associated with that name. Their order is significant—it
-//   determines which [parse rules](#model.NodeSpec.parseDOM) take
-//   precedence by default, and which nodes come first in a given
-//   [group](#model.NodeSpec.group).
-//
-//   marks:: ?union<Object<MarkSpec>, OrderedMap<MarkSpec>>
-//   The mark types that exist in this schema. The order in which they
-//   are provided determines the order in which [mark
-//   sets](#model.Mark.addToSet) are sorted and in which [parse
-//   rules](#model.MarkSpec.parseDOM) are tried.
-//
-//   topNode:: ?string
-//   The name of the default top-level node for the schema. Defaults
-//   to `"doc"`.
-
-// NodeSpec:: interface
-//
-//   content:: ?string
-//   The content expression for this node, as described in the [schema
-//   guide](/docs/guide/#schema.content_expressions). When not given,
-//   the node does not allow any content.
-//
-//   marks:: ?string
-//   The marks that are allowed inside of this node. May be a
-//   space-separated string referring to mark names or groups, `"_"`
-//   to explicitly allow all marks, or `""` to disallow marks. When
-//   not given, nodes with inline content default to allowing all
-//   marks, other nodes default to not allowing marks.
-//
-//   group:: ?string
-//   The group or space-separated groups to which this node belongs,
-//   which can be referred to in the content expressions for the
-//   schema.
-//
-//   inline:: ?bool
-//   Should be set to true for inline nodes. (Implied for text nodes.)
-//
-//   atom:: ?bool
-//   Can be set to true to indicate that, though this isn't a [leaf
-//   node](#model.NodeType.isLeaf), it doesn't have directly editable
-//   content and should be treated as a single unit in the view.
-//
-//   attrs:: ?Object<AttributeSpec>
-//   The attributes that nodes of this type get.
-//
-//   selectable:: ?bool
-//   Controls whether nodes of this type can be selected as a [node
-//   selection](#state.NodeSelection). Defaults to true for non-text
-//   nodes.
-//
-//   draggable:: ?bool
-//   Determines whether nodes of this type can be dragged without
-//   being selected. Defaults to false.
-//
-//   code:: ?bool
-//   Can be used to indicate that this node contains code, which
-//   causes some commands to behave differently.
-//
-//   defining:: ?bool
-//   Determines whether this node is considered an important parent
-//   node during replace operations (such as paste). Non-defining (the
-//   default) nodes get dropped when their entire content is replaced,
-//   whereas defining nodes persist and wrap the inserted content.
-//   Likewise, in _inserted_ content the defining parents of the
-//   content are preserved when possible. Typically,
-//   non-default-paragraph textblock types, and possibly list items,
-//   are marked as defining.
-//
-//   isolating:: ?bool
-//   When enabled (default is false), the sides of nodes of this type
-//   count as boundaries that regular editing operations, like
-//   backspacing or lifting, won't cross. An example of a node that
-//   should probably have this enabled is a table cell.
-//
-//   toDOM:: ?(node: Node) → DOMOutputSpec
-//   Defines the default way a node of this type should be serialized
-//   to DOM/HTML (as used by
-//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).
-//   Should return a DOM node or an [array
-//   structure](#model.DOMOutputSpec) that describes one, with an
-//   optional number zero (“hole”) in it to indicate where the node's
-//   content should be inserted.
-//
-//   For text nodes, the default is to create a text DOM node. Though
-//   it is possible to create a serializer where text is rendered
-//   differently, this is not supported inside the editor, so you
-//   shouldn't override that in your text node spec.
-//
-//   parseDOM:: ?[ParseRule]
-//   Associates DOM parser information with this node, which can be
-//   used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to
-//   automatically derive a parser. The `node` field in the rules is
-//   implied (the name of this node will be filled in automatically).
-//   If you supply your own parser, you do not need to also specify
-//   parsing rules in your schema.
-//
-//   toDebugString:: ?(node: Node) -> string
-//   Defines the default way a node of this type should be serialized
-//   to a string representation for debugging (e.g. in error messages).
-
-// MarkSpec:: interface
-//
-//   attrs:: ?Object<AttributeSpec>
-//   The attributes that marks of this type get.
-//
-//   inclusive:: ?bool
-//   Whether this mark should be active when the cursor is positioned
-//   at its end (or at its start when that is also the start of the
-//   parent node). Defaults to true.
-//
-//   excludes:: ?string
-//   Determines which other marks this mark can coexist with. Should
-//   be a space-separated strings naming other marks or groups of marks.
-//   When a mark is [added](#model.Mark.addToSet) to a set, all marks
-//   that it excludes are removed in the process. If the set contains
-//   any mark that excludes the new mark but is not, itself, excluded
-//   by the new mark, the mark can not be added an the set. You can
-//   use the value `"_"` to indicate that the mark excludes all
-//   marks in the schema.
-//
-//   Defaults to only being exclusive with marks of the same type. You
-//   can set it to an empty string (or any string not containing the
-//   mark's own name) to allow multiple marks of a given type to
-//   coexist (as long as they have different attributes).
-//
-//   group:: ?string
-//   The group or space-separated groups to which this mark belongs.
-//
-//   toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec
-//   Defines the default way marks of this type should be serialized
-//   to DOM/HTML. When the resulting spec contains a hole, that is
-//   where the marked content is placed. Otherwise, it is appended to
-//   the top node.
-//
-//   parseDOM:: ?[ParseRule]
-//   Associates DOM parser information with this mark (see the
-//   corresponding [node spec field](#model.NodeSpec.parseDOM)). The
-//   `mark` field in the rules is implied.
-
-// AttributeSpec:: interface
-//
-// Used to [define](#model.NodeSpec.attrs) attributes on nodes or
-// marks.
-//
-//   default:: ?any
-//   The default value for this attribute, to use when no explicit
-//   value is provided. Attributes that have no default must be
-//   provided whenever a node or mark of a type that has them is
-//   created.
-
-// ::- A document schema. Holds [node](#model.NodeType) and [mark
-// type](#model.MarkType) objects for the nodes and marks that may
-// occur in conforming documents, and provides functionality for
-// creating and deserializing such documents.
-var Schema = function Schema(spec) {
-  var this$1 = this;
-
-  // :: SchemaSpec
-  // The [spec](#model.SchemaSpec) on which the schema is based,
-  // with the added guarantee that its `nodes` and `marks`
-  // properties are
-  // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances
-  // (not raw objects).
-  this.spec = {};
-  for (var prop in spec) { this$1.spec[prop] = spec[prop]; }
-  this.spec.nodes = OrderedMap.from(spec.nodes);
-  this.spec.marks = OrderedMap.from(spec.marks);
-
-  // :: Object<NodeType>
-  // An object mapping the schema's node names to node type objects.
-  this.nodes = NodeType.compile(this.spec.nodes, this);
-
-  // :: Object<MarkType>
-  // A map from mark names to mark type objects.
-  this.marks = MarkType.compile(this.spec.marks, this);
-
-  var contentExprCache = Object.create(null);
-  for (var prop$1 in this$1.nodes) {
-    if (prop$1 in this$1.marks)
-      { throw new RangeError(prop$1 + " can not be both a node and a mark") }
-    var type = this$1.nodes[prop$1], contentExpr = type.spec.content || "", markExpr = type.spec.marks;
-    type.contentMatch = contentExprCache[contentExpr] ||
-      (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this$1.nodes));
-    type.inlineContent = type.contentMatch.inlineContent;
-    type.markSet = markExpr == "_" ? null :
-      markExpr ? gatherMarks(this$1, markExpr.split(" ")) :
-      markExpr == "" || !type.inlineContent ? [] : null;
-  }
-  for (var prop$2 in this$1.marks) {
-    var type$1 = this$1.marks[prop$2], excl = type$1.spec.excludes;
-    type$1.excluded = excl == null ? [type$1] : excl == "" ? [] : gatherMarks(this$1, excl.split(" "));
-  }
-
-  this.nodeFromJSON = this.nodeFromJSON.bind(this);
-  this.markFromJSON = this.markFromJSON.bind(this);
-
-  // :: NodeType
-  // The type of the [default top node](#model.SchemaSpec.topNode)
-  // for this schema.
-  this.topNodeType = this.nodes[this.spec.topNode || "doc"];
-
-  // :: Object
-  // An object for storing whatever values modules may want to
-  // compute and cache per schema. (If you want to store something
-  // in it, try to use property names unlikely to clash.)
-  this.cached = Object.create(null);
-  this.cached.wrappings = Object.create(null);
-};
-
-// :: (union<string, NodeType>, ?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-// Create a node in this schema. The `type` may be a string or a
-// `NodeType` instance. Attributes will be extended
-// with defaults, `content` may be a `Fragment`,
-// `null`, a `Node`, or an array of nodes.
-Schema.prototype.node = function node (type, attrs, content, marks) {
-  if (typeof type == "string")
-    { type = this.nodeType(type); }
-  else if (!(type instanceof NodeType))
-    { throw new RangeError("Invalid node type: " + type) }
-  else if (type.schema != this)
-    { throw new RangeError("Node type from different schema used (" + type.name + ")") }
-
-  return type.createChecked(attrs, content, marks)
-};
-
-// :: (string, ?[Mark]) → Node
-// Create a text node in the schema. Empty text nodes are not
-// allowed.
-Schema.prototype.text = function text (text$1, marks) {
-  var type = this.nodes.text;
-  return new TextNode(type, type.defaultAttrs, text$1, Mark.setFrom(marks))
-};
-
-// :: (union<string, MarkType>, ?Object) → Mark
-// Create a mark with the given type and attributes.
-Schema.prototype.mark = function mark (type, attrs) {
-  if (typeof type == "string") { type = this.marks[type]; }
-  return type.create(attrs)
-};
-
-// :: (Object) → Node
-// Deserialize a node from its JSON representation. This method is
-// bound.
-Schema.prototype.nodeFromJSON = function nodeFromJSON (json) {
-  return Node.fromJSON(this, json)
-};
-
-// :: (Object) → Mark
-// Deserialize a mark from its JSON representation. This method is
-// bound.
-Schema.prototype.markFromJSON = function markFromJSON (json) {
-  return Mark.fromJSON(this, json)
-};
-
-Schema.prototype.nodeType = function nodeType (name) {
-  var found = this.nodes[name];
-  if (!found) { throw new RangeError("Unknown node type: " + name) }
-  return found
-};
-
-function gatherMarks(schema, marks) {
-  var found = [];
-  for (var i = 0; i < marks.length; i++) {
-    var name = marks[i], mark = schema.marks[name], ok = mark;
-    if (mark) {
-      found.push(mark);
-    } else {
-      for (var prop in schema.marks) {
-        var mark$1 = schema.marks[prop];
-        if (name == "_" || (mark$1.spec.group && mark$1.spec.group.split(" ").indexOf(name) > -1))
-          { found.push(ok = mark$1); }
-      }
-    }
-    if (!ok) { throw new SyntaxError("Unknown mark type: '" + marks[i] + "'") }
-  }
-  return found
-}
-
-// ParseOptions:: interface
-// These are the options recognized by the
-// [`parse`](#model.DOMParser.parse) and
-// [`parseSlice`](#model.DOMParser.parseSlice) methods.
-//
-//   preserveWhitespace:: ?union<bool, "full">
-//   By default, whitespace is collapsed as per HTML's rules. Pass
-//   `true` to preserve whitespace, but normalize newlines to
-//   spaces, and `"full"` to preserve whitespace entirely.
-//
-//   findPositions:: ?[{node: dom.Node, offset: number}]
-//   When given, the parser will, beside parsing the content,
-//   record the document positions of the given DOM positions. It
-//   will do so by writing to the objects, adding a `pos` property
-//   that holds the document position. DOM positions that are not
-//   in the parsed content will not be written to.
-//
-//   from:: ?number
-//   The child node index to start parsing from.
-//
-//   to:: ?number
-//   The child node index to stop parsing at.
-//
-//   topNode:: ?Node
-//   By default, the content is parsed into the schema's default
-//   [top node type](#model.Schema.topNodeType). You can pass this
-//   option to use the type and attributes from a different node
-//   as the top container.
-//
-//   topMatch:: ?ContentMatch
-//   Provide the starting content match that content parsed into the
-//   top node is matched against.
-//
-//   context:: ?ResolvedPos
-//   A set of additional nodes to count as
-//   [context](#model.ParseRule.context) when parsing, above the
-//   given [top node](#model.ParseOptions.topNode).
-
-// ParseRule:: interface
-// A value that describes how to parse a given DOM node or inline
-// style as a ProseMirror node or mark.
-//
-//   tag:: ?string
-//   A CSS selector describing the kind of DOM elements to match. A
-//   single rule should have _either_ a `tag` or a `style` property.
-//
-//   namespace:: ?string
-//   The namespace to match. This should be used with `tag`.
-//   Nodes are only matched when the namespace matches or this property
-//   is null.
-//
-//   style:: ?string
-//   A CSS property name to match. When given, this rule matches
-//   inline styles that list that property. May also have the form
-//   `"property=value"`, in which case the rule only matches if the
-//   propery's value exactly matches the given value. (For more
-//   complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)
-//   and return undefined to indicate that the match failed.)
-//
-//   priority:: ?number
-//   Can be used to change the order in which the parse rules in a
-//   schema are tried. Those with higher priority come first. Rules
-//   without a priority are counted as having priority 50. This
-//   property is only meaningful in a schema—when directly
-//   constructing a parser, the order of the rule array is used.
-//
-//   context:: ?string
-//   When given, restricts this rule to only match when the current
-//   context—the parent nodes into which the content is being
-//   parsed—matches this expression. Should contain one or more node
-//   names or node group names followed by single or double slashes.
-//   For example `"paragraph/"` means the rule only matches when the
-//   parent node is a paragraph, `"blockquote/paragraph/"` restricts
-//   it to be in a paragraph that is inside a blockquote, and
-//   `"section//"` matches any position inside a section—a double
-//   slash matches any sequence of ancestor nodes. To allow multiple
-//   different contexts, they can be separated by a pipe (`|`)
-//   character, as in `"blockquote/|list_item/"`.
-//
-//   node:: ?string
-//   The name of the node type to create when this rule matches. Only
-//   valid for rules with a `tag` property, not for style rules. Each
-//   rule should have one of a `node`, `mark`, or `ignore` property
-//   (except when it appears in a [node](#model.NodeSpec.parseDOM) or
-//   [mark spec](#model.MarkSpec.parseDOM), in which case the `node`
-//   or `mark` property will be derived from its position).
-//
-//   mark:: ?string
-//   The name of the mark type to wrap the matched content in.
-//
-//   ignore:: ?bool
-//   When true, ignore content that matches this rule.
-//
-//   skip:: ?bool
-//   When true, ignore the node that matches this rule, but do parse
-//   its content.
-//
-//   attrs:: ?Object
-//   Attributes for the node or mark created by this rule. When
-//   `getAttrs` is provided, it takes precedence.
-//
-//   getAttrs:: ?(union<dom.Node, string>) → ?union<Object, false>
-//   A function used to compute the attributes for the node or mark
-//   created by this rule. Can also be used to describe further
-//   conditions the DOM element or style must match. When it returns
-//   `false`, the rule won't match. When it returns null or undefined,
-//   that is interpreted as an empty/default set of attributes.
-//
-//   Called with a DOM Element for `tag` rules, and with a string (the
-//   style's value) for `style` rules.
-//
-//   contentElement:: ?union<string, (dom.Node) → dom.Node>
-//   For `tag` rules that produce non-leaf nodes or marks, by default
-//   the content of the DOM element is parsed as content of the mark
-//   or node. If the child nodes are in a descendent node, this may be
-//   a CSS selector string that the parser must use to find the actual
-//   content element, or a function that returns the actual content
-//   element to the parser.
-//
-//   getContent:: ?(dom.Node, schema: Schema) → Fragment
-//   Can be used to override the content of a matched node. When
-//   present, instead of parsing the node's child nodes, the result of
-//   this function is used.
-//
-//   preserveWhitespace:: ?union<bool, "full">
-//   Controls whether whitespace should be preserved when parsing the
-//   content inside the matched element. `false` means whitespace may
-//   be collapsed, `true` means that whitespace should be preserved
-//   but newlines normalized to spaces, and `"full"` means that
-//   newlines should also be preserved.
-
-// ::- A DOM parser represents a strategy for parsing DOM content into
-// a ProseMirror document conforming to a given schema. Its behavior
-// is defined by an array of [rules](#model.ParseRule).
-var DOMParser = function DOMParser(schema, rules) {
-  var this$1 = this;
-
-  // :: Schema
-  // The schema into which the parser parses.
-  this.schema = schema;
-  // :: [ParseRule]
-  // The set of [parse rules](#model.ParseRule) that the parser
-  // uses, in order of precedence.
-  this.rules = rules;
-  this.tags = [];
-  this.styles = [];
-
-  rules.forEach(function (rule) {
-    if (rule.tag) { this$1.tags.push(rule); }
-    else if (rule.style) { this$1.styles.push(rule); }
-  });
-};
-
-// :: (dom.Node, ?ParseOptions) → Node
-// Parse a document from the content of a DOM node.
-DOMParser.prototype.parse = function parse (dom, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var context = new ParseContext(this, options, false);
-  context.addAll(dom, null, options.from, options.to);
-  return context.finish()
-};
-
-// :: (dom.Node, ?ParseOptions) → Slice
-// Parses the content of the given DOM node, like
-// [`parse`](#model.DOMParser.parse), and takes the same set of
-// options. But unlike that method, which produces a whole node,
-// this one returns a slice that is open at the sides, meaning that
-// the schema constraints aren't applied to the start of nodes to
-// the left of the input and the end of nodes at the end.
-DOMParser.prototype.parseSlice = function parseSlice (dom, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var context = new ParseContext(this, options, true);
-  context.addAll(dom, null, options.from, options.to);
-  return Slice.maxOpen(context.finish())
-};
-
-DOMParser.prototype.matchTag = function matchTag (dom, context) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.tags.length; i++) {
-    var rule = this$1.tags[i];
-    if (matches(dom, rule.tag) &&
-        (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&
-        (!rule.context || context.matchesContext(rule.context))) {
-      if (rule.getAttrs) {
-        var result = rule.getAttrs(dom);
-        if (result === false) { continue }
-        rule.attrs = result;
-      }
-      return rule
-    }
-  }
-};
-
-DOMParser.prototype.matchStyle = function matchStyle (prop, value, context) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.styles.length; i++) {
-    var rule = this$1.styles[i];
-    if (rule.style.indexOf(prop) != 0 ||
-        rule.context && !context.matchesContext(rule.context) ||
-        // Test that the style string either precisely matches the prop,
-        // or has an '=' sign after the prop, followed by the given
-        // value.
-        rule.style.length > prop.length &&
-        (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))
-      { continue }
-    if (rule.getAttrs) {
-      var result = rule.getAttrs(value);
-      if (result === false) { continue }
-      rule.attrs = result;
-    }
-    return rule
-  }
-};
-
-// : (Schema) → [ParseRule]
-DOMParser.schemaRules = function schemaRules (schema) {
-  var result = [];
-  function insert(rule) {
-    var priority = rule.priority == null ? 50 : rule.priority, i = 0;
-    for (; i < result.length; i++) {
-      var next = result[i], nextPriority = next.priority == null ? 50 : next.priority;
-      if (nextPriority < priority) { break }
-    }
-    result.splice(i, 0, rule);
-  }
-
-  var loop = function ( name ) {
-    var rules = schema.marks[name].spec.parseDOM;
-    if (rules) { rules.forEach(function (rule) {
-      insert(rule = copy(rule));
-      rule.mark = name;
-    }); }
-  };
-
-    for (var name in schema.marks) { loop( name ); }
-  var loop$1 = function ( name ) {
-    var rules$1 = schema.nodes[name$1].spec.parseDOM;
-    if (rules$1) { rules$1.forEach(function (rule) {
-      insert(rule = copy(rule));
-      rule.node = name$1;
-    }); }
-  };
-
-    for (var name$1 in schema.nodes) { loop$1( name ); }
-  return result
-};
-
-// :: (Schema) → DOMParser
-// Construct a DOM parser using the parsing rules listed in a
-// schema's [node specs](#model.NodeSpec.parseDOM), reordered by
-// [priority](#model.ParseRule.priority).
-DOMParser.fromSchema = function fromSchema (schema) {
-  return schema.cached.domParser ||
-    (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))
-};
-
-// : Object<bool> The block-level tags in HTML5
-var blockTags = {
-  address: true, article: true, aside: true, blockquote: true, canvas: true,
-  dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,
-  footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,
-  h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,
-  output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true
-};
-
-// : Object<bool> The tags that we normally ignore.
-var ignoreTags = {
-  head: true, noscript: true, object: true, script: true, style: true, title: true
-};
-
-// : Object<bool> List tags.
-var listTags = {ol: true, ul: true};
-
-// Using a bitfield for node context options
-var OPT_PRESERVE_WS = 1;
-var OPT_PRESERVE_WS_FULL = 2;
-var OPT_OPEN_LEFT = 4;
-
-function wsOptionsFor(preserveWhitespace) {
-  return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === "full" ? OPT_PRESERVE_WS_FULL : 0)
-}
-
-var NodeContext = function NodeContext(type, attrs, marks, solid, match, options) {
-  this.type = type;
-  this.attrs = attrs;
-  this.solid = solid;
-  this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);
-  this.options = options;
-  this.content = [];
-  this.marks = marks;
-  this.activeMarks = Mark.none;
-};
-
-NodeContext.prototype.findWrapping = function findWrapping (node) {
-  if (!this.match) {
-    if (!this.type) { return [] }
-    var fill = this.type.contentMatch.fillBefore(Fragment.from(node));
-    if (fill) {
-      this.match = this.type.contentMatch.matchFragment(fill);
-    } else {
-      var start = this.type.contentMatch, wrap;
-      if (wrap = start.findWrapping(node.type)) {
-        this.match = start;
-        return wrap
-      } else {
-        return null
-      }
-    }
-  }
-  return this.match.findWrapping(node.type)
-};
-
-NodeContext.prototype.finish = function finish (openEnd) {
-  if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace
-    var last = this.content[this.content.length - 1], m;
-    if (last && last.isText && (m = /\s+$/.exec(last.text))) {
-      if (last.text.length == m[0].length) { this.content.pop(); }
-      else { this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length)); }
-    }
-  }
-  var content = Fragment.from(this.content);
-  if (!openEnd && this.match)
-    { content = content.append(this.match.fillBefore(Fragment.empty, true)); }
-  return this.type ? this.type.create(this.attrs, content, this.marks) : content
-};
-
-var ParseContext = function ParseContext(parser, options, open) {
-  // : DOMParser The parser we are using.
-  this.parser = parser;
-  // : Object The options passed to this parse.
-  this.options = options;
-  this.isOpen = open;
-  this.pendingMarks = [];
-  var topNode = options.topNode, topContext;
-  var topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0);
-  if (topNode)
-    { topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, true,
-                                 options.topMatch || topNode.type.contentMatch, topOptions); }
-  else if (open)
-    { topContext = new NodeContext(null, null, Mark.none, true, null, topOptions); }
-  else
-    { topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, true, null, topOptions); }
-  this.nodes = [topContext];
-  // : [Mark] The current set of marks
-  this.open = 0;
-  this.find = options.findPositions;
-  this.needsBlock = false;
-};
-
-var prototypeAccessors$6 = { top: {},currentPos: {} };
-
-prototypeAccessors$6.top.get = function () {
-  return this.nodes[this.open]
-};
-
-// : (dom.Node)
-// Add a DOM node to the content. Text is inserted as text node,
-// otherwise, the node is passed to `addElement` or, if it has a
-// `style` attribute, `addElementWithStyles`.
-ParseContext.prototype.addDOM = function addDOM (dom) {
-    var this$1 = this;
-
-  if (dom.nodeType == 3) {
-    this.addTextNode(dom);
-  } else if (dom.nodeType == 1) {
-    var style = dom.getAttribute("style");
-    var marks = style ? this.readStyles(parseStyles(style)) : null;
-    if (marks != null) { for (var i = 0; i < marks.length; i++) { this$1.addPendingMark(marks[i]); } }
-    this.addElement(dom);
-    if (marks != null) { for (var i$1 = 0; i$1 < marks.length; i$1++) { this$1.removePendingMark(marks[i$1]); } }
-  }
-};
-
-ParseContext.prototype.addTextNode = function addTextNode (dom) {
-  var value = dom.nodeValue;
-  var top = this.top;
-  if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /\S/.test(value)) {
-    if (!(top.options & OPT_PRESERVE_WS)) {
-      value = value.replace(/\s+/g, " ");
-      // If this starts with whitespace, and there is either no node
-      // before it or a node that ends with whitespace, strip the
-      // leading space.
-      if (/^\s/.test(value) && this.open == this.nodes.length - 1) {
-        var nodeBefore = top.content[top.content.length - 1];
-        if (!nodeBefore || nodeBefore.isText && /\s$/.test(nodeBefore.text))
-          { value = value.slice(1); }
-      }
-    } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {
-      value = value.replace(/\r?\n|\r/g, " ");
-    }
-    if (value) { this.insertNode(this.parser.schema.text(value)); }
-    this.findInText(dom);
-  } else {
-    this.findInside(dom);
-  }
-};
-
-// : (dom.Element)
-// Try to find a handler for the given tag and use that to parse. If
-// none is found, the element's content nodes are added directly.
-ParseContext.prototype.addElement = function addElement (dom) {
-  var name = dom.nodeName.toLowerCase();
-  if (listTags.hasOwnProperty(name)) { normalizeList(dom); }
-  var rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) || this.parser.matchTag(dom, this);
-  if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
-    this.findInside(dom);
-  } else if (!rule || rule.skip) {
-    if (rule && rule.skip.nodeType) { dom = rule.skip; }
-    var sync, top = this.top, oldNeedsBlock = this.needsBlock;
-    if (blockTags.hasOwnProperty(name)) {
-      sync = true;
-      if (!top.type) { this.needsBlock = true; }
-    }
-    this.addAll(dom);
-    if (sync) { this.sync(top); }
-    this.needsBlock = oldNeedsBlock;
-  } else {
-    this.addElementByRule(dom, rule);
-  }
-};
-
-// Run any style parser associated with the node's styles. Either
-// return an array of marks, or null to indicate some of the styles
-// had a rule with `ignore` set.
-ParseContext.prototype.readStyles = function readStyles (styles) {
-    var this$1 = this;
-
-  var marks = Mark.none;
-  for (var i = 0; i < styles.length; i += 2) {
-    var rule = this$1.parser.matchStyle(styles[i], styles[i + 1], this$1);
-    if (!rule) { continue }
-    if (rule.ignore) { return null }
-    marks = this$1.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks);
-  }
-  return marks
-};
-
-// : (dom.Element, ParseRule) → bool
-// Look up a handler for the given node. If none are found, return
-// false. Otherwise, apply it, use its return value to drive the way
-// the node's content is wrapped, and return true.
-ParseContext.prototype.addElementByRule = function addElementByRule (dom, rule) {
-    var this$1 = this;
-
-  var sync, nodeType, markType, mark;
-  if (rule.node) {
-    nodeType = this.parser.schema.nodes[rule.node];
-    if (nodeType.isLeaf) { this.insertNode(nodeType.create(rule.attrs)); }
-    else { sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace); }
-  } else {
-    markType = this.parser.schema.marks[rule.mark];
-    mark = markType.create(rule.attrs);
-    this.addPendingMark(mark);
-  }
-  var startIn = this.top;
-
-  if (nodeType && nodeType.isLeaf) {
-    this.findInside(dom);
-  } else if (rule.getContent) {
-    this.findInside(dom);
-    rule.getContent(dom, this.parser.schema).forEach(function (node) { return this$1.insertNode(node); });
-  } else {
-    var contentDOM = rule.contentElement;
-    if (typeof contentDOM == "string") { contentDOM = dom.querySelector(contentDOM); }
-    else if (typeof contentDOM == "function") { contentDOM = contentDOM(dom); }
-    if (!contentDOM) { contentDOM = dom; }
-    this.findAround(dom, contentDOM, true);
-    this.addAll(contentDOM, sync);
-  }
-  if (sync) { this.sync(startIn); this.open--; }
-  if (mark) { this.removePendingMark(mark); }
-  return true
-};
-
-// : (dom.Node, ?NodeBuilder, ?number, ?number)
-// Add all child nodes between `startIndex` and `endIndex` (or the
-// whole node, if not given). If `sync` is passed, use it to
-// synchronize after every block element.
-ParseContext.prototype.addAll = function addAll (parent, sync, startIndex, endIndex) {
-    var this$1 = this;
-
-  var index = startIndex || 0;
-  for (var dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,
-           end = endIndex == null ? null : parent.childNodes[endIndex];
-       dom != end; dom = dom.nextSibling, ++index) {
-    this$1.findAtPoint(parent, index);
-    this$1.addDOM(dom);
-    if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))
-      { this$1.sync(sync); }
-  }
-  this.findAtPoint(parent, index);
-};
-
-// Try to find a way to fit the given node type into the current
-// context. May add intermediate wrappers and/or leave non-solid
-// nodes that we're in.
-ParseContext.prototype.findPlace = function findPlace (node) {
-    var this$1 = this;
-
-  var route, sync;
-  for (var depth = this.open; depth >= 0; depth--) {
-    var cx = this$1.nodes[depth];
-    var found = cx.findWrapping(node);
-    if (found && (!route || route.length > found.length)) {
-      route = found;
-      sync = cx;
-      if (!found.length) { break }
-    }
-    if (cx.solid) { break }
-  }
-  if (!route) { return false }
-  this.sync(sync);
-  for (var i = 0; i < route.length; i++)
-    { this$1.enterInner(route[i], null, false); }
-  return true
-};
-
-// : (Node) → ?Node
-// Try to insert the given node, adjusting the context when needed.
-ParseContext.prototype.insertNode = function insertNode (node) {
-  if (node.isInline && this.needsBlock && !this.top.type) {
-    var block = this.textblockFromContext();
-    if (block) { this.enterInner(block); }
-  }
-  if (this.findPlace(node)) {
-    this.closeExtra();
-    var top = this.top;
-    this.applyPendingMarks(top);
-    if (top.match) { top.match = top.match.matchType(node.type); }
-    var marks = top.activeMarks;
-    for (var i = 0; i < node.marks.length; i++)
-      { if (!top.type || top.type.allowsMarkType(node.marks[i].type))
-        { marks = node.marks[i].addToSet(marks); } }
-    top.content.push(node.mark(marks));
-  }
-};
-
-ParseContext.prototype.applyPendingMarks = function applyPendingMarks (top) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.pendingMarks.length; i++) {
-    var mark = this$1.pendingMarks[i];
-    if ((!top.type || top.type.allowsMarkType(mark.type)) && !mark.type.isInSet(top.activeMarks)) {
-      top.activeMarks = mark.addToSet(top.activeMarks);
-      this$1.pendingMarks.splice(i--, 1);
-    }
-  }
-};
-
-// : (NodeType, ?Object) → bool
-// Try to start a node of the given type, adjusting the context when
-// necessary.
-ParseContext.prototype.enter = function enter (type, attrs, preserveWS) {
-  var ok = this.findPlace(type.create(attrs));
-  if (ok) {
-    this.applyPendingMarks(this.top);
-    this.enterInner(type, attrs, true, preserveWS);
-  }
-  return ok
-};
-
-// Open a node of the given type
-ParseContext.prototype.enterInner = function enterInner (type, attrs, solid, preserveWS) {
-  this.closeExtra();
-  var top = this.top;
-  top.match = top.match && top.match.matchType(type, attrs);
-  var options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS);
-  if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) { options |= OPT_OPEN_LEFT; }
-  this.nodes.push(new NodeContext(type, attrs, top.activeMarks, solid, null, options));
-  this.open++;
-};
-
-// Make sure all nodes above this.open are finished and added to
-// their parents
-ParseContext.prototype.closeExtra = function closeExtra (openEnd) {
-    var this$1 = this;
-
-  var i = this.nodes.length - 1;
-  if (i > this.open) {
-    for (; i > this.open; i--) { this$1.nodes[i - 1].content.push(this$1.nodes[i].finish(openEnd)); }
-    this.nodes.length = this.open + 1;
-  }
-};
-
-ParseContext.prototype.finish = function finish () {
-  this.open = 0;
-  this.closeExtra(this.isOpen);
-  return this.nodes[0].finish(this.isOpen || this.options.topOpen)
-};
-
-ParseContext.prototype.sync = function sync (to) {
-    var this$1 = this;
-
-  for (var i = this.open; i >= 0; i--) { if (this$1.nodes[i] == to) {
-    this$1.open = i;
-    return
-  } }
-};
-
-ParseContext.prototype.addPendingMark = function addPendingMark (mark) {
-  this.pendingMarks.push(mark);
-};
-
-ParseContext.prototype.removePendingMark = function removePendingMark (mark) {
-  var found = this.pendingMarks.lastIndexOf(mark);
-  if (found > -1) {
-    this.pendingMarks.splice(found, 1);
-  } else {
-    var top = this.top;
-    top.activeMarks = mark.removeFromSet(top.activeMarks);
-  }
-};
-
-prototypeAccessors$6.currentPos.get = function () {
-    var this$1 = this;
-
-  this.closeExtra();
-  var pos = 0;
-  for (var i = this.open; i >= 0; i--) {
-    var content = this$1.nodes[i].content;
-    for (var j = content.length - 1; j >= 0; j--)
-      { pos += content[j].nodeSize; }
-    if (i) { pos++; }
-  }
-  return pos
-};
-
-ParseContext.prototype.findAtPoint = function findAtPoint (parent, offset) {
-    var this$1 = this;
-
-  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].node == parent && this$1.find[i].offset == offset)
-      { this$1.find[i].pos = this$1.currentPos; }
-  } }
-};
-
-ParseContext.prototype.findInside = function findInside (parent) {
-    var this$1 = this;
-
-  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node))
-      { this$1.find[i].pos = this$1.currentPos; }
-  } }
-};
-
-ParseContext.prototype.findAround = function findAround (parent, content, before) {
-    var this$1 = this;
-
-  if (parent != content && this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node)) {
-      var pos = content.compareDocumentPosition(this$1.find[i].node);
-      if (pos & (before ? 2 : 4))
-        { this$1.find[i].pos = this$1.currentPos; }
-    }
-  } }
-};
-
-ParseContext.prototype.findInText = function findInText (textNode) {
-    var this$1 = this;
-
-  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-    if (this$1.find[i].node == textNode)
-      { this$1.find[i].pos = this$1.currentPos - (textNode.nodeValue.length - this$1.find[i].offset); }
-  } }
-};
-
-// : (string) → bool
-// Determines whether the given [context
-// string](#ParseRule.context) matches this context.
-ParseContext.prototype.matchesContext = function matchesContext (context) {
-    var this$1 = this;
-
-  if (context.indexOf("|") > -1)
-    { return context.split(/\s*\|\s*/).some(this.matchesContext, this) }
-
-  var parts = context.split("/");
-  var option = this.options.context;
-  var useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);
-  var minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);
-  var match = function (i, depth) {
-    for (; i >= 0; i--) {
-      var part = parts[i];
-      if (part == "") {
-        if (i == parts.length - 1 || i == 0) { continue }
-        for (; depth >= minDepth; depth--)
-          { if (match(i - 1, depth)) { return true } }
-        return false
-      } else {
-        var next = depth > 0 || (depth == 0 && useRoot) ? this$1.nodes[depth].type
-            : option && depth >= minDepth ? option.node(depth - minDepth).type
-            : null;
-        if (!next || (next.name != part && next.groups.indexOf(part) == -1))
-          { return false }
-        depth--;
-      }
-    }
-    return true
-  };
-  return match(parts.length - 1, this.open)
-};
-
-ParseContext.prototype.textblockFromContext = function textblockFromContext () {
-    var this$1 = this;
-
-  var $context = this.options.context;
-  if ($context) { for (var d = $context.depth; d >= 0; d--) {
-    var deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;
-    if (deflt && deflt.isTextblock && deflt.defaultAttrs) { return deflt }
-  } }
-  for (var name in this$1.parser.schema.nodes) {
-    var type = this$1.parser.schema.nodes[name];
-    if (type.isTextblock && type.defaultAttrs) { return type }
-  }
-};
-
-Object.defineProperties( ParseContext.prototype, prototypeAccessors$6 );
-
-// Kludge to work around directly nested list nodes produced by some
-// tools and allowed by browsers to mean that the nested list is
-// actually part of the list item above it.
-function normalizeList(dom) {
-  for (var child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {
-    var name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;
-    if (name && listTags.hasOwnProperty(name) && prevItem) {
-      prevItem.appendChild(child);
-      child = prevItem;
-    } else if (name == "li") {
-      prevItem = child;
-    } else if (name) {
-      prevItem = null;
-    }
-  }
-}
-
-// Apply a CSS selector.
-function matches(dom, selector) {
-  return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)
-}
-
-// : (string) → [string]
-// Tokenize a style attribute into property/value pairs.
-function parseStyles(style) {
-  var re = /\s*([\w-]+)\s*:\s*([^;]+)/g, m, result = [];
-  while (m = re.exec(style)) { result.push(m[1], m[2].trim()); }
-  return result
-}
-
-function copy(obj) {
-  var copy = {};
-  for (var prop in obj) { copy[prop] = obj[prop]; }
-  return copy
-}
-
-// DOMOutputSpec:: interface
-// A description of a DOM structure. Can be either a string, which is
-// interpreted as a text node, a DOM node, which is interpreted as
-// itself, or an array.
-//
-// An array describes a DOM element. The first value in the array
-// should be a string—the name of the DOM element. If the second
-// element is plain object, it is interpreted as a set of attributes
-// for the element. Any elements after that (including the 2nd if it's
-// not an attribute object) are interpreted as children of the DOM
-// elements, and must either be valid `DOMOutputSpec` values, or the
-// number zero.
-//
-// The number zero (pronounced “hole”) is used to indicate the place
-// where a node's child nodes should be inserted. It it occurs in an
-// output spec, it should be the only child element in its parent
-// node.
-
-// ::- A DOM serializer knows how to convert ProseMirror nodes and
-// marks of various types to DOM nodes.
-var DOMSerializer = function DOMSerializer(nodes, marks) {
-  // :: Object<(node: Node) → DOMOutputSpec>
-  // The node serialization functions.
-  this.nodes = nodes || {};
-  // :: Object<?(mark: Mark, inline: bool) → DOMOutputSpec>
-  // The mark serialization functions.
-  this.marks = marks || {};
-};
-
-// :: (Fragment, ?Object) → dom.DocumentFragment
-// Serialize the content of this fragment to a DOM fragment. When
-// not in the browser, the `document` option, containing a DOM
-// document, should be passed so that the serializer can create
-// nodes.
-DOMSerializer.prototype.serializeFragment = function serializeFragment (fragment, options, target) {
-    var this$1 = this;
-    if ( options === void 0 ) { options = {}; }
-
-  if (!target) { target = doc(options).createDocumentFragment(); }
-
-  var top = target, active = null;
-  fragment.forEach(function (node) {
-    if (active || node.marks.length) {
-      if (!active) { active = []; }
-      var keep = 0, rendered = 0;
-      while (keep < active.length && rendered < node.marks.length) {
-        var next = node.marks[rendered];
-        if (!this$1.marks[next.type.name]) { rendered++; continue }
-        if (!next.eq(active[keep])) { break }
-        keep += 2; rendered++;
-      }
-      while (keep < active.length) {
-        top = active.pop();
-        active.pop();
-      }
-      while (rendered < node.marks.length) {
-        var add = node.marks[rendered++];
-        var markDOM = this$1.serializeMark(add, node.isInline, options);
-        if (markDOM) {
-          active.push(add, top);
-          top.appendChild(markDOM.dom);
-          top = markDOM.contentDOM || markDOM.dom;
-        }
-      }
-    }
-    top.appendChild(this$1.serializeNode(node, options));
-  });
-
-  return target
-};
-
-// :: (Node, ?Object) → dom.Node
-// Serialize this node to a DOM node. This can be useful when you
-// need to serialize a part of a document, as opposed to the whole
-// document. To serialize a whole document, use
-// [`serializeFragment`](#model.DOMSerializer.serializeFragment) on
-// its [content](#model.Node.content).
-DOMSerializer.prototype.serializeNode = function serializeNode (node, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var ref =
-      DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));
-    var dom = ref.dom;
-    var contentDOM = ref.contentDOM;
-  if (contentDOM) {
-    if (node.isLeaf)
-      { throw new RangeError("Content hole not allowed in a leaf node spec") }
-    if (options.onContent)
-      { options.onContent(node, contentDOM, options); }
-    else
-      { this.serializeFragment(node.content, options, contentDOM); }
-  }
-  return dom
-};
-
-DOMSerializer.prototype.serializeNodeAndMarks = function serializeNodeAndMarks (node, options) {
-    var this$1 = this;
-    if ( options === void 0 ) { options = {}; }
-
-  var dom = this.serializeNode(node, options);
-  for (var i = node.marks.length - 1; i >= 0; i--) {
-    var wrap = this$1.serializeMark(node.marks[i], node.isInline, options);
-    if (wrap) {
-      (wrap.contentDOM || wrap.dom).appendChild(dom);
-      dom = wrap.dom;
-    }
-  }
-  return dom
-};
-
-DOMSerializer.prototype.serializeMark = function serializeMark (mark, inline, options) {
-    if ( options === void 0 ) { options = {}; }
-
-  var toDOM = this.marks[mark.type.name];
-  return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))
-};
-
-// :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}
-// Render an [output spec](#model.DOMOutputSpec) to a DOM node. If
-// the spec has a hole (zero) in it, `contentDOM` will point at the
-// node with the hole.
-DOMSerializer.renderSpec = function renderSpec (doc, structure) {
-  if (typeof structure == "string")
-    { return {dom: doc.createTextNode(structure)} }
-  if (structure.nodeType != null)
-    { return {dom: structure} }
-  var dom = doc.createElement(structure[0]), contentDOM = null;
-  var attrs = structure[1], start = 1;
-  if (attrs && typeof attrs == "object" && attrs.nodeType == null && !Array.isArray(attrs)) {
-    start = 2;
-    for (var name in attrs) {
-      if (name == "style") { dom.style.cssText = attrs[name]; }
-      else if (attrs[name] != null) { dom.setAttribute(name, attrs[name]); }
-    }
-  }
-  for (var i = start; i < structure.length; i++) {
-    var child = structure[i];
-    if (child === 0) {
-      if (i < structure.length - 1 || i > start)
-        { throw new RangeError("Content hole must be the only child of its parent node") }
-      return {dom: dom, contentDOM: dom}
-    } else {
-      var ref = DOMSerializer.renderSpec(doc, child);
-        var inner = ref.dom;
-        var innerContent = ref.contentDOM;
-      dom.appendChild(inner);
-      if (innerContent) {
-        if (contentDOM) { throw new RangeError("Multiple content holes") }
-        contentDOM = innerContent;
-      }
-    }
-  }
-  return {dom: dom, contentDOM: contentDOM}
-};
-
-// :: (Schema) → DOMSerializer
-// Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)
-// properties in a schema's node and mark specs.
-DOMSerializer.fromSchema = function fromSchema (schema) {
-  return schema.cached.domSerializer ||
-    (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))
-};
-
-// : (Schema) → Object<(node: Node) → DOMOutputSpec>
-// Gather the serializers in a schema's node specs into an object.
-// This can be useful as a base to build a custom serializer from.
-DOMSerializer.nodesFromSchema = function nodesFromSchema (schema) {
-  var result = gatherToDOM(schema.nodes);
-  if (!result.text) { result.text = function (node) { return node.text; }; }
-  return result
-};
-
-// : (Schema) → Object<(mark: Mark) → DOMOutputSpec>
-// Gather the serializers in a schema's mark specs into an object.
-DOMSerializer.marksFromSchema = function marksFromSchema (schema) {
-  return gatherToDOM(schema.marks)
-};
-
-function gatherToDOM(obj) {
-  var result = {};
-  for (var name in obj) {
-    var toDOM = obj[name].spec.toDOM;
-    if (toDOM) { result[name] = toDOM; }
-  }
-  return result
-}
-
-function doc(options) {
-  // declare global: window
-  return options.document || window.document
-}
-
-exports.Node = Node;
-exports.ResolvedPos = ResolvedPos;
-exports.NodeRange = NodeRange;
-exports.Fragment = Fragment;
-exports.Slice = Slice;
-exports.ReplaceError = ReplaceError;
-exports.Mark = Mark;
-exports.Schema = Schema;
-exports.NodeType = NodeType;
-exports.MarkType = MarkType;
-exports.ContentMatch = ContentMatch;
-exports.DOMParser = DOMParser;
-exports.DOMSerializer = DOMSerializer;
-
-});
-
-unwrapExports(dist);
-var dist_1 = dist.Node;
-var dist_2 = dist.ResolvedPos;
-var dist_3 = dist.NodeRange;
-var dist_4 = dist.Fragment;
-var dist_5 = dist.Slice;
-var dist_6 = dist.ReplaceError;
-var dist_7 = dist.Mark;
-var dist_8 = dist.Schema;
-var dist_9 = dist.NodeType;
-var dist_10 = dist.MarkType;
-var dist_11 = dist.ContentMatch;
-var dist_12 = dist.DOMParser;
-var dist_13 = dist.DOMSerializer;
-
-var dist$1 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-// Mappable:: interface
-// There are several things that positions can be mapped through.
-// Such objects conform to this interface.
-//
-//   map:: (pos: number, assoc: ?number) → number
-//   Map a position through this object. When given, `assoc` (should
-//   be -1 or 1, defaults to 1) determines with which side the
-//   position is associated, which determines in which direction to
-//   move when a chunk of content is inserted at the mapped position.
-//
-//   mapResult:: (pos: number, assoc: ?number) → MapResult
-//   Map a position, and return an object containing additional
-//   information about the mapping. The result's `deleted` field tells
-//   you whether the position was deleted (completely enclosed in a
-//   replaced range) during the mapping. When content on only one side
-//   is deleted, the position itself is only considered deleted when
-//   `assoc` points in the direction of the deleted content.
-
-// Recovery values encode a range index and an offset. They are
-// represented as numbers, because tons of them will be created when
-// mapping, for example, a large number of decorations. The number's
-// lower 16 bits provide the index, the remaining bits the offset.
-//
-// Note: We intentionally don't use bit shift operators to en- and
-// decode these, since those clip to 32 bits, which we might in rare
-// cases want to overflow. A 64-bit float can represent 48-bit
-// integers precisely.
-
-var lower16 = 0xffff;
-var factor16 = Math.pow(2, 16);
-
-function makeRecover(index, offset) { return index + offset * factor16 }
-function recoverIndex(value) { return value & lower16 }
-function recoverOffset(value) { return (value - (value & lower16)) / factor16 }
-
-// ::- An object representing a mapped position with extra
-// information.
-var MapResult = function MapResult(pos, deleted, recover) {
-  if ( deleted === void 0 ) { deleted = false; }
-  if ( recover === void 0 ) { recover = null; }
-
-  // :: number The mapped version of the position.
-  this.pos = pos;
-  // :: bool Tells you whether the position was deleted, that is,
-  // whether the step removed its surroundings from the document.
-  this.deleted = deleted;
-  this.recover = recover;
-};
-
-// :: class extends Mappable
-// A map describing the deletions and insertions made by a step, which
-// can be used to find the correspondence between positions in the
-// pre-step version of a document and the same position in the
-// post-step version.
-var StepMap = function StepMap(ranges, inverted) {
-  if ( inverted === void 0 ) { inverted = false; }
-
-  this.ranges = ranges;
-  this.inverted = inverted;
-};
-
-StepMap.prototype.recover = function recover (value) {
-    var this$1 = this;
-
-  var diff = 0, index = recoverIndex(value);
-  if (!this.inverted) { for (var i = 0; i < index; i++)
-    { diff += this$1.ranges[i * 3 + 2] - this$1.ranges[i * 3 + 1]; } }
-  return this.ranges[index * 3] + diff + recoverOffset(value)
-};
-
-// : (number, ?number) → MapResult
-StepMap.prototype.mapResult = function mapResult (pos, assoc) {
-  if ( assoc === void 0 ) { assoc = 1; }
- return this._map(pos, assoc, false) };
-
-// : (number, ?number) → number
-StepMap.prototype.map = function map (pos, assoc) {
-  if ( assoc === void 0 ) { assoc = 1; }
- return this._map(pos, assoc, true) };
-
-StepMap.prototype._map = function _map (pos, assoc, simple) {
-    var this$1 = this;
-
-  var diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-  for (var i = 0; i < this.ranges.length; i += 3) {
-    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);
-    if (start > pos) { break }
-    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex], end = start + oldSize;
-    if (pos <= end) {
-      var side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;
-      var result = start + diff + (side < 0 ? 0 : newSize);
-      if (simple) { return result }
-      var recover = makeRecover(i / 3, pos - start);
-      return new MapResult(result, assoc < 0 ? pos != start : pos != end, recover)
-    }
-    diff += newSize - oldSize;
-  }
-  return simple ? pos + diff : new MapResult(pos + diff)
-};
-
-StepMap.prototype.touches = function touches (pos, recover) {
-    var this$1 = this;
-
-  var diff = 0, index = recoverIndex(recover);
-  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-  for (var i = 0; i < this.ranges.length; i += 3) {
-    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);
-    if (start > pos) { break }
-    var oldSize = this$1.ranges[i + oldIndex], end = start + oldSize;
-    if (pos <= end && i == index * 3) { return true }
-    diff += this$1.ranges[i + newIndex] - oldSize;
-  }
-  return false
-};
-
-// :: ((oldStart: number, oldEnd: number, newStart: number, newEnd: number))
-// Calls the given function on each of the changed ranges included in
-// this map.
-StepMap.prototype.forEach = function forEach (f) {
-    var this$1 = this;
-
-  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-  for (var i = 0, diff = 0; i < this.ranges.length; i += 3) {
-    var start = this$1.ranges[i], oldStart = start - (this$1.inverted ? diff : 0), newStart = start + (this$1.inverted ? 0 : diff);
-    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex];
-    f(oldStart, oldStart + oldSize, newStart, newStart + newSize);
-    diff += newSize - oldSize;
-  }
-};
-
-// :: () → StepMap
-// Create an inverted version of this map. The result can be used to
-// map positions in the post-step document to the pre-step document.
-StepMap.prototype.invert = function invert () {
-  return new StepMap(this.ranges, !this.inverted)
-};
-
-StepMap.prototype.toString = function toString () {
-  return (this.inverted ? "-" : "") + JSON.stringify(this.ranges)
-};
-
-// :: (n: number) → StepMap
-// Create a map that moves all positions by offset `n` (which may be
-// negative). This can be useful when applying steps meant for a
-// sub-document to a larger document, or vice-versa.
-StepMap.offset = function offset (n) {
-  return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n])
-};
-
-StepMap.empty = new StepMap([]);
-
-// :: class extends Mappable
-// A mapping represents a pipeline of zero or more [step
-// maps](#transform.StepMap). It has special provisions for losslessly
-// handling mapping positions through a series of steps in which some
-// steps are inverted versions of earlier steps. (This comes up when
-// ‘[rebasing](/docs/guide/#transform.rebasing)’ steps for
-// collaboration or history management.)
-var Mapping = function Mapping(maps, mirror, from, to) {
-  // :: [StepMap]
-  // The step maps in this mapping.
-  this.maps = maps || [];
-  // :: number
-  // The starting position in the `maps` array, used when `map` or
-  // `mapResult` is called.
-  this.from = from || 0;
-  // :: number
-  // The end position in the `maps` array.
-  this.to = to == null ? this.maps.length : to;
-  this.mirror = mirror;
-};
-
-// :: (?number, ?number) → Mapping
-// Create a mapping that maps only through a part of this one.
-Mapping.prototype.slice = function slice (from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.maps.length; }
-
-  return new Mapping(this.maps, this.mirror, from, to)
-};
-
-Mapping.prototype.copy = function copy () {
-  return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to)
-};
-
-// :: (StepMap, ?number)
-// Add a step map to the end of this mapping. If `mirrors` is
-// given, it should be the index of the step map that is the mirror
-// image of this one.
-Mapping.prototype.appendMap = function appendMap (map, mirrors) {
-  this.to = this.maps.push(map);
-  if (mirrors != null) { this.setMirror(this.maps.length - 1, mirrors); }
-};
-
-// :: (Mapping)
-// Add all the step maps in a given mapping to this one (preserving
-// mirroring information).
-Mapping.prototype.appendMapping = function appendMapping (mapping) {
-    var this$1 = this;
-
-  for (var i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {
-    var mirr = mapping.getMirror(i);
-    this$1.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : null);
-  }
-};
-
-// :: (number) → ?number
-// Finds the offset of the step map that mirrors the map at the
-// given offset, in this mapping (as per the second argument to
-// `appendMap`).
-Mapping.prototype.getMirror = function getMirror (n) {
-    var this$1 = this;
-
-  if (this.mirror) { for (var i = 0; i < this.mirror.length; i++)
-    { if (this$1.mirror[i] == n) { return this$1.mirror[i + (i % 2 ? -1 : 1)] } } }
-};
-
-Mapping.prototype.setMirror = function setMirror (n, m) {
-  if (!this.mirror) { this.mirror = []; }
-  this.mirror.push(n, m);
-};
-
-// :: (Mapping)
-// Append the inverse of the given mapping to this one.
-Mapping.prototype.appendMappingInverted = function appendMappingInverted (mapping) {
-    var this$1 = this;
-
-  for (var i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {
-    var mirr = mapping.getMirror(i);
-    this$1.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : null);
-  }
-};
-
-// () → Mapping
-// Create an inverted version of this mapping.
-Mapping.prototype.invert = function invert () {
-  var inverse = new Mapping;
-  inverse.appendMappingInverted(this);
-  return inverse
-};
-
-// : (number, ?number) → number
-// Map a position through this mapping.
-Mapping.prototype.map = function map (pos, assoc) {
-    var this$1 = this;
-    if ( assoc === void 0 ) { assoc = 1; }
-
-  if (this.mirror) { return this._map(pos, assoc, true) }
-  for (var i = this.from; i < this.to; i++)
-    { pos = this$1.maps[i].map(pos, assoc); }
-  return pos
-};
-
-// : (number, ?number) → MapResult
-// Map a position through this mapping, returning a mapping
-// result.
-Mapping.prototype.mapResult = function mapResult (pos, assoc) {
-  if ( assoc === void 0 ) { assoc = 1; }
- return this._map(pos, assoc, false) };
-
-Mapping.prototype._map = function _map (pos, assoc, simple) {
-    var this$1 = this;
-
-  var deleted = false, recoverables = null;
-
-  for (var i = this.from; i < this.to; i++) {
-    var map = this$1.maps[i], rec = recoverables && recoverables[i];
-    if (rec != null && map.touches(pos, rec)) {
-      pos = map.recover(rec);
-      continue
-    }
-
-    var result = map.mapResult(pos, assoc);
-    if (result.recover != null) {
-      var corr = this$1.getMirror(i);
-      if (corr != null && corr > i && corr < this$1.to) {
-        if (result.deleted) {
-          i = corr;
-          pos = this$1.maps[corr].recover(result.recover);
-          continue
-        } else {
-          (recoverables || (recoverables = Object.create(null)))[corr] = result.recover;
-        }
-      }
-    }
-
-    if (result.deleted) { deleted = true; }
-    pos = result.pos;
-  }
-
-  return simple ? pos : new MapResult(pos, deleted)
-};
-
-function TransformError(message) {
-  var err = Error.call(this, message);
-  err.__proto__ = TransformError.prototype;
-  return err
-}
-
-TransformError.prototype = Object.create(Error.prototype);
-TransformError.prototype.constructor = TransformError;
-TransformError.prototype.name = "TransformError";
-
-// ::- Abstraction to build up and track an array of
-// [steps](#transform.Step) representing a document transformation.
-//
-// Most transforming methods return the `Transform` object itself, so
-// that they can be chained.
-var Transform = function Transform(doc) {
-  // :: Node
-  // The current document (the result of applying the steps in the
-  // transform).
-  this.doc = doc;
-  // :: [Step]
-  // The steps in this transform.
-  this.steps = [];
-  // :: [Node]
-  // The documents before each of the steps.
-  this.docs = [];
-  // :: Mapping
-  // A mapping with the maps for each of the steps in this transform.
-  this.mapping = new Mapping;
-};
-
-var prototypeAccessors = { before: {},docChanged: {} };
-
-// :: Node The starting document.
-prototypeAccessors.before.get = function () { return this.docs.length ? this.docs[0] : this.doc };
-
-// :: (step: Step) → this
-// Apply a new step in this transform, saving the result. Throws an
-// error when the step fails.
-Transform.prototype.step = function step (object) {
-  var result = this.maybeStep(object);
-  if (result.failed) { throw new TransformError(result.failed) }
-  return this
-};
-
-// :: (Step) → StepResult
-// Try to apply a step in this transformation, ignoring it if it
-// fails. Returns the step result.
-Transform.prototype.maybeStep = function maybeStep (step) {
-  var result = step.apply(this.doc);
-  if (!result.failed) { this.addStep(step, result.doc); }
-  return result
-};
-
-// :: bool
-// True when the document has been changed (when there are any
-// steps).
-prototypeAccessors.docChanged.get = function () {
-  return this.steps.length > 0
-};
-
-Transform.prototype.addStep = function addStep (step, doc) {
-  this.docs.push(this.doc);
-  this.steps.push(step);
-  this.mapping.appendMap(step.getMap());
-  this.doc = doc;
-};
-
-Object.defineProperties( Transform.prototype, prototypeAccessors );
-
-function mustOverride() { throw new Error("Override me") }
-
-var stepsByID = Object.create(null);
-
-// ::- A step object represents an atomic change. It generally applies
-// only to the document it was created for, since the positions
-// stored in it will only make sense for that document.
-//
-// New steps are defined by creating classes that extend `Step`,
-// overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`
-// methods, and registering your class with a unique
-// JSON-serialization identifier using
-// [`Step.jsonID`](#transform.Step^jsonID).
-var Step = function Step () {};
-
-Step.prototype.apply = function apply (_doc) { return mustOverride() };
-
-// :: () → StepMap
-// Get the step map that represents the changes made by this step,
-// and which can be used to transform between positions in the old
-// and the new document.
-Step.prototype.getMap = function getMap () { return StepMap.empty };
-
-// :: (doc: Node) → Step
-// Create an inverted version of this step. Needs the document as it
-// was before the step as argument.
-Step.prototype.invert = function invert (_doc) { return mustOverride() };
-
-// :: (mapping: Mappable) → ?Step
-// Map this step through a mappable thing, returning either a
-// version of that step with its positions adjusted, or `null` if
-// the step was entirely deleted by the mapping.
-Step.prototype.map = function map (_mapping) { return mustOverride() };
-
-// :: (other: Step) → ?Step
-// Try to merge this step with another one, to be applied directly
-// after it. Returns the merged step when possible, null if the
-// steps can't be merged.
-Step.prototype.merge = function merge (_other) { return null };
-
-// :: () → Object
-// Create a JSON-serializeable representation of this step. When
-// defining this for a custom subclass, make sure the result object
-// includes the step type's [JSON id](#transform.Step^jsonID) under
-// the `stepType` property.
-Step.prototype.toJSON = function toJSON () { return mustOverride() };
-
-// :: (Schema, Object) → Step
-// Deserialize a step from its JSON representation. Will call
-// through to the step class' own implementation of this method.
-Step.fromJSON = function fromJSON (schema, json) {
-  if (!json || !json.stepType) { throw new RangeError("Invalid input for Step.fromJSON") }
-  var type = stepsByID[json.stepType];
-  if (!type) { throw new RangeError(("No step type " + (json.stepType) + " defined")) }
-  return type.fromJSON(schema, json)
-};
-
-// :: (string, constructor<Step>)
-// To be able to serialize steps to JSON, each step needs a string
-// ID to attach to its JSON representation. Use this method to
-// register an ID for your step classes. Try to pick something
-// that's unlikely to clash with steps from other modules.
-Step.jsonID = function jsonID (id, stepClass) {
-  if (id in stepsByID) { throw new RangeError("Duplicate use of step JSON ID " + id) }
-  stepsByID[id] = stepClass;
-  stepClass.prototype.jsonID = id;
-  return stepClass
-};
-
-// ::- The result of [applying](#transform.Step.apply) a step. Contains either a
-// new document or a failure value.
-var StepResult = function StepResult(doc, failed) {
-  // :: ?Node The transformed document.
-  this.doc = doc;
-  // :: ?string Text providing information about a failed step.
-  this.failed = failed;
-};
-
-// :: (Node) → StepResult
-// Create a successful step result.
-StepResult.ok = function ok (doc) { return new StepResult(doc, null) };
-
-// :: (string) → StepResult
-// Create a failed step result.
-StepResult.fail = function fail (message) { return new StepResult(null, message) };
-
-// :: (Node, number, number, Slice) → StepResult
-// Call [`Node.replace`](#model.Node.replace) with the given
-// arguments. Create a successful result if it succeeds, and a
-// failed one if it throws a `ReplaceError`.
-StepResult.fromReplace = function fromReplace (doc, from, to, slice) {
-  try {
-    return StepResult.ok(doc.replace(from, to, slice))
-  } catch (e) {
-    if (e instanceof dist.ReplaceError) { return StepResult.fail(e.message) }
-    throw e
-  }
-};
-
-// ::- Replace a part of the document with a slice of new content.
-var ReplaceStep = (function (Step$$1) {
-  function ReplaceStep(from, to, slice, structure) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.slice = slice;
-    this.structure = !!structure;
-  }
-
-  if ( Step$$1 ) { ReplaceStep.__proto__ = Step$$1; }
-  ReplaceStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  ReplaceStep.prototype.constructor = ReplaceStep;
-
-  ReplaceStep.prototype.apply = function apply (doc) {
-    if (this.structure && contentBetween(doc, this.from, this.to))
-      { return StepResult.fail("Structure replace would overwrite content") }
-    return StepResult.fromReplace(doc, this.from, this.to, this.slice)
-  };
-
-  ReplaceStep.prototype.getMap = function getMap () {
-    return new StepMap([this.from, this.to - this.from, this.slice.size])
-  };
-
-  ReplaceStep.prototype.invert = function invert (doc) {
-    return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))
-  };
-
-  ReplaceStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    if (from.deleted && to.deleted) { return null }
-    return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice)
-  };
-
-  ReplaceStep.prototype.merge = function merge (other) {
-    if (!(other instanceof ReplaceStep) || other.structure != this.structure) { return null }
-
-    if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {
-      var slice = this.slice.size + other.slice.size == 0 ? dist.Slice.empty
-          : new dist.Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);
-      return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure)
-    } else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {
-      var slice$1 = this.slice.size + other.slice.size == 0 ? dist.Slice.empty
-          : new dist.Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);
-      return new ReplaceStep(other.from, this.to, slice$1, this.structure)
-    } else {
-      return null
-    }
-  };
-
-  ReplaceStep.prototype.toJSON = function toJSON () {
-    var json = {stepType: "replace", from: this.from, to: this.to};
-    if (this.slice.size) { json.slice = this.slice.toJSON(); }
-    if (this.structure) { json.structure = true; }
-    return json
-  };
-
-  ReplaceStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number")
-      { throw new RangeError("Invalid input for ReplaceStep.fromJSON") }
-    return new ReplaceStep(json.from, json.to, dist.Slice.fromJSON(schema, json.slice), !!json.structure)
-  };
-
-  return ReplaceStep;
-}(Step));
-
-Step.jsonID("replace", ReplaceStep);
-
-// ::- Replace a part of the document with a slice of content, but
-// preserve a range of the replaced content by moving it into the
-// slice.
-var ReplaceAroundStep = (function (Step$$1) {
-  function ReplaceAroundStep(from, to, gapFrom, gapTo, slice, insert, structure) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.gapFrom = gapFrom;
-    this.gapTo = gapTo;
-    this.slice = slice;
-    this.insert = insert;
-    this.structure = !!structure;
-  }
-
-  if ( Step$$1 ) { ReplaceAroundStep.__proto__ = Step$$1; }
-  ReplaceAroundStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  ReplaceAroundStep.prototype.constructor = ReplaceAroundStep;
-
-  ReplaceAroundStep.prototype.apply = function apply (doc) {
-    if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||
-                           contentBetween(doc, this.gapTo, this.to)))
-      { return StepResult.fail("Structure gap-replace would overwrite content") }
-
-    var gap = doc.slice(this.gapFrom, this.gapTo);
-    if (gap.openStart || gap.openEnd)
-      { return StepResult.fail("Gap is not a flat range") }
-    var inserted = this.slice.insertAt(this.insert, gap.content);
-    if (!inserted) { return StepResult.fail("Content does not fit in gap") }
-    return StepResult.fromReplace(doc, this.from, this.to, inserted)
-  };
-
-  ReplaceAroundStep.prototype.getMap = function getMap () {
-    return new StepMap([this.from, this.gapFrom - this.from, this.insert,
-                        this.gapTo, this.to - this.gapTo, this.slice.size - this.insert])
-  };
-
-  ReplaceAroundStep.prototype.invert = function invert (doc) {
-    var gap = this.gapTo - this.gapFrom;
-    return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap,
-                                 this.from + this.insert, this.from + this.insert + gap,
-                                 doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),
-                                 this.gapFrom - this.from, this.structure)
-  };
-
-  ReplaceAroundStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    var gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);
-    if ((from.deleted && to.deleted) || gapFrom < from.pos || gapTo > to.pos) { return null }
-    return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure)
-  };
-
-  ReplaceAroundStep.prototype.toJSON = function toJSON () {
-    var json = {stepType: "replaceAround", from: this.from, to: this.to,
-                gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert};
-    if (this.slice.size) { json.slice = this.slice.toJSON(); }
-    if (this.structure) { json.structure = true; }
-    return json
-  };
-
-  ReplaceAroundStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number" ||
-        typeof json.gapFrom != "number" || typeof json.gapTo != "number" || typeof json.insert != "number")
-      { throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON") }
-    return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo,
-                                 dist.Slice.fromJSON(schema, json.slice), json.insert, !!json.structure)
-  };
-
-  return ReplaceAroundStep;
-}(Step));
-
-Step.jsonID("replaceAround", ReplaceAroundStep);
-
-function contentBetween(doc, from, to) {
-  var $from = doc.resolve(from), dist$$1 = to - from, depth = $from.depth;
-  while (dist$$1 > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {
-    depth--;
-    dist$$1--;
-  }
-  if (dist$$1 > 0) {
-    var next = $from.node(depth).maybeChild($from.indexAfter(depth));
-    while (dist$$1 > 0) {
-      if (!next || next.isLeaf) { return true }
-      next = next.firstChild;
-      dist$$1--;
-    }
-  }
-  return false
-}
-
-function canCut(node, start, end) {
-  return (start == 0 || node.canReplace(start, node.childCount)) &&
-    (end == node.childCount || node.canReplace(0, end))
-}
-
-// :: (NodeRange) → ?number
-// Try to find a target depth to which the content in the given range
-// can be lifted. Will not go across
-// [isolating](#model.NodeSpec.isolating) parent nodes.
-function liftTarget(range) {
-  var parent = range.parent;
-  var content = parent.content.cutByIndex(range.startIndex, range.endIndex);
-  for (var depth = range.depth;; --depth) {
-    var node = range.$from.node(depth);
-    var index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);
-    if (depth < range.depth && node.canReplace(index, endIndex, content))
-      { return depth }
-    if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex)) { break }
-  }
-}
-
-// :: (NodeRange, number) → this
-// Split the content in the given range off from its parent, if there
-// is sibling content before or after it, and move it up the tree to
-// the depth specified by `target`. You'll probably want to use
-// [`liftTarget`](#transform.liftTarget) to compute `target`, to make
-// sure the lift is valid.
-Transform.prototype.lift = function(range, target) {
-  var $from = range.$from;
-  var $to = range.$to;
-  var depth = range.depth;
-
-  var gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);
-  var start = gapStart, end = gapEnd;
-
-  var before = dist.Fragment.empty, openStart = 0;
-  for (var d = depth, splitting = false; d > target; d--)
-    { if (splitting || $from.index(d) > 0) {
-      splitting = true;
-      before = dist.Fragment.from($from.node(d).copy(before));
-      openStart++;
-    } else {
-      start--;
-    } }
-  var after = dist.Fragment.empty, openEnd = 0;
-  for (var d$1 = depth, splitting$1 = false; d$1 > target; d$1--)
-    { if (splitting$1 || $to.after(d$1 + 1) < $to.end(d$1)) {
-      splitting$1 = true;
-      after = dist.Fragment.from($to.node(d$1).copy(after));
-      openEnd++;
-    } else {
-      end++;
-    } }
-
-  return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,
-                                         new dist.Slice(before.append(after), openStart, openEnd),
-                                         before.size - openStart, true))
-};
-
-// :: (NodeRange, NodeType, ?Object, ?NodeRange) → ?[{type: NodeType, attrs: ?Object}]
-// Try to find a valid way to wrap the content in the given range in a
-// node of the given type. May introduce extra nodes around and inside
-// the wrapper node, if necessary. Returns null if no valid wrapping
-// could be found. When `innerRange` is given, that range's content is
-// used as the content to fit into the wrapping, instead of the
-// content of `range`.
-function findWrapping(range, nodeType, attrs, innerRange) {
-  if ( innerRange === void 0 ) { innerRange = range; }
-
-  var around = findWrappingOutside(range, nodeType);
-  var inner = around && findWrappingInside(innerRange, nodeType);
-  if (!inner) { return null }
-  return around.map(withAttrs).concat({type: nodeType, attrs: attrs}).concat(inner.map(withAttrs))
-}
-
-function withAttrs(type) { return {type: type, attrs: null} }
-
-function findWrappingOutside(range, type) {
-  var parent = range.parent;
-  var startIndex = range.startIndex;
-  var endIndex = range.endIndex;
-  var around = parent.contentMatchAt(startIndex).findWrapping(type);
-  if (!around) { return null }
-  var outer = around.length ? around[0] : type;
-  return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null
-}
-
-function findWrappingInside(range, type) {
-  var parent = range.parent;
-  var startIndex = range.startIndex;
-  var endIndex = range.endIndex;
-  var inner = parent.child(startIndex);
-  var inside = type.contentMatch.findWrapping(inner.type);
-  if (!inside) { return null }
-  var lastType = inside.length ? inside[inside.length - 1] : type;
-  var innerMatch = lastType.contentMatch;
-  for (var i = startIndex; innerMatch && i < endIndex; i++)
-    { innerMatch = innerMatch.matchType(parent.child(i).type); }
-  if (!innerMatch || !innerMatch.validEnd) { return null }
-  return inside
-}
-
-// :: (NodeRange, [{type: NodeType, attrs: ?Object}]) → this
-// Wrap the given [range](#model.NodeRange) in the given set of wrappers.
-// The wrappers are assumed to be valid in this position, and should
-// probably be computed with [`findWrapping`](#transform.findWrapping).
-Transform.prototype.wrap = function(range, wrappers) {
-  var content = dist.Fragment.empty;
-  for (var i = wrappers.length - 1; i >= 0; i--)
-    { content = dist.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }
-
-  var start = range.start, end = range.end;
-  return this.step(new ReplaceAroundStep(start, end, start, end, new dist.Slice(content, 0, 0), wrappers.length, true))
-};
-
-// :: (number, ?number, NodeType, ?Object) → this
-// Set the type of all textblocks (partly) between `from` and `to` to
-// the given node type with the given attributes.
-Transform.prototype.setBlockType = function(from, to, type, attrs) {
-  var this$1 = this;
-  if ( to === void 0 ) { to = from; }
-
-  if (!type.isTextblock) { throw new RangeError("Type given to setBlockType should be a textblock") }
-  var mapFrom = this.steps.length;
-  this.doc.nodesBetween(from, to, function (node, pos) {
-    if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this$1.doc, this$1.mapping.slice(mapFrom).map(pos), type)) {
-      // Ensure all markup that isn't allowed in the new node type is cleared
-      this$1.clearIncompatible(this$1.mapping.slice(mapFrom).map(pos, 1), type);
-      var mapping = this$1.mapping.slice(mapFrom);
-      var startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);
-      this$1.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,
-                                      new dist.Slice(dist.Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));
-      return false
-    }
-  });
-  return this
-};
-
-function canChangeType(doc, pos, type) {
-  var $pos = doc.resolve(pos), index = $pos.index();
-  return $pos.parent.canReplaceWith(index, index + 1, type)
-}
-
-// :: (number, ?NodeType, ?Object, ?[Mark]) → this
-// Change the type, attributes, and/or marks of the node at `pos`.
-// When `type` isn't given, the existing node type is preserved,
-Transform.prototype.setNodeMarkup = function(pos, type, attrs, marks) {
-  var node = this.doc.nodeAt(pos);
-  if (!node) { throw new RangeError("No node at given position") }
-  if (!type) { type = node.type; }
-  var newNode = type.create(attrs, null, marks || node.marks);
-  if (node.isLeaf)
-    { return this.replaceWith(pos, pos + node.nodeSize, newNode) }
-
-  if (!type.validContent(node.content))
-    { throw new RangeError("Invalid content for node type " + type.name) }
-
-  return this.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1,
-                                         new dist.Slice(dist.Fragment.from(newNode), 0, 0), 1, true))
-};
-
-// :: (Node, number, number, ?[?{type: NodeType, attrs: ?Object}]) → bool
-// Check whether splitting at the given position is allowed.
-function canSplit(doc, pos, depth, typesAfter) {
-  if ( depth === void 0 ) { depth = 1; }
-
-  var $pos = doc.resolve(pos), base = $pos.depth - depth;
-  var innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;
-  if (base < 0 || $pos.parent.type.spec.isolating ||
-      !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||
-      !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))
-    { return false }
-  for (var d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {
-    var node = $pos.node(d), index$1 = $pos.index(d);
-    if (node.type.spec.isolating) { return false }
-    var rest = node.content.cutByIndex(index$1, node.childCount);
-    var after = (typesAfter && typesAfter[i]) || node;
-    if (after != node) { rest = rest.replaceChild(0, after.type.create(after.attrs)); }
-    if (!node.canReplace(index$1 + 1, node.childCount) || !after.type.validContent(rest))
-      { return false }
-  }
-  var index = $pos.indexAfter(base);
-  var baseType = typesAfter && typesAfter[0];
-  return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type)
-}
-
-// :: (number, ?number, ?[?{type: NodeType, attrs: ?Object}]) → this
-// Split the node at the given position, and optionally, if `depth` is
-// greater than one, any number of nodes above that. By default, the
-// parts split off will inherit the node type of the original node.
-// This can be changed by passing an array of types and attributes to
-// use after the split.
-Transform.prototype.split = function(pos, depth, typesAfter) {
-  if ( depth === void 0 ) { depth = 1; }
-
-  var $pos = this.doc.resolve(pos), before = dist.Fragment.empty, after = dist.Fragment.empty;
-  for (var d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {
-    before = dist.Fragment.from($pos.node(d).copy(before));
-    var typeAfter = typesAfter && typesAfter[i];
-    after = dist.Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));
-  }
-  return this.step(new ReplaceStep(pos, pos, new dist.Slice(before.append(after), depth, depth, true)))
-};
-
-// :: (Node, number) → bool
-// Test whether the blocks before and after a given position can be
-// joined.
-function canJoin(doc, pos) {
-  var $pos = doc.resolve(pos), index = $pos.index();
-  return joinable($pos.nodeBefore, $pos.nodeAfter) &&
-    $pos.parent.canReplace(index, index + 1)
-}
-
-function joinable(a, b) {
-  return a && b && !a.isLeaf && a.canAppend(b)
-}
-
-// :: (Node, number, ?number) → ?number
-// Find an ancestor of the given position that can be joined to the
-// block before (or after if `dir` is positive). Returns the joinable
-// point, if any.
-function joinPoint(doc, pos, dir) {
-  if ( dir === void 0 ) { dir = -1; }
-
-  var $pos = doc.resolve(pos);
-  for (var d = $pos.depth;; d--) {
-    var before = (void 0), after = (void 0);
-    if (d == $pos.depth) {
-      before = $pos.nodeBefore;
-      after = $pos.nodeAfter;
-    } else if (dir > 0) {
-      before = $pos.node(d + 1);
-      after = $pos.node(d).maybeChild($pos.index(d) + 1);
-    } else {
-      before = $pos.node(d).maybeChild($pos.index(d) - 1);
-      after = $pos.node(d + 1);
-    }
-    if (before && !before.isTextblock && joinable(before, after)) { return pos }
-    if (d == 0) { break }
-    pos = dir < 0 ? $pos.before(d) : $pos.after(d);
-  }
-}
-
-// :: (number, ?number) → this
-// Join the blocks around the given position. If depth is 2, their
-// last and first siblings are also joined, and so on.
-Transform.prototype.join = function(pos, depth) {
-  if ( depth === void 0 ) { depth = 1; }
-
-  var step = new ReplaceStep(pos - depth, pos + depth, dist.Slice.empty, true);
-  return this.step(step)
-};
-
-// :: (Node, number, NodeType) → ?number
-// Try to find a point where a node of the given type can be inserted
-// near `pos`, by searching up the node hierarchy when `pos` itself
-// isn't a valid place but is at the start or end of a node. Return
-// null if no position was found.
-function insertPoint(doc, pos, nodeType) {
-  var $pos = doc.resolve(pos);
-  if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) { return pos }
-
-  if ($pos.parentOffset == 0)
-    { for (var d = $pos.depth - 1; d >= 0; d--) {
-      var index = $pos.index(d);
-      if ($pos.node(d).canReplaceWith(index, index, nodeType)) { return $pos.before(d + 1) }
-      if (index > 0) { return null }
-    } }
-  if ($pos.parentOffset == $pos.parent.content.size)
-    { for (var d$1 = $pos.depth - 1; d$1 >= 0; d$1--) {
-      var index$1 = $pos.indexAfter(d$1);
-      if ($pos.node(d$1).canReplaceWith(index$1, index$1, nodeType)) { return $pos.after(d$1 + 1) }
-      if (index$1 < $pos.node(d$1).childCount) { return null }
-    } }
-}
-
-// :: (Node, number, Slice) → ?number
-// Finds a position at or around the given position where the given
-// slice can be inserted. Will look at parent nodes' nearest boundary
-// and try there, even if the original position wasn't directly at the
-// start or end of that node. Returns null when no position was found.
-function dropPoint(doc, pos, slice) {
-  var $pos = doc.resolve(pos);
-  if (!slice.content.size) { return pos }
-  var content = slice.content;
-  for (var i = 0; i < slice.openStart; i++) { content = content.firstChild.content; }
-  for (var pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {
-    for (var d = $pos.depth; d >= 0; d--) {
-      var bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;
-      var insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);
-      if (pass == 1
-          ? $pos.node(d).canReplace(insertPos, insertPos, content)
-          : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))
-        { return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1) }
-    }
-  }
-  return null
-}
-
-function mapFragment(fragment, f, parent) {
-  var mapped = [];
-  for (var i = 0; i < fragment.childCount; i++) {
-    var child = fragment.child(i);
-    if (child.content.size) { child = child.copy(mapFragment(child.content, f, child)); }
-    if (child.isInline) { child = f(child, parent, i); }
-    mapped.push(child);
-  }
-  return dist.Fragment.fromArray(mapped)
-}
-
-// ::- Add a mark to all inline content between two positions.
-var AddMarkStep = (function (Step$$1) {
-  function AddMarkStep(from, to, mark) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.mark = mark;
-  }
-
-  if ( Step$$1 ) { AddMarkStep.__proto__ = Step$$1; }
-  AddMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  AddMarkStep.prototype.constructor = AddMarkStep;
-
-  AddMarkStep.prototype.apply = function apply (doc) {
-    var this$1 = this;
-
-    var oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);
-    var parent = $from.node($from.sharedDepth(this.to));
-    var slice = new dist.Slice(mapFragment(oldSlice.content, function (node, parent) {
-      if (!parent.type.allowsMarkType(this$1.mark.type)) { return node }
-      return node.mark(this$1.mark.addToSet(node.marks))
-    }, parent), oldSlice.openStart, oldSlice.openEnd);
-    return StepResult.fromReplace(doc, this.from, this.to, slice)
-  };
-
-  AddMarkStep.prototype.invert = function invert () {
-    return new RemoveMarkStep(this.from, this.to, this.mark)
-  };
-
-  AddMarkStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
-    return new AddMarkStep(from.pos, to.pos, this.mark)
-  };
-
-  AddMarkStep.prototype.merge = function merge (other) {
-    if (other instanceof AddMarkStep &&
-        other.mark.eq(this.mark) &&
-        this.from <= other.to && this.to >= other.from)
-      { return new AddMarkStep(Math.min(this.from, other.from),
-                             Math.max(this.to, other.to), this.mark) }
-  };
-
-  AddMarkStep.prototype.toJSON = function toJSON () {
-    return {stepType: "addMark", mark: this.mark.toJSON(),
-            from: this.from, to: this.to}
-  };
-
-  AddMarkStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number")
-      { throw new RangeError("Invalid input for AddMarkStep.fromJSON") }
-    return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
-  };
-
-  return AddMarkStep;
-}(Step));
-
-Step.jsonID("addMark", AddMarkStep);
-
-// ::- Remove a mark from all inline content between two positions.
-var RemoveMarkStep = (function (Step$$1) {
-  function RemoveMarkStep(from, to, mark) {
-    Step$$1.call(this);
-    this.from = from;
-    this.to = to;
-    this.mark = mark;
-  }
-
-  if ( Step$$1 ) { RemoveMarkStep.__proto__ = Step$$1; }
-  RemoveMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-  RemoveMarkStep.prototype.constructor = RemoveMarkStep;
-
-  RemoveMarkStep.prototype.apply = function apply (doc) {
-    var this$1 = this;
-
-    var oldSlice = doc.slice(this.from, this.to);
-    var slice = new dist.Slice(mapFragment(oldSlice.content, function (node) {
-      return node.mark(this$1.mark.removeFromSet(node.marks))
-    }), oldSlice.openStart, oldSlice.openEnd);
-    return StepResult.fromReplace(doc, this.from, this.to, slice)
-  };
-
-  RemoveMarkStep.prototype.invert = function invert () {
-    return new AddMarkStep(this.from, this.to, this.mark)
-  };
-
-  RemoveMarkStep.prototype.map = function map (mapping) {
-    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-    if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
-    return new RemoveMarkStep(from.pos, to.pos, this.mark)
-  };
-
-  RemoveMarkStep.prototype.merge = function merge (other) {
-    if (other instanceof RemoveMarkStep &&
-        other.mark.eq(this.mark) &&
-        this.from <= other.to && this.to >= other.from)
-      { return new RemoveMarkStep(Math.min(this.from, other.from),
-                                Math.max(this.to, other.to), this.mark) }
-  };
-
-  RemoveMarkStep.prototype.toJSON = function toJSON () {
-    return {stepType: "removeMark", mark: this.mark.toJSON(),
-            from: this.from, to: this.to}
-  };
-
-  RemoveMarkStep.fromJSON = function fromJSON (schema, json) {
-    if (typeof json.from != "number" || typeof json.to != "number")
-      { throw new RangeError("Invalid input for RemoveMarkStep.fromJSON") }
-    return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
-  };
-
-  return RemoveMarkStep;
-}(Step));
-
-Step.jsonID("removeMark", RemoveMarkStep);
-
-// :: (number, number, Mark) → this
-// Add the given mark to the inline content between `from` and `to`.
-Transform.prototype.addMark = function(from, to, mark) {
-  var this$1 = this;
-
-  var removed = [], added = [], removing = null, adding = null;
-  this.doc.nodesBetween(from, to, function (node, pos, parent) {
-    if (!node.isInline) { return }
-    var marks = node.marks;
-    if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {
-      var start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);
-      var newSet = mark.addToSet(marks);
-
-      for (var i = 0; i < marks.length; i++) {
-        if (!marks[i].isInSet(newSet)) {
-          if (removing && removing.to == start && removing.mark.eq(marks[i]))
-            { removing.to = end; }
-          else
-            { removed.push(removing = new RemoveMarkStep(start, end, marks[i])); }
-        }
-      }
-
-      if (adding && adding.to == start)
-        { adding.to = end; }
-      else
-        { added.push(adding = new AddMarkStep(start, end, mark)); }
-    }
-  });
-
-  removed.forEach(function (s) { return this$1.step(s); });
-  added.forEach(function (s) { return this$1.step(s); });
-  return this
-};
-
-// :: (number, number, ?union<Mark, MarkType>) → this
-// Remove marks from inline nodes between `from` and `to`. When `mark`
-// is a single mark, remove precisely that mark. When it is a mark type,
-// remove all marks of that type. When it is null, remove all marks of
-// any type.
-Transform.prototype.removeMark = function(from, to, mark) {
-  var this$1 = this;
-  if ( mark === void 0 ) { mark = null; }
-
-  var matched = [], step = 0;
-  this.doc.nodesBetween(from, to, function (node, pos) {
-    if (!node.isInline) { return }
-    step++;
-    var toRemove = null;
-    if (mark instanceof dist.MarkType) {
-      var found = mark.isInSet(node.marks);
-      if (found) { toRemove = [found]; }
-    } else if (mark) {
-      if (mark.isInSet(node.marks)) { toRemove = [mark]; }
-    } else {
-      toRemove = node.marks;
-    }
-    if (toRemove && toRemove.length) {
-      var end = Math.min(pos + node.nodeSize, to);
-      for (var i = 0; i < toRemove.length; i++) {
-        var style = toRemove[i], found$1 = (void 0);
-        for (var j = 0; j < matched.length; j++) {
-          var m = matched[j];
-          if (m.step == step - 1 && style.eq(matched[j].style)) { found$1 = m; }
-        }
-        if (found$1) {
-          found$1.to = end;
-          found$1.step = step;
-        } else {
-          matched.push({style: style, from: Math.max(pos, from), to: end, step: step});
-        }
-      }
-    }
-  });
-  matched.forEach(function (m) { return this$1.step(new RemoveMarkStep(m.from, m.to, m.style)); });
-  return this
-};
-
-// :: (number, NodeType, ?ContentMatch) → this
-// Removes all marks and nodes from the content of the node at `pos`
-// that don't match the given new parent node type. Accepts an
-// optional starting [content match](#model.ContentMatch) as third
-// argument.
-Transform.prototype.clearIncompatible = function(pos, parentType, match) {
-  var this$1 = this;
-  if ( match === void 0 ) { match = parentType.contentMatch; }
-
-  var node = this.doc.nodeAt(pos);
-  var delSteps = [], cur = pos + 1;
-  for (var i = 0; i < node.childCount; i++) {
-    var child = node.child(i), end = cur + child.nodeSize;
-    var allowed = match.matchType(child.type, child.attrs);
-    if (!allowed) {
-      delSteps.push(new ReplaceStep(cur, end, dist.Slice.empty));
-    } else {
-      match = allowed;
-      for (var j = 0; j < child.marks.length; j++) { if (!parentType.allowsMarkType(child.marks[j].type))
-        { this$1.step(new RemoveMarkStep(cur, end, child.marks[j])); } }
-    }
-    cur = end;
-  }
-  if (!match.validEnd) {
-    var fill = match.fillBefore(dist.Fragment.empty, true);
-    this.replace(cur, cur, new dist.Slice(fill, 0, 0));
-  }
-  for (var i$1 = delSteps.length - 1; i$1 >= 0; i$1--) { this$1.step(delSteps[i$1]); }
-  return this
-};
-
-// :: (Node, number, ?number, ?Slice) → ?Step
-// ‘Fit’ a slice into a given position in the document, producing a
-// [step](#transform.Step) that inserts it. Will return null if
-// there's no meaningful way to insert the slice here, or inserting it
-// would be a no-op (an empty slice over an empty range).
-function replaceStep(doc, from, to, slice) {
-  if ( to === void 0 ) { to = from; }
-  if ( slice === void 0 ) { slice = dist.Slice.empty; }
-
-  if (from == to && !slice.size) { return null }
-
-  var $from = doc.resolve(from), $to = doc.resolve(to);
-  // Optimization -- avoid work if it's obvious that it's not needed.
-  if (fitsTrivially($from, $to, slice)) { return new ReplaceStep(from, to, slice) }
-  var placed = placeSlice($from, slice);
-
-  var fittedLeft = fitLeft($from, placed);
-  var fitted = fitRight($from, $to, fittedLeft);
-  if (!fitted) { return null }
-  if (fittedLeft.size != fitted.size && canMoveText($from, $to, fittedLeft)) {
-    var d = $to.depth, after = $to.after(d);
-    while (d > 1 && after == $to.end(--d)) { ++after; }
-    var fittedAfter = fitRight($from, doc.resolve(after), fittedLeft);
-    if (fittedAfter)
-      { return new ReplaceAroundStep(from, after, to, $to.end(), fittedAfter, fittedLeft.size) }
-  }
-  return fitted.size || from != to ? new ReplaceStep(from, to, fitted) : null
-}
-
-// :: (number, ?number, ?Slice) → this
-// Replace the part of the document between `from` and `to` with the
-// given `slice`.
-Transform.prototype.replace = function(from, to, slice) {
-  if ( to === void 0 ) { to = from; }
-  if ( slice === void 0 ) { slice = dist.Slice.empty; }
-
-  var step = replaceStep(this.doc, from, to, slice);
-  if (step) { this.step(step); }
-  return this
-};
-
-// :: (number, number, union<Fragment, Node, [Node]>) → this
-// Replace the given range with the given content, which may be a
-// fragment, node, or array of nodes.
-Transform.prototype.replaceWith = function(from, to, content) {
-  return this.replace(from, to, new dist.Slice(dist.Fragment.from(content), 0, 0))
-};
-
-// :: (number, number) → this
-// Delete the content between the given positions.
-Transform.prototype.delete = function(from, to) {
-  return this.replace(from, to, dist.Slice.empty)
-};
-
-// :: (number, union<Fragment, Node, [Node]>) → this
-// Insert the given content at the given position.
-Transform.prototype.insert = function(pos, content) {
-  return this.replaceWith(pos, pos, content)
-};
-
-
-
-function fitLeftInner($from, depth, placed, placedBelow) {
-  var content = dist.Fragment.empty, openEnd = 0, placedHere = placed[depth];
-  if ($from.depth > depth) {
-    var inner = fitLeftInner($from, depth + 1, placed, placedBelow || placedHere);
-    openEnd = inner.openEnd + 1;
-    content = dist.Fragment.from($from.node(depth + 1).copy(inner.content));
-  }
-
-  if (placedHere) {
-    content = content.append(placedHere.content);
-    openEnd = placedHere.openEnd;
-  }
-  if (placedBelow) {
-    content = content.append($from.node(depth).contentMatchAt($from.indexAfter(depth)).fillBefore(dist.Fragment.empty, true));
-    openEnd = 0;
-  }
-
-  return {content: content, openEnd: openEnd}
-}
-
-function fitLeft($from, placed) {
-  var ref = fitLeftInner($from, 0, placed, false);
-  var content = ref.content;
-  var openEnd = ref.openEnd;
-  return new dist.Slice(content, $from.depth, openEnd || 0)
-}
-
-function fitRightJoin(content, parent, $from, $to, depth, openStart, openEnd) {
-  var match, count = content.childCount, matchCount = count - (openEnd > 0 ? 1 : 0);
-  var parentNode = openStart < 0 ? parent : $from.node(depth);
-  if (openStart < 0)
-    { match = parentNode.contentMatchAt(matchCount); }
-  else if (count == 1 && openEnd > 0)
-    { match = parentNode.contentMatchAt(openStart ? $from.index(depth) : $from.indexAfter(depth)); }
-  else
-    { match = parentNode.contentMatchAt($from.indexAfter(depth))
-      .matchFragment(content, count > 0 && openStart ? 1 : 0, matchCount); }
-
-  var toNode = $to.node(depth);
-  if (openEnd > 0 && depth < $to.depth) {
-    var after = toNode.content.cutByIndex($to.indexAfter(depth)).addToStart(content.lastChild);
-    var joinable$1 = match.fillBefore(after, true);
-    // Can't insert content if there's a single node stretched across this gap
-    if (joinable$1 && joinable$1.size && openStart > 0 && count == 1) { joinable$1 = null; }
-
-    if (joinable$1) {
-      var inner = fitRightJoin(content.lastChild.content, content.lastChild, $from, $to,
-                               depth + 1, count == 1 ? openStart - 1 : -1, openEnd - 1);
-      if (inner) {
-        var last = content.lastChild.copy(inner);
-        if (joinable$1.size)
-          { return content.cutByIndex(0, count - 1).append(joinable$1).addToEnd(last) }
-        else
-          { return content.replaceChild(count - 1, last) }
-      }
-    }
-  }
-  if (openEnd > 0)
-    { match = match.matchType((count == 1 && openStart > 0 ? $from.node(depth + 1) : content.lastChild).type); }
-
-  // If we're here, the next level can't be joined, so we see what
-  // happens if we leave it open.
-  var toIndex = $to.index(depth);
-  if (toIndex == toNode.childCount && !toNode.type.compatibleContent(parent.type)) { return null }
-  var joinable = match.fillBefore(toNode.content, true, toIndex);
-  for (var i = toIndex; joinable && i < toNode.content.childCount; i++)
-    { if (!parentNode.type.allowsMarks(toNode.content.child(i).marks)) { joinable = null; } }
-  if (!joinable) { return null }
-
-  if (openEnd > 0) {
-    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
-                                count == 1 ? openStart - 1 : -1);
-    content = content.replaceChild(count - 1, closed);
-  }
-  content = content.append(joinable);
-  if ($to.depth > depth)
-    { content = content.addToEnd(fitRightSeparate($to, depth + 1)); }
-  return content
-}
-
-function fitRightClosed(node, openEnd, $from, depth, openStart) {
-  var match, content = node.content, count = content.childCount;
-  if (openStart >= 0)
-    { match = $from.node(depth).contentMatchAt($from.indexAfter(depth))
-      .matchFragment(content, openStart > 0 ? 1 : 0, count); }
-  else
-    { match = node.contentMatchAt(count); }
-
-  if (openEnd > 0) {
-    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
-                                count == 1 ? openStart - 1 : -1);
-    content = content.replaceChild(count - 1, closed);
-  }
-
-  return node.copy(content.append(match.fillBefore(dist.Fragment.empty, true)))
-}
-
-function fitRightSeparate($to, depth) {
-  var node = $to.node(depth);
-  var fill = node.contentMatchAt(0).fillBefore(node.content, true, $to.index(depth));
-  if ($to.depth > depth) { fill = fill.addToEnd(fitRightSeparate($to, depth + 1)); }
-  return node.copy(fill)
-}
-
-function normalizeSlice(content, openStart, openEnd) {
-  while (openStart > 0 && openEnd > 0 && content.childCount == 1) {
-    content = content.firstChild.content;
-    openStart--;
-    openEnd--;
-  }
-  return new dist.Slice(content, openStart, openEnd)
-}
-
-// : (ResolvedPos, ResolvedPos, number, Slice) → Slice
-function fitRight($from, $to, slice) {
-  var fitted = fitRightJoin(slice.content, $from.node(0), $from, $to, 0, slice.openStart, slice.openEnd);
-  if (!fitted) { return null }
-  return normalizeSlice(fitted, slice.openStart, $to.depth)
-}
-
-function fitsTrivially($from, $to, slice) {
-  return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&
-    $from.parent.canReplace($from.index(), $to.index(), slice.content)
-}
-
-function canMoveText($from, $to, slice) {
-  if (!$to.parent.isTextblock) { return false }
-
-  var parent = slice.openEnd ? nodeRight(slice.content, slice.openEnd)
-      : $from.node($from.depth - (slice.openStart - slice.openEnd));
-  if (!parent.isTextblock) { return false }
-  for (var i = $to.index(); i < $to.parent.childCount; i++)
-    { if (!parent.type.allowsMarks($to.parent.child(i).marks)) { return false } }
-  var match;
-  if (slice.openEnd) {
-    match = parent.contentMatchAt(parent.childCount);
-  } else {
-    match = parent.contentMatchAt(parent.childCount);
-    if (slice.size) { match = match.matchFragment(slice.content, slice.openStart ? 1 : 0); }
-  }
-  match = match.matchFragment($to.parent.content, $to.index());
-  return match && match.validEnd
-}
-
-function nodeRight(content, depth) {
-  for (var i = 1; i < depth; i++) { content = content.lastChild.content; }
-  return content.lastChild
-}
-
-// Algorithm for 'placing' the elements of a slice into a gap:
-//
-// We consider the content of each node that is open to the left to be
-// independently placeable. I.e. in <p("foo"), p("bar")>, when the
-// paragraph on the left is open, "foo" can be placed (somewhere on
-// the left side of the replacement gap) independently from p("bar").
-//
-// So placeSlice splits up a slice into a number of sub-slices,
-// along with information on where they can be placed on the given
-// left-side edge. It works by walking the open side of the slice,
-// from the inside out, and trying to find a landing spot for each
-// element, by simultaneously scanning over the gap side. When no
-// place is found for an open node's content, it is left in that node.
-
-// : (ResolvedPos, Slice) → [{content: Fragment, openEnd: number, depth: number}]
-function placeSlice($from, slice) {
-  var frontier = new Frontier($from);
-  for (var pass = 1; slice.size && pass <= 3; pass++)
-    { slice = frontier.placeSlice(slice.content, slice.openStart, slice.openEnd, pass); }
-  while (frontier.open.length) { frontier.closeNode(); }
-  return frontier.placed
-}
-
-// Helper class that models the open side of the insert position,
-// keeping track of the content match and already inserted content
-// at each depth.
-var Frontier = function Frontier($pos) {
-  var this$1 = this;
-
-  // : [{parent: Node, match: ContentMatch, content: Fragment, wrapper: bool, openEnd: number, depth: number}]
-  this.open = [];
-  for (var d = 0; d <= $pos.depth; d++) {
-    var parent = $pos.node(d), match = parent.contentMatchAt($pos.indexAfter(d));
-    this$1.open.push({parent: parent, match: match, content: dist.Fragment.empty, wrapper: false, openEnd: 0, depth: d});
-  }
-  this.placed = [];
-};
-
-// : (Fragment, number, number, number, ?Node) → Slice
-// Tries to place the content of the given slice, and returns a
-// slice containing unplaced content.
-//
-// pass 1: try to fit directly
-// pass 2: allow wrapper nodes to be introduced
-// pass 3: allow unwrapping of nodes that aren't open
-Frontier.prototype.placeSlice = function placeSlice (fragment, openStart, openEnd, pass, parent) {
-    var this$1 = this;
-
-  if (openStart > 0) {
-    var first = fragment.firstChild;
-    var inner = this.placeSlice(first.content, Math.max(0, openStart - 1),
-                                openEnd && fragment.childCount == 1 ? openEnd - 1 : 0,
-                                pass, first);
-    if (inner.content != first.content) {
-      if (inner.content.size) {
-        fragment = fragment.replaceChild(0, first.copy(inner.content));
-        openStart = inner.openStart + 1;
-      } else {
-        if (fragment.childCount == 1) { openEnd = 0; }
-        fragment = fragment.cutByIndex(1);
-        openStart = 0;
-      }
-    }
-  }
-  var result = this.placeContent(fragment, openStart, openEnd, pass, parent);
-  if (pass > 2 && result.size && openStart == 0) {
-    for (var i = 0; i < result.content.childCount; i++) {
-      var child = result.content.child(i);
-      this$1.placeContent(child.content, 0,
-                        openEnd && i == result.content.childCount.length - 1 ? openEnd - 1 : 0,
-                        pass, child);
-    }
-    result = dist.Fragment.empty;
-  }
-  return result
-};
-
-Frontier.prototype.placeContent = function placeContent (fragment, openStart, openEnd, pass, parent) {
-    var this$1 = this;
-
-  var i = 0;
-  // Go over the fragment's children
-  for (; i < fragment.childCount; i++) {
-    var child = fragment.child(i), placed = false, last = i == fragment.childCount - 1;
-    // Try each open node in turn, starting from the innermost
-    for (var d = this.open.length - 1; d >= 0; d--) {
-      var open = this$1.open[d], wrap = (void 0);
-
-      // If pass > 1, it is allowed to wrap the node to help find a
-      // fit, so if findWrappeing returns something, we add open
-      // nodes to the frontier for that wrapping.
-      if (pass > 1 && (wrap = open.match.findWrapping(child.type)) &&
-          !(parent && wrap.length && wrap[wrap.length - 1] == parent.type)) {
-        while (this.open.length - 1 > d) { this$1.closeNode(); }
-        for (var w = 0; w < wrap.length; w++) {
-          open.match = open.match.matchType(wrap[w]);
-          d++;
-          open = {parent: wrap[w].create(),
-                  match: wrap[w].contentMatch,
-                  content: dist.Fragment.empty, wrapper: true, openEnd: 0, depth: d + w};
-          this$1.open.push(open);
-        }
-      }
-
-      // See if the child fits here
-      var match = open.match.matchType(child.type);
-      if (!match) {
-        var fill = open.match.fillBefore(dist.Fragment.from(child));
-        if (fill) {
-          for (var j = 0; j < fill.childCount; j++) {
-            var ch = fill.child(j);
-            this$1.addNode(open, ch, 0);
-            match = open.match.matchFragment(ch);
-          }
-        } else if (parent && open.match.matchType(parent.type)) {
-          // Don't continue looking further up if the parent node
-          // would fit here.
-          break
-        } else {
-          continue
-        }
-      }
-
-      // Close open nodes above this one, since we're starting to
-      // add to this.
-      while (this.open.length - 1 > d) { this$1.closeNode(); }
-      // Strip marks from the child or close its start when necessary
-      child = child.mark(open.parent.type.allowedMarks(child.marks));
-      if (openStart) {
-        child = closeNodeStart(child, openStart, last ? openEnd : 0);
-        openStart = 0;
-      }
-      // Add the child to this open node and adjust its metadata
-      this$1.addNode(open, child, last ? openEnd : 0);
-      open.match = match;
-      if (last) { openEnd = 0; }
-      placed = true;
-      break
-    }
-    // As soon as we've failed to place a node we stop looking at
-    // later nodes
-    if (!placed) { break }
-  }
-  // Close the current open node if it's not the the root and we
-  // either placed up to the end of the node or the the current
-  // slice depth's node type matches the open node's type
-  if (this.open.length > 1 &&
-      (i > 0 && i == fragment.childCount ||
-       parent && this.open[this.open.length - 1].parent.type == parent.type))
-    { this.closeNode(); }
-
-  return new dist.Slice(fragment.cutByIndex(i), openStart, openEnd)
-};
-
-Frontier.prototype.addNode = function addNode (open, node, openEnd) {
-  open.content = closeFragmentEnd(open.content, open.openEnd).addToEnd(node);
-  open.openEnd = openEnd;
-};
-
-Frontier.prototype.closeNode = function closeNode () {
-  var open = this.open.pop();
-  if (open.content.size == 0) ; else if (open.wrapper) {
-    this.addNode(this.open[this.open.length - 1], open.parent.copy(open.content), open.openEnd + 1);
-  } else {
-    this.placed[open.depth] = {depth: open.depth, content: open.content, openEnd: open.openEnd};
-  }
-};
-
-function closeNodeStart(node, openStart, openEnd) {
-  var content = node.content;
-  if (openStart > 1) {
-    var first = closeNodeStart(node.firstChild, openStart - 1, node.childCount == 1 ? openEnd - 1 : 0);
-    content = node.content.replaceChild(0, first);
-  }
-  var fill = node.type.contentMatch.fillBefore(content, openEnd == 0);
-  return node.copy(fill.append(content))
-}
-
-function closeNodeEnd(node, depth) {
-  var content = node.content;
-  if (depth > 1) {
-    var last = closeNodeEnd(node.lastChild, depth - 1);
-    content = node.content.replaceChild(node.childCount - 1, last);
-  }
-  var fill = node.contentMatchAt(node.childCount).fillBefore(dist.Fragment.empty, true);
-  return node.copy(content.append(fill))
-}
-
-function closeFragmentEnd(fragment, depth) {
-  return depth ? fragment.replaceChild(fragment.childCount - 1, closeNodeEnd(fragment.lastChild, depth)) : fragment
-}
-
-// :: (number, number, Slice) → this
-// Replace a range of the document with a given slice, using `from`,
-// `to`, and the slice's [`openStart`](#model.Slice.openStart) property
-// as hints, rather than fixed start and end points. This method may
-// grow the replaced area or close open nodes in the slice in order to
-// get a fit that is more in line with WYSIWYG expectations, by
-// dropping fully covered parent nodes of the replaced region when
-// they are marked [non-defining](#model.NodeSpec.defining), or
-// including an open parent node from the slice that _is_ marked as
-// [defining](#model.NodeSpec.defining).
-//
-// This is the method, for example, to handle paste. The similar
-// [`replace`](#transform.Transform.replace) method is a more
-// primitive tool which will _not_ move the start and end of its given
-// range, and is useful in situations where you need more precise
-// control over what happens.
-Transform.prototype.replaceRange = function(from, to, slice) {
-  var this$1 = this;
-
-  if (!slice.size) { return this.deleteRange(from, to) }
-
-  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
-  if (fitsTrivially($from, $to, slice))
-    { return this.step(new ReplaceStep(from, to, slice)) }
-
-  var targetDepths = coveredDepths($from, this.doc.resolve(to));
-  // Can't replace the whole document, so remove 0 if it's present
-  if (targetDepths[targetDepths.length - 1] == 0) { targetDepths.pop(); }
-  // Negative numbers represent not expansion over the whole node at
-  // that depth, but replacing from $from.before(-D) to $to.pos.
-  var preferredTarget = -($from.depth + 1);
-  targetDepths.unshift(preferredTarget);
-  // This loop picks a preferred target depth, if one of the covering
-  // depths is not outside of a defining node, and adds negative
-  // depths for any depth that has $from at its start and does not
-  // cross a defining node.
-  for (var d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {
-    var spec = $from.node(d).type.spec;
-    if (spec.defining || spec.isolating) { break }
-    if (targetDepths.indexOf(d) > -1) { preferredTarget = d; }
-    else if ($from.before(d) == pos) { targetDepths.splice(1, 0, -d); }
-  }
-  // Try to fit each possible depth of the slice into each possible
-  // target depth, starting with the preferred depths.
-  var preferredTargetIndex = targetDepths.indexOf(preferredTarget);
-
-  var leftNodes = [], preferredDepth = slice.openStart;
-  for (var content = slice.content, i = 0;; i++) {
-    var node = content.firstChild;
-    leftNodes.push(node);
-    if (i == slice.openStart) { break }
-    content = node.content;
-  }
-  // Back up if the node directly above openStart, or the node above
-  // that separated only by a non-defining textblock node, is defining.
-  if (preferredDepth > 0 && leftNodes[preferredDepth - 1].type.spec.defining &&
-      $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 1].type)
-    { preferredDepth -= 1; }
-  else if (preferredDepth >= 2 && leftNodes[preferredDepth - 1].isTextblock && leftNodes[preferredDepth - 2].type.spec.defining &&
-           $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 2].type)
-    { preferredDepth -= 2; }
-
-  for (var j = slice.openStart; j >= 0; j--) {
-    var openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);
-    var insert = leftNodes[openDepth];
-    if (!insert) { continue }
-    for (var i$1 = 0; i$1 < targetDepths.length; i$1++) {
-      // Loop over possible expansion levels, starting with the
-      // preferred one
-      var targetDepth = targetDepths[(i$1 + preferredTargetIndex) % targetDepths.length], expand = true;
-      if (targetDepth < 0) { expand = false; targetDepth = -targetDepth; }
-      var parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);
-      if (parent.canReplaceWith(index, index, insert.type, insert.marks))
-        { return this$1.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,
-                            new dist.Slice(closeFragment(slice.content, 0, slice.openStart, openDepth),
-                                      openDepth, slice.openEnd)) }
-    }
-  }
-
-  return this.replace(from, to, slice)
-};
-
-function closeFragment(fragment, depth, oldOpen, newOpen, parent) {
-  if (depth < oldOpen) {
-    var first = fragment.firstChild;
-    fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));
-  }
-  if (depth > newOpen)
-    { fragment = parent.contentMatchAt(0).fillBefore(fragment, true).append(fragment); }
-  return fragment
-}
-
-// :: (number, number, Node) → this
-// Replace the given range with a node, but use `from` and `to` as
-// hints, rather than precise positions. When from and to are the same
-// and are at the start or end of a parent node in which the given
-// node doesn't fit, this method may _move_ them out towards a parent
-// that does allow the given node to be placed. When the given range
-// completely covers a parent node, this method may completely replace
-// that parent node.
-Transform.prototype.replaceRangeWith = function(from, to, node) {
-  if (!node.isInline && from == to && this.doc.resolve(from).parent.content.size) {
-    var point = insertPoint(this.doc, from, node.type);
-    if (point != null) { from = to = point; }
-  }
-  return this.replaceRange(from, to, new dist.Slice(dist.Fragment.from(node), 0, 0))
-};
-
-// :: (number, number) → this
-// Delete the given range, expanding it to cover fully covered
-// parent nodes until a valid replace is found.
-Transform.prototype.deleteRange = function(from, to) {
-  var this$1 = this;
-
-  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
-  var covered = coveredDepths($from, $to);
-  for (var i = 0; i < covered.length; i++) {
-    var depth = covered[i], last = i == covered.length - 1;
-    if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)
-      { return this$1.delete($from.start(depth), $to.end(depth)) }
-    if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))
-      { return this$1.delete($from.before(depth), $to.after(depth)) }
-  }
-  for (var d = 1; d <= $from.depth; d++) {
-    if (from - $from.start(d) == $from.depth - d && to > $from.end(d))
-      { return this$1.delete($from.before(d), to) }
-  }
-  return this.delete(from, to)
-};
-
-// : (ResolvedPos, ResolvedPos) → [number]
-// Returns an array of all depths for which $from - $to spans the
-// whole content of the nodes at that depth.
-function coveredDepths($from, $to) {
-  var result = [], minDepth = Math.min($from.depth, $to.depth);
-  for (var d = minDepth; d >= 0; d--) {
-    var start = $from.start(d);
-    if (start < $from.pos - ($from.depth - d) ||
-        $to.end(d) > $to.pos + ($to.depth - d) ||
-        $from.node(d).type.spec.isolating ||
-        $to.node(d).type.spec.isolating) { break }
-    if (start == $to.start(d)) { result.push(d); }
-  }
-  return result
-}
-
-exports.Transform = Transform;
-exports.TransformError = TransformError;
-exports.Step = Step;
-exports.StepResult = StepResult;
-exports.joinPoint = joinPoint;
-exports.canJoin = canJoin;
-exports.canSplit = canSplit;
-exports.insertPoint = insertPoint;
-exports.dropPoint = dropPoint;
-exports.liftTarget = liftTarget;
-exports.findWrapping = findWrapping;
-exports.StepMap = StepMap;
-exports.MapResult = MapResult;
-exports.Mapping = Mapping;
-exports.AddMarkStep = AddMarkStep;
-exports.RemoveMarkStep = RemoveMarkStep;
-exports.ReplaceStep = ReplaceStep;
-exports.ReplaceAroundStep = ReplaceAroundStep;
-exports.replaceStep = replaceStep;
-
-});
-
-unwrapExports(dist$1);
-var dist_1$1 = dist$1.Transform;
-var dist_2$1 = dist$1.TransformError;
-var dist_3$1 = dist$1.Step;
-var dist_4$1 = dist$1.StepResult;
-var dist_5$1 = dist$1.joinPoint;
-var dist_6$1 = dist$1.canJoin;
-var dist_7$1 = dist$1.canSplit;
-var dist_8$1 = dist$1.insertPoint;
-var dist_9$1 = dist$1.dropPoint;
-var dist_10$1 = dist$1.liftTarget;
-var dist_11$1 = dist$1.findWrapping;
-var dist_12$1 = dist$1.StepMap;
-var dist_13$1 = dist$1.MapResult;
-var dist_14 = dist$1.Mapping;
-var dist_15 = dist$1.AddMarkStep;
-var dist_16 = dist$1.RemoveMarkStep;
-var dist_17 = dist$1.ReplaceStep;
-var dist_18 = dist$1.ReplaceAroundStep;
-var dist_19 = dist$1.replaceStep;
-
-var dist$2 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-var classesById = Object.create(null);
-
-// ::- Superclass for editor selections. Every selection type should
-// extend this. Should not be instantiated directly.
-var Selection = function Selection($anchor, $head, ranges) {
-  // :: [SelectionRange]
-  // The ranges covered by the selection.
-  this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];
-  // :: ResolvedPos
-  // The resolved anchor of the selection (the side that stays in
-  // place when the selection is modified).
-  this.$anchor = $anchor;
-  // :: ResolvedPos
-  // The resolved head of the selection (the side that moves when
-  // the selection is modified).
-  this.$head = $head;
-};
-
-var prototypeAccessors = { anchor: {},head: {},from: {},to: {},$from: {},$to: {},empty: {} };
-
-// :: number
-// The selection's anchor, as an unresolved position.
-prototypeAccessors.anchor.get = function () { return this.$anchor.pos };
-
-// :: number
-// The selection's head.
-prototypeAccessors.head.get = function () { return this.$head.pos };
-
-// :: number
-// The lower bound of the selection's main range.
-prototypeAccessors.from.get = function () { return this.$from.pos };
-
-// :: number
-// The upper bound of the selection's main range.
-prototypeAccessors.to.get = function () { return this.$to.pos };
-
-// :: ResolvedPos
-// The resolved lowerbound of the selection's main range.
-prototypeAccessors.$from.get = function () {
-  return this.ranges[0].$from
-};
-
-// :: ResolvedPos
-// The resolved upper bound of the selection's main range.
-prototypeAccessors.$to.get = function () {
-  return this.ranges[0].$to
-};
-
-// :: bool
-// Indicates whether the selection contains any content.
-prototypeAccessors.empty.get = function () {
-  var ranges = this.ranges;
-  for (var i = 0; i < ranges.length; i++)
-    { if (ranges[i].$from.pos != ranges[i].$to.pos) { return false } }
-  return true
-};
-
-// eq:: (Selection) → bool
-// Test whether the selection is the same as another selection.
-
-// map:: (doc: Node, mapping: Mappable) → Selection
-// Map this selection through a [mappable](#transform.Mappable) thing. `doc`
-// should be the new document to which we are mapping.
-
-// :: () → Slice
-// Get the content of this selection as a slice.
-Selection.prototype.content = function content () {
-  return this.$from.node(0).slice(this.from, this.to, true)
-};
-
-// :: (Transaction, ?Slice)
-// Replace the selection with a slice or, if no slice is given,
-// delete the selection. Will append to the given transaction.
-Selection.prototype.replace = function replace (tr, content) {
-    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-  // Put the new selection at the position after the inserted
-  // content. When that ended in an inline node, search backwards,
-  // to get the position after that node. If not, search forward.
-  var lastNode = content.content.lastChild, lastParent = null;
-  for (var i = 0; i < content.openEnd; i++) {
-    lastParent = lastNode;
-    lastNode = lastNode.lastChild;
-  }
-
-  var mapFrom = tr.steps.length, ranges = this.ranges;
-  for (var i$1 = 0; i$1 < ranges.length; i$1++) {
-    var ref = ranges[i$1];
-      var $from = ref.$from;
-      var $to = ref.$to;
-      var mapping = tr.mapping.slice(mapFrom);
-    tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i$1 ? dist.Slice.empty : content);
-    if (i$1 == 0)
-      { selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1); }
-  }
-};
-
-// :: (Transaction, Node)
-// Replace the selection with the given node, appending the changes
-// to the given transaction.
-Selection.prototype.replaceWith = function replaceWith (tr, node) {
-  var mapFrom = tr.steps.length, ranges = this.ranges;
-  for (var i = 0; i < ranges.length; i++) {
-    var ref = ranges[i];
-      var $from = ref.$from;
-      var $to = ref.$to;
-      var mapping = tr.mapping.slice(mapFrom);
-    var from = mapping.map($from.pos), to = mapping.map($to.pos);
-    if (i) {
-      tr.deleteRange(from, to);
-    } else {
-      tr.replaceRangeWith(from, to, node);
-      selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);
-    }
-  }
-};
-
-// toJSON:: () → Object
-// Convert the selection to a JSON representation. When implementing
-// this for a custom selection class, make sure to give the object a
-// `type` property whose value matches the ID under which you
-// [registered](#state.Selection^jsonID) your class.
-
-// :: (ResolvedPos, number, ?bool) → ?Selection
-// Find a valid cursor or leaf node selection starting at the given
-// position and searching back if `dir` is negative, and forward if
-// positive. When `textOnly` is true, only consider cursor
-// selections. Will return null when no valid selection position is
-// found.
-Selection.findFrom = function findFrom ($pos, dir, textOnly) {
-  var inner = $pos.parent.inlineContent ? new TextSelection($pos)
-      : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);
-  if (inner) { return inner }
-
-  for (var depth = $pos.depth - 1; depth >= 0; depth--) {
-    var found = dir < 0
-        ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)
-        : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);
-    if (found) { return found }
-  }
-};
-
-// :: (ResolvedPos, ?number) → Selection
-// Find a valid cursor or leaf node selection near the given
-// position. Searches forward first by default, but if `bias` is
-// negative, it will search backwards first.
-Selection.near = function near ($pos, bias) {
-    if ( bias === void 0 ) { bias = 1; }
-
-  return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0))
-};
-
-// :: (Node) → Selection
-// Find the cursor or leaf node selection closest to the start of
-// the given document. Will return an
-// [`AllSelection`](#state.AllSelection) if no valid position
-// exists.
-Selection.atStart = function atStart (doc) {
-  return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc)
-};
-
-// :: (Node) → Selection
-// Find the cursor or leaf node selection closest to the end of the
-// given document.
-Selection.atEnd = function atEnd (doc) {
-  return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc)
-};
-
-// :: (Node, Object) → Selection
-// Deserialize the JSON representation of a selection. Must be
-// implemented for custom classes (as a static class method).
-Selection.fromJSON = function fromJSON (doc, json) {
-  if (!json || !json.type) { throw new RangeError("Invalid input for Selection.fromJSON") }
-  var cls = classesById[json.type];
-  if (!cls) { throw new RangeError(("No selection type " + (json.type) + " defined")) }
-  return cls.fromJSON(doc, json)
-};
-
-// :: (string, constructor<Selection>)
-// To be able to deserialize selections from JSON, custom selection
-// classes must register themselves with an ID string, so that they
-// can be disambiguated. Try to pick something that's unlikely to
-// clash with classes from other modules.
-Selection.jsonID = function jsonID (id, selectionClass) {
-  if (id in classesById) { throw new RangeError("Duplicate use of selection JSON ID " + id) }
-  classesById[id] = selectionClass;
-  selectionClass.prototype.jsonID = id;
-  return selectionClass
-};
-
-// :: () → SelectionBookmark
-// Get a [bookmark](#state.SelectionBookmark) for this selection,
-// which is a value that can be mapped without having access to a
-// current document, and later resolved to a real selection for a
-// given document again. (This is used mostly by the history to
-// track and restore old selections.) The default implementation of
-// this method just converts the selection to a text selection and
-// returns the bookmark for that.
-Selection.prototype.getBookmark = function getBookmark () {
-  return TextSelection.between(this.$anchor, this.$head).getBookmark()
-};
-
-Object.defineProperties( Selection.prototype, prototypeAccessors );
-
-// :: bool
-// Controls whether, when a selection of this type is active in the
-// browser, the selected range should be visible to the user. Defaults
-// to `true`.
-Selection.prototype.visible = true;
-
-// SelectionBookmark:: interface
-// A lightweight, document-independent representation of a selection.
-// You can define a custom bookmark type for a custom selection class
-// to make the history handle it well.
-//
-//   map:: (mapping: Mapping) → SelectionBookmark
-//   Map the bookmark through a set of changes.
-//
-//   resolve:: (doc: Node) → Selection
-//   Resolve the bookmark to a real selection again. This may need to
-//   do some error checking and may fall back to a default (usually
-//   [`TextSelection.between`](#state.TextSelection^between)) if
-//   mapping made the bookmark invalid.
-
-// ::- Represents a selected range in a document.
-var SelectionRange = function SelectionRange($from, $to) {
-  // :: ResolvedPos
-  // The lower bound of the range.
-  this.$from = $from;
-  // :: ResolvedPos
-  // The upper bound of the range.
-  this.$to = $to;
-};
-
-// ::- A text selection represents a classical editor selection, with
-// a head (the moving side) and anchor (immobile side), both of which
-// point into textblock nodes. It can be empty (a regular cursor
-// position).
-var TextSelection = (function (Selection) {
-  function TextSelection($anchor, $head) {
-    if ( $head === void 0 ) { $head = $anchor; }
-
-    Selection.call(this, $anchor, $head);
-  }
-
-  if ( Selection ) { TextSelection.__proto__ = Selection; }
-  TextSelection.prototype = Object.create( Selection && Selection.prototype );
-  TextSelection.prototype.constructor = TextSelection;
-
-  var prototypeAccessors$1 = { $cursor: {} };
-
-  // :: ?ResolvedPos
-  // Returns a resolved position if this is a cursor selection (an
-  // empty text selection), and null otherwise.
-  prototypeAccessors$1.$cursor.get = function () { return this.$anchor.pos == this.$head.pos ? this.$head : null };
-
-  TextSelection.prototype.map = function map (doc, mapping) {
-    var $head = doc.resolve(mapping.map(this.head));
-    if (!$head.parent.inlineContent) { return Selection.near($head) }
-    var $anchor = doc.resolve(mapping.map(this.anchor));
-    return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head)
-  };
-
-  TextSelection.prototype.replace = function replace (tr, content) {
-    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-    Selection.prototype.replace.call(this, tr, content);
-    if (content == dist.Slice.empty) {
-      var marks = this.$from.marksAcross(this.$to);
-      if (marks) { tr.ensureMarks(marks); }
-    }
-  };
-
-  TextSelection.prototype.eq = function eq (other) {
-    return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head
-  };
-
-  TextSelection.prototype.getBookmark = function getBookmark () {
-    return new TextBookmark(this.anchor, this.head)
-  };
-
-  TextSelection.prototype.toJSON = function toJSON () {
-    return {type: "text", anchor: this.anchor, head: this.head}
-  };
-
-  TextSelection.fromJSON = function fromJSON (doc, json) {
-    if (typeof json.anchor != "number" || typeof json.head != "number")
-      { throw new RangeError("Invalid input for TextSelection.fromJSON") }
-    return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head))
-  };
-
-  // :: (Node, number, ?number) → TextSelection
-  // Create a text selection from non-resolved positions.
-  TextSelection.create = function create (doc, anchor, head) {
-    if ( head === void 0 ) { head = anchor; }
-
-    var $anchor = doc.resolve(anchor);
-    return new this($anchor, head == anchor ? $anchor : doc.resolve(head))
-  };
-
-  // :: (ResolvedPos, ResolvedPos, ?number) → Selection
-  // Return a text selection that spans the given positions or, if
-  // they aren't text positions, find a text selection near them.
-  // `bias` determines whether the method searches forward (default)
-  // or backwards (negative number) first. Will fall back to calling
-  // [`Selection.near`](#state.Selection^near) when the document
-  // doesn't contain a valid text position.
-  TextSelection.between = function between ($anchor, $head, bias) {
-    var dPos = $anchor.pos - $head.pos;
-    if (!bias || dPos) { bias = dPos >= 0 ? 1 : -1; }
-    if (!$head.parent.inlineContent) {
-      var found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);
-      if (found) { $head = found.$head; }
-      else { return Selection.near($head, bias) }
-    }
-    if (!$anchor.parent.inlineContent) {
-      if (dPos == 0) {
-        $anchor = $head;
-      } else {
-        $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;
-        if (($anchor.pos < $head.pos) != (dPos < 0)) { $anchor = $head; }
-      }
-    }
-    return new TextSelection($anchor, $head)
-  };
-
-  Object.defineProperties( TextSelection.prototype, prototypeAccessors$1 );
-
-  return TextSelection;
-}(Selection));
-
-Selection.jsonID("text", TextSelection);
-
-var TextBookmark = function TextBookmark(anchor, head) {
-  this.anchor = anchor;
-  this.head = head;
-};
-TextBookmark.prototype.map = function map (mapping) {
-  return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head))
-};
-TextBookmark.prototype.resolve = function resolve (doc) {
-  return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head))
-};
-
-// ::- A node selection is a selection that points at a single node.
-// All nodes marked [selectable](#model.NodeSpec.selectable) can be
-// the target of a node selection. In such a selection, `from` and
-// `to` point directly before and after the selected node, `anchor`
-// equals `from`, and `head` equals `to`..
-var NodeSelection = (function (Selection) {
-  function NodeSelection($pos) {
-    var node = $pos.nodeAfter;
-    var $end = $pos.node(0).resolve($pos.pos + node.nodeSize);
-    Selection.call(this, $pos, $end);
-    // :: Node The selected node.
-    this.node = node;
-  }
-
-  if ( Selection ) { NodeSelection.__proto__ = Selection; }
-  NodeSelection.prototype = Object.create( Selection && Selection.prototype );
-  NodeSelection.prototype.constructor = NodeSelection;
-
-  NodeSelection.prototype.map = function map (doc, mapping) {
-    var ref = mapping.mapResult(this.anchor);
-    var deleted = ref.deleted;
-    var pos = ref.pos;
-    var $pos = doc.resolve(pos);
-    if (deleted) { return Selection.near($pos) }
-    return new NodeSelection($pos)
-  };
-
-  NodeSelection.prototype.content = function content () {
-    return new dist.Slice(dist.Fragment.from(this.node), 0, 0)
-  };
-
-  NodeSelection.prototype.eq = function eq (other) {
-    return other instanceof NodeSelection && other.anchor == this.anchor
-  };
-
-  NodeSelection.prototype.toJSON = function toJSON () {
-    return {type: "node", anchor: this.anchor}
-  };
-
-  NodeSelection.prototype.getBookmark = function getBookmark () { return new NodeBookmark(this.anchor) };
-
-  NodeSelection.fromJSON = function fromJSON (doc, json) {
-    if (typeof json.anchor != "number")
-      { throw new RangeError("Invalid input for NodeSelection.fromJSON") }
-    return new NodeSelection(doc.resolve(json.anchor))
-  };
-
-  // :: (Node, number) → NodeSelection
-  // Create a node selection from non-resolved positions.
-  NodeSelection.create = function create (doc, from) {
-    return new this(doc.resolve(from))
-  };
-
-  // :: (Node) → bool
-  // Determines whether the given node may be selected as a node
-  // selection.
-  NodeSelection.isSelectable = function isSelectable (node) {
-    return !node.isText && node.type.spec.selectable !== false
-  };
-
-  return NodeSelection;
-}(Selection));
-
-NodeSelection.prototype.visible = false;
-
-Selection.jsonID("node", NodeSelection);
-
-var NodeBookmark = function NodeBookmark(anchor) {
-  this.anchor = anchor;
-};
-NodeBookmark.prototype.map = function map (mapping) {
-  var ref = mapping.mapResult(this.anchor);
-    var deleted = ref.deleted;
-    var pos = ref.pos;
-  return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos)
-};
-NodeBookmark.prototype.resolve = function resolve (doc) {
-  var $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;
-  if (node && NodeSelection.isSelectable(node)) { return new NodeSelection($pos) }
-  return Selection.near($pos)
-};
-
-// ::- A selection type that represents selecting the whole document
-// (which can not necessarily be expressed with a text selection, when
-// there are for example leaf block nodes at the start or end of the
-// document).
-var AllSelection = (function (Selection) {
-  function AllSelection(doc) {
-    Selection.call(this, doc.resolve(0), doc.resolve(doc.content.size));
-  }
-
-  if ( Selection ) { AllSelection.__proto__ = Selection; }
-  AllSelection.prototype = Object.create( Selection && Selection.prototype );
-  AllSelection.prototype.constructor = AllSelection;
-
-  AllSelection.prototype.toJSON = function toJSON () { return {type: "all"} };
-
-  AllSelection.fromJSON = function fromJSON (doc) { return new AllSelection(doc) };
-
-  AllSelection.prototype.map = function map (doc) { return new AllSelection(doc) };
-
-  AllSelection.prototype.eq = function eq (other) { return other instanceof AllSelection };
-
-  AllSelection.prototype.getBookmark = function getBookmark () { return AllBookmark };
-
-  return AllSelection;
-}(Selection));
-
-Selection.jsonID("all", AllSelection);
-
-var AllBookmark = {
-  map: function map() { return this },
-  resolve: function resolve(doc) { return new AllSelection(doc) }
-};
-
-// FIXME we'll need some awareness of text direction when scanning for selections
-
-// Try to find a selection inside the given node. `pos` points at the
-// position where the search starts. When `text` is true, only return
-// text selections.
-function findSelectionIn(doc, node, pos, index, dir, text) {
-  if (node.inlineContent) { return TextSelection.create(doc, pos) }
-  for (var i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {
-    var child = node.child(i);
-    if (!child.isAtom) {
-      var inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);
-      if (inner) { return inner }
-    } else if (!text && NodeSelection.isSelectable(child)) {
-      return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0))
-    }
-    pos += child.nodeSize * dir;
-  }
-}
-
-function selectionToInsertionEnd(tr, startLen, bias) {
-  var last = tr.steps.length - 1;
-  if (last < startLen) { return }
-  var step = tr.steps[last];
-  if (!(step instanceof dist$1.ReplaceStep || step instanceof dist$1.ReplaceAroundStep)) { return }
-  var map = tr.mapping.maps[last], end;
-  map.forEach(function (_from, _to, _newFrom, newTo) { if (end == null) { end = newTo; } });
-  tr.setSelection(Selection.near(tr.doc.resolve(end), bias));
-}
-
-var UPDATED_SEL = 1;
-var UPDATED_MARKS = 2;
-var UPDATED_SCROLL = 4;
-
-// ::- An editor state transaction, which can be applied to a state to
-// create an updated state. Use
-// [`EditorState.tr`](#state.EditorState.tr) to create an instance.
-//
-// Transactions track changes to the document (they are a subclass of
-// [`Transform`](#transform.Transform)), but also other state changes,
-// like selection updates and adjustments of the set of [stored
-// marks](#state.EditorState.storedMarks). In addition, you can store
-// metadata properties in a transaction, which are extra pieces of
-// information that client code or plugins can use to describe what a
-// transacion represents, so that they can update their [own
-// state](#state.StateField) accordingly.
-//
-// The [editor view](#view.EditorView) uses a few metadata properties:
-// it will attach a property `"pointer"` with the value `true` to
-// selection transactions directly caused by mouse or touch input, and
-// a `"uiEvent"` property of that may be `"paste"`, `"cut"`, or `"drop"`.
-var Transaction = (function (Transform$$1) {
-  function Transaction(state) {
-    Transform$$1.call(this, state.doc);
-    // :: number
-    // The timestamp associated with this transaction, in the same
-    // format as `Date.now()`.
-    this.time = Date.now();
-    this.curSelection = state.selection;
-    // The step count for which the current selection is valid.
-    this.curSelectionFor = 0;
-    // :: ?[Mark]
-    // The stored marks set by this transaction, if any.
-    this.storedMarks = state.storedMarks;
-    // Bitfield to track which aspects of the state were updated by
-    // this transaction.
-    this.updated = 0;
-    // Object used to store metadata properties for the transaction.
-    this.meta = Object.create(null);
-  }
-
-  if ( Transform$$1 ) { Transaction.__proto__ = Transform$$1; }
-  Transaction.prototype = Object.create( Transform$$1 && Transform$$1.prototype );
-  Transaction.prototype.constructor = Transaction;
-
-  var prototypeAccessors = { selection: {},selectionSet: {},storedMarksSet: {},isGeneric: {},scrolledIntoView: {} };
-
-  // :: Selection
-  // The transaction's current selection. This defaults to the editor
-  // selection [mapped](#state.Selection.map) through the steps in the
-  // transaction, but can be overwritten with
-  // [`setSelection`](#state.Transaction.setSelection).
-  prototypeAccessors.selection.get = function () {
-    if (this.curSelectionFor < this.steps.length) {
-      this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));
-      this.curSelectionFor = this.steps.length;
-    }
-    return this.curSelection
-  };
-
-  // :: (Selection) → Transaction
-  // Update the transaction's current selection. Will determine the
-  // selection that the editor gets when the transaction is applied.
-  Transaction.prototype.setSelection = function setSelection (selection) {
-    this.curSelection = selection;
-    this.curSelectionFor = this.steps.length;
-    this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;
-    this.storedMarks = null;
-    return this
-  };
-
-  // :: bool
-  // Whether the selection was explicitly updated by this transaction.
-  prototypeAccessors.selectionSet.get = function () {
-    return (this.updated & UPDATED_SEL) > 0
-  };
-
-  // :: (?[Mark]) → Transaction
-  // Set the current stored marks.
-  Transaction.prototype.setStoredMarks = function setStoredMarks (marks) {
-    this.storedMarks = marks;
-    this.updated |= UPDATED_MARKS;
-    return this
-  };
-
-  // :: ([Mark]) → Transaction
-  // Make sure the current stored marks or, if that is null, the marks
-  // at the selection, match the given set of marks. Does nothing if
-  // this is already the case.
-  Transaction.prototype.ensureMarks = function ensureMarks (marks) {
-    if (!dist.Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))
-      { this.setStoredMarks(marks); }
-    return this
-  };
-
-  // :: (Mark) → Transaction
-  // Add a mark to the set of stored marks.
-  Transaction.prototype.addStoredMark = function addStoredMark (mark) {
-    return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()))
-  };
-
-  // :: (union<Mark, MarkType>) → Transaction
-  // Remove a mark or mark type from the set of stored marks.
-  Transaction.prototype.removeStoredMark = function removeStoredMark (mark) {
-    return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()))
-  };
-
-  // :: bool
-  // Whether the stored marks were explicitly set for this transaction.
-  prototypeAccessors.storedMarksSet.get = function () {
-    return (this.updated & UPDATED_MARKS) > 0
-  };
-
-  Transaction.prototype.addStep = function addStep (step, doc) {
-    Transform$$1.prototype.addStep.call(this, step, doc);
-    this.updated = this.updated & ~UPDATED_MARKS;
-    this.storedMarks = null;
-  };
-
-  // :: (number) → Transaction
-  // Update the timestamp for the transaction.
-  Transaction.prototype.setTime = function setTime (time) {
-    this.time = time;
-    return this
-  };
-
-  // :: (Slice) → Transaction
-  // Replace the current selection with the given slice.
-  Transaction.prototype.replaceSelection = function replaceSelection (slice) {
-    this.selection.replace(this, slice);
-    return this
-  };
-
-  // :: (Node, ?bool) → Transaction
-  // Replace the selection with the given node. When `inheritMarks` is
-  // true and the content is inline, it inherits the marks from the
-  // place where it is inserted.
-  Transaction.prototype.replaceSelectionWith = function replaceSelectionWith (node, inheritMarks) {
-    var selection = this.selection;
-    if (inheritMarks !== false)
-      { node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || dist.Mark.none))); }
-    selection.replaceWith(this, node);
-    return this
-  };
-
-  // :: () → Transaction
-  // Delete the selection.
-  Transaction.prototype.deleteSelection = function deleteSelection () {
-    this.selection.replace(this);
-    return this
-  };
-
-  // :: (string, from: ?number, to: ?number) → Transaction
-  // Replace the given range, or the selection if no range is given,
-  // with a text node containing the given string.
-  Transaction.prototype.insertText = function insertText (text, from, to) {
-    if ( to === void 0 ) { to = from; }
-
-    var schema = this.doc.type.schema;
-    if (from == null) {
-      if (!text) { return this.deleteSelection() }
-      return this.replaceSelectionWith(schema.text(text), true)
-    } else {
-      if (!text) { return this.deleteRange(from, to) }
-      var marks = this.storedMarks;
-      if (!marks) {
-        var $from = this.doc.resolve(from);
-        marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));
-      }
-      return this.replaceRangeWith(from, to, schema.text(text, marks))
-    }
-  };
-
-  // :: (union<string, Plugin, PluginKey>, any) → Transaction
-  // Store a metadata property in this transaction, keyed either by
-  // name or by plugin.
-  Transaction.prototype.setMeta = function setMeta (key, value) {
-    this.meta[typeof key == "string" ? key : key.key] = value;
-    return this
-  };
-
-  // :: (union<string, Plugin, PluginKey>) → any
-  // Retrieve a metadata property for a given name or plugin.
-  Transaction.prototype.getMeta = function getMeta (key) {
-    return this.meta[typeof key == "string" ? key : key.key]
-  };
-
-  // :: bool
-  // Returns true if this transaction doesn't contain any metadata,
-  // and can thus safely be extended.
-  prototypeAccessors.isGeneric.get = function () {
-    var this$1 = this;
-
-    for (var _ in this$1.meta) { return false }
-    return true
-  };
-
-  // :: () → Transaction
-  // Indicate that the editor should scroll the selection into view
-  // when updated to the state produced by this transaction.
-  Transaction.prototype.scrollIntoView = function scrollIntoView () {
-    this.updated |= UPDATED_SCROLL;
-    return this
-  };
-
-  prototypeAccessors.scrolledIntoView.get = function () {
-    return (this.updated & UPDATED_SCROLL) > 0
-  };
-
-  Object.defineProperties( Transaction.prototype, prototypeAccessors );
-
-  return Transaction;
-}(dist$1.Transform));
-
-function bind(f, self) {
-  return !self || !f ? f : f.bind(self)
-}
-
-var FieldDesc = function FieldDesc(name, desc, self) {
-  this.name = name;
-  this.init = bind(desc.init, self);
-  this.apply = bind(desc.apply, self);
-};
-
-var baseFields = [
-  new FieldDesc("doc", {
-    init: function init(config) { return config.doc || config.schema.topNodeType.createAndFill() },
-    apply: function apply(tr) { return tr.doc }
-  }),
-
-  new FieldDesc("selection", {
-    init: function init(config, instance) { return config.selection || Selection.atStart(instance.doc) },
-    apply: function apply(tr) { return tr.selection }
-  }),
-
-  new FieldDesc("storedMarks", {
-    init: function init(config) { return config.storedMarks || null },
-    apply: function apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }
-  }),
-
-  new FieldDesc("scrollToSelection", {
-    init: function init() { return 0 },
-    apply: function apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev }
-  })
-];
-
-// Object wrapping the part of a state object that stays the same
-// across transactions. Stored in the state's `config` property.
-var Configuration = function Configuration(schema, plugins) {
-  var this$1 = this;
-
-  this.schema = schema;
-  this.fields = baseFields.concat();
-  this.plugins = [];
-  this.pluginsByKey = Object.create(null);
-  if (plugins) { plugins.forEach(function (plugin) {
-    if (this$1.pluginsByKey[plugin.key])
-      { throw new RangeError("Adding different instances of a keyed plugin (" + plugin.key + ")") }
-    this$1.plugins.push(plugin);
-    this$1.pluginsByKey[plugin.key] = plugin;
-    if (plugin.spec.state)
-      { this$1.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin)); }
-  }); }
-};
-
-// ::- The state of a ProseMirror editor is represented by an object
-// of this type. A state is a persistent data structure—it isn't
-// updated, but rather a new state value is computed from an old one
-// using the [`apply`](#state.EditorState.apply) method.
-//
-// A state holds a number of built-in fields, and plugins can
-// [define](#state.PluginSpec.state) additional fields.
-var EditorState = function EditorState(config) {
-  this.config = config;
-};
-
-var prototypeAccessors$1 = { schema: {},plugins: {},tr: {} };
-
-// doc:: Node
-// The current document.
-
-// selection:: Selection
-// The selection.
-
-// storedMarks:: ?[Mark]
-// A set of marks to apply to the next input. Will be null when
-// no explicit marks have been set.
-
-// :: Schema
-// The schema of the state's document.
-prototypeAccessors$1.schema.get = function () {
-  return this.config.schema
-};
-
-// :: [Plugin]
-// The plugins that are active in this state.
-prototypeAccessors$1.plugins.get = function () {
-  return this.config.plugins
-};
-
-// :: (Transaction) → EditorState
-// Apply the given transaction to produce a new state.
-EditorState.prototype.apply = function apply (tr) {
-  return this.applyTransaction(tr).state
-};
-
-// : (Transaction) → ?Transaction
-EditorState.prototype.filterTransaction = function filterTransaction (tr, ignore) {
-    var this$1 = this;
-    if ( ignore === void 0 ) { ignore = -1; }
-
-  for (var i = 0; i < this.config.plugins.length; i++) { if (i != ignore) {
-    var plugin = this$1.config.plugins[i];
-    if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this$1))
-      { return false }
-  } }
-  return true
-};
-
-// :: (Transaction) → {state: EditorState, transactions: [Transaction]}
-// Verbose variant of [`apply`](#state.EditorState.apply) that
-// returns the precise transactions that were applied (which might
-// be influenced by the [transaction
-// hooks](#state.PluginSpec.filterTransaction) of
-// plugins) along with the new state.
-EditorState.prototype.applyTransaction = function applyTransaction (rootTr) {
-    var this$1 = this;
-
-  if (!this.filterTransaction(rootTr)) { return {state: this, transactions: []} }
-
-  var trs = [rootTr], newState = this.applyInner(rootTr), seen = null;
-  // This loop repeatedly gives plugins a chance to respond to
-  // transactions as new transactions are added, making sure to only
-  // pass the transactions the plugin did not see before.
-  outer: for (;;) {
-    var haveNew = false;
-    for (var i = 0; i < this.config.plugins.length; i++) {
-      var plugin = this$1.config.plugins[i];
-      if (plugin.spec.appendTransaction) {
-        var n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this$1;
-        var tr = n < trs.length &&
-            plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);
-        if (tr && newState.filterTransaction(tr, i)) {
-          tr.setMeta("appendedTransaction", rootTr);
-          if (!seen) {
-            seen = [];
-            for (var j = 0; j < this.config.plugins.length; j++)
-              { seen.push(j < i ? {state: newState, n: trs.length} : {state: this$1, n: 0}); }
-          }
-          trs.push(tr);
-          newState = newState.applyInner(tr);
-          haveNew = true;
-        }
-        if (seen) { seen[i] = {state: newState, n: trs.length}; }
-      }
-    }
-    if (!haveNew) { return {state: newState, transactions: trs} }
-  }
-};
-
-// : (Transaction) → EditorState
-EditorState.prototype.applyInner = function applyInner (tr) {
-    var this$1 = this;
-
-  if (!tr.before.eq(this.doc)) { throw new RangeError("Applying a mismatched transaction") }
-  var newInstance = new EditorState(this.config), fields = this.config.fields;
-  for (var i = 0; i < fields.length; i++) {
-    var field = fields[i];
-    newInstance[field.name] = field.apply(tr, this$1[field.name], this$1, newInstance);
-  }
-  for (var i$1 = 0; i$1 < applyListeners.length; i$1++) { applyListeners[i$1](this$1, tr, newInstance); }
-  return newInstance
-};
-
-// :: Transaction
-// Start a [transaction](#state.Transaction) from this state.
-prototypeAccessors$1.tr.get = function () { return new Transaction(this) };
-
-// :: (Object) → EditorState
-// Create a new state.
-//
-// config::- Configuration options. Must contain `schema` or `doc` (or both).
-//
-//    schema:: ?Schema
-//    The schema to use.
-//
-//    doc:: ?Node
-//    The starting document.
-//
-//    selection:: ?Selection
-//    A valid selection in the document.
-//
-//    storedMarks:: ?[Mark]
-//    The initial set of [stored marks](#state.EditorState.storedMarks).
-//
-//    plugins:: ?[Plugin]
-//    The plugins that should be active in this state.
-EditorState.create = function create (config) {
-  var $config = new Configuration(config.schema || config.doc.type.schema, config.plugins);
-  var instance = new EditorState($config);
-  for (var i = 0; i < $config.fields.length; i++)
-    { instance[$config.fields[i].name] = $config.fields[i].init(config, instance); }
-  return instance
-};
-
-// :: (Object) → EditorState
-// Create a new state based on this one, but with an adjusted set of
-// active plugins. State fields that exist in both sets of plugins
-// are kept unchanged. Those that no longer exist are dropped, and
-// those that are new are initialized using their
-// [`init`](#state.StateField.init) method, passing in the new
-// configuration object..
-//
-// config::- configuration options
-//
-//   schema:: ?Schema
-//   New schema to use.
-//
-//   plugins:: ?[Plugin]
-//   New set of active plugins.
-EditorState.prototype.reconfigure = function reconfigure (config) {
-    var this$1 = this;
-
-  var $config = new Configuration(config.schema || this.schema, config.plugins);
-  var fields = $config.fields, instance = new EditorState($config);
-  for (var i = 0; i < fields.length; i++) {
-    var name = fields[i].name;
-    instance[name] = this$1.hasOwnProperty(name) ? this$1[name] : fields[i].init(config, instance);
-  }
-  return instance
-};
-
-// :: (?union<Object<Plugin>, string, number>) → Object
-// Serialize this state to JSON. If you want to serialize the state
-// of plugins, pass an object mapping property names to use in the
-// resulting JSON object to plugin objects. The argument may also be
-// a string or number, in which case it is ignored, to support the
-// way `JSON.stringify` calls `toString` methods.
-EditorState.prototype.toJSON = function toJSON (pluginFields) {
-    var this$1 = this;
-
-  var result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()};
-  if (this.storedMarks) { result.storedMarks = this.storedMarks.map(function (m) { return m.toJSON(); }); }
-  if (pluginFields && typeof pluginFields == 'object') { for (var prop in pluginFields) {
-    if (prop == "doc" || prop == "selection")
-      { throw new RangeError("The JSON fields `doc` and `selection` are reserved") }
-    var plugin = pluginFields[prop], state = plugin.spec.state;
-    if (state && state.toJSON) { result[prop] = state.toJSON.call(plugin, this$1[plugin.key]); }
-  } }
-  return result
-};
-
-// :: (Object, Object, ?Object<Plugin>) → EditorState
-// Deserialize a JSON representation of a state. `config` should
-// have at least a `schema` field, and should contain array of
-// plugins to initialize the state with. `pluginFields` can be used
-// to deserialize the state of plugins, by associating plugin
-// instances with the property names they use in the JSON object.
-//
-// config::- configuration options
-//
-//   schema:: Schema
-//   The schema to use.
-//
-//   plugins:: ?[Plugin]
-//   The set of active plugins.
-EditorState.fromJSON = function fromJSON (config, json, pluginFields) {
-  if (!json) { throw new RangeError("Invalid input for EditorState.fromJSON") }
-  if (!config.schema) { throw new RangeError("Required config field 'schema' missing") }
-  var $config = new Configuration(config.schema, config.plugins);
-  var instance = new EditorState($config);
-  $config.fields.forEach(function (field) {
-    if (field.name == "doc") {
-      instance.doc = dist.Node.fromJSON(config.schema, json.doc);
-    } else if (field.name == "selection") {
-      instance.selection = Selection.fromJSON(instance.doc, json.selection);
-    } else if (field.name == "storedMarks") {
-      if (json.storedMarks) { instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON); }
-    } else {
-      if (pluginFields) { for (var prop in pluginFields) {
-        var plugin = pluginFields[prop], state = plugin.spec.state;
-        if (plugin.key == field.name && state && state.fromJSON &&
-            Object.prototype.hasOwnProperty.call(json, prop)) {
-          // This field belongs to a plugin mapped to a JSON field, read it from there.
-          instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);
-          return
-        }
-      } }
-      instance[field.name] = field.init(config, instance);
-    }
-  });
-  return instance
-};
-
-// Kludge to allow the view to track mappings between different
-// instances of a state.
-EditorState.addApplyListener = function addApplyListener (f) {
-  applyListeners.push(f);
-};
-EditorState.removeApplyListener = function removeApplyListener (f) {
-  var found = applyListeners.indexOf(f);
-  if (found > -1) { applyListeners.splice(found, 1); }
-};
-
-Object.defineProperties( EditorState.prototype, prototypeAccessors$1 );
-
-var applyListeners = [];
-
-// PluginSpec:: interface
-//
-// This is the type passed to the [`Plugin`](#state.Plugin)
-// constructor. It provides a definition for a plugin.
-//
-//   props:: ?EditorProps
-//   The [view props](#view.EditorProps) added by this plugin. Props
-//   that are functions will be bound to have the plugin instance as
-//   their `this` binding.
-//
-//   state:: ?StateField<any>
-//   Allows a plugin to define a [state field](#state.StateField), an
-//   extra slot in the state object in which it can keep its own data.
-//
-//   key:: ?PluginKey
-//   Can be used to make this a keyed plugin. You can have only one
-//   plugin with a given key in a given state, but it is possible to
-//   access the plugin's configuration and state through the key,
-//   without having access to the plugin instance object.
-//
-//   view:: ?(EditorView) → Object
-//   When the plugin needs to interact with the editor view, or
-//   set something up in the DOM, use this field. The function
-//   will be called when the plugin's state is associated with an
-//   editor view.
-//
-//     return::-
-//     Should return an object with the following optional
-//     properties:
-//
-//       update:: ?(view: EditorView, prevState: EditorState)
-//       Called whenever the view's state is updated.
-//
-//       destroy:: ?()
-//       Called when the view is destroyed or receives a state
-//       with different plugins.
-//
-//   filterTransaction:: ?(Transaction, EditorState) → bool
-//   When present, this will be called before a transaction is
-//   applied by the state, allowing the plugin to cancel it (by
-//   returning false).
-//
-//   appendTransaction:: ?(transactions: [Transaction], oldState: EditorState, newState: EditorState) → ?Transaction
-//   Allows the plugin to append another transaction to be applied
-//   after the given array of transactions. When another plugin
-//   appends a transaction after this was called, it is called again
-//   with the new state and new transactions—but only the new
-//   transactions, i.e. it won't be passed transactions that it
-//   already saw.
-
-function bindProps(obj, self, target) {
-  for (var prop in obj) {
-    var val = obj[prop];
-    if (val instanceof Function) { val = val.bind(self); }
-    else if (prop == "handleDOMEvents") { val = bindProps(val, self, {}); }
-    target[prop] = val;
-  }
-  return target
-}
-
-// ::- Plugins bundle functionality that can be added to an editor.
-// They are part of the [editor state](#state.EditorState) and
-// may influence that state and the view that contains it.
-var Plugin = function Plugin(spec) {
-  // :: EditorProps
-  // The [props](#view.EditorProps) exported by this plugin.
-  this.props = {};
-  if (spec.props) { bindProps(spec.props, this, this.props); }
-  // :: Object
-  // The plugin's [spec object](#state.PluginSpec).
-  this.spec = spec;
-  this.key = spec.key ? spec.key.key : createKey("plugin");
-};
-
-// :: (EditorState) → any
-// Extract the plugin's state field from an editor state.
-Plugin.prototype.getState = function getState (state) { return state[this.key] };
-
-// StateField:: interface<T>
-// A plugin spec may provide a state field (under its
-// [`state`](#state.PluginSpec.state) property) of this type, which
-// describes the state it wants to keep. Functions provided here are
-// always called with the plugin instance as their `this` binding.
-//
-//   init:: (config: Object, instance: EditorState) → T
-//   Initialize the value of the field. `config` will be the object
-//   passed to [`EditorState.create`](#state.EditorState^create). Note
-//   that `instance` is a half-initialized state instance, and will
-//   not have values for plugin fields initialized after this one.
-//
-//   apply:: (tr: Transaction, value: T, oldState: EditorState, newState: EditorState) → T
-//   Apply the given transaction to this state field, producing a new
-//   field value. Note that the `newState` argument is again a partially
-//   constructed state does not yet contain the state from plugins
-//   coming after this one.
-//
-//   toJSON:: ?(value: T) → *
-//   Convert this field to JSON. Optional, can be left off to disable
-//   JSON serialization for the field.
-//
-//   fromJSON:: ?(config: Object, value: *, state: EditorState) → T
-//   Deserialize the JSON representation of this field. Note that the
-//   `state` argument is again a half-initialized state.
-
-var keys = Object.create(null);
-
-function createKey(name) {
-  if (name in keys) { return name + "$" + ++keys[name] }
-  keys[name] = 0;
-  return name + "$"
-}
-
-// ::- A key is used to [tag](#state.PluginSpec.key)
-// plugins in a way that makes it possible to find them, given an
-// editor state. Assigning a key does mean only one plugin of that
-// type can be active in a state.
-var PluginKey = function PluginKey(name) {
-if ( name === void 0 ) { name = "key"; }
- this.key = createKey(name); };
-
-// :: (EditorState) → ?Plugin
-// Get the active plugin with this key, if any, from an editor
-// state.
-PluginKey.prototype.get = function get (state) { return state.config.pluginsByKey[this.key] };
-
-// :: (EditorState) → ?any
-// Get the plugin's state from an editor state.
-PluginKey.prototype.getState = function getState (state) { return state[this.key] };
-
-exports.Selection = Selection;
-exports.SelectionRange = SelectionRange;
-exports.TextSelection = TextSelection;
-exports.NodeSelection = NodeSelection;
-exports.AllSelection = AllSelection;
-exports.Transaction = Transaction;
-exports.EditorState = EditorState;
-exports.Plugin = Plugin;
-exports.PluginKey = PluginKey;
-
-});
-
-unwrapExports(dist$2);
-var dist_1$2 = dist$2.Selection;
-var dist_2$2 = dist$2.SelectionRange;
-var dist_3$2 = dist$2.TextSelection;
-var dist_4$2 = dist$2.NodeSelection;
-var dist_5$2 = dist$2.AllSelection;
-var dist_6$2 = dist$2.Transaction;
-var dist_7$2 = dist$2.EditorState;
-var dist_8$2 = dist$2.Plugin;
-var dist_9$2 = dist$2.PluginKey;
-
-var dist$3 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-var result = {};
-if (typeof navigator != "undefined" && typeof document != "undefined") {
-  var ie_edge = /Edge\/(\d+)/.exec(navigator.userAgent);
-  var ie_upto10 = /MSIE \d/.test(navigator.userAgent);
-  var ie_11up = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);
-
-  result.mac = /Mac/.test(navigator.platform);
-  var ie = result.ie = !!(ie_upto10 || ie_11up || ie_edge);
-  result.ie_version = ie_upto10 ? document.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : null;
-  result.gecko = !ie && /gecko\/(\d+)/i.test(navigator.userAgent);
-  result.gecko_version = result.gecko && +(/Firefox\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1];
-  var chrome = !ie && /Chrome\/(\d+)/.exec(navigator.userAgent);
-  result.chrome = !!chrome;
-  result.chrome_version = chrome && +chrome[1];
-  result.ios = !ie && /AppleWebKit/.test(navigator.userAgent) && /Mobile\/\w+/.test(navigator.userAgent);
-  result.android = /Android \d/.test(navigator.userAgent);
-  result.webkit = !ie && 'WebkitAppearance' in document.documentElement.style;
-  result.safari = /Apple Computer/.test(navigator.vendor);
-  result.webkit_version = result.webkit && +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1];
-}
-
-var domIndex = function(node) {
-  for (var index = 0;; index++) {
-    node = node.previousSibling;
-    if (!node) { return index }
-  }
-};
-
-var parentNode = function(node) {
-  var parent = node.parentNode;
-  return parent && parent.nodeType == 11 ? parent.host : parent
-};
-
-var textRange = function(node, from, to) {
-  var range = document.createRange();
-  range.setEnd(node, to == null ? node.nodeValue.length : to);
-  range.setStart(node, from || 0);
-  return range
-};
-
-// Scans forward and backward through DOM positions equivalent to the
-// given one to see if the two are in the same place (i.e. after a
-// text node vs at the end of that text node)
-var isEquivalentPosition = function(node, off, targetNode, targetOff) {
-  return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||
-                        scanFor(node, off, targetNode, targetOff, 1))
-};
-
-var atomElements = /^(img|br|input|textarea|hr)$/i;
-
-function scanFor(node, off, targetNode, targetOff, dir) {
-  for (;;) {
-    if (node == targetNode && off == targetOff) { return true }
-    if (off == (dir < 0 ? 0 : nodeSize(node)) || node.nodeType == 3 && node.nodeValue == "\ufeff") {
-      var parent = node.parentNode;
-      if (parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName)) { return false }
-      off = domIndex(node) + (dir < 0 ? 0 : 1);
-      node = parent;
-    } else if (node.nodeType == 1) {
-      node = node.childNodes[off + (dir < 0 ? -1 : 0)];
-      off = dir < 0 ? nodeSize(node) : 0;
-    } else {
-      return false
-    }
-  }
-}
-
-function nodeSize(node) {
-  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length
-}
-
-function hasBlockDesc(dom) {
-  var desc = dom.pmViewDesc;
-  return desc && desc.node && desc.node.isBlock
-}
-
-// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523
-// (isCollapsed inappropriately returns true in shadow dom)
-var selectionCollapsed = function(domSel) {
-  var collapsed = domSel.isCollapsed;
-  if (collapsed && result.chrome && domSel.rangeCount && !domSel.getRangeAt(0).collapsed)
-    { collapsed = false; }
-  return collapsed
-};
-
-function windowRect(win) {
-  return {left: 0, right: win.innerWidth,
-          top: 0, bottom: win.innerHeight}
-}
-
-function scrollRectIntoView(view, rect) {
-  var scrollThreshold = view.someProp("scrollThreshold") || 0, scrollMargin = view.someProp("scrollMargin");
-  var doc = view.dom.ownerDocument, win = doc.defaultView;
-  if (scrollMargin == null) { scrollMargin = 5; }
-  for (var parent = view.dom;; parent = parentNode(parent)) {
-    if (!parent) { break }
-    var atTop = parent == doc.body || parent.nodeType != 1;
-    var bounding = atTop ? windowRect(win) : parent.getBoundingClientRect();
-    var moveX = 0, moveY = 0;
-    if (rect.top < bounding.top + scrollThreshold)
-      { moveY = -(bounding.top - rect.top + scrollMargin); }
-    else if (rect.bottom > bounding.bottom - scrollThreshold)
-      { moveY = rect.bottom - bounding.bottom + scrollMargin; }
-    if (rect.left < bounding.left + scrollThreshold)
-      { moveX = -(bounding.left - rect.left + scrollMargin); }
-    else if (rect.right > bounding.right - scrollThreshold)
-      { moveX = rect.right - bounding.right + scrollMargin; }
-    if (moveX || moveY) {
-      if (atTop) {
-        win.scrollBy(moveX, moveY);
-      } else {
-        if (moveY) { parent.scrollTop += moveY; }
-        if (moveX) { parent.scrollLeft += moveX; }
-      }
-    }
-    if (atTop) { break }
-  }
-}
-
-// Store the scroll position of the editor's parent nodes, along with
-// the top position of an element near the top of the editor, which
-// will be used to make sure the visible viewport remains stable even
-// when the size of the content above changes.
-function storeScrollPos(view) {
-  var rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top);
-  var doc = view.dom.ownerDocument;
-  var refDOM, refTop;
-  for (var x = (rect.left + rect.right) / 2, y = startY + 1;
-       y < Math.min(innerHeight, rect.bottom); y += 5) {
-    var dom = view.root.elementFromPoint(x, y);
-    if (dom == view.dom || !view.dom.contains(dom)) { continue }
-    var localRect = dom.getBoundingClientRect();
-    if (localRect.top >= startY - 20) {
-      refDOM = dom;
-      refTop = localRect.top;
-      break
-    }
-  }
-  var stack = [];
-  for (var dom$1 = view.dom; dom$1; dom$1 = parentNode(dom$1)) {
-    stack.push({dom: dom$1, top: dom$1.scrollTop, left: dom$1.scrollLeft});
-    if (dom$1 == doc.body) { break }
-  }
-  return {refDOM: refDOM, refTop: refTop, stack: stack}
-}
-
-// Reset the scroll position of the editor's parent nodes to that what
-// it was before, when storeScrollPos was called.
-function resetScrollPos(ref) {
-  var refDOM = ref.refDOM;
-  var refTop = ref.refTop;
-  var stack = ref.stack;
-
-  var newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;
-  var dTop = newRefTop == 0 ? 0 : newRefTop - refTop;
-  for (var i = 0; i < stack.length; i++) {
-    var ref$1 = stack[i];
-    var dom = ref$1.dom;
-    var top = ref$1.top;
-    var left = ref$1.left;
-    if (dom.scrollTop != top + dTop) { dom.scrollTop = top + dTop; }
-    if (dom.scrollLeft != left) { dom.scrollLeft = left; }
-  }
-}
-
-function findOffsetInNode(node, coords) {
-  var closest, dxClosest = 2e8, coordsClosest, offset = 0;
-  var rowBot = coords.top, rowTop = coords.top;
-  for (var child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {
-    var rects = (void 0);
-    if (child.nodeType == 1) { rects = child.getClientRects(); }
-    else if (child.nodeType == 3) { rects = textRange(child).getClientRects(); }
-    else { continue }
-
-    for (var i = 0; i < rects.length; i++) {
-      var rect = rects[i];
-      if (rect.top <= rowBot && rect.bottom >= rowTop) {
-        rowBot = Math.max(rect.bottom, rowBot);
-        rowTop = Math.min(rect.top, rowTop);
-        var dx = rect.left > coords.left ? rect.left - coords.left
-            : rect.right < coords.left ? coords.left - rect.right : 0;
-        if (dx < dxClosest) {
-          closest = child;
-          dxClosest = dx;
-          coordsClosest = dx && closest.nodeType == 3 ? {left: rect.right < coords.left ? rect.right : rect.left, top: coords.top} : coords;
-          if (child.nodeType == 1 && dx)
-            { offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0); }
-          continue
-        }
-      }
-      if (!closest && (coords.left >= rect.right && coords.top >= rect.top ||
-                       coords.left >= rect.left && coords.top >= rect.bottom))
-        { offset = childIndex + 1; }
-    }
-  }
-  if (closest && closest.nodeType == 3) { return findOffsetInText(closest, coordsClosest) }
-  if (!closest || (dxClosest && closest.nodeType == 1)) { return {node: node, offset: offset} }
-  return findOffsetInNode(closest, coordsClosest)
-}
-
-function findOffsetInText(node, coords) {
-  var len = node.nodeValue.length;
-  var range = document.createRange();
-  for (var i = 0; i < len; i++) {
-    range.setEnd(node, i + 1);
-    range.setStart(node, i);
-    var rect = singleRect(range, 1);
-    if (rect.top == rect.bottom) { continue }
-    if (rect.left - 1 <= coords.left && rect.right + 1 >= coords.left &&
-        rect.top - 1 <= coords.top && rect.bottom + 1 >= coords.top)
-      { return {node: node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0)} }
-  }
-  return {node: node, offset: 0}
-}
-
-function targetKludge(dom, coords) {
-  var parent = dom.parentNode;
-  if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left)
-    { return parent }
-  return dom
-}
-
-function posFromElement(view, elt, coords) {
-  if (!view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) { return null }
-
-  var ref = findOffsetInNode(elt, coords);
-  var node = ref.node;
-  var offset = ref.offset;
-  var bias = -1;
-  if (node.nodeType == 1 && !node.firstChild) {
-    var rect = node.getBoundingClientRect();
-    bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1;
-  }
-  return view.docView.posFromDOM(node, offset, bias)
-}
-
-function posFromCaret(view, node, offset, coords) {
-  // Browser (in caretPosition/RangeFromPoint) will agressively
-  // normalize towards nearby inline nodes. Since we are interested in
-  // positions between block nodes too, we first walk up the hierarchy
-  // of nodes to see if there are block nodes that the coordinates
-  // fall outside of. If so, we take the position before/after that
-  // block. If not, we call `posFromDOM` on the raw node/offset.
-  var outside = -1;
-  for (var cur = node;;) {
-    if (cur == view.dom) { break }
-    var desc = view.docView.nearestDesc(cur, true);
-    if (!desc) { return null }
-    if (desc.node.isBlock && desc.parent) {
-      var rect = desc.dom.getBoundingClientRect();
-      if (rect.left > coords.left || rect.top > coords.top) { outside = desc.posBefore; }
-      else if (rect.right < coords.left || rect.bottom < coords.top) { outside = desc.posAfter; }
-      else { break }
-    }
-    cur = desc.dom.parentNode;
-  }
-  return outside > -1 ? outside : view.docView.posFromDOM(node, offset)
-}
-
-// Given an x,y position on the editor, get the position in the document.
-function posAtCoords(view, coords) {
-  var root = view.root, node, offset;
-  if (root.caretPositionFromPoint) {
-    var pos$1 = root.caretPositionFromPoint(coords.left, coords.top);
-    if (pos$1) { var assign;
-      ((assign = pos$1, node = assign.offsetNode, offset = assign.offset)); }
-  }
-  if (!node && root.caretRangeFromPoint) {
-    var range = root.caretRangeFromPoint(coords.left, coords.top);
-    if (range) { var assign$1;
-      ((assign$1 = range, node = assign$1.startContainer, offset = assign$1.startOffset)); }
-  }
-
-  var elt = root.elementFromPoint(coords.left, coords.top + 1), pos;
-  if (!elt) { return null }
-  elt = targetKludge(elt, coords);
-  if (node) {
-    // Suspiciously specific kludge to work around caret*FromPoint
-    // never returning a position at the end of the document
-    if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 &&
-        coords.top > node.lastChild.getBoundingClientRect().bottom)
-      { pos = view.state.doc.content.size; }
-    // Ignore positions directly after a BR, since caret*FromPoint
-    // 'round up' positions that would be more accurately places
-    // before the BR node.
-    else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != "BR")
-      { pos = posFromCaret(view, node, offset, coords); }
-  }
-  if (pos == null) {
-    pos = posFromElement(view, elt, coords);
-    if (pos == null) { return null }
-  }
-
-  var desc = view.docView.nearestDesc(elt, true);
-  return {pos: pos, inside: desc ? desc.posAtStart - desc.border : -1}
-}
-
-function singleRect(object, bias) {
-  var rects = object.getClientRects();
-  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1]
-}
-
-// : (EditorView, number) → {left: number, top: number, right: number, bottom: number}
-// Given a position in the document model, get a bounding box of the
-// character at that position, relative to the window.
-function coordsAtPos(view, pos) {
-  var ref = view.docView.domFromPos(pos);
-  var node = ref.node;
-  var offset = ref.offset;
-  var side, rect;
-  if (node.nodeType == 3) {
-    if (offset < node.nodeValue.length) {
-      rect = singleRect(textRange(node, offset, offset + 1), -1);
-      side = "left";
-    }
-    if ((!rect || rect.left == rect.right) && offset) {
-      rect = singleRect(textRange(node, offset - 1, offset), 1);
-      side = "right";
-    }
-  } else if (node.firstChild) {
-    if (offset < node.childNodes.length) {
-      var child = node.childNodes[offset];
-      rect = singleRect(child.nodeType == 3 ? textRange(child) : child, -1);
-      side = "left";
-    }
-    if ((!rect || rect.top == rect.bottom) && offset) {
-      var child$1 = node.childNodes[offset - 1];
-      rect = singleRect(child$1.nodeType == 3 ? textRange(child$1) : child$1, 1);
-      side = "right";
-    }
-  } else {
-    rect = node.getBoundingClientRect();
-    side = "left";
-  }
-  var x = rect[side];
-  return {top: rect.top, bottom: rect.bottom, left: x, right: x}
-}
-
-function withFlushedState(view, state, f) {
-  var viewState = view.state, active = view.root.activeElement;
-  if (viewState != state || !view.inDOMChange) { view.updateState(state); }
-  if (active != view.dom) { view.focus(); }
-  try {
-    return f()
-  } finally {
-    if (viewState != state) { view.updateState(viewState); }
-    if (active != view.dom) { active.focus(); }
-  }
-}
-
-// : (EditorView, number, number)
-// Whether vertical position motion in a given direction
-// from a position would leave a text block.
-function endOfTextblockVertical(view, state, dir) {
-  var sel = state.selection;
-  var $pos = dir == "up" ? sel.$anchor.min(sel.$head) : sel.$anchor.max(sel.$head);
-  if (!$pos.depth) { return false }
-  return withFlushedState(view, state, function () {
-    var dom = view.docView.domAfterPos($pos.before());
-    var coords = coordsAtPos(view, $pos.pos);
-    for (var child = dom.firstChild; child; child = child.nextSibling) {
-      var boxes = (void 0);
-      if (child.nodeType == 1) { boxes = child.getClientRects(); }
-      else if (child.nodeType == 3) { boxes = textRange(child, 0, child.nodeValue.length).getClientRects(); }
-      else { continue }
-      for (var i = 0; i < boxes.length; i++) {
-        var box = boxes[i];
-        if (box.bottom > box.top && (dir == "up" ? box.bottom < coords.top + 1 : box.top > coords.bottom - 1))
-          { return false }
-      }
-    }
-    return true
-  })
-}
-
-var maybeRTL = /[\u0590-\u08ac]/;
-
-function endOfTextblockHorizontal(view, state, dir) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  if (!$head.parent.isTextblock || !$head.depth) { return false }
-  var offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size;
-  var sel = getSelection();
-  // If the textblock is all LTR, or the browser doesn't support
-  // Selection.modify (Edge), fall back to a primitive approach
-  if (!maybeRTL.test($head.parent.textContent) || !sel.modify)
-    { return dir == "left" || dir == "backward" ? atStart : atEnd }
-
-  return withFlushedState(view, state, function () {
-    // This is a huge hack, but appears to be the best we can
-    // currently do: use `Selection.modify` to move the selection by
-    // one character, and see if that moves the cursor out of the
-    // textblock (or doesn't move it at all, when at the start/end of
-    // the document).
-    var oldRange = sel.getRangeAt(0), oldNode = sel.focusNode, oldOff = sel.focusOffset;
-    sel.modify("move", dir, "character");
-    var parentDOM = view.docView.domAfterPos($head.before());
-    var result = !parentDOM.contains(sel.focusNode.nodeType == 1 ? sel.focusNode : sel.focusNode.parentNode) ||
-        (oldNode == sel.focusNode && oldOff == sel.focusOffset);
-    // Restore the previous selection
-    sel.removeAllRanges();
-    sel.addRange(oldRange);
-    return result
-  })
-}
-
-var cachedState = null;
-var cachedDir = null;
-var cachedResult = false;
-function endOfTextblock(view, state, dir) {
-  if (cachedState == state && cachedDir == dir) { return cachedResult }
-  cachedState = state; cachedDir = dir;
-  return cachedResult = dir == "up" || dir == "down"
-    ? endOfTextblockVertical(view, state, dir)
-    : endOfTextblockHorizontal(view, state, dir)
-}
-
-// NodeView:: interface
-//
-// By default, document nodes are rendered using the result of the
-// [`toDOM`](#model.NodeSpec.toDOM) method of their spec, and managed
-// entirely by the editor. For some use cases, such as embedded
-// node-specific editing interfaces, you want more control over
-// the behavior of a node's in-editor representation, and need to
-// [define](#view.EditorProps.nodeViews) a custom node view.
-//
-// Objects returned as node views must conform to this interface.
-//
-//   dom:: ?dom.Node
-//   The outer DOM node that represents the document node. When not
-//   given, the default strategy is used to create a DOM node.
-//
-//   contentDOM:: ?dom.Node
-//   The DOM node that should hold the node's content. Only meaningful
-//   if the node view also defines a `dom` property and if its node
-//   type is not a leaf node type. When this is present, ProseMirror
-//   will take care of rendering the node's children into it. When it
-//   is not present, the node view itself is responsible for rendering
-//   (or deciding not to render) its child nodes.
-//
-//   update:: ?(node: Node, decorations: [Decoration]) → bool
-//   When given, this will be called when the view is updating itself.
-//   It will be given a node (possibly of a different type), and an
-//   array of active decorations (which are automatically drawn, and
-//   the node view may ignore if it isn't interested in them), and
-//   should return true if it was able to update to that node, and
-//   false otherwise. If the node view has a `contentDOM` property (or
-//   no `dom` property), updating its child nodes will be handled by
-//   ProseMirror.
-//
-//   selectNode:: ?()
-//   Can be used to override the way the node's selected status (as a
-//   node selection) is displayed.
-//
-//   deselectNode:: ?()
-//   When defining a `selectNode` method, you should also provide a
-//   `deselectNode` method to remove the effect again.
-//
-//   setSelection:: ?(anchor: number, head: number, root: dom.Document)
-//   This will be called to handle setting the selection inside the
-//   node. The `anchor` and `head` positions are relative to the start
-//   of the node. By default, a DOM selection will be created between
-//   the DOM positions corresponding to those positions, but if you
-//   override it you can do something else.
-//
-//   stopEvent:: ?(event: dom.Event) → bool
-//   Can be used to prevent the editor view from trying to handle some
-//   or all DOM events that bubble up from the node view. Events for
-//   which this returns true are not handled by the editor.
-//
-//   ignoreMutation:: ?(dom.MutationRecord) → bool
-//   Called when a DOM
-//   [mutation](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver)
-//   happens within the view. Return false if the editor should
-//   re-parse the range around the mutation, true if it can safely be
-//   ignored.
-//
-//   destroy:: ?()
-//   Called when the node view is removed from the editor or the whole
-//   editor is destroyed.
-
-// View descriptions are data structures that describe the DOM that is
-// used to represent the editor's content. They are used for:
-//
-// - Incremental redrawing when the document changes
-//
-// - Figuring out what part of the document a given DOM position
-//   corresponds to
-//
-// - Wiring in custom implementations of the editing interface for a
-//   given node
-//
-// They form a doubly-linked mutable tree, starting at `view.docView`.
-
-var NOT_DIRTY = 0;
-var CHILD_DIRTY = 1;
-var CONTENT_DIRTY = 2;
-var NODE_DIRTY = 3;
-
-// Superclass for the various kinds of descriptions. Defines their
-// basic structure and shared methods.
-var ViewDesc = function ViewDesc(parent, children, dom, contentDOM) {
-  this.parent = parent;
-  this.children = children;
-  this.dom = dom;
-  // An expando property on the DOM node provides a link back to its
-  // description.
-  dom.pmViewDesc = this;
-  // This is the node that holds the child views. It may be null for
-  // descs that don't have children.
-  this.contentDOM = contentDOM;
-  this.dirty = NOT_DIRTY;
-};
-
-var prototypeAccessors$1 = { beforePosition: {},size: {},border: {},posBefore: {},posAtStart: {},posAfter: {},posAtEnd: {},contentLost: {} };
-
-// Used to check whether a given description corresponds to a
-// widget/mark/node.
-ViewDesc.prototype.matchesWidget = function matchesWidget () { return false };
-ViewDesc.prototype.matchesMark = function matchesMark () { return false };
-ViewDesc.prototype.matchesNode = function matchesNode () { return false };
-ViewDesc.prototype.matchesHack = function matchesHack () { return false };
-
-prototypeAccessors$1.beforePosition.get = function () { return false };
-
-// : () → ?ParseRule
-// When parsing in-editor content (in domchange.js), we allow
-// descriptions to determine the parse rules that should be used to
-// parse them.
-ViewDesc.prototype.parseRule = function parseRule () { return null };
-
-// : (dom.Event) → bool
-// Used by the editor's event handler to ignore events that come
-// from certain descs.
-ViewDesc.prototype.stopEvent = function stopEvent () { return false };
-
-// The size of the content represented by this desc.
-prototypeAccessors$1.size.get = function () {
-    var this$1 = this;
-
-  var size = 0;
-  for (var i = 0; i < this.children.length; i++) { size += this$1.children[i].size; }
-  return size
-};
-
-// For block nodes, this represents the space taken up by their
-// start/end tokens.
-prototypeAccessors$1.border.get = function () { return 0 };
-
-ViewDesc.prototype.destroy = function destroy () {
-    var this$1 = this;
-
-  this.parent = null;
-  if (this.dom.pmViewDesc == this) { this.dom.pmViewDesc = null; }
-  for (var i = 0; i < this.children.length; i++)
-    { this$1.children[i].destroy(); }
-};
-
-ViewDesc.prototype.posBeforeChild = function posBeforeChild (child) {
-    var this$1 = this;
-
-  for (var i = 0, pos = this.posAtStart; i < this.children.length; i++) {
-    var cur = this$1.children[i];
-    if (cur == child) { return pos }
-    pos += cur.size;
-  }
-};
-
-prototypeAccessors$1.posBefore.get = function () {
-  return this.parent.posBeforeChild(this)
-};
-
-prototypeAccessors$1.posAtStart.get = function () {
-  return this.parent ? this.parent.posBeforeChild(this) + this.border : 0
-};
-
-prototypeAccessors$1.posAfter.get = function () {
-  return this.posBefore + this.size
-};
-
-prototypeAccessors$1.posAtEnd.get = function () {
-  return this.posAtStart + this.size - 2 * this.border
-};
-
-// : (dom.Node, number, ?number) → number
-ViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {
-    var this$1 = this;
-
-  // If the DOM position is in the content, use the child desc after
-  // it to figure out a position.
-  if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {
-    if (bias < 0) {
-      var domBefore, desc;
-      if (dom == this.contentDOM) {
-        domBefore = dom.childNodes[offset - 1];
-      } else {
-        while (dom.parentNode != this.contentDOM) { dom = dom.parentNode; }
-        domBefore = dom.previousSibling;
-      }
-      while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this)) { domBefore = domBefore.previousSibling; }
-      return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart
-    } else {
-      var domAfter, desc$1;
-      if (dom == this.contentDOM) {
-        domAfter = dom.childNodes[offset];
-      } else {
-        while (dom.parentNode != this.contentDOM) { dom = dom.parentNode; }
-        domAfter = dom.nextSibling;
-      }
-      while (domAfter && !((desc$1 = domAfter.pmViewDesc) && desc$1.parent == this)) { domAfter = domAfter.nextSibling; }
-      return domAfter ? this.posBeforeChild(desc$1) : this.posAtEnd
-    }
-  }
-  // Otherwise, use various heuristics, falling back on the bias
-  // parameter, to determine whether to return the position at the
-  // start or at the end of this view desc.
-  var atEnd;
-  if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {
-    atEnd = dom.compareDocumentPosition(this.contentDOM) & 2;
-  } else if (this.dom.firstChild) {
-    if (offset == 0) { for (var search = dom;; search = search.parentNode) {
-      if (search == this$1.dom) { atEnd = false; break }
-      if (search.parentNode.firstChild != search) { break }
-    } }
-    if (atEnd == null && offset == dom.childNodes.length) { for (var search$1 = dom;; search$1 = search$1.parentNode) {
-      if (search$1 == this$1.dom) { atEnd = true; break }
-      if (search$1.parentNode.lastChild != search$1) { break }
-    } }
-  }
-  return (atEnd == null ? bias > 0 : atEnd) ? this.posAtEnd : this.posAtStart
-};
-
-// Scan up the dom finding the first desc that is a descendant of
-// this one.
-ViewDesc.prototype.nearestDesc = function nearestDesc (dom, onlyNodes) {
-    var this$1 = this;
-
-  for (var first = true, cur = dom; cur; cur = cur.parentNode) {
-    var desc = this$1.getDesc(cur);
-    if (desc && (!onlyNodes || desc.node)) {
-      // If dom is outside of this desc's nodeDOM, don't count it.
-      if (first && desc.nodeDOM && !(desc.nodeDOM.nodeType == 1 ? desc.nodeDOM.contains(dom) : desc.nodeDOM == dom)) { first = false; }
-      else { return desc }
-    }
-  }
-};
-
-ViewDesc.prototype.getDesc = function getDesc (dom) {
-    var this$1 = this;
-
-  var desc = dom.pmViewDesc;
-  for (var cur = desc; cur; cur = cur.parent) { if (cur == this$1) { return desc } }
-};
-
-ViewDesc.prototype.posFromDOM = function posFromDOM (dom, offset, bias) {
-    var this$1 = this;
-
-  for (var scan = dom;; scan = scan.parentNode) {
-    var desc = this$1.getDesc(scan);
-    if (desc) { return desc.localPosFromDOM(dom, offset, bias) }
-  }
-};
-
-// : (number) → ?NodeViewDesc
-// Find the desc for the node after the given pos, if any. (When a
-// parent node overrode rendering, there might not be one.)
-ViewDesc.prototype.descAt = function descAt (pos) {
-    var this$1 = this;
-
-  for (var i = 0, offset = 0; i < this.children.length; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (offset == pos && end != offset) {
-      while (!child.border && child.children.length) { child = child.children[0]; }
-      return child
-    }
-    if (pos < end) { return child.descAt(pos - offset - child.border) }
-    offset = end;
-  }
-};
-
-// : (number) → {node: dom.Node, offset: number}
-ViewDesc.prototype.domFromPos = function domFromPos (pos) {
-    var this$1 = this;
-
-  if (!this.contentDOM) { return {node: this.dom, offset: 0} }
-  for (var offset = 0, i = 0;; i++) {
-    if (offset == pos) {
-      while (i < this.children.length && this.children[i].beforePosition) { i++; }
-      return {node: this$1.contentDOM, offset: i}
-    }
-    if (i == this$1.children.length) { throw new Error("Invalid position " + pos) }
-    var child = this$1.children[i], end = offset + child.size;
-    if (pos < end) { return child.domFromPos(pos - offset - child.border) }
-    offset = end;
-  }
-};
-
-// Used to find a DOM range in a single parent for a given changed
-// range.
-ViewDesc.prototype.parseRange = function parseRange (from, to, base) {
-    var this$1 = this;
-    if ( base === void 0 ) { base = 0; }
-
-  if (this.children.length == 0)
-    { return {node: this.contentDOM, from: from, to: to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length} }
-
-  var fromOffset = -1, toOffset = -1;
-  for (var offset = 0, i = 0;; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (fromOffset == -1 && from <= end) {
-      var childBase = offset + child.border;
-      // FIXME maybe descend mark views to parse a narrower range?
-      if (from >= childBase && to <= end - child.border && child.node &&
-          child.contentDOM && this$1.contentDOM.contains(child.contentDOM))
-        { return child.parseRange(from - childBase, to - childBase, base + childBase) }
-
-      from = base + offset;
-      for (var j = i; j > 0; j--) {
-        var prev = this$1.children[j - 1];
-        if (prev.size && prev.dom.parentNode == this$1.contentDOM && !prev.emptyChildAt(1)) {
-          fromOffset = domIndex(prev.dom) + 1;
-          break
-        }
-        from -= prev.size;
-      }
-      if (fromOffset == -1) { fromOffset = 0; }
-    }
-    if (fromOffset > -1 && to <= end) {
-      to = base + end;
-      for (var j$1 = i + 1; j$1 < this.children.length; j$1++) {
-        var next = this$1.children[j$1];
-        if (next.size && next.dom.parentNode == this$1.contentDOM && !next.emptyChildAt(-1)) {
-          toOffset = domIndex(next.dom);
-          break
-        }
-        to += next.size;
-      }
-      if (toOffset == -1) { toOffset = this$1.contentDOM.childNodes.length; }
-      break
-    }
-    offset = end;
-  }
-  return {node: this.contentDOM, from: from, to: to, fromOffset: fromOffset, toOffset: toOffset}
-};
-
-ViewDesc.prototype.emptyChildAt = function emptyChildAt (side) {
-  if (this.border || !this.contentDOM || !this.children.length) { return false }
-  var child = this.children[side < 0 ? 0 : this.children.length - 1];
-  return child.size == 0 || child.emptyChildAt(side)
-};
-
-// : (number) → dom.Node
-ViewDesc.prototype.domAfterPos = function domAfterPos (pos) {
-  var ref = this.domFromPos(pos);
-    var node = ref.node;
-    var offset = ref.offset;
-  if (node.nodeType != 1 || offset == node.childNodes.length)
-    { throw new RangeError("No node after pos " + pos) }
-  return node.childNodes[offset]
-};
-
-// : (number, number, dom.Document)
-// View descs are responsible for setting any selection that falls
-// entirely inside of them, so that custom implementations can do
-// custom things with the selection. Note that this falls apart when
-// a selection starts in such a node and ends in another, in which
-// case we just use whatever domFromPos produces as a best effort.
-ViewDesc.prototype.setSelection = function setSelection (anchor, head, root) {
-    var this$1 = this;
-
-  // If the selection falls entirely in a child, give it to that child
-  var from = Math.min(anchor, head), to = Math.max(anchor, head);
-  for (var i = 0, offset = 0; i < this.children.length; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (from > offset && to < end)
-      { return child.setSelection(anchor - offset - child.border, head - offset - child.border, root) }
-    offset = end;
-  }
-
-  var anchorDOM = this.domFromPos(anchor), headDOM = this.domFromPos(head);
-  var domSel = root.getSelection(), range = document.createRange();
-  if (isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset) &&
-      isEquivalentPosition(headDOM.node, headDOM.offset, domSel.focusNode, domSel.focusOffset))
-    { return }
-
-  // Selection.extend can be used to create an 'inverted' selection
-  // (one where the focus is before the anchor), but not all
-  // browsers support it yet.
-  if (domSel.extend) {
-    range.setEnd(anchorDOM.node, anchorDOM.offset);
-    range.collapse(false);
-  } else {
-    if (anchor > head) { var tmp = anchorDOM; anchorDOM = headDOM; headDOM = tmp; }
-    range.setEnd(headDOM.node, headDOM.offset);
-    range.setStart(anchorDOM.node, anchorDOM.offset);
-  }
-  domSel.removeAllRanges();
-  domSel.addRange(range);
-  if (domSel.extend)
-    { domSel.extend(headDOM.node, headDOM.offset); }
-};
-
-// : (dom.MutationRecord) → bool
-ViewDesc.prototype.ignoreMutation = function ignoreMutation (_mutation) {
-  return !this.contentDOM
-};
-
-prototypeAccessors$1.contentLost.get = function () {
-  return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM)
-};
-
-// Remove a subtree of the element tree that has been touched
-// by a DOM change, so that the next update will redraw it.
-ViewDesc.prototype.markDirty = function markDirty (from, to) {
-    var this$1 = this;
-
-  for (var offset = 0, i = 0; i < this.children.length; i++) {
-    var child = this$1.children[i], end = offset + child.size;
-    if (offset == end ? from <= end && to >= offset : from < end && to > offset) {
-      var startInside = offset + child.border, endInside = end - child.border;
-      if (from >= startInside && to <= endInside) {
-        this$1.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;
-        if (from == startInside && to == endInside && child.contentLost) { child.dirty = NODE_DIRTY; }
-        else { child.markDirty(from - startInside, to - startInside); }
-        return
-      } else {
-        child.dirty = NODE_DIRTY;
-      }
-    }
-    offset = end;
-  }
-  this.dirty = CONTENT_DIRTY;
-};
-
-Object.defineProperties( ViewDesc.prototype, prototypeAccessors$1 );
-
-// Reused array to avoid allocating fresh arrays for things that will
-// stay empty anyway.
-var nothing = [];
-
-// A widget desc represents a widget decoration, which is a DOM node
-// drawn between the document nodes.
-var WidgetViewDesc = (function (ViewDesc) {
-  function WidgetViewDesc(parent, widget, view, pos) {
-    var self, dom = widget.type.toDOM;
-    if (typeof dom == "function") { dom = dom(view, function () {
-      if (!self) { return pos }
-      if (self.parent) { return self.parent.posBeforeChild(self) }
-    }); }
-    if (!widget.type.spec.raw) {
-      if (dom.nodeType != 1) {
-        var wrap = document.createElement("span");
-        wrap.appendChild(dom);
-        dom = wrap;
-      }
-      dom.contentEditable = false;
-      dom.classList.add("ProseMirror-widget");
-    }
-    ViewDesc.call(this, parent, nothing, dom, null);
-    this.widget = widget;
-    self = this;
-  }
-
-  if ( ViewDesc ) { WidgetViewDesc.__proto__ = ViewDesc; }
-  WidgetViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  WidgetViewDesc.prototype.constructor = WidgetViewDesc;
-
-  var prototypeAccessors$1 = { beforePosition: {} };
-
-  prototypeAccessors$1.beforePosition.get = function () {
-    return this.widget.type.side < 0
-  };
-
-  WidgetViewDesc.prototype.matchesWidget = function matchesWidget (widget) {
-    return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type)
-  };
-
-  WidgetViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };
-
-  WidgetViewDesc.prototype.stopEvent = function stopEvent (event) {
-    var stop = this.widget.spec.stopEvent;
-    return stop ? stop(event) : false
-  };
-
-  Object.defineProperties( WidgetViewDesc.prototype, prototypeAccessors$1 );
-
-  return WidgetViewDesc;
-}(ViewDesc));
-
-// A cursor wrapper is used to put the cursor in when newly typed text
-// needs to be styled differently from its surrounding text (for
-// example through storedMarks), so that the style of the text doesn't
-// visually 'pop' between typing it and actually updating the view.
-var CursorWrapperDesc = (function (WidgetViewDesc) {
-  function CursorWrapperDesc () {
-    WidgetViewDesc.apply(this, arguments);
-  }
-
-  if ( WidgetViewDesc ) { CursorWrapperDesc.__proto__ = WidgetViewDesc; }
-  CursorWrapperDesc.prototype = Object.create( WidgetViewDesc && WidgetViewDesc.prototype );
-  CursorWrapperDesc.prototype.constructor = CursorWrapperDesc;
-
-  CursorWrapperDesc.prototype.parseRule = function parseRule () {
-    var content;
-    for (var child = this.dom.firstChild; child; child = child.nextSibling) {
-      var add = (void 0);
-      if (child.nodeType == 3) {
-        var text = child.nodeValue.replace(/\ufeff/g, "");
-        if (!text) { continue }
-        add = document.createTextNode(text);
-      } else if (child.textContent == "\ufeff") {
-        continue
-      } else {
-        add = child.cloneNode(true);
-      }
-      if (!content) { content = document.createDocumentFragment(); }
-      content.appendChild(add);
-    }
-    if (content) { return {skip: content} }
-    else { return WidgetViewDesc.prototype.parseRule.call(this) }
-  };
-
-  CursorWrapperDesc.prototype.ignoreMutation = function ignoreMutation () { return false };
-
-  return CursorWrapperDesc;
-}(WidgetViewDesc));
-
-// A mark desc represents a mark. May have multiple children,
-// depending on how the mark is split. Note that marks are drawn using
-// a fixed nesting order, for simplicity and predictability, so in
-// some cases they will be split more often than would appear
-// necessary.
-var MarkViewDesc = (function (ViewDesc) {
-  function MarkViewDesc(parent, mark, dom, contentDOM) {
-    ViewDesc.call(this, parent, [], dom, contentDOM);
-    this.mark = mark;
-  }
-
-  if ( ViewDesc ) { MarkViewDesc.__proto__ = ViewDesc; }
-  MarkViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  MarkViewDesc.prototype.constructor = MarkViewDesc;
-
-  MarkViewDesc.create = function create (parent, mark, inline, view) {
-    var custom = customNodeViews(view)[mark.type.name];
-    var spec = custom && custom(mark, view);
-    if (!spec || !spec.dom)
-      { spec = dist.DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline)); }
-    return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom)
-  };
-
-  MarkViewDesc.prototype.parseRule = function parseRule () { return {mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM} };
-
-  MarkViewDesc.prototype.matchesMark = function matchesMark (mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark) };
-
-  MarkViewDesc.prototype.markDirty = function markDirty (from, to) {
-    ViewDesc.prototype.markDirty.call(this, from, to);
-    // Move dirty info to nearest node view
-    if (this.dirty != NOT_DIRTY) {
-      var parent = this.parent;
-      while (!parent.node) { parent = parent.parent; }
-      if (parent.dirty < this.dirty) { parent.dirty = this.dirty; }
-      this.dirty = NOT_DIRTY;
-    }
-  };
-
-  return MarkViewDesc;
-}(ViewDesc));
-
-// Node view descs are the main, most common type of view desc, and
-// correspond to an actual node in the document. Unlike mark descs,
-// they populate their child array themselves.
-var NodeViewDesc = (function (ViewDesc) {
-  function NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {
-    ViewDesc.call(this, parent, node.isLeaf ? nothing : [], dom, contentDOM);
-    this.nodeDOM = nodeDOM;
-    this.node = node;
-    this.outerDeco = outerDeco;
-    this.innerDeco = innerDeco;
-    if (contentDOM) { this.updateChildren(view, pos); }
-  }
-
-  if ( ViewDesc ) { NodeViewDesc.__proto__ = ViewDesc; }
-  NodeViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  NodeViewDesc.prototype.constructor = NodeViewDesc;
-
-  var prototypeAccessors$2 = { size: {},border: {} };
-
-  // By default, a node is rendered using the `toDOM` method from the
-  // node type spec. But client code can use the `nodeViews` spec to
-  // supply a custom node view, which can influence various aspects of
-  // the way the node works.
-  //
-  // (Using subclassing for this was intentionally decided against,
-  // since it'd require exposing a whole slew of finnicky
-  // implementation details to the user code that they probably will
-  // never need.)
-  NodeViewDesc.create = function create (parent, node, outerDeco, innerDeco, view, pos) {
-    var custom = customNodeViews(view)[node.type.name], descObj;
-    var spec = custom && custom(node, view, function () {
-      // (This is a function that allows the custom view to find its
-      // own position)
-      if (!descObj) { return pos }
-      if (descObj.parent) { return descObj.parent.posBeforeChild(descObj) }
-    }, outerDeco);
-
-    var dom = spec && spec.dom, contentDOM = spec && spec.contentDOM;
-    if (node.isText) {
-      if (!dom) { dom = document.createTextNode(node.text); }
-      else if (dom.nodeType != 3) { throw new RangeError("Text must be rendered as a DOM text node") }
-    } else if (!dom) {
-      var assign;
-      ((assign = dist.DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)), dom = assign.dom, contentDOM = assign.contentDOM));
-    }
-    if (!contentDOM && !node.isText && dom.nodeName != "BR") { // Chrome gets confused by <br contenteditable=false>
-      dom.contentEditable = false;
-      if (node.type.spec.draggable) { dom.draggable = true; }
-    }
-
-    var nodeDOM = dom;
-    dom = applyOuterDeco(dom, outerDeco, node);
-
-    if (spec)
-      { return descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view) }
-    else if (node.isText)
-      { return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) }
-    else
-      { return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos + 1) }
-  };
-
-  NodeViewDesc.prototype.parseRule = function parseRule () {
-    var this$1 = this;
-
-    // Experimental kludge to allow opt-in re-parsing of nodes
-    if (this.node.type.spec.reparseInView) { return null }
-    // FIXME the assumption that this can always return the current
-    // attrs means that if the user somehow manages to change the
-    // attrs in the dom, that won't be picked up. Not entirely sure
-    // whether this is a problem
-    var rule = {node: this.node.type.name, attrs: this.node.attrs};
-    if (this.node.type.spec.code) { rule.preserveWhitespace = "full"; }
-    if (this.contentDOM && !this.contentLost) { rule.contentElement = this.contentDOM; }
-    else { rule.getContent = function () { return this$1.contentDOM ? dist.Fragment.empty : this$1.node.content; }; }
-    return rule
-  };
-
-  NodeViewDesc.prototype.matchesNode = function matchesNode (node, outerDeco, innerDeco) {
-    return this.dirty == NOT_DIRTY && node.eq(this.node) &&
-      sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco)
-  };
-
-  prototypeAccessors$2.size.get = function () { return this.node.nodeSize };
-
-  prototypeAccessors$2.border.get = function () { return this.node.isLeaf ? 0 : 1 };
-
-  // Syncs `this.children` to match `this.node.content` and the local
-  // decorations, possibly introducing nesting for marks. Then, in a
-  // separate step, syncs the DOM inside `this.contentDOM` to
-  // `this.children`.
-  NodeViewDesc.prototype.updateChildren = function updateChildren (view, pos) {
-    var this$1 = this;
-
-    var updater = new ViewTreeUpdater(this), inline = this.node.inlineContent;
-    iterDeco(this.node, this.innerDeco, function (widget, i) {
-      if (widget.spec.marks)
-        { updater.syncToMarks(widget.spec.marks, inline, view); }
-      else if (widget.type.side >= 0)
-        { updater.syncToMarks(i == this$1.node.childCount ? dist.Mark.none : this$1.node.child(i).marks, inline, view); }
-      // If the next node is a desc matching this widget, reuse it,
-      // otherwise insert the widget as a new view desc.
-      updater.placeWidget(widget, view, pos);
-    }, function (child, outerDeco, innerDeco, i) {
-      // Make sure the wrapping mark descs match the node's marks.
-      updater.syncToMarks(child.marks, inline, view);
-      // Either find an existing desc that exactly matches this node,
-      // and drop the descs before it.
-      updater.findNodeMatch(child, outerDeco, innerDeco, i) ||
-        // Or try updating the next desc to reflect this node.
-        updater.updateNextNode(child, outerDeco, innerDeco, view, i) ||
-        // Or just add it as a new desc.
-        updater.addNode(child, outerDeco, innerDeco, view, pos);
-      pos += child.nodeSize;
-    });
-    // Drop all remaining descs after the current position.
-    updater.syncToMarks(nothing, inline, view);
-    if (this.node.isTextblock) { updater.addTextblockHacks(); }
-    updater.destroyRest();
-
-    // Sync the DOM if anything changed
-    if (updater.changed || this.dirty == CONTENT_DIRTY) { this.renderChildren(); }
-  };
-
-  NodeViewDesc.prototype.renderChildren = function renderChildren () {
-    renderDescs(this.contentDOM, this.children, NodeViewDesc.is);
-    if (result.ios) { iosHacks(this.dom); }
-  };
-
-  // : (Node, [Decoration], DecorationSet, EditorView) → bool
-  // If this desc be updated to match the given node decoration,
-  // do so and return true.
-  NodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {
-    if (this.dirty == NODE_DIRTY ||
-        !node.sameMarkup(this.node)) { return false }
-    this.updateInner(node, outerDeco, innerDeco, view);
-    return true
-  };
-
-  NodeViewDesc.prototype.updateInner = function updateInner (node, outerDeco, innerDeco, view) {
-    this.updateOuterDeco(outerDeco);
-    this.node = node;
-    this.innerDeco = innerDeco;
-    if (this.contentDOM) { this.updateChildren(view, this.posAtStart); }
-    this.dirty = NOT_DIRTY;
-  };
-
-  NodeViewDesc.prototype.updateOuterDeco = function updateOuterDeco (outerDeco) {
-    if (sameOuterDeco(outerDeco, this.outerDeco)) { return }
-    var needsWrap = this.nodeDOM.nodeType != 1;
-    var oldDOM = this.dom;
-    this.dom = patchOuterDeco(this.dom, this.nodeDOM,
-                              computeOuterDeco(this.outerDeco, this.node, needsWrap),
-                              computeOuterDeco(outerDeco, this.node, needsWrap));
-    if (this.dom != oldDOM) {
-      oldDOM.pmViewDesc = null;
-      this.dom.pmViewDesc = this;
-    }
-    this.outerDeco = outerDeco;
-  };
-
-  // Mark this node as being the selected node.
-  NodeViewDesc.prototype.selectNode = function selectNode () {
-    this.nodeDOM.classList.add("ProseMirror-selectednode");
-  };
-
-  // Remove selected node marking from this node.
-  NodeViewDesc.prototype.deselectNode = function deselectNode () {
-    this.nodeDOM.classList.remove("ProseMirror-selectednode");
-  };
-
-  Object.defineProperties( NodeViewDesc.prototype, prototypeAccessors$2 );
-
-  return NodeViewDesc;
-}(ViewDesc));
-
-// Create a view desc for the top-level document node, to be exported
-// and used by the view class.
-function docViewDesc(doc, outerDeco, innerDeco, dom, view) {
-  applyOuterDeco(dom, outerDeco, doc, true);
-  return new NodeViewDesc(null, doc, outerDeco, innerDeco, dom, dom, dom, view, 0)
-}
-
-var TextViewDesc = (function (NodeViewDesc) {
-  function TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {
-    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view);
-  }
-
-  if ( NodeViewDesc ) { TextViewDesc.__proto__ = NodeViewDesc; }
-  TextViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );
-  TextViewDesc.prototype.constructor = TextViewDesc;
-
-  TextViewDesc.prototype.parseRule = function parseRule () {
-    var parent = this.nodeDOM.parentNode;
-    return parent ? {skip: parent} : {ignore: true}
-  };
-
-  TextViewDesc.prototype.update = function update (node, outerDeco) {
-    if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) ||
-        !node.sameMarkup(this.node)) { return false }
-    this.updateOuterDeco(outerDeco);
-    if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue)
-      { this.nodeDOM.nodeValue = node.text; }
-    this.node = node;
-    this.dirty = NOT_DIRTY;
-    return true
-  };
-
-  TextViewDesc.prototype.inParent = function inParent () {
-    var parentDOM = this.parent.contentDOM;
-    for (var n = this.nodeDOM; n; n = n.parentNode) { if (n == parentDOM) { return true } }
-    return false
-  };
-
-  TextViewDesc.prototype.domFromPos = function domFromPos (pos) {
-    return {node: this.nodeDOM, offset: pos}
-  };
-
-  TextViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {
-    if (dom == this.nodeDOM) { return this.posAtStart + Math.min(offset, this.node.text.length) }
-    return NodeViewDesc.prototype.localPosFromDOM.call(this, dom, offset, bias)
-  };
-
-  TextViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {
-    return mutation.type != "characterData"
-  };
-
-  return TextViewDesc;
-}(NodeViewDesc));
-
-// A dummy desc used to tag trailing BR or span nodes created to work
-// around contentEditable terribleness.
-var BRHackViewDesc = (function (ViewDesc) {
-  function BRHackViewDesc () {
-    ViewDesc.apply(this, arguments);
-  }
-
-  if ( ViewDesc ) { BRHackViewDesc.__proto__ = ViewDesc; }
-  BRHackViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-  BRHackViewDesc.prototype.constructor = BRHackViewDesc;
-
-  BRHackViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };
-  BRHackViewDesc.prototype.matchesHack = function matchesHack () { return this.dirty == NOT_DIRTY };
-
-  return BRHackViewDesc;
-}(ViewDesc));
-
-// A separate subclass is used for customized node views, so that the
-// extra checks only have to be made for nodes that are actually
-// customized.
-var CustomNodeViewDesc = (function (NodeViewDesc) {
-  function CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view) {
-    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view);
-    this.spec = spec;
-  }
-
-  if ( NodeViewDesc ) { CustomNodeViewDesc.__proto__ = NodeViewDesc; }
-  CustomNodeViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );
-  CustomNodeViewDesc.prototype.constructor = CustomNodeViewDesc;
-
-  // A custom `update` method gets to decide whether the update goes
-  // through. If it does, and there's a `contentDOM` node, our logic
-  // updates the children.
-  CustomNodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {
-    if (this.dirty == NODE_DIRTY) { return false }
-    if (this.spec.update) {
-      var result$$1 = this.spec.update(node, outerDeco);
-      if (result$$1) { this.updateInner(node, outerDeco, innerDeco, view); }
-      return result$$1
-    } else if (!this.contentDOM && !node.isLeaf) {
-      return false
-    } else {
-      return NodeViewDesc.prototype.update.call(this, node, outerDeco, innerDeco, view)
-    }
-  };
-
-  CustomNodeViewDesc.prototype.selectNode = function selectNode () {
-    this.spec.selectNode ? this.spec.selectNode() : NodeViewDesc.prototype.selectNode.call(this);
-  };
-
-  CustomNodeViewDesc.prototype.deselectNode = function deselectNode () {
-    this.spec.deselectNode ? this.spec.deselectNode() : NodeViewDesc.prototype.deselectNode.call(this);
-  };
-
-  CustomNodeViewDesc.prototype.setSelection = function setSelection (anchor, head, root) {
-    this.spec.setSelection ? this.spec.setSelection(anchor, head, root) : NodeViewDesc.prototype.setSelection.call(this, anchor, head, root);
-  };
-
-  CustomNodeViewDesc.prototype.destroy = function destroy () {
-    if (this.spec.destroy) { this.spec.destroy(); }
-    NodeViewDesc.prototype.destroy.call(this);
-  };
-
-  CustomNodeViewDesc.prototype.stopEvent = function stopEvent (event) {
-    return this.spec.stopEvent ? this.spec.stopEvent(event) : false
-  };
-
-  CustomNodeViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {
-    return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : NodeViewDesc.prototype.ignoreMutation.call(this, mutation)
-  };
-
-  return CustomNodeViewDesc;
-}(NodeViewDesc));
-
-// : (dom.Node, [ViewDesc])
-// Sync the content of the given DOM node with the nodes associated
-// with the given array of view descs, recursing into mark descs
-// because this should sync the subtree for a whole node at a time.
-function renderDescs(parentDOM, descs) {
-  var dom = parentDOM.firstChild;
-  for (var i = 0; i < descs.length; i++) {
-    var desc = descs[i], childDOM = desc.dom;
-    if (childDOM.parentNode == parentDOM) {
-      while (childDOM != dom) { dom = rm(dom); }
-      dom = dom.nextSibling;
-    } else {
-      parentDOM.insertBefore(childDOM, dom);
-    }
-    if (desc instanceof MarkViewDesc) {
-      var pos = dom ? dom.previousSibling : parentDOM.lastChild;
-      renderDescs(desc.contentDOM, desc.children);
-      dom = pos ? pos.nextSibling : parentDOM.firstChild;
-    }
-  }
-  while (dom) { dom = rm(dom); }
-}
-
-function OuterDecoLevel(nodeName) {
-  if (nodeName) { this.nodeName = nodeName; }
-}
-OuterDecoLevel.prototype = Object.create(null);
-
-var noDeco = [new OuterDecoLevel];
-
-function computeOuterDeco(outerDeco, node, needsWrap) {
-  if (outerDeco.length == 0) { return noDeco }
-
-  var top = needsWrap ? noDeco[0] : new OuterDecoLevel, result$$1 = [top];
-
-  for (var i = 0; i < outerDeco.length; i++) {
-    var attrs = outerDeco[i].type.attrs, cur = top;
-    if (!attrs) { continue }
-    if (attrs.nodeName)
-      { result$$1.push(cur = new OuterDecoLevel(attrs.nodeName)); }
-
-    for (var name in attrs) {
-      var val = attrs[name];
-      if (val == null) { continue }
-      if (needsWrap && result$$1.length == 1)
-        { result$$1.push(cur = top = new OuterDecoLevel(node.isInline ? "span" : "div")); }
-      if (name == "class") { cur.class = (cur.class ? cur.class + " " : "") + val; }
-      else if (name == "style") { cur.style = (cur.style ? cur.style + ";" : "") + val; }
-      else if (name != "nodeName") { cur[name] = val; }
-    }
-  }
-
-  return result$$1
-}
-
-function patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {
-  // Shortcut for trivial case
-  if (prevComputed == noDeco && curComputed == noDeco) { return nodeDOM }
-
-  var curDOM = nodeDOM;
-  for (var i = 0; i < curComputed.length; i++) {
-    var deco = curComputed[i], prev = prevComputed[i];
-    if (i) {
-      var parent = (void 0);
-      if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&
-          (parent = nodeDOM.parentNode) && parent.tagName.toLowerCase() == deco.nodeName) {
-        curDOM = parent;
-      } else {
-        parent = document.createElement(deco.nodeName);
-        parent.appendChild(curDOM);
-        curDOM = parent;
-      }
-    }
-    patchAttributes(curDOM, prev || noDeco[0], deco);
-  }
-  return curDOM
-}
-
-function patchAttributes(dom, prev, cur) {
-  for (var name in prev)
-    { if (name != "class" && name != "style" && name != "nodeName" && !(name in cur))
-      { dom.removeAttribute(name); } }
-  for (var name$1 in cur)
-    { if (name$1 != "class" && name$1 != "style" && name$1 != "nodeName" && cur[name$1] != prev[name$1])
-      { dom.setAttribute(name$1, cur[name$1]); } }
-  if (prev.class != cur.class) {
-    var prevList = prev.class ? prev.class.split(" ") : nothing;
-    var curList = cur.class ? cur.class.split(" ") : nothing;
-    for (var i = 0; i < prevList.length; i++) { if (curList.indexOf(prevList[i]) == -1)
-      { dom.classList.remove(prevList[i]); } }
-    for (var i$1 = 0; i$1 < curList.length; i$1++) { if (prevList.indexOf(curList[i$1]) == -1)
-      { dom.classList.add(curList[i$1]); } }
-  }
-  if (prev.style != cur.style) {
-    if (prev.style) {
-      var prop = /\s*([\w\-\xa1-\uffff]+)\s*:(?:"(?:\\.|[^"])*"|'(?:\\.|[^'])*'|\(.*?\)|[^;])*/g, m;
-      while (m = prop.exec(prev.style))
-        { dom.style[m[1].toLowerCase()] = ""; }
-    }
-    if (cur.style)
-      { dom.style.cssText += cur.style; }
-  }
-}
-
-function applyOuterDeco(dom, deco, node) {
-  return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1))
-}
-
-// : ([Decoration], [Decoration]) → bool
-function sameOuterDeco(a, b) {
-  if (a.length != b.length) { return false }
-  for (var i = 0; i < a.length; i++) { if (!a[i].type.eq(b[i].type)) { return false } }
-  return true
-}
-
-// Remove a DOM node and return its next sibling.
-function rm(dom) {
-  var next = dom.nextSibling;
-  dom.parentNode.removeChild(dom);
-  return next
-}
-
-// Helper class for incrementally updating a tree of mark descs and
-// the widget and node descs inside of them.
-var ViewTreeUpdater = function ViewTreeUpdater(top) {
-  this.top = top;
-  // Index into `this.top`'s child array, represents the current
-  // update position.
-  this.index = 0;
-  // When entering a mark, the current top and index are pushed
-  // onto this.
-  this.stack = [];
-  // Tracks whether anything was changed
-  this.changed = false;
-
-  this.preMatched = preMatch(top.node.content, top.children);
-};
-
-// Destroy and remove the children between the given indices in
-// `this.top`.
-ViewTreeUpdater.prototype.destroyBetween = function destroyBetween (start, end) {
-    var this$1 = this;
-
-  if (start == end) { return }
-  for (var i = start; i < end; i++) { this$1.top.children[i].destroy(); }
-  this.top.children.splice(start, end - start);
-  this.changed = true;
-};
-
-// Destroy all remaining children in `this.top`.
-ViewTreeUpdater.prototype.destroyRest = function destroyRest () {
-  this.destroyBetween(this.index, this.top.children.length);
-};
-
-// : ([Mark], EditorView)
-// Sync the current stack of mark descs with the given array of
-// marks, reusing existing mark descs when possible.
-ViewTreeUpdater.prototype.syncToMarks = function syncToMarks (marks, inline, view) {
-    var this$1 = this;
-
-  var keep = 0, depth = this.stack.length >> 1;
-  var maxKeep = Math.min(depth, marks.length), next;
-  while (keep < maxKeep &&
-         (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1]).matchesMark(marks[keep]))
-    { keep++; }
-
-  while (keep < depth) {
-    this$1.destroyRest();
-    this$1.top.dirty = NOT_DIRTY;
-    this$1.index = this$1.stack.pop();
-    this$1.top = this$1.stack.pop();
-    depth--;
-  }
-  while (depth < marks.length) {
-    this$1.stack.push(this$1.top, this$1.index + 1);
-    if (this$1.index < this$1.top.children.length &&
-        (next = this$1.top.children[this$1.index]).matchesMark(marks[depth])) {
-      this$1.top = next;
-    } else {
-      var markDesc = MarkViewDesc.create(this$1.top, marks[depth], inline, view);
-      this$1.top.children.splice(this$1.index, 0, markDesc);
-      this$1.top = markDesc;
-      this$1.changed = true;
-    }
-    this$1.index = 0;
-    depth++;
-  }
-};
-
-// : (Node, [Decoration], DecorationSet) → bool
-// Try to find a node desc matching the given data. Skip over it and
-// return true when successful.
-ViewTreeUpdater.prototype.findNodeMatch = function findNodeMatch (node, outerDeco, innerDeco, index) {
-    var this$1 = this;
-
-  for (var i = this.index, children = this.top.children, e = Math.min(children.length, i + 5); i < e; i++) {
-    var child = children[i], preMatched = (void 0);
-    if (child.matchesNode(node, outerDeco, innerDeco) &&
-        ((preMatched = this$1.preMatched.indexOf(child)) == -1 || preMatched == index)) {
-      this$1.destroyBetween(this$1.index, i);
-      this$1.index++;
-      return true
-    }
-  }
-  return false
-};
-
-// : (Node, [Decoration], DecorationSet, EditorView, Fragment, number) → bool
-// Try to update the next node, if any, to the given data. Checks
-// pre-matches to avoid overwriting nodes that could still be used.
-ViewTreeUpdater.prototype.updateNextNode = function updateNextNode (node, outerDeco, innerDeco, view, index) {
-  if (this.index == this.top.children.length) { return false }
-  var next = this.top.children[this.index];
-  if (next instanceof NodeViewDesc) {
-    var preMatch = this.preMatched.indexOf(next);
-    if (preMatch > -1 && preMatch != index) { return false }
-    var nextDOM = next.dom;
-    if (next.update(node, outerDeco, innerDeco, view)) {
-      if (next.dom != nextDOM) { this.changed = true; }
-      this.index++;
-      return true
-    }
-  }
-  return false
-};
-
-// : (Node, [Decoration], DecorationSet, EditorView)
-// Insert the node as a newly created node desc.
-ViewTreeUpdater.prototype.addNode = function addNode (node, outerDeco, innerDeco, view, pos) {
-  this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos));
-  this.changed = true;
-};
-
-ViewTreeUpdater.prototype.placeWidget = function placeWidget (widget, view, pos) {
-  if (this.index < this.top.children.length && this.top.children[this.index].matchesWidget(widget)) {
-    this.index++;
-  } else {
-    var desc = new (widget.spec.isCursorWrapper ? CursorWrapperDesc : WidgetViewDesc)(this.top, widget, view, pos);
-    this.top.children.splice(this.index++, 0, desc);
-    this.changed = true;
-  }
-};
-
-// Make sure a textblock looks and behaves correctly in
-// contentEditable.
-ViewTreeUpdater.prototype.addTextblockHacks = function addTextblockHacks () {
-  var lastChild = this.top.children[this.index - 1];
-  while (lastChild instanceof MarkViewDesc) { lastChild = lastChild.children[lastChild.children.length - 1]; }
-
-  if (!lastChild || // Empty textblock
-      !(lastChild instanceof TextViewDesc) ||
-      /\n$/.test(lastChild.node.text)) {
-    if (this.index < this.top.children.length && this.top.children[this.index].matchesHack()) {
-      this.index++;
-    } else {
-      var dom = document.createElement("br");
-      this.top.children.splice(this.index++, 0, new BRHackViewDesc(this.top, nothing, dom, null));
-      this.changed = true;
-    }
-  }
-};
-
-// : (Fragment, [ViewDesc]) → [ViewDesc]
-// Iterate from the end of the fragment and array of descs to find
-// directly matching ones, in order to avoid overeagerly reusing
-// those for other nodes. Returns an array whose positions correspond
-// to node positions in the fragment, and whose elements are either
-// descs matched to the child at that index, or empty.
-function preMatch(frag, descs) {
-  var result$$1 = [], end = frag.childCount;
-  for (var i = descs.length - 1; end > 0 && i >= 0; i--) {
-    var desc = descs[i], node = desc.node;
-    if (!node) { continue }
-    if (node != frag.child(end - 1)) { break }
-    result$$1[--end] = desc;
-  }
-  return result$$1
-}
-
-function compareSide(a, b) { return a.type.side - b.type.side }
-
-// : (ViewDesc, DecorationSet, (Decoration), (Node, [Decoration], DecorationSet, number))
-// This function abstracts iterating over the nodes and decorations in
-// a fragment. Calls `onNode` for each node, with its local and child
-// decorations. Splits text nodes when there is a decoration starting
-// or ending inside of them. Calls `onWidget` for each widget.
-function iterDeco(parent, deco, onWidget, onNode) {
-  var locals = deco.locals(parent), offset = 0;
-  // Simple, cheap variant for when there are no local decorations
-  if (locals.length == 0) {
-    for (var i = 0; i < parent.childCount; i++) {
-      var child = parent.child(i);
-      onNode(child, locals, deco.forChild(offset, child), i);
-      offset += child.nodeSize;
-    }
-    return
-  }
-
-  var decoIndex = 0, active = [], restNode = null;
-  for (var parentIndex = 0;;) {
-    if (decoIndex < locals.length && locals[decoIndex].to == offset) {
-      var widget = locals[decoIndex++], widgets = (void 0);
-      while (decoIndex < locals.length && locals[decoIndex].to == offset)
-        { (widgets || (widgets = [widget])).push(locals[decoIndex++]); }
-      if (widgets) {
-        widgets.sort(compareSide);
-        for (var i$1 = 0; i$1 < widgets.length; i$1++) { onWidget(widgets[i$1], parentIndex); }
-      } else {
-        onWidget(widget, parentIndex);
-      }
-    }
-
-    var child$1 = (void 0);
-    if (restNode) {
-      child$1 = restNode;
-      restNode = null;
-    } else if (parentIndex < parent.childCount) {
-      child$1 = parent.child(parentIndex++);
-    } else {
-      break
-    }
-
-    for (var i$2 = 0; i$2 < active.length; i$2++) { if (active[i$2].to <= offset) { active.splice(i$2--, 1); } }
-    while (decoIndex < locals.length && locals[decoIndex].from == offset) { active.push(locals[decoIndex++]); }
-
-    var end = offset + child$1.nodeSize;
-    if (child$1.isText) {
-      var cutAt = end;
-      if (decoIndex < locals.length && locals[decoIndex].from < cutAt) { cutAt = locals[decoIndex].from; }
-      for (var i$3 = 0; i$3 < active.length; i$3++) { if (active[i$3].to < cutAt) { cutAt = active[i$3].to; } }
-      if (cutAt < end) {
-        restNode = child$1.cut(cutAt - offset);
-        child$1 = child$1.cut(0, cutAt - offset);
-        end = cutAt;
-      }
-    }
-
-    onNode(child$1, active.length ? active.slice() : nothing, deco.forChild(offset, child$1), parentIndex - 1);
-    offset = end;
-  }
-}
-
-// Pre-calculate and cache the set of custom view specs for a given
-// prop object.
-var cachedCustomViews;
-var cachedCustomFor;
-function customNodeViews(view) {
-  if (cachedCustomFor == view._props) { return cachedCustomViews }
-  cachedCustomFor = view._props;
-  return cachedCustomViews = buildCustomViews(view)
-}
-function buildCustomViews(view) {
-  var result$$1 = {};
-  view.someProp("nodeViews", function (obj) {
-    for (var prop in obj) { if (!Object.prototype.hasOwnProperty.call(result$$1, prop))
-      { result$$1[prop] = obj[prop]; } }
-  });
-  return result$$1
-}
-
-// List markers in Mobile Safari will mysteriously disappear
-// sometimes. This works around that.
-function iosHacks(dom) {
-  if (dom.nodeName == "UL" || dom.nodeName == "OL") {
-    var oldCSS = dom.style.cssText;
-    dom.style.cssText = oldCSS + "; list-style: square !important";
-    window.getComputedStyle(dom).listStyle;
-    dom.style.cssText = oldCSS;
-  }
-}
-
-function moveSelectionBlock(state, dir) {
-  var ref = state.selection;
-  var $anchor = ref.$anchor;
-  var $head = ref.$head;
-  var $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);
-  var $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null;
-  return $start && dist$2.Selection.findFrom($start, dir)
-}
-
-function apply(view, sel) {
-  view.dispatch(view.state.tr.setSelection(sel).scrollIntoView());
-  return true
-}
-
-function selectHorizontally(view, dir) {
-  var sel = view.state.selection;
-  if (sel instanceof dist$2.TextSelection) {
-    if (!sel.empty) {
-      return false
-    } else if (view.endOfTextblock(dir > 0 ? "right" : "left")) {
-      var next = moveSelectionBlock(view.state, dir);
-      if (next && (next instanceof dist$2.NodeSelection)) { return apply(view, next) }
-      return false
-    } else {
-      var $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc;
-      if (node && dist$2.NodeSelection.isSelectable(node)) {
-        var nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;
-        if (node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM)
-          { return apply(view, new dist$2.NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head)) }
-      }
-      return false
-    }
-  } else if (sel instanceof dist$2.NodeSelection && sel.node.isInline) {
-    return apply(view, new dist$2.TextSelection(dir > 0 ? sel.$to : sel.$from))
-  } else {
-    var next$1 = moveSelectionBlock(view.state, dir);
-    if (next$1) { return apply(view, next$1) }
-    return false
-  }
-}
-
-function nodeLen(node) {
-  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length
-}
-
-function isIgnorable(dom) {
-  var desc = dom.pmViewDesc;
-  return desc && desc.size == 0 && (dom.nextSibling || dom.nodeName != "BR")
-}
-
-// Make sure the cursor isn't directly after one or more ignored
-// nodes, which will confuse the browser's cursor motion logic.
-function skipIgnoredNodesLeft(view) {
-  var sel = view.root.getSelection();
-  var node = sel.focusNode, offset = sel.focusOffset;
-  if (!node) { return }
-  var moveNode, moveOffset, force = false;
-  // Gecko will do odd things when the selection is directly in front
-  // of a non-editable node, so in that case, move it into the next
-  // node if possible. Issue prosemirror/prosemirror#832.
-  if (result.gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset])) { force = true; }
-  for (;;) {
-    if (offset > 0) {
-      if (node.nodeType != 1) {
-        if (node.nodeType == 3 && node.nodeValue.charAt(offset - 1) == "\ufeff") {
-          // IE11's cursor will still be stuck when placed at the
-          // beginning of the cursor wrapper text node (#807)
-          if (result.ie && result.ie_version <= 11) { force = true; }
-          moveNode = node;
-          moveOffset = --offset;
-        } else { break }
-      } else {
-        var before = node.childNodes[offset - 1];
-        if (isIgnorable(before)) {
-          moveNode = node;
-          moveOffset = --offset;
-        } else if (before.nodeType == 3) {
-          node = before;
-          offset = node.nodeValue.length;
-        } else { break }
-      }
-    } else if (isBlockNode(node)) {
-      break
-    } else {
-      var prev = node.previousSibling;
-      while (prev && isIgnorable(prev)) {
-        moveNode = node.parentNode;
-        moveOffset = domIndex(prev);
-        prev = prev.previousSibling;
-      }
-      if (!prev) {
-        node = node.parentNode;
-        if (node == view.dom) { break }
-        offset = 0;
-      } else {
-        node = prev;
-        offset = nodeLen(node);
-      }
-    }
-  }
-  if (force) { setSelFocus(view, sel, node, offset); }
-  else if (moveNode) { setSelFocus(view, sel, moveNode, moveOffset); }
-}
-
-// Make sure the cursor isn't directly before one or more ignored
-// nodes.
-function skipIgnoredNodesRight(view) {
-  var sel = view.root.getSelection();
-  var node = sel.focusNode, offset = sel.focusOffset;
-  if (!node) { return }
-  var len = nodeLen(node);
-  var moveNode, moveOffset;
-  for (;;) {
-    if (offset < len) {
-      if (node.nodeType != 1) { break }
-      var after = node.childNodes[offset];
-      if (isIgnorable(after)) {
-        moveNode = node;
-        moveOffset = ++offset;
-      }
-      else { break }
-    } else if (isBlockNode(node)) {
-      break
-    } else {
-      var next = node.nextSibling;
-      while (next && isIgnorable(next)) {
-        moveNode = next.parentNode;
-        moveOffset = domIndex(next) + 1;
-        next = next.nextSibling;
-      }
-      if (!next) {
-        node = node.parentNode;
-        if (node == view.dom) { break }
-        offset = len = 0;
-      } else {
-        node = next;
-        offset = 0;
-        len = nodeLen(node);
-      }
-    }
-  }
-  if (moveNode) { setSelFocus(view, sel, moveNode, moveOffset); }
-}
-
-function isBlockNode(dom) {
-  var desc = dom.pmViewDesc;
-  return desc && desc.node && desc.node.isBlock
-}
-
-function setSelFocus(view, sel, node, offset) {
-  if (selectionCollapsed(sel)) {
-    var range = document.createRange();
-    range.setEnd(node, offset);
-    range.setStart(node, offset);
-    sel.removeAllRanges();
-    sel.addRange(range);
-  } else if (sel.extend) {
-    sel.extend(node, offset);
-  }
-  view.selectionReader.storeDOMState(view.selection);
-}
-
-// : (EditorState, number)
-// Check whether vertical selection motion would involve node
-// selections. If so, apply it (if not, the result is left to the
-// browser)
-function selectVertically(view, dir) {
-  var sel = view.state.selection;
-  if (sel instanceof dist$2.TextSelection && !sel.empty) { return false }
-  var $from = sel.$from;
-  var $to = sel.$to;
-
-  if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? "up" : "down")) {
-    var next = moveSelectionBlock(view.state, dir);
-    if (next && (next instanceof dist$2.NodeSelection))
-      { return apply(view, next) }
-  }
-  if (!$from.parent.inlineContent) {
-    var beyond = dist$2.Selection.findFrom(dir < 0 ? $from : $to, dir);
-    return beyond ? apply(view, beyond) : true
-  }
-  return false
-}
-
-function stopNativeHorizontalDelete(view, dir) {
-  if (!(view.state.selection instanceof dist$2.TextSelection)) { return true }
-  var ref = view.state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  var empty = ref.empty;
-  if (!$head.sameParent($anchor)) { return true }
-  if (!empty) { return false }
-  if (view.endOfTextblock(dir > 0 ? "forward" : "backward")) { return true }
-  var nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);
-  if (nextNode && !nextNode.isText) {
-    var tr = view.state.tr;
-    if (dir < 0) { tr.delete($head.pos - nextNode.nodeSize, $head.pos); }
-    else { tr.delete($head.pos, $head.pos + nextNode.nodeSize); }
-    view.dispatch(tr);
-    return true
-  }
-  return false
-}
-
-// A backdrop key mapping used to make sure we always suppress keys
-// that have a dangerous default effect, even if the commands they are
-// bound to return false, and to make sure that cursor-motion keys
-// find a cursor (as opposed to a node selection) when pressed. For
-// cursor-motion keys, the code in the handlers also takes care of
-// block selections.
-
-function getMods(event) {
-  var result$$1 = "";
-  if (event.ctrlKey) { result$$1 += "c"; }
-  if (event.metaKey) { result$$1 += "m"; }
-  if (event.altKey) { result$$1 += "a"; }
-  if (event.shiftKey) { result$$1 += "s"; }
-  return result$$1
-}
-
-function captureKeyDown(view, event) {
-  var code = event.keyCode, mods = getMods(event);
-  if (code == 8 || (result.mac && code == 72 && mods == "c")) { // Backspace, Ctrl-h on Mac
-    return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodesLeft(view)
-  } else if (code == 46 || (result.mac && code == 68 && mods == "c")) { // Delete, Ctrl-d on Mac
-    return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodesRight(view)
-  } else if (code == 13 || code == 27) { // Enter, Esc
-    return true
-  } else if (code == 37) { // Left arrow
-    return selectHorizontally(view, -1) || skipIgnoredNodesLeft(view)
-  } else if (code == 39) { // Right arrow
-    return selectHorizontally(view, 1) || skipIgnoredNodesRight(view)
-  } else if (code == 38) { // Up arrow
-    return selectVertically(view, -1) || skipIgnoredNodesLeft(view)
-  } else if (code == 40) { // Down arrow
-    return selectVertically(view, 1) || skipIgnoredNodesRight(view)
-  } else if (mods == (result.mac ? "m" : "c") &&
-             (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]
-    return true
-  }
-  return false
-}
-
-var TrackedRecord = function TrackedRecord(prev, mapping, state) {
-  this.prev = prev;
-  this.mapping = mapping;
-  this.state = state;
-};
-
-var TrackMappings = function TrackMappings(state) {
-  this.seen = [new TrackedRecord(null, null, state)];
-  // Kludge to listen to state changes globally in order to be able
-  // to find mappings from a given state to another.
-  dist$2.EditorState.addApplyListener(this.track = this.track.bind(this));
-};
-
-TrackMappings.prototype.destroy = function destroy () {
-  dist$2.EditorState.removeApplyListener(this.track);
-};
-
-TrackMappings.prototype.find = function find (state) {
-    var this$1 = this;
-
-  for (var i = this.seen.length - 1; i >= 0; i--) {
-    var record = this$1.seen[i];
-    if (record.state == state) { return record }
-  }
-};
-
-TrackMappings.prototype.track = function track (old, tr, state) {
-  var found = this.seen.length < 200 ? this.find(old) : null;
-  if (found)
-    { this.seen.push(new TrackedRecord(found, tr.docChanged ? tr.mapping : null, state)); }
-};
-
-TrackMappings.prototype.getMapping = function getMapping (state, appendTo) {
-  var found = this.find(state);
-  if (!found) { return null }
-  var mappings = [];
-  for (var rec = found; rec; rec = rec.prev)
-    { if (rec.mapping) { mappings.push(rec.mapping); } }
-  var result = appendTo || new dist$1.Mapping;
-  for (var i = mappings.length - 1; i >= 0; i--)
-    { result.appendMapping(mappings[i]); }
-  return result
-};
-
-// Track the state of the DOM selection, creating transactions to
-// update the selection state when necessary.
-var SelectionReader = function SelectionReader(view) {
-  var this$1 = this;
-
-  this.view = view;
-
-  // Track the state of the DOM selection.
-  this.lastAnchorNode = this.lastHeadNode = this.lastAnchorOffset = this.lastHeadOffset = null;
-  this.lastSelection = view.state.selection;
-  this.ignoreUpdates = false;
-  this.suppressUpdates = false;
-  this.poller = poller(this);
-
-  view.dom.addEventListener("focus", function () { return this$1.poller.start(hasFocusAndSelection(this$1.view)); });
-  view.dom.addEventListener("blur", function () { return this$1.poller.stop(); });
-
-  if (!view.editable) { this.poller.start(false); }
-};
-
-SelectionReader.prototype.destroy = function destroy () { this.poller.stop(); };
-
-SelectionReader.prototype.poll = function poll (origin) { this.poller.poll(origin); };
-
-SelectionReader.prototype.editableChanged = function editableChanged () {
-  if (!this.view.editable) { this.poller.start(); }
-  else if (!hasFocusAndSelection(this.view)) { this.poller.stop(); }
-};
-
-// : () → bool
-// Whether the DOM selection has changed from the last known state.
-SelectionReader.prototype.domChanged = function domChanged () {
-  var sel = this.view.root.getSelection();
-  return sel.anchorNode != this.lastAnchorNode || sel.anchorOffset != this.lastAnchorOffset ||
-    sel.focusNode != this.lastHeadNode || sel.focusOffset != this.lastHeadOffset
-};
-
-// Store the current state of the DOM selection.
-SelectionReader.prototype.storeDOMState = function storeDOMState (selection) {
-  var sel = this.view.root.getSelection();
-  this.lastAnchorNode = sel.anchorNode; this.lastAnchorOffset = sel.anchorOffset;
-  this.lastHeadNode = sel.focusNode; this.lastHeadOffset = sel.focusOffset;
-  this.lastSelection = selection;
-};
-
-SelectionReader.prototype.clearDOMState = function clearDOMState () {
-  this.lastAnchorNode = this.lastSelection = null;
-};
-
-// : (?string)
-// When the DOM selection changes in a notable manner, modify the
-// current selection state to match.
-SelectionReader.prototype.readFromDOM = function readFromDOM (origin) {
-  if (this.ignoreUpdates || !this.domChanged() || !hasFocusAndSelection(this.view)) { return }
-  if (this.suppressUpdates) { return selectionToDOM(this.view) }
-  if (!this.view.inDOMChange) { this.view.domObserver.flush(); }
-  if (this.view.inDOMChange) { return }
-
-  var domSel = this.view.root.getSelection(), doc = this.view.state.doc;
-  var nearestDesc = this.view.docView.nearestDesc(domSel.focusNode), inWidget = nearestDesc && nearestDesc.size == 0;
-  var head = this.view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset);
-  var $head = doc.resolve(head), $anchor, selection;
-  if (selectionCollapsed(domSel)) {
-    $anchor = $head;
-    while (nearestDesc && !nearestDesc.node) { nearestDesc = nearestDesc.parent; }
-    if (nearestDesc && nearestDesc.node.isAtom && dist$2.NodeSelection.isSelectable(nearestDesc.node) && nearestDesc.parent) {
-      var pos = nearestDesc.posBefore;
-      selection = new dist$2.NodeSelection(head == pos ? $head : doc.resolve(pos));
-    }
-  } else {
-    $anchor = doc.resolve(this.view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset));
-  }
-
-  if (!selection) {
-    var bias = origin == "pointer" || (this.view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;
-    selection = selectionBetween(this.view, $anchor, $head, bias);
-  }
-  if (!this.view.state.selection.eq(selection)) {
-    var tr = this.view.state.tr.setSelection(selection);
-    if (origin == "pointer") { tr.setMeta("pointer", true); }
-    this.view.dispatch(tr);
-  } else {
-    selectionToDOM(this.view);
-  }
-};
-
-// There's two polling models. On browsers that support the
-// selectionchange event (everything except Firefox < 52, basically), we
-// register a listener for that whenever the editor is focused.
-var SelectionChangePoller = function SelectionChangePoller(reader) {
-  var this$1 = this;
-
-  this.listening = false;
-  this.curOrigin = null;
-  this.originTime = 0;
-  this.reader = reader;
-
-  this.readFunc = function () { return reader.readFromDOM(this$1.originTime > Date.now() - 50 ? this$1.curOrigin : null); };
-};
-
-SelectionChangePoller.prototype.poll = function poll (origin) {
-  this.curOrigin = origin;
-  this.originTime = Date.now();
-};
-
-SelectionChangePoller.prototype.start = function start (andRead) {
-  if (!this.listening) {
-    var doc = this.reader.view.dom.ownerDocument;
-    doc.addEventListener("selectionchange", this.readFunc);
-    this.listening = true;
-    if (andRead) { this.readFunc(); }
-  }
-};
-
-SelectionChangePoller.prototype.stop = function stop () {
-  if (this.listening) {
-    var doc = this.reader.view.dom.ownerDocument;
-    doc.removeEventListener("selectionchange", this.readFunc);
-    this.listening = false;
-  }
-};
-
-// On Browsers that don't support the selectionchange event,
-// we use timeout-based polling.
-var TimeoutPoller = function TimeoutPoller(reader) {
-  // The timeout ID for the poller when active.
-  this.polling = null;
-  this.reader = reader;
-  this.pollFunc = this.doPoll.bind(this, null);
-};
-
-TimeoutPoller.prototype.doPoll = function doPoll (origin) {
-  var view = this.reader.view;
-  if (view.focused || !view.editable) {
-    this.reader.readFromDOM(origin);
-    this.polling = setTimeout(this.pollFunc, 100);
-  } else {
-    this.polling = null;
-  }
-};
-
-TimeoutPoller.prototype.poll = function poll (origin) {
-  clearTimeout(this.polling);
-  this.polling = setTimeout(origin ? this.doPoll.bind(this, origin) : this.pollFunc, 0);
-};
-
-TimeoutPoller.prototype.start = function start () {
-  if (this.polling == null) { this.poll(); }
-};
-
-TimeoutPoller.prototype.stop = function stop () {
-  clearTimeout(this.polling);
-  this.polling = null;
-};
-
-function poller(reader) {
-  return new ("onselectionchange" in document ? SelectionChangePoller : TimeoutPoller)(reader)
-}
-
-function selectionToDOM(view, takeFocus) {
-  var sel = view.state.selection;
-  syncNodeSelection(view, sel);
-
-  if (view.editable && !view.hasFocus()) {
-    if (!takeFocus) { return }
-    // See https://bugzilla.mozilla.org/show_bug.cgi?id=921444
-    if (result.gecko && result.gecko_version <= 55) {
-      view.selectionReader.ignoreUpdates = true;
-      view.dom.focus();
-      view.selectionReader.ignoreUpdates = false;
-    }
-  } else if (!view.editable && !hasSelection(view) && !takeFocus) {
-    return
-  }
-
-  var reader = view.selectionReader;
-  if (reader.lastSelection && reader.lastSelection.eq(sel) && !reader.domChanged()) { return }
-
-  reader.ignoreUpdates = true;
-
-  if (view.cursorWrapper) {
-    selectCursorWrapper(view);
-  } else {
-    var anchor = sel.anchor;
-    var head = sel.head;
-    var resetEditableFrom, resetEditableTo;
-    if (brokenSelectBetweenUneditable && !(sel instanceof dist$2.TextSelection)) {
-      if (!sel.$from.parent.inlineContent)
-        { resetEditableFrom = temporarilyEditableNear(view, sel.from); }
-      if (!sel.empty && !sel.$from.parent.inlineContent)
-        { resetEditableTo = temporarilyEditableNear(view, sel.to); }
-    }
-    view.docView.setSelection(anchor, head, view.root);
-    if (brokenSelectBetweenUneditable) {
-      if (resetEditableFrom) { resetEditableFrom.contentEditable = "false"; }
-      if (resetEditableTo) { resetEditableTo.contentEditable = "false"; }
-    }
-    if (sel.visible) {
-      view.dom.classList.remove("ProseMirror-hideselection");
-    } else if (anchor != head) {
-      view.dom.classList.add("ProseMirror-hideselection");
-      if ("onselectionchange" in document) { removeClassOnSelectionChange(view); }
-    }
-  }
-
-  reader.storeDOMState(sel);
-  reader.ignoreUpdates = false;
-}
-
-// Kludge to work around Webkit not allowing a selection to start/end
-// between non-editable block nodes. We briefly make something
-// editable, set the selection, then set it uneditable again.
-
-var brokenSelectBetweenUneditable = result.safari || result.chrome && result.chrome_version < 63;
-
-function temporarilyEditableNear(view, pos) {
-  var ref = view.docView.domFromPos(pos);
-  var node = ref.node;
-  var offset = ref.offset;
-  var after = offset < node.childNodes.length ? node.childNodes[offset] : null;
-  var before = offset ? node.childNodes[offset - 1] : null;
-  if ((!after || after.contentEditable == "false") && (!before || before.contentEditable == "false")) {
-    if (after) {
-      after.contentEditable = "true";
-      return after
-    } else if (before) {
-      before.contentEditable = "true";
-      return before
-    }
-  }
-}
-
-function removeClassOnSelectionChange(view) {
-  var doc = view.dom.ownerDocument;
-  doc.removeEventListener("selectionchange", view.hideSelectionGuard);
-  var domSel = view.root.getSelection();
-  var node = domSel.anchorNode, offset = domSel.anchorOffset;
-  doc.addEventListener("selectionchange", view.hideSelectionGuard = function () {
-    if (domSel.anchorNode != node || domSel.anchorOffset != offset) {
-      doc.removeEventListener("selectionchange", view.hideSelectionGuard);
-      view.dom.classList.remove("ProseMirror-hideselection");
-    }
-  });
-}
-
-function selectCursorWrapper(view) {
-  var domSel = view.root.getSelection(), range = document.createRange();
-  var node = view.cursorWrapper.dom;
-  range.setEnd(node, node.childNodes.length);
-  range.collapse(false);
-  domSel.removeAllRanges();
-  domSel.addRange(range);
-  // Kludge to kill 'control selection' in IE11 when selecting an
-  // invisible cursor wrapper, since that would result in those weird
-  // resize handles and a selection that considers the absolutely
-  // positioned wrapper, rather than the root editable node, the
-  // focused element.
-  if (!view.state.selection.visible && result.ie && result.ie_version <= 11) {
-    node.disabled = true;
-    node.disabled = false;
-  }
-}
-
-function syncNodeSelection(view, sel) {
-  if (sel instanceof dist$2.NodeSelection) {
-    var desc = view.docView.descAt(sel.from);
-    if (desc != view.lastSelectedViewDesc) {
-      clearNodeSelection(view);
-      if (desc) { desc.selectNode(); }
-      view.lastSelectedViewDesc = desc;
-    }
-  } else {
-    clearNodeSelection(view);
-  }
-}
-
-// Clear all DOM statefulness of the last node selection.
-function clearNodeSelection(view) {
-  if (view.lastSelectedViewDesc) {
-    view.lastSelectedViewDesc.deselectNode();
-    view.lastSelectedViewDesc = null;
-  }
-}
-
-function selectionBetween(view, $anchor, $head, bias) {
-  return view.someProp("createSelectionBetween", function (f) { return f(view, $anchor, $head); })
-    || dist$2.TextSelection.between($anchor, $head, bias)
-}
-
-function hasFocusAndSelection(view) {
-  if (view.editable && view.root.activeElement != view.dom) { return false }
-  return hasSelection(view)
-}
-
-function hasSelection(view) {
-  var sel = view.root.getSelection();
-  if (!sel.anchorNode) { return false }
-  try {
-    // Firefox will raise 'permission denied' errors when accessing
-    // properties of `sel.anchorNode` when it's in a generated CSS
-    // element.
-    return view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode)
-  } catch(_) {
-    return false
-  }
-}
-
-function nonInclusiveMark(mark) {
-  return mark.type.spec.inclusive === false
-}
-
-function needsCursorWrapper(state) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  var visible = ref.visible;
-  var $pos = $head.pos == $anchor.pos && (!visible || $head.parent.inlineContent) ? $head : null;
-  if ($pos && (!visible || state.storedMarks || $pos.parent.content.length == 0 ||
-               $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.some(nonInclusiveMark)))
-    { return $pos }
-  else
-    { return null }
-}
-
-var DOMChange = function DOMChange(view, composing) {
-  var this$1 = this;
-
-  this.view = view;
-  this.state = view.state;
-  this.composing = composing;
-  this.from = this.to = null;
-  this.typeOver = false;
-  this.timeout = composing ? null : setTimeout(function () { return this$1.finish(); }, DOMChange.commitTimeout);
-  this.trackMappings = new TrackMappings(view.state);
-
-  // If there have been changes since this DOM update started, we must
-  // map our start and end positions, as well as the new selection
-  // positions, through them. This tracks that mapping.
-  this.mapping = new dist$1.Mapping;
-  this.mappingTo = view.state;
-};
-
-DOMChange.prototype.addRange = function addRange (from, to) {
-  if (this.from == null) {
-    this.from = from;
-    this.to = to;
-  } else {
-    this.from = Math.min(from, this.from);
-    this.to = Math.max(to, this.to);
-  }
-};
-
-DOMChange.prototype.changedRange = function changedRange () {
-  if (this.from == null) { return rangeAroundSelection(this.state.selection) }
-  var $from = this.state.doc.resolve(Math.min(this.from, this.state.selection.from)), $to = this.state.doc.resolve(this.to);
-  var shared = $from.sharedDepth(this.to);
-  return {from: $from.before(shared + 1), to: $to.after(shared + 1)}
-};
-
-DOMChange.prototype.markDirty = function markDirty (range) {
-  if (this.from == null) { this.view.docView.markDirty((range = range || this.changedRange()).from, range.to); }
-  else { this.view.docView.markDirty(this.from, this.to); }
-};
-
-DOMChange.prototype.stateUpdated = function stateUpdated (state) {
-  if (this.trackMappings.getMapping(state, this.mapping)) {
-    this.trackMappings.destroy();
-    this.trackMappings = new TrackMappings(state);
-    this.mappingTo = state;
-    return true
-  } else {
-    this.markDirty();
-    this.destroy();
-    return false
-  }
-};
-
-DOMChange.prototype.finish = function finish (force) {
-  clearTimeout(this.timeout);
-  if (this.composing && !force) { return }
-  this.view.domObserver.flush();
-  var range = this.changedRange();
-  this.markDirty(range);
-
-  this.destroy();
-  var sel = this.state.selection, allowTypeOver = this.typeOver && sel instanceof dist$2.TextSelection &&
-      !sel.empty && sel.$head.sameParent(sel.$anchor);
-  readDOMChange(this.view, this.mapping, this.state, range, allowTypeOver);
-
-  // If the reading didn't result in a view update, force one by
-  // resetting the view to its current state.
-  if (this.view.docView.dirty) { this.view.updateState(this.view.state); }
-};
-
-DOMChange.prototype.destroy = function destroy () {
-  clearTimeout(this.timeout);
-  this.trackMappings.destroy();
-  this.view.inDOMChange = null;
-};
-
-DOMChange.prototype.compositionEnd = function compositionEnd () {
-    var this$1 = this;
-
-  if (this.composing) {
-    this.composing = false;
-    this.timeout = setTimeout(function () { return this$1.finish(); }, 50);
-  }
-};
-
-DOMChange.start = function start (view, composing) {
-  if (view.inDOMChange) {
-    if (composing) {
-      clearTimeout(view.inDOMChange.timeout);
-      view.inDOMChange.composing = true;
-    }
-  } else {
-    view.inDOMChange = new DOMChange(view, composing);
-  }
-  return view.inDOMChange
-};
-DOMChange.commitTimeout = 20;
-
-// Note that all referencing and parsing is done with the
-// start-of-operation selection and document, since that's the one
-// that the DOM represents. If any changes came in in the meantime,
-// the modification is mapped over those before it is applied, in
-// readDOMChange.
-
-function parseBetween(view, oldState, range) {
-  var ref = view.docView.parseRange(range.from, range.to);
-  var parent = ref.node;
-  var fromOffset = ref.fromOffset;
-  var toOffset = ref.toOffset;
-  var from = ref.from;
-  var to = ref.to;
-
-  var domSel = view.root.getSelection(), find = null, anchor = domSel.anchorNode;
-  if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {
-    find = [{node: anchor, offset: domSel.anchorOffset}];
-    if (!selectionCollapsed(domSel))
-      { find.push({node: domSel.focusNode, offset: domSel.focusOffset}); }
-  }
-  // Work around issue in Chrome where backspacing sometimes replaces
-  // the deleted content with a random BR node (issues #799, #831)
-  if (result.chrome && view.lastKeyCode === 8) {
-    for (var off = toOffset; off > fromOffset; off--) {
-      var node = parent.childNodes[off - 1], desc = node.pmViewDesc;
-      if (node.nodeType == "BR" && !desc) { toOffset = off; break }
-      if (!desc || desc.size) { break }
-    }
-  }
-  var startDoc = oldState.doc;
-  var parser = view.someProp("domParser") || dist.DOMParser.fromSchema(view.state.schema);
-  var $from = startDoc.resolve(from);
-  var sel = null, doc = parser.parse(parent, {
-    topNode: $from.parent,
-    topMatch: $from.parent.contentMatchAt($from.index()),
-    topOpen: true,
-    from: fromOffset,
-    to: toOffset,
-    preserveWhitespace: $from.parent.type.spec.code ? "full" : true,
-    editableContent: true,
-    findPositions: find,
-    ruleFromNode: ruleFromNode(parser, $from),
-    context: $from
-  });
-  if (find && find[0].pos != null) {
-    var anchor$1 = find[0].pos, head = find[1] && find[1].pos;
-    if (head == null) { head = anchor$1; }
-    sel = {anchor: anchor$1 + from, head: head + from};
-  }
-  return {doc: doc, sel: sel, from: from, to: to}
-}
-
-function ruleFromNode(parser, context) {
-  return function (dom) {
-    var desc = dom.pmViewDesc;
-    if (desc) {
-      return desc.parseRule()
-    } else if (dom.nodeName == "BR" && dom.parentNode) {
-      // Safari replaces the list item with a BR directly in the list node (?!) if you delete the last character in a list item (#708)
-      if (result.safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName))
-        { return parser.matchTag(document.createElement("li"), context) }
-      else if (dom.parentNode.lastChild == dom)
-        { return {ignore: true} }
-    }
-  }
-}
-
-function isAtEnd($pos, depth) {
-  for (var i = depth || 0; i < $pos.depth; i++)
-    { if ($pos.index(i) + 1 < $pos.node(i).childCount) { return false } }
-  return $pos.parentOffset == $pos.parent.content.size
-}
-function isAtStart($pos, depth) {
-  for (var i = depth || 0; i < $pos.depth; i++)
-    { if ($pos.index(0) > 0) { return false } }
-  return $pos.parentOffset == 0
-}
-
-function rangeAroundSelection(selection) {
-  // Intentionally uses $head/$anchor because those will correspond to the DOM selection
-  var $from = selection.$anchor.min(selection.$head), $to = selection.$anchor.max(selection.$head);
-
-  if ($from.sameParent($to) && $from.parent.inlineContent && $from.parentOffset && $to.parentOffset < $to.parent.content.size) {
-    var startOff = Math.max(0, $from.parentOffset);
-    var size = $from.parent.content.size;
-    var endOff = Math.min(size, $to.parentOffset);
-
-    if (startOff > 0)
-      { startOff = $from.parent.childBefore(startOff).offset; }
-    if (endOff < size) {
-      var after = $from.parent.childAfter(endOff);
-      endOff = after.offset + after.node.nodeSize;
-    }
-    var nodeStart = $from.start();
-    return {from: nodeStart + startOff, to: nodeStart + endOff}
-  } else {
-    for (var depth = 0;; depth++) {
-      var fromStart = isAtStart($from, depth + 1), toEnd = isAtEnd($to, depth + 1);
-      if (fromStart || toEnd || $from.index(depth) != $to.index(depth) || $to.node(depth).isTextblock) {
-        var from = $from.before(depth + 1), to = $to.after(depth + 1);
-        if (fromStart && $from.index(depth) > 0)
-          { from -= $from.node(depth).child($from.index(depth) - 1).nodeSize; }
-        if (toEnd && $to.index(depth) + 1 < $to.node(depth).childCount)
-          { to += $to.node(depth).child($to.index(depth) + 1).nodeSize; }
-        return {from: from, to: to}
-      }
-    }
-  }
-}
-
-function keyEvent(keyCode, key) {
-  var event = document.createEvent("Event");
-  event.initEvent("keydown", true, true);
-  event.keyCode = keyCode;
-  event.key = event.code = key;
-  return event
-}
-
-function readDOMChange(view, mapping, oldState, range, allowTypeOver) {
-  var parse = parseBetween(view, oldState, range);
-
-  var doc = oldState.doc, compare = doc.slice(parse.from, parse.to);
-  var preferredPos, preferredSide;
-  // Prefer anchoring to end when Backspace is pressed
-  if (view.lastKeyCode === 8 && Date.now() - 100 < view.lastKeyCodeTime) {
-    preferredPos = oldState.selection.to;
-    preferredSide = "end";
-  } else {
-    preferredPos = oldState.selection.from;
-    preferredSide = "start";
-  }
-  view.lastKeyCode = null;
-
-  var change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);
-  if (!change) {
-    if (allowTypeOver) {
-      var state = view.state, sel = state.selection;
-      view.dispatch(state.tr.replaceSelectionWith(state.schema.text(state.doc.textBetween(sel.from, sel.to)), true).scrollIntoView());
-    } else if (parse.sel) {
-      var sel$1 = resolveSelection(view, view.state.doc, mapping, parse.sel);
-      if (sel$1 && !sel$1.eq(view.state.selection)) { view.dispatch(view.state.tr.setSelection(sel$1)); }
-    }
-    return
-  }
-
-  var $from = parse.doc.resolveNoCache(change.start - parse.from);
-  var $to = parse.doc.resolveNoCache(change.endB - parse.from);
-  var nextSel;
-  // If this looks like the effect of pressing Enter, just dispatch an
-  // Enter key instead.
-  if (!$from.sameParent($to) && $from.pos < parse.doc.content.size &&
-      (nextSel = dist$2.Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&
-      nextSel.head == $to.pos &&
-      view.someProp("handleKeyDown", function (f) { return f(view, keyEvent(13, "Enter")); }))
-    { return }
-  // Same for backspace
-  if (oldState.selection.anchor > change.start &&
-      looksLikeJoin(doc, change.start, change.endA, $from, $to) &&
-      view.someProp("handleKeyDown", function (f) { return f(view, keyEvent(8, "Backspace")); })) {
-    if (result.android && result.chrome) { // #820
-      view.selectionReader.suppressUpdates = true;
-      setTimeout(function () { return view.selectionReader.suppressUpdates = false; }, 50);
-    }
-    return
-  }
-
-  var from = mapping.map(change.start), to = mapping.map(change.endA, -1);
-
-  var tr, storedMarks, markChange, $from1;
-  if ($from.sameParent($to) && $from.parent.inlineContent) {
-    if ($from.pos == $to.pos) { // Deletion
-      tr = view.state.tr.delete(from, to);
-      storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));
-    } else if ( // Adding or removing a mark
-      change.endA == change.endB && ($from1 = doc.resolve(change.start)) &&
-      (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset),
-                                 $from1.parent.content.cut($from1.parentOffset, change.endA - $from1.start())))
-    ) {
-      tr = view.state.tr;
-      if (markChange.type == "add") { tr.addMark(from, to, markChange.mark); }
-      else { tr.removeMark(from, to, markChange.mark); }
-    } else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {
-      // Both positions in the same text node -- simply insert text
-      var text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);
-      if (view.someProp("handleTextInput", function (f) { return f(view, from, to, text); })) { return }
-      tr = view.state.tr.insertText(text, from, to);
-    }
-  }
-
-  if (!tr)
-    { tr = view.state.tr.replace(from, to, parse.doc.slice(change.start - parse.from, change.endB - parse.from)); }
-  if (parse.sel) {
-    var sel$2 = resolveSelection(view, tr.doc, mapping, parse.sel);
-    if (sel$2) { tr.setSelection(sel$2); }
-  }
-  if (storedMarks) { tr.ensureMarks(storedMarks); }
-  view.dispatch(tr.scrollIntoView());
-}
-
-function resolveSelection(view, doc, mapping, parsedSel) {
-  if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size) { return null }
-  return selectionBetween(view, doc.resolve(mapping.map(parsedSel.anchor)),
-                          doc.resolve(mapping.map(parsedSel.head)))
-}
-
-// : (Fragment, Fragment) → ?{mark: Mark, type: string}
-// Given two same-length, non-empty fragments of inline content,
-// determine whether the first could be created from the second by
-// removing or adding a single mark type.
-function isMarkChange(cur, prev) {
-  var curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks;
-  var added = curMarks, removed = prevMarks, type, mark, update;
-  for (var i = 0; i < prevMarks.length; i++) { added = prevMarks[i].removeFromSet(added); }
-  for (var i$1 = 0; i$1 < curMarks.length; i$1++) { removed = curMarks[i$1].removeFromSet(removed); }
-  if (added.length == 1 && removed.length == 0) {
-    mark = added[0];
-    type = "add";
-    update = function (node) { return node.mark(mark.addToSet(node.marks)); };
-  } else if (added.length == 0 && removed.length == 1) {
-    mark = removed[0];
-    type = "remove";
-    update = function (node) { return node.mark(mark.removeFromSet(node.marks)); };
-  } else {
-    return null
-  }
-  var updated = [];
-  for (var i$2 = 0; i$2 < prev.childCount; i$2++) { updated.push(update(prev.child(i$2))); }
-  if (dist.Fragment.from(updated).eq(cur)) { return {mark: mark, type: type} }
-}
-
-function looksLikeJoin(old, start, end, $newStart, $newEnd) {
-  if (!$newStart.parent.isTextblock ||
-      // The content must have shrunk
-      end - start <= $newEnd.pos - $newStart.pos ||
-      // newEnd must point directly at or after the end of the block that newStart points into
-      skipClosingAndOpening($newStart, true, false) < $newEnd.pos)
-    { return false }
-
-  var $start = old.resolve(start);
-  // Start must be at the end of a block
-  if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock)
-    { return false }
-  var $next = old.resolve(skipClosingAndOpening($start, true, true));
-  // The next textblock must start before end and end near it
-  if (!$next.parent.isTextblock || $next.pos > end ||
-      skipClosingAndOpening($next, true, false) < end)
-    { return false }
-
-  // The fragments after the join point must match
-  return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content)
-}
-
-function skipClosingAndOpening($pos, fromEnd, mayOpen) {
-  var depth = $pos.depth, end = fromEnd ? $pos.end() : $pos.pos;
-  while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {
-    depth--;
-    end++;
-    fromEnd = false;
-  }
-  if (mayOpen) {
-    var next = $pos.node(depth).maybeChild($pos.indexAfter(depth));
-    while (next && !next.isLeaf) {
-      next = next.firstChild;
-      end++;
-    }
-  }
-  return end
-}
-
-function findDiff(a, b, pos, preferredPos, preferredSide) {
-  var start = a.findDiffStart(b, pos);
-  if (start == null) { return null }
-  var ref = a.findDiffEnd(b, pos + a.size, pos + b.size);
-  var endA = ref.a;
-  var endB = ref.b;
-  if (preferredSide == "end") {
-    var adjust = Math.max(0, start - Math.min(endA, endB));
-    preferredPos -= endA + adjust - start;
-  }
-  if (endA < start && a.size < b.size) {
-    var move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0;
-    start -= move;
-    endB = start + (endB - endA);
-    endA = start;
-  } else if (endB < start) {
-    var move$1 = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;
-    start -= move$1;
-    endA = start + (endA - endB);
-    endB = start;
-  }
-  return {start: start, endA: endA, endB: endB}
-}
-
-function serializeForClipboard(view, slice) {
-  var context = [];
-  var content = slice.content;
-  var openStart = slice.openStart;
-  var openEnd = slice.openEnd;
-  while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {
-    openStart--;
-    openEnd--;
-    var node = content.firstChild;
-    context.push(node.type.name, node.type.hasRequiredAttrs() ? node.attrs : null);
-    content = node.content;
-  }
-
-  var serializer = view.someProp("clipboardSerializer") || dist.DOMSerializer.fromSchema(view.state.schema);
-  var wrap = document.createElement("div");
-  wrap.appendChild(serializer.serializeFragment(content));
-
-  var firstChild = wrap.firstChild, needsWrap;
-  while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {
-    for (var i = needsWrap.length - 1; i >= 0; i--) {
-      var wrapper = document.createElement(needsWrap[i]);
-      while (wrap.firstChild) { wrapper.appendChild(wrap.firstChild); }
-      wrap.appendChild(wrapper);
-    }
-    firstChild = wrap.firstChild;
-  }
-
-  if (firstChild && firstChild.nodeType == 1)
-    { firstChild.setAttribute("data-pm-slice", (openStart + " " + openEnd + " " + (JSON.stringify(context)))); }
-
-  var text = view.someProp("clipboardTextSerializer", function (f) { return f(slice); }) ||
-      slice.content.textBetween(0, slice.content.size, "\n\n");
-
-  return {dom: wrap, text: text}
-}
-
-// : (EditorView, string, string, ?bool, ResolvedPos) → ?Slice
-// Read a slice of content from the clipboard (or drop data).
-function parseFromClipboard(view, text, html, plainText, $context) {
-  var dom, inCode = $context.parent.type.spec.code, slice;
-  if (!html && !text) { return null }
-  if ((plainText || inCode || !html) && text) {
-    view.someProp("transformPastedText", function (f) { text = f(text); });
-    if (inCode) { return new dist.Slice(dist.Fragment.from(view.state.schema.text(text)), 0, 0) }
-    var parsed = view.someProp("clipboardTextParser", function (f) { return f(text, $context); });
-    if (parsed) {
-      slice = parsed;
-    } else {
-      dom = document.createElement("div");
-      text.trim().split(/(?:\r\n?|\n)+/).forEach(function (block) {
-        dom.appendChild(document.createElement("p")).textContent = block;
-      });
-    }
-  } else {
-    view.someProp("transformPastedHTML", function (f) { return html = f(html); });
-    dom = readHTML(html);
-  }
-
-  if (!slice) {
-    var parser = view.someProp("clipboardParser") || view.someProp("domParser") || dist.DOMParser.fromSchema(view.state.schema);
-    slice = parser.parseSlice(dom, {preserveWhitespace: true, context: $context});
-  }
-  var contextNode = dom && dom.querySelector("[data-pm-slice]");
-  var sliceData = contextNode && /^(\d+) (\d+) (.*)/.exec(contextNode.getAttribute("data-pm-slice"));
-  if (sliceData)
-    { slice = addContext(new dist.Slice(slice.content, Math.min(slice.openStart, +sliceData[1]),
-                                 Math.min(slice.openEnd, +sliceData[2])), sliceData[3]); }
-  else // HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent
-    { slice = dist.Slice.maxOpen(normalizeSiblings(slice.content, $context), false); }
-  view.someProp("transformPasted", function (f) { slice = f(slice); });
-  return slice
-}
-
-// Takes a slice parsed with parseSlice, which means there hasn't been
-// any content-expression checking done on the top nodes, tries to
-// find a parent node in the current context that might fit the nodes,
-// and if successful, rebuilds the slice so that it fits into that parent.
-//
-// This addresses the problem that Transform.replace expects a
-// coherent slice, and will fail to place a set of siblings that don't
-// fit anywhere in the schema.
-function normalizeSiblings(fragment, $context) {
-  if (fragment.childCount < 2) { return fragment }
-  var loop = function ( d ) {
-    var parent = $context.node(d);
-    var match = parent.contentMatchAt($context.index(d));
-    var lastWrap = (void 0), result = [];
-    fragment.forEach(function (node) {
-      if (!result) { return }
-      var wrap = match.findWrapping(node.type), inLast;
-      if (!wrap) { return result = null }
-      if (inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0)) {
-        result[result.length - 1] = inLast;
-      } else {
-        if (result.length) { result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length); }
-        var wrapped = withWrappers(node, wrap);
-        result.push(wrapped);
-        match = match.matchType(wrapped.type, wrapped.attrs);
-        lastWrap = wrap;
-      }
-    });
-    if (result) { return { v: dist.Fragment.from(result) } }
-  };
-
-  for (var d = $context.depth; d >= 0; d--) {
-    var returned = loop( d );
-
-    if ( returned ) { return returned.v; }
-  }
-  return fragment
-}
-
-function withWrappers(node, wrap, from) {
-  if ( from === void 0 ) { from = 0; }
-
-  for (var i = wrap.length - 1; i >= from; i--)
-    { node = wrap[i].create(null, dist.Fragment.from(node)); }
-  return node
-}
-
-// Used to group adjacent nodes wrapped in similar parents by
-// normalizeSiblings into the same parent node
-function addToSibling(wrap, lastWrap, node, sibling, depth) {
-  if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {
-    var inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);
-    if (inner) { return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner)) }
-    var match = sibling.contentMatchAt(sibling.childCount);
-    if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1]))
-      { return sibling.copy(sibling.content.append(dist.Fragment.from(withWrappers(node, wrap, depth + 1)))) }
-  }
-}
-
-function closeRight(node, depth) {
-  if (depth == 0) { return node }
-  var fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));
-  var fill = node.contentMatchAt(node.childCount).fillBefore(dist.Fragment.empty, true);
-  return node.copy(fragment.append(fill))
-}
-
-// Trick from jQuery -- some elements must be wrapped in other
-// elements for innerHTML to work. I.e. if you do `div.innerHTML =
-// "<td>..</td>"` the table cells are ignored.
-var wrapMap = {thead: ["table"], colgroup: ["table"], col: ["table", "colgroup"],
-                 tr: ["table", "tbody"], td: ["table", "tbody", "tr"], th: ["table", "tbody", "tr"]};
-var detachedDoc = null;
-function readHTML(html) {
-  var metas = /(\s*<meta [^>]*>)*/.exec(html);
-  if (metas) { html = html.slice(metas[0].length); }
-  var doc = detachedDoc || (detachedDoc = document.implementation.createHTMLDocument("title"));
-  var elt = doc.createElement("div");
-  var firstTag = /(?:<meta [^>]*>)*<([a-z][^>\s]+)/i.exec(html), wrap, depth = 0;
-  if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()]) {
-    html = wrap.map(function (n) { return "<" + n + ">"; }).join("") + html + wrap.map(function (n) { return "</" + n + ">"; }).reverse().join("");
-    depth = wrap.length;
-  }
-  elt.innerHTML = html;
-  for (var i = 0; i < depth; i++) { elt = elt.firstChild; }
-  return elt
-}
-
-function addContext(slice, context) {
-  if (!slice.size) { return slice }
-  var schema = slice.content.firstChild.type.schema, array;
-  try { array = JSON.parse(context); }
-  catch(e) { return slice }
-  var content = slice.content;
-  var openStart = slice.openStart;
-  var openEnd = slice.openEnd;
-  for (var i = array.length - 2; i >= 0; i -= 2) {
-    var type = schema.nodes[array[i]];
-    if (!type || type.hasRequiredAttrs()) { break }
-    content = dist.Fragment.from(type.create(array[i + 1], content));
-    openStart++; openEnd++;
-  }
-  return new dist.Slice(content, openStart, openEnd)
-}
-
-var observeOptions = {childList: true, characterData: true, attributes: true, subtree: true, characterDataOldValue: true};
-// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified
-var useCharData = result.ie && result.ie_version <= 11;
-
-var DOMObserver = function DOMObserver(view) {
-  var this$1 = this;
-
-  this.view = view;
-  this.observer = window.MutationObserver &&
-    new window.MutationObserver(function (mutations) { return this$1.registerMutations(mutations); });
-  if (useCharData)
-    { this.onCharData = function (e) { return this$1.registerMutation({target: e.target, type: "characterData", oldValue: e.prevValue}); }; }
-};
-
-DOMObserver.prototype.start = function start () {
-  if (this.observer)
-    { this.observer.observe(this.view.dom, observeOptions); }
-  if (useCharData)
-    { this.view.dom.addEventListener("DOMCharacterDataModified", this.onCharData); }
-};
-
-DOMObserver.prototype.stop = function stop () {
-  if (this.observer) {
-    this.flush();
-    this.observer.disconnect();
-  }
-  if (useCharData)
-    { this.view.dom.removeEventListener("DOMCharacterDataModified", this.onCharData); }
-};
-
-DOMObserver.prototype.flush = function flush () {
-  if (this.observer)
-    { this.registerMutations(this.observer.takeRecords()); }
-};
-
-DOMObserver.prototype.registerMutations = function registerMutations (mutations) {
-    var this$1 = this;
-
-  for (var i = 0; i < mutations.length; i++)
-    { this$1.registerMutation(mutations[i]); }
-};
-
-DOMObserver.prototype.registerMutation = function registerMutation (mut) {
-  if (!this.view.editable) { return }
-  var desc = this.view.docView.nearestDesc(mut.target);
-  if (mut.type == "attributes" &&
-      (desc == this.view.docView || mut.attributeName == "contenteditable")) { return }
-  if (!desc || desc.ignoreMutation(mut)) { return }
-
-  var from, to;
-  if (mut.type == "childList") {
-    var fromOffset = mut.previousSibling && mut.previousSibling.parentNode == mut.target
-        ? domIndex(mut.previousSibling) + 1 : 0;
-    if (fromOffset == -1) { return }
-    from = desc.localPosFromDOM(mut.target, fromOffset, -1);
-    var toOffset = mut.nextSibling && mut.nextSibling.parentNode == mut.target
-        ? domIndex(mut.nextSibling) : mut.target.childNodes.length;
-    if (toOffset == -1) { return }
-    to = desc.localPosFromDOM(mut.target, toOffset, 1);
-  } else if (mut.type == "attributes") {
-    from = desc.posAtStart - desc.border;
-    to = desc.posAtEnd + desc.border;
-  } else { // "characterData"
-    from = desc.posAtStart;
-    to = desc.posAtEnd;
-    // An event was generated for a text change that didn't change
-    // any text. Mark the dom change to fall back to assuming the
-    // selection was typed over with an identical value if it can't
-    // find another change.
-    if (mut.target.nodeValue == mut.oldValue) { DOMChange.start(this.view).typeOver = true; }
-  }
-
-  DOMChange.start(this.view).addRange(from, to);
-};
-
-// A collection of DOM events that occur within the editor, and callback functions
-// to invoke when the event fires.
-var handlers = {};
-var editHandlers = {};
-
-function initInput(view) {
-  view.shiftKey = false;
-  view.mouseDown = null;
-  view.inDOMChange = null;
-  view.lastKeyCode = null;
-  view.lastKeyCodeTime = 0;
-  view.domObserver = new DOMObserver(view);
-  view.domObserver.start();
-
-  view.eventHandlers = Object.create(null);
-  var loop = function ( event ) {
-    var handler = handlers[event];
-    view.dom.addEventListener(event, view.eventHandlers[event] = function (event) {
-      if (eventBelongsToView(view, event) && !runCustomHandler(view, event) &&
-          (view.editable || !(event.type in editHandlers)))
-        { handler(view, event); }
-    });
-  };
-
-  for (var event in handlers) { loop( event ); }
-  ensureListeners(view);
-}
-
-function destroyInput(view) {
-  view.domObserver.stop();
-  if (view.inDOMChange) { view.inDOMChange.destroy(); }
-  for (var type in view.eventHandlers)
-    { view.dom.removeEventListener(type, view.eventHandlers[type]); }
-}
-
-function ensureListeners(view) {
-  view.someProp("handleDOMEvents", function (currentHandlers) {
-    for (var type in currentHandlers) { if (!view.eventHandlers[type])
-      { view.dom.addEventListener(type, view.eventHandlers[type] = function (event) { return runCustomHandler(view, event); }); } }
-  });
-}
-
-function runCustomHandler(view, event) {
-  return view.someProp("handleDOMEvents", function (handlers) {
-    var handler = handlers[event.type];
-    return handler ? handler(view, event) || event.defaultPrevented : false
-  })
-}
-
-function eventBelongsToView(view, event) {
-  if (!event.bubbles) { return true }
-  if (event.defaultPrevented) { return false }
-  for (var node = event.target; node != view.dom; node = node.parentNode)
-    { if (!node || node.nodeType == 11 ||
-        (node.pmViewDesc && node.pmViewDesc.stopEvent(event)))
-      { return false } }
-  return true
-}
-
-function dispatchEvent(view, event) {
-  if (!runCustomHandler(view, event) && handlers[event.type] &&
-      (view.editable || !(event.type in editHandlers)))
-    { handlers[event.type](view, event); }
-}
-
-editHandlers.keydown = function (view, event) {
-  view.shiftKey = event.keyCode == 16 || event.shiftKey;
-  if (view.inDOMChange) {
-    if (view.inDOMChange.composing) { return }
-    view.inDOMChange.finish();
-  }
-  view.lastKeyCode = event.keyCode;
-  view.lastKeyCodeTime = Date.now();
-  if (view.someProp("handleKeyDown", function (f) { return f(view, event); }) || captureKeyDown(view, event))
-    { event.preventDefault(); }
-  else
-    { view.selectionReader.poll(); }
-};
-
-editHandlers.keyup = function (view, e) {
-  if (e.keyCode == 16) { view.shiftKey = false; }
-};
-
-editHandlers.keypress = function (view, event) {
-  if (view.inDOMChange || !event.charCode ||
-      event.ctrlKey && !event.altKey || result.mac && event.metaKey) { return }
-
-  if (view.someProp("handleKeyPress", function (f) { return f(view, event); })) {
-    event.preventDefault();
-    return
-  }
-
-  var sel = view.state.selection;
-  if (!(sel instanceof dist$2.TextSelection) || !sel.$from.sameParent(sel.$to)) {
-    var text = String.fromCharCode(event.charCode);
-    if (!view.someProp("handleTextInput", function (f) { return f(view, sel.$from.pos, sel.$to.pos, text); }))
-      { view.dispatch(view.state.tr.insertText(text).scrollIntoView()); }
-    event.preventDefault();
-  }
-};
-
-function eventCoords(event) { return {left: event.clientX, top: event.clientY} }
-
-var lastClick = {time: 0, x: 0, y: 0};
-var oneButLastClick = lastClick;
-
-function isNear(event, click) {
-  var dx = click.x - event.clientX, dy = click.y - event.clientY;
-  return dx * dx + dy * dy < 100
-}
-
-function runHandlerOnContext(view, propName, pos, inside, event) {
-  if (inside == -1) { return false }
-  var $pos = view.state.doc.resolve(inside);
-  var loop = function ( i ) {
-    if (view.someProp(propName, function (f) { return i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true)
-                                                    : f(view, pos, $pos.node(i), $pos.before(i), event, false); }))
-      { return { v: true } }
-  };
-
-  for (var i = $pos.depth + 1; i > 0; i--) {
-    var returned = loop( i );
-
-    if ( returned ) { return returned.v; }
-  }
-  return false
-}
-
-function updateSelection(view, selection, origin) {
-  if (!view.focused) { view.focus(); }
-  var tr = view.state.tr.setSelection(selection);
-  if (origin == "pointer") { tr.setMeta("pointer", true); }
-  view.dispatch(tr);
-}
-
-function selectClickedLeaf(view, inside) {
-  if (inside == -1) { return false }
-  var $pos = view.state.doc.resolve(inside), node = $pos.nodeAfter;
-  if (node && node.isAtom && dist$2.NodeSelection.isSelectable(node)) {
-    updateSelection(view, new dist$2.NodeSelection($pos), "pointer");
-    return true
-  }
-  return false
-}
-
-function selectClickedNode(view, inside) {
-  if (inside == -1) { return false }
-  var sel = view.state.selection, selectedNode, selectAt;
-  if (sel instanceof dist$2.NodeSelection) { selectedNode = sel.node; }
-
-  var $pos = view.state.doc.resolve(inside);
-  for (var i = $pos.depth + 1; i > 0; i--) {
-    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
-    if (dist$2.NodeSelection.isSelectable(node)) {
-      if (selectedNode && sel.$from.depth > 0 &&
-          i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos)
-        { selectAt = $pos.before(sel.$from.depth); }
-      else
-        { selectAt = $pos.before(i); }
-      break
-    }
-  }
-
-  if (selectAt != null) {
-    updateSelection(view, dist$2.NodeSelection.create(view.state.doc, selectAt), "pointer");
-    return true
-  } else {
-    return false
-  }
-}
-
-function handleSingleClick(view, pos, inside, event, selectNode) {
-  return runHandlerOnContext(view, "handleClickOn", pos, inside, event) ||
-    view.someProp("handleClick", function (f) { return f(view, pos, event); }) ||
-    (selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside))
-}
-
-function handleDoubleClick(view, pos, inside, event) {
-  return runHandlerOnContext(view, "handleDoubleClickOn", pos, inside, event) ||
-    view.someProp("handleDoubleClick", function (f) { return f(view, pos, event); })
-}
-
-function handleTripleClick(view, pos, inside, event) {
-  return runHandlerOnContext(view, "handleTripleClickOn", pos, inside, event) ||
-    view.someProp("handleTripleClick", function (f) { return f(view, pos, event); }) ||
-    defaultTripleClick(view, inside)
-}
-
-function defaultTripleClick(view, inside) {
-  var doc = view.state.doc;
-  if (inside == -1) {
-    if (doc.inlineContent) {
-      updateSelection(view, dist$2.TextSelection.create(doc, 0, doc.content.size), "pointer");
-      return true
-    }
-    return false
-  }
-
-  var $pos = doc.resolve(inside);
-  for (var i = $pos.depth + 1; i > 0; i--) {
-    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
-    var nodePos = $pos.before(i);
-    if (node.inlineContent)
-      { updateSelection(view, dist$2.TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size), "pointer"); }
-    else if (dist$2.NodeSelection.isSelectable(node))
-      { updateSelection(view, dist$2.NodeSelection.create(doc, nodePos), "pointer"); }
-    else
-      { continue }
-    return true
-  }
-}
-
-function forceDOMFlush(view) {
-  if (!view.inDOMChange) { return false }
-  view.inDOMChange.finish(true);
-  return true
-}
-
-var selectNodeModifier = result.mac ? "metaKey" : "ctrlKey";
-
-handlers.mousedown = function (view, event) {
-  view.shiftKey = event.shiftKey;
-  var flushed = forceDOMFlush(view);
-  var now = Date.now(), type;
-  if (now - lastClick.time >= 500 || !isNear(event, lastClick) || event[selectNodeModifier]) { type = "singleClick"; }
-  else if (now - oneButLastClick.time >= 600 || !isNear(event, oneButLastClick)) { type = "doubleClick"; }
-  else { type = "tripleClick"; }
-  oneButLastClick = lastClick;
-  lastClick = {time: now, x: event.clientX, y: event.clientY};
-
-  var pos = view.posAtCoords(eventCoords(event));
-  if (!pos) { return }
-
-  if (type == "singleClick")
-    { view.mouseDown = new MouseDown(view, pos, event, flushed); }
-  else if ((type == "doubleClick" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event))
-    { event.preventDefault(); }
-  else
-    { view.selectionReader.poll("pointer"); }
-};
-
-var MouseDown = function MouseDown(view, pos, event, flushed) {
-  var this$1 = this;
-
-  this.view = view;
-  this.pos = pos;
-  this.event = event;
-  this.flushed = flushed;
-  this.selectNode = event[selectNodeModifier];
-  this.allowDefault = event.shiftKey;
-
-  var targetNode, targetPos;
-  if (pos.inside > -1) {
-    targetNode = view.state.doc.nodeAt(pos.inside);
-    targetPos = pos.inside;
-  } else {
-    var $pos = view.state.doc.resolve(pos.pos);
-    targetNode = $pos.parent;
-    targetPos = $pos.depth ? $pos.before() : 0;
-  }
-
-  this.mightDrag = null;
-  this.target = flushed ? null : event.target;
-  if (targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||
-      view.state.selection instanceof dist$2.NodeSelection && targetPos == view.state.selection.from)
-    { this.mightDrag = {node: targetNode,
-                      pos: targetPos,
-                      addAttr: this.target && !this.target.draggable,
-                      setUneditable: this.target && result.gecko && !this.target.hasAttribute("contentEditable")}; }
-
-  if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {
-    this.view.domObserver.stop();
-    if (this.mightDrag.addAttr) { this.target.draggable = true; }
-    if (this.mightDrag.setUneditable)
-      { setTimeout(function () { return this$1.target.setAttribute("contentEditable", "false"); }, 20); }
-    this.view.domObserver.start();
-  }
-
-  view.root.addEventListener("mouseup", this.up = this.up.bind(this));
-  view.root.addEventListener("mousemove", this.move = this.move.bind(this));
-  view.selectionReader.poll("pointer");
-};
-
-MouseDown.prototype.done = function done () {
-  this.view.root.removeEventListener("mouseup", this.up);
-  this.view.root.removeEventListener("mousemove", this.move);
-  if (this.mightDrag && this.target) {
-    this.view.domObserver.stop();
-    if (this.mightDrag.addAttr) { this.target.draggable = false; }
-    if (this.mightDrag.setUneditable) { this.target.removeAttribute("contentEditable"); }
-    this.view.domObserver.start();
-  }
-  this.view.mouseDown = null;
-};
-
-MouseDown.prototype.up = function up (event) {
-  this.done();
-
-  if (!this.view.dom.contains(event.target.nodeType == 3 ? event.target.parentNode : event.target))
-    { return }
-
-  if (this.allowDefault) {
-    // Force a cursor wrapper redraw if this was suppressed (to avoid an issue with IE drag-selection)
-    if (result.ie && needsCursorWrapper(this.view.state)) { this.view.updateState(this.view.state); }
-    this.view.selectionReader.poll("pointer");
-  } else if (handleSingleClick(this.view, this.pos.pos, this.pos.inside, event, this.selectNode)) {
-    event.preventDefault();
-  } else if (this.flushed) {
-    updateSelection(this.view, dist$2.Selection.near(this.view.state.doc.resolve(this.pos.pos)), "pointer");
-    event.preventDefault();
-  } else {
-    this.view.selectionReader.poll("pointer");
-  }
-};
-
-MouseDown.prototype.move = function move (event) {
-  if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 ||
-                             Math.abs(this.event.y - event.clientY) > 4))
-    { this.allowDefault = true; }
-  this.view.selectionReader.poll("pointer");
-};
-
-handlers.touchdown = function (view) {
-  forceDOMFlush(view);
-  view.selectionReader.poll("pointer");
-};
-
-handlers.contextmenu = function (view) { return forceDOMFlush(view); };
-
-// Input compositions are hard. Mostly because the events fired by
-// browsers are A) very unpredictable and inconsistent, and B) not
-// cancelable.
-//
-// ProseMirror has the problem that it must not update the DOM during
-// a composition, or the browser will cancel it. What it does is keep
-// long-running operations (delayed DOM updates) when a composition is
-// active.
-//
-// We _do not_ trust the information in the composition events which,
-// apart from being very uninformative to begin with, is often just
-// plain wrong. Instead, when a composition ends, we parse the dom
-// around the original selection, and derive an update from that.
-
-editHandlers.compositionstart = editHandlers.compositionupdate = function (view) {
-  DOMChange.start(view, true);
-};
-
-editHandlers.compositionend = function (view, e) {
-  if (!view.inDOMChange) {
-    // We received a compositionend without having seen any previous
-    // events for the composition. If there's data in the event
-    // object, we assume that it's a real change, and start a
-    // composition. Otherwise, we just ignore it.
-    if (e.data) { DOMChange.start(view, true); }
-    else { return }
-  }
-
-  view.inDOMChange.compositionEnd();
-};
-
-editHandlers.input = function (view) {
-  var change = DOMChange.start(view);
-  if (!change.composing) { change.finish(); }
-};
-
-function captureCopy(view, dom) {
-  // The extra wrapper is somehow necessary on IE/Edge to prevent the
-  // content from being mangled when it is put onto the clipboard
-  var doc = dom.ownerDocument;
-  var wrap = doc.body.appendChild(doc.createElement("div"));
-  wrap.appendChild(dom);
-  wrap.style.cssText = "position: fixed; left: -10000px; top: 10px";
-  var sel = getSelection(), range = doc.createRange();
-  range.selectNodeContents(dom);
-  // Done because IE will fire a selectionchange moving the selection
-  // to its start when removeAllRanges is called and the editor still
-  // has focus (which will mess up the editor's selection state).
-  view.dom.blur();
-  sel.removeAllRanges();
-  sel.addRange(range);
-  setTimeout(function () {
-    doc.body.removeChild(wrap);
-    view.focus();
-  }, 50);
-}
-
-// This is very crude, but unfortunately both these browsers _pretend_
-// that they have a clipboard API—all the objects and methods are
-// there, they just don't work, and they are hard to test.
-var brokenClipboardAPI = (result.ie && result.ie_version < 15) ||
-      (result.ios && result.webkit_version < 604);
-
-handlers.copy = editHandlers.cut = function (view, e) {
-  var sel = view.state.selection, cut = e.type == "cut";
-  if (sel.empty) { return }
-
-  // IE and Edge's clipboard interface is completely broken
-  var data = brokenClipboardAPI ? null : e.clipboardData;
-  var slice = sel.content();
-  var ref = serializeForClipboard(view, slice);
-  var dom = ref.dom;
-  var text = ref.text;
-  if (data) {
-    e.preventDefault();
-    data.clearData();
-    data.setData("text/html", dom.innerHTML);
-    data.setData("text/plain", text);
-  } else {
-    captureCopy(view, dom);
-  }
-  if (cut) { view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta("uiEvent", "cut")); }
-};
-
-function sliceSingleNode(slice) {
-  return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null
-}
-
-function capturePaste(view, e) {
-  var doc = view.dom.ownerDocument;
-  var plainText = view.shiftKey || view.state.selection.$from.parent.type.spec.code;
-  var target = doc.body.appendChild(doc.createElement(plainText ? "textarea" : "div"));
-  if (!plainText) { target.contentEditable = "true"; }
-  target.style.cssText = "position: fixed; left: -10000px; top: 10px";
-  target.focus();
-  setTimeout(function () {
-    view.focus();
-    doc.body.removeChild(target);
-    if (plainText) { doPaste(view, target.value, null, e); }
-    else { doPaste(view, target.textContent, target.innerHTML, e); }
-  }, 50);
-}
-
-function doPaste(view, text, html, e) {
-  var slice = parseFromClipboard(view, text, html, view.shiftKey, view.state.selection.$from);
-  if (!slice) { return false }
-
-  if (view.someProp("handlePaste", function (f) { return f(view, e, slice); })) { return true }
-
-  var singleNode = sliceSingleNode(slice);
-  var tr = singleNode ? view.state.tr.replaceSelectionWith(singleNode, view.shiftKey) : view.state.tr.replaceSelection(slice);
-  view.dispatch(tr.scrollIntoView().setMeta("paste", true).setMeta("uiEvent", "paste"));
-  return true
-}
-
-editHandlers.paste = function (view, e) {
-  var data = brokenClipboardAPI ? null : e.clipboardData;
-  if (data && doPaste(view, data.getData("text/plain"), data.getData("text/html"), e))
-    { e.preventDefault(); }
-  else
-    { capturePaste(view, e); }
-};
-
-var Dragging = function Dragging(slice, move) {
-  this.slice = slice;
-  this.move = move;
-};
-
-var dragCopyModifier = result.mac ? "altKey" : "ctrlKey";
-
-handlers.dragstart = function (view, e) {
-  var mouseDown = view.mouseDown;
-  if (mouseDown) { mouseDown.done(); }
-  if (!e.dataTransfer) { return }
-
-  var sel = view.state.selection;
-  var pos = sel.empty ? null : view.posAtCoords(eventCoords(e));
-  if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof dist$2.NodeSelection ? sel.to - 1: sel.to)) ; else if (mouseDown && mouseDown.mightDrag) {
-    view.dispatch(view.state.tr.setSelection(dist$2.NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos)));
-  } else if (e.target && e.target.nodeType == 1) {
-    var desc = view.docView.nearestDesc(e.target, true);
-    if (!desc || !desc.node.type.spec.draggable || desc == view.docView) { return }
-    view.dispatch(view.state.tr.setSelection(dist$2.NodeSelection.create(view.state.doc, desc.posBefore)));
-  }
-  var slice = view.state.selection.content();
-  var ref = serializeForClipboard(view, slice);
-  var dom = ref.dom;
-  var text = ref.text;
-  e.dataTransfer.clearData();
-  e.dataTransfer.setData(brokenClipboardAPI ? "Text" : "text/html", dom.innerHTML);
-  if (!brokenClipboardAPI) { e.dataTransfer.setData("text/plain", text); }
-  view.dragging = new Dragging(slice, !e[dragCopyModifier]);
-};
-
-handlers.dragend = function (view) {
-  window.setTimeout(function () { return view.dragging = null; }, 50);
-};
-
-editHandlers.dragover = editHandlers.dragenter = function (_, e) { return e.preventDefault(); };
-
-editHandlers.drop = function (view, e) {
-  var dragging = view.dragging;
-  view.dragging = null;
-
-  if (!e.dataTransfer) { return }
-
-  var eventPos = view.posAtCoords(eventCoords(e));
-  if (!eventPos) { return }
-  var $mouse = view.state.doc.resolve(eventPos.pos);
-  if (!$mouse) { return }
-  var slice = dragging && dragging.slice ||
-      parseFromClipboard(view, e.dataTransfer.getData(brokenClipboardAPI ? "Text" : "text/plain"),
-                         brokenClipboardAPI ? null : e.dataTransfer.getData("text/html"), false, $mouse);
-  if (!slice) { return }
-
-  e.preventDefault();
-  if (view.someProp("handleDrop", function (f) { return f(view, e, slice, dragging && dragging.move); })) { return }
-  var insertPos = slice ? dist$1.dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;
-  if (insertPos == null) { insertPos = $mouse.pos; }
-
-  var tr = view.state.tr;
-  if (dragging && dragging.move) { tr.deleteSelection(); }
-
-  var pos = tr.mapping.map(insertPos);
-  var isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;
-  var beforeInsert = tr.doc;
-  if (isNode)
-    { tr.replaceRangeWith(pos, pos, slice.content.firstChild); }
-  else
-    { tr.replaceRange(pos, pos, slice); }
-  if (tr.doc.eq(beforeInsert)) { return }
-
-  var $pos = tr.doc.resolve(pos);
-  if (isNode && dist$2.NodeSelection.isSelectable(slice.content.firstChild) &&
-      $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild))
-    { tr.setSelection(new dist$2.NodeSelection($pos)); }
-  else
-    { tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(tr.mapping.map(insertPos)))); }
-  view.focus();
-  view.dispatch(tr.setMeta("uiEvent", "drop"));
-};
-
-handlers.focus = function (view) {
-  if (!view.focused) {
-    view.dom.classList.add("ProseMirror-focused");
-    view.focused = true;
-  }
-};
-
-handlers.blur = function (view) {
-  if (view.focused) {
-    view.dom.classList.remove("ProseMirror-focused");
-    view.focused = false;
-  }
-};
-
-// Make sure all handlers get registered
-for (var prop in editHandlers) { handlers[prop] = editHandlers[prop]; }
-
-function compareObjs(a, b) {
-  if (a == b) { return true }
-  for (var p in a) { if (a[p] !== b[p]) { return false } }
-  for (var p$1 in b) { if (!(p$1 in a)) { return false } }
-  return true
-}
-
-var WidgetType = function WidgetType(toDOM, spec) {
-  this.spec = spec || noSpec;
-  this.side = this.spec.side || 0;
-  this.toDOM = toDOM;
-};
-
-WidgetType.prototype.map = function map (mapping, span, offset, oldOffset) {
-  var ref = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);
-    var pos = ref.pos;
-    var deleted = ref.deleted;
-  return deleted ? null : new Decoration(pos - offset, pos - offset, this)
-};
-
-WidgetType.prototype.valid = function valid () { return true };
-
-WidgetType.prototype.eq = function eq (other) {
-  return this == other ||
-    (other instanceof WidgetType &&
-     (this.spec.key && this.spec.key == other.spec.key ||
-      this.toDOM == other.toDOM && compareObjs(this.spec, other.spec)))
-};
-
-var InlineType = function InlineType(attrs, spec) {
-  this.spec = spec || noSpec;
-  this.attrs = attrs;
-};
-
-InlineType.prototype.map = function map (mapping, span, offset, oldOffset) {
-  var from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;
-  var to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;
-  return from >= to ? null : new Decoration(from, to, this)
-};
-
-InlineType.prototype.valid = function valid (_, span) { return span.from < span.to };
-
-InlineType.prototype.eq = function eq (other) {
-  return this == other ||
-    (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&
-     compareObjs(this.spec, other.spec))
-};
-
-InlineType.is = function is (span) { return span.type instanceof InlineType };
-
-var NodeType = function NodeType(attrs, spec) {
-  this.spec = spec || noSpec;
-  this.attrs = attrs;
-};
-
-NodeType.prototype.map = function map (mapping, span, offset, oldOffset) {
-  var from = mapping.mapResult(span.from + oldOffset, 1);
-  if (from.deleted) { return null }
-  var to = mapping.mapResult(span.to + oldOffset, -1);
-  if (to.deleted || to.pos <= from.pos) { return null }
-  return new Decoration(from.pos - offset, to.pos - offset, this)
-};
-
-NodeType.prototype.valid = function valid (node, span) {
-  var ref = node.content.findIndex(span.from);
-    var index = ref.index;
-    var offset = ref.offset;
-  return offset == span.from && offset + node.child(index).nodeSize == span.to
-};
-
-NodeType.prototype.eq = function eq (other) {
-  return this == other ||
-    (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&
-     compareObjs(this.spec, other.spec))
-};
-
-// ::- Decoration objects can be provided to the view through the
-// [`decorations` prop](#view.EditorProps.decorations). They come in
-// several variants—see the static members of this class for details.
-var Decoration = function Decoration(from, to, type) {
-  // :: number
-  // The start position of the decoration.
-  this.from = from;
-  // :: number
-  // The end position. Will be the same as `from` for [widget
-  // decorations](#view.Decoration^widget).
-  this.to = to;
-  this.type = type;
-};
-
-var prototypeAccessors$2 = { spec: {} };
-
-Decoration.prototype.copy = function copy (from, to) {
-  return new Decoration(from, to, this.type)
-};
-
-Decoration.prototype.eq = function eq (other) {
-  return this.type.eq(other.type) && this.from == other.from && this.to == other.to
-};
-
-Decoration.prototype.map = function map (mapping, offset, oldOffset) {
-  return this.type.map(mapping, this, offset, oldOffset)
-};
-
-// :: (number, union<(view: EditorView, getPos: () → number) → dom.Node, dom.Node>, ?Object) → Decoration
-// Creates a widget decoration, which is a DOM node that's shown in
-// the document at the given position. It is recommended that you
-// delay rendering the widget by passing a function that will be
-// called when the widget is actually drawn in a view, but you can
-// also directly pass a DOM node. `getPos` can be used to find the
-// widget's current document position.
-//
-// spec::- These options are supported:
-//
-//   side:: ?number
-//   Controls which side of the document position this widget is
-//   associated with. When negative, it is drawn before a cursor
-//   at its position, and content inserted at that position ends
-//   up after the widget. When zero (the default) or positive, the
-//   widget is drawn after the cursor and content inserted there
-//   ends up before the widget.
-//
-//   When there are multiple widgets at a given position, their
-//   `side` values determine the order in which they appear. Those
-//   with lower values appear first. The ordering of widgets with
-//   the same `side` value is unspecified.
-//
-//   When `marks` is null, `side` also determines the marks that
-//   the widget is wrapped in—those of the node before when
-//   negative, those of the node after when positive.
-//
-//   marks:: ?[Mark]
-//   The precise set of marks to draw around the widget.
-//
-//   stopEvent:: ?(event: dom.Event) → bool
-//   Can be used to control which DOM events, when they bubble out
-//   of this widget, the editor view should ignore.
-//
-//   key:: ?string
-//   When comparing decorations of this type (in order to decide
-//   whether it needs to be redrawn), ProseMirror will by default
-//   compare the widget DOM node by identity. If you pass a key,
-//   that key will be compared instead, which can be useful when
-//   you generate decorations on the fly and don't want to store
-//   and reuse DOM nodes. Make sure that any widgets with the same
-//   key are interchangeable—if widgets differ in, for example,
-//   the behavior of some event handler, they should get
-//   different keys.
-Decoration.widget = function widget (pos, toDOM, spec) {
-  return new Decoration(pos, pos, new WidgetType(toDOM, spec))
-};
-
-// :: (number, number, DecorationAttrs, ?Object) → Decoration
-// Creates an inline decoration, which adds the given attributes to
-// each inline node between `from` and `to`.
-//
-// spec::- These options are recognized:
-//
-//   inclusiveStart:: ?bool
-//   Determines how the left side of the decoration is
-//   [mapped](#transform.Position_Mapping) when content is
-//   inserted directly at that positon. By default, the decoration
-//   won't include the new content, but you can set this to `true`
-//   to make it inclusive.
-//
-//   inclusiveEnd:: ?bool
-//   Determines how the right side of the decoration is mapped.
-//   See
-//   [`inclusiveStart`](#view.Decoration^inline^spec.inclusiveStart).
-Decoration.inline = function inline (from, to, attrs, spec) {
-  return new Decoration(from, to, new InlineType(attrs, spec))
-};
-
-// :: (number, number, DecorationAttrs, ?Object) → Decoration
-// Creates a node decoration. `from` and `to` should point precisely
-// before and after a node in the document. That node, and only that
-// node, will receive the given attributes.
-Decoration.node = function node (from, to, attrs, spec) {
-  return new Decoration(from, to, new NodeType(attrs, spec))
-};
-
-// :: Object
-// The spec provided when creating this decoration. Can be useful
-// if you've stored extra information in that object.
-prototypeAccessors$2.spec.get = function () { return this.type.spec };
-
-Object.defineProperties( Decoration.prototype, prototypeAccessors$2 );
-
-// DecorationAttrs:: interface
-// A set of attributes to add to a decorated node. Most properties
-// simply directly correspond to DOM attributes of the same name,
-// which will be set to the property's value. These are exceptions:
-//
-//   class:: ?string
-//   A CSS class name or a space-separated set of class names to be
-//   _added_ to the classes that the node already had.
-//
-//   style:: ?string
-//   A string of CSS to be _added_ to the node's existing `style` property.
-//
-//   nodeName:: ?string
-//   When non-null, the target node is wrapped in a DOM element of
-//   this type (and the other attributes are applied to this element).
-
-var none = [];
-var noSpec = {};
-
-// ::- A collection of [decorations](#view.Decoration), organized in
-// such a way that the drawing algorithm can efficiently use and
-// compare them. This is a persistent data structure—it is not
-// modified, updates create a new value.
-var DecorationSet = function DecorationSet(local, children) {
-  this.local = local && local.length ? local : none;
-  this.children = children && children.length ? children : none;
-};
-
-// :: (Node, [Decoration]) → DecorationSet
-// Create a set of decorations, using the structure of the given
-// document.
-DecorationSet.create = function create (doc, decorations) {
-  return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty
-};
-
-// :: (?number, ?number, ?(spec: Object) → bool) → [Decoration]
-// Find all decorations in this set which touch the given range
-// (including decorations that start or end directly at the
-// boundaries) and match the given predicate on their spec. When
-// `start` and `end` are omitted, all decorations in the set are
-// considered. When `predicate` isn't given, all decorations are
-// asssumed to match.
-DecorationSet.prototype.find = function find (start, end, predicate) {
-  var result = [];
-  this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);
-  return result
-};
-
-DecorationSet.prototype.findInner = function findInner (start, end, result, offset, predicate) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.local.length; i++) {
-    var span = this$1.local[i];
-    if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec)))
-      { result.push(span.copy(span.from + offset, span.to + offset)); }
-  }
-  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3) {
-    if (this$1.children[i$1] < end && this$1.children[i$1 + 1] > start) {
-      var childOff = this$1.children[i$1] + 1;
-      this$1.children[i$1 + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate);
-    }
-  }
-};
-
-// :: (Mapping, Node, ?Object) → DecorationSet
-// Map the set of decorations in response to a change in the
-// document.
-//
-// options::- An optional set of options.
-//
-//   onRemove:: ?(decorationSpec: Object)
-//   When given, this function will be called for each decoration
-//   that gets dropped as a result of the mapping, passing the
-//   spec of that decoration.
-DecorationSet.prototype.map = function map (mapping, doc, options) {
-  if (this == empty || mapping.maps.length == 0) { return this }
-  return this.mapInner(mapping, doc, 0, 0, options || noSpec)
-};
-
-DecorationSet.prototype.mapInner = function mapInner (mapping, node, offset, oldOffset, options) {
-    var this$1 = this;
-
-  var newLocal;
-  for (var i = 0; i < this.local.length; i++) {
-    var mapped = this$1.local[i].map(mapping, offset, oldOffset);
-    if (mapped && mapped.type.valid(node, mapped)) { (newLocal || (newLocal = [])).push(mapped); }
-    else if (options.onRemove) { options.onRemove(this$1.local[i].spec); }
-  }
-
-  if (this.children.length)
-    { return mapChildren(this.children, newLocal, mapping, node, offset, oldOffset, options) }
-  else
-    { return newLocal ? new DecorationSet(newLocal.sort(byPos)) : empty }
-};
-
-// :: (Node, [Decoration]) → DecorationSet
-// Add the given array of decorations to the ones in the set,
-// producing a new set. Needs access to the current document to
-// create the appropriate tree structure.
-DecorationSet.prototype.add = function add (doc, decorations) {
-  if (!decorations.length) { return this }
-  if (this == empty) { return DecorationSet.create(doc, decorations) }
-  return this.addInner(doc, decorations, 0)
-};
-
-DecorationSet.prototype.addInner = function addInner (doc, decorations, offset) {
-    var this$1 = this;
-
-  var children, childIndex = 0;
-  doc.forEach(function (childNode, childOffset) {
-    var baseOffset = childOffset + offset, found;
-    if (!(found = takeSpansForNode(decorations, childNode, baseOffset))) { return }
-
-    if (!children) { children = this$1.children.slice(); }
-    while (childIndex < children.length && children[childIndex] < childOffset) { childIndex += 3; }
-    if (children[childIndex] == childOffset)
-      { children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1); }
-    else
-      { children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec)); }
-    childIndex += 3;
-  });
-
-  var local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset);
-  return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local,
-                           children || this.children)
-};
-
-// :: ([Decoration]) → DecorationSet
-// Create a new set that contains the decorations in this set, minus
-// the ones in the given array.
-DecorationSet.prototype.remove = function remove (decorations) {
-  if (decorations.length == 0 || this == empty) { return this }
-  return this.removeInner(decorations, 0)
-};
-
-DecorationSet.prototype.removeInner = function removeInner (decorations, offset) {
-    var this$1 = this;
-
-  var children = this.children, local = this.local;
-  for (var i = 0; i < children.length; i += 3) {
-    var found = (void 0), from = children[i] + offset, to = children[i + 1] + offset;
-    for (var j = 0, span = (void 0); j < decorations.length; j++) { if (span = decorations[j]) {
-      if (span.from > from && span.to < to) {
-        decorations[j] = null
-        ;(found || (found = [])).push(span);
-      }
-    } }
-    if (!found) { continue }
-    if (children == this$1.children) { children = this$1.children.slice(); }
-    var removed = children[i + 2].removeInner(found, from + 1);
-    if (removed != empty) {
-      children[i + 2] = removed;
-    } else {
-      children.splice(i, 3);
-      i -= 3;
-    }
-  }
-  if (local.length) { for (var i$1 = 0, span$1 = (void 0); i$1 < decorations.length; i$1++) { if (span$1 = decorations[i$1]) {
-    for (var j$1 = 0; j$1 < local.length; j$1++) { if (local[j$1].type.eq(span$1.type)) {
-      if (local == this$1.local) { local = this$1.local.slice(); }
-      local.splice(j$1--, 1);
-    } }
-  } } }
-  if (children == this.children && local == this.local) { return this }
-  return local.length || children.length ? new DecorationSet(local, children) : empty
-};
-
-DecorationSet.prototype.forChild = function forChild (offset, node) {
-    var this$1 = this;
-
-  if (this == empty) { return this }
-  if (node.isLeaf) { return DecorationSet.empty }
-
-  var child, local;
-  for (var i = 0; i < this.children.length; i += 3) { if (this$1.children[i] >= offset) {
-    if (this$1.children[i] == offset) { child = this$1.children[i + 2]; }
-    break
-  } }
-  var start = offset + 1, end = start + node.content.size;
-  for (var i$1 = 0; i$1 < this.local.length; i$1++) {
-    var dec = this$1.local[i$1];
-    if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {
-      var from = Math.max(start, dec.from) - start, to = Math.min(end, dec.to) - start;
-      if (from < to) { (local || (local = [])).push(dec.copy(from, to)); }
-    }
-  }
-  if (local) {
-    var localSet = new DecorationSet(local.sort(byPos));
-    return child ? new DecorationGroup([localSet, child]) : localSet
-  }
-  return child || empty
-};
-
-DecorationSet.prototype.eq = function eq (other) {
-    var this$1 = this;
-
-  if (this == other) { return true }
-  if (!(other instanceof DecorationSet) ||
-      this.local.length != other.local.length ||
-      this.children.length != other.children.length) { return false }
-  for (var i = 0; i < this.local.length; i++)
-    { if (!this$1.local[i].eq(other.local[i])) { return false } }
-  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3)
-    { if (this$1.children[i$1] != other.children[i$1] ||
-        this$1.children[i$1 + 1] != other.children[i$1 + 1] ||
-        !this$1.children[i$1 + 2].eq(other.children[i$1 + 2])) { return false } }
-  return false
-};
-
-DecorationSet.prototype.locals = function locals (node) {
-  return removeOverlap(this.localsInner(node))
-};
-
-DecorationSet.prototype.localsInner = function localsInner (node) {
-    var this$1 = this;
-
-  if (this == empty) { return none }
-  if (node.inlineContent || !this.local.some(InlineType.is)) { return this.local }
-  var result = [];
-  for (var i = 0; i < this.local.length; i++) {
-    if (!(this$1.local[i].type instanceof InlineType))
-      { result.push(this$1.local[i]); }
-  }
-  return result
-};
-
-var empty = new DecorationSet();
-
-// :: DecorationSet
-// The empty set of decorations.
-DecorationSet.empty = empty;
-
-DecorationSet.removeOverlap = removeOverlap;
-
-// :- An abstraction that allows the code dealing with decorations to
-// treat multiple DecorationSet objects as if it were a single object
-// with (a subset of) the same interface.
-var DecorationGroup = function DecorationGroup(members) {
-  this.members = members;
-};
-
-DecorationGroup.prototype.forChild = function forChild (offset, child) {
-    var this$1 = this;
-
-  if (child.isLeaf) { return DecorationSet.empty }
-  var found = [];
-  for (var i = 0; i < this.members.length; i++) {
-    var result = this$1.members[i].forChild(offset, child);
-    if (result == empty) { continue }
-    if (result instanceof DecorationGroup) { found = found.concat(result.members); }
-    else { found.push(result); }
-  }
-  return DecorationGroup.from(found)
-};
-
-DecorationGroup.prototype.eq = function eq (other) {
-    var this$1 = this;
-
-  if (!(other instanceof DecorationGroup) ||
-      other.members.length != this.members.length) { return false }
-  for (var i = 0; i < this.members.length; i++)
-    { if (!this$1.members[i].eq(other.members[i])) { return false } }
-  return true
-};
-
-DecorationGroup.prototype.locals = function locals (node) {
-    var this$1 = this;
-
-  var result, sorted = true;
-  for (var i = 0; i < this.members.length; i++) {
-    var locals = this$1.members[i].localsInner(node);
-    if (!locals.length) { continue }
-    if (!result) {
-      result = locals;
-    } else {
-      if (sorted) {
-        result = result.slice();
-        sorted = false;
-      }
-      for (var j = 0; j < locals.length; j++) { result.push(locals[j]); }
-    }
-  }
-  return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none
-};
-
-// : ([DecorationSet]) → union<DecorationSet, DecorationGroup>
-// Create a group for the given array of decoration sets, or return
-// a single set when possible.
-DecorationGroup.from = function from (members) {
-  switch (members.length) {
-    case 0: return empty
-    case 1: return members[0]
-    default: return new DecorationGroup(members)
-  }
-};
-
-function mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {
-  var children = oldChildren.slice();
-
-  // Mark the children that are directly touched by changes, and
-  // move those that are after the changes.
-  var shift = function (oldStart, oldEnd, newStart, newEnd) {
-    for (var i = 0; i < children.length; i += 3) {
-      var end = children[i + 1], dSize = (void 0);
-      if (end == -1 || oldStart > end + oldOffset) { continue }
-      if (oldEnd >= children[i] + oldOffset) {
-        children[i + 1] = -1;
-      } else if (dSize = (newEnd - newStart) - (oldEnd - oldStart) + (oldOffset - offset)) {
-        children[i] += dSize;
-        children[i + 1] += dSize;
-      }
-    }
-  };
-  for (var i = 0; i < mapping.maps.length; i++) { mapping.maps[i].forEach(shift); }
-
-  // Find the child nodes that still correspond to a single node,
-  // recursively call mapInner on them and update their positions.
-  var mustRebuild = false;
-  for (var i$1 = 0; i$1 < children.length; i$1 += 3) { if (children[i$1 + 1] == -1) { // Touched nodes
-    var from = mapping.map(children[i$1] + oldOffset), fromLocal = from - offset;
-    if (fromLocal < 0 || fromLocal >= node.content.size) {
-      mustRebuild = true;
-      continue
-    }
-    // Must read oldChildren because children was tagged with -1
-    var to = mapping.map(oldChildren[i$1 + 1] + oldOffset, -1), toLocal = to - offset;
-    var ref = node.content.findIndex(fromLocal);
-    var index = ref.index;
-    var childOffset = ref.offset;
-    var childNode = node.maybeChild(index);
-    if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {
-      var mapped = children[i$1 + 2].mapInner(mapping, childNode, from + 1, children[i$1] + oldOffset + 1, options);
-      if (mapped != empty) {
-        children[i$1] = fromLocal;
-        children[i$1 + 1] = toLocal;
-        children[i$1 + 2] = mapped;
-      } else {
-        children.splice(i$1, 3);
-        i$1 -= 3;
-      }
-    } else {
-      mustRebuild = true;
-    }
-  } }
-
-  // Remaining children must be collected and rebuilt into the appropriate structure
-  if (mustRebuild) {
-    var decorations = mapAndGatherRemainingDecorations(children, newLocal ? moveSpans(newLocal, offset) : [], mapping,
-                                                       offset, oldOffset, options);
-    var built = buildTree(decorations, node, 0, options);
-    newLocal = built.local;
-    for (var i$2 = 0; i$2 < children.length; i$2 += 3) { if (children[i$2 + 1] == -1) {
-      children.splice(i$2, 3);
-      i$2 -= 3;
-    } }
-    for (var i$3 = 0, j = 0; i$3 < built.children.length; i$3 += 3) {
-      var from$1 = built.children[i$3];
-      while (j < children.length && children[j] < from$1) { j += 3; }
-      children.splice(j, 0, built.children[i$3], built.children[i$3 + 1], built.children[i$3 + 2]);
-    }
-  }
-
-  return new DecorationSet(newLocal && newLocal.sort(byPos), children)
-}
-
-function moveSpans(spans, offset) {
-  if (!offset || !spans.length) { return spans }
-  var result = [];
-  for (var i = 0; i < spans.length; i++) {
-    var span = spans[i];
-    result.push(new Decoration(span.from + offset, span.to + offset, span.type));
-  }
-  return result
-}
-
-function mapAndGatherRemainingDecorations(children, decorations, mapping, offset, oldOffset, options) {
-  // Gather all decorations from the remaining marked children
-  function gather(set, oldOffset) {
-    for (var i = 0; i < set.local.length; i++) {
-      var mapped = set.local[i].map(mapping, offset, oldOffset);
-      if (mapped) { decorations.push(mapped); }
-      else if (options.onRemove) { options.onRemove(set.local[i].spec); }
-    }
-    for (var i$1 = 0; i$1 < set.children.length; i$1 += 3)
-      { gather(set.children[i$1 + 2], set.children[i$1] + oldOffset + 1); }
-  }
-  for (var i = 0; i < children.length; i += 3) { if (children[i + 1] == -1)
-    { gather(children[i + 2], children[i] + oldOffset + 1); } }
-
-  return decorations
-}
-
-function takeSpansForNode(spans, node, offset) {
-  if (node.isLeaf) { return null }
-  var end = offset + node.nodeSize, found = null;
-  for (var i = 0, span = (void 0); i < spans.length; i++) {
-    if ((span = spans[i]) && span.from > offset && span.to < end) {
-      (found || (found = [])).push(span);
-      spans[i] = null;
-    }
-  }
-  return found
-}
-
-function withoutNulls(array) {
-  var result = [];
-  for (var i = 0; i < array.length; i++)
-    { if (array[i] != null) { result.push(array[i]); } }
-  return result
-}
-
-// : ([Decoration], Node, number) → DecorationSet
-// Build up a tree that corresponds to a set of decorations. `offset`
-// is a base offset that should be subtractet from the `from` and `to`
-// positions in the spans (so that we don't have to allocate new spans
-// for recursive calls).
-function buildTree(spans, node, offset, options) {
-  var children = [], hasNulls = false;
-  node.forEach(function (childNode, localStart) {
-    var found = takeSpansForNode(spans, childNode, localStart + offset);
-    if (found) {
-      hasNulls = true;
-      var subtree = buildTree(found, childNode, offset + localStart + 1, options);
-      if (subtree != empty)
-        { children.push(localStart, localStart + childNode.nodeSize, subtree); }
-    }
-  });
-  var locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);
-  for (var i = 0; i < locals.length; i++) { if (!locals[i].type.valid(node, locals[i])) {
-    if (options.onRemove) { options.onRemove(locals[i].spec); }
-    locals.splice(i--, 1);
-  } }
-  return locals.length || children.length ? new DecorationSet(locals, children) : empty
-}
-
-// : (Decoration, Decoration) → number
-// Used to sort decorations so that ones with a low start position
-// come first, and within a set with the same start position, those
-// with an smaller end position come first.
-function byPos(a, b) {
-  return a.from - b.from || a.to - b.to
-}
-
-// : ([Decoration]) → [Decoration]
-// Scan a sorted array of decorations for partially overlapping spans,
-// and split those so that only fully overlapping spans are left (to
-// make subsequent rendering easier). Will return the input array if
-// no partially overlapping spans are found (the common case).
-function removeOverlap(spans) {
-  var working = spans;
-  for (var i = 0; i < working.length - 1; i++) {
-    var span = working[i];
-    if (span.from != span.to) { for (var j = i + 1; j < working.length; j++) {
-      var next = working[j];
-      if (next.from == span.from) {
-        if (next.to != span.to) {
-          if (working == spans) { working = spans.slice(); }
-          // Followed by a partially overlapping larger span. Split that
-          // span.
-          working[j] = next.copy(next.from, span.to);
-          insertAhead(working, j + 1, next.copy(span.to, next.to));
-        }
-        continue
-      } else {
-        if (next.from < span.to) {
-          if (working == spans) { working = spans.slice(); }
-          // The end of this one overlaps with a subsequent span. Split
-          // this one.
-          working[i] = span.copy(span.from, next.from);
-          insertAhead(working, j, span.copy(next.from, span.to));
-        }
-        break
-      }
-    } }
-  }
-  return working
-}
-
-function insertAhead(array, i, deco) {
-  while (i < array.length && byPos(deco, array[i]) > 0) { i++; }
-  array.splice(i, 0, deco);
-}
-
-// : (EditorView) → union<DecorationSet, DecorationGroup>
-// Get the decorations associated with the current props of a view.
-function viewDecorations(view) {
-  var found = [];
-  view.someProp("decorations", function (f) {
-    var result = f(view.state);
-    if (result && result != empty) { found.push(result); }
-  });
-  if (view.cursorWrapper)
-    { found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco])); }
-  return DecorationGroup.from(found)
-}
-
-// ::- An editor view manages the DOM structure that represents an
-// editable document. Its state and behavior are determined by its
-// [props](#view.DirectEditorProps).
-var EditorView = function EditorView(place, props) {
-  this._props = props;
-  // :: EditorState
-  // The view's current [state](#state.EditorState).
-  this.state = props.state;
-
-  this.dispatch = this.dispatch.bind(this);
-
-  this._root = null;
-  this.focused = false;
-
-  // :: dom.Element
-  // An editable DOM node containing the document. (You probably
-  // should not directly interfere with its content.)
-  this.dom = (place && place.mount) || document.createElement("div");
-  if (place) {
-    if (place.appendChild) { place.appendChild(this.dom); }
-    else if (place.apply) { place(this.dom); }
-    else if (place.mount) { this.mounted = true; }
-  }
-
-  this.editable = getEditable(this);
-  this.cursorWrapper = null;
-  updateCursorWrapper(this);
-  this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);
-
-  this.lastSelectedViewDesc = null;
-  // :: ?{slice: Slice, move: bool}
-  // When editor content is being dragged, this object contains
-  // information about the dragged slice and whether it is being
-  // copied or moved. At any other time, it is null.
-  this.dragging = null;
-  initInput(this); // Must be done before creating a SelectionReader
-
-  this.selectionReader = new SelectionReader(this);
-
-  this.pluginViews = [];
-  this.updatePluginViews();
-};
-
-var prototypeAccessors = { props: {},root: {} };
-
-// :: DirectEditorProps
-// The view's current [props](#view.EditorProps).
-prototypeAccessors.props.get = function () {
-    var this$1 = this;
-
-  if (this._props.state != this.state) {
-    var prev = this._props;
-    this._props = {};
-    for (var name in prev) { this$1._props[name] = prev[name]; }
-    this._props.state = this.state;
-  }
-  return this._props
-};
-
-// :: (DirectEditorProps)
-// Update the view's props. Will immediately cause an update to
-// the DOM.
-EditorView.prototype.update = function update (props) {
-  if (props.handleDOMEvents != this._props.handleDOMEvents) { ensureListeners(this); }
-  this._props = props;
-  this.updateState(props.state);
-};
-
-// :: (DirectEditorProps)
-// Update the view by updating existing props object with the object
-// given as argument. Equivalent to `view.update(Object.assign({},
-// view.props, props))`.
-EditorView.prototype.setProps = function setProps (props) {
-    var this$1 = this;
-
-  var updated = {};
-  for (var name in this$1._props) { updated[name] = this$1._props[name]; }
-  updated.state = this.state;
-  for (var name$1 in props) { updated[name$1] = props[name$1]; }
-  this.update(updated);
-};
-
-// :: (EditorState)
-// Update the editor's `state` prop, without touching any of the
-// other props.
-EditorView.prototype.updateState = function updateState (state) {
-    var this$1 = this;
-
-  var prev = this.state;
-  this.state = state;
-  if (prev.plugins != state.plugins) { ensureListeners(this); }
-
-  this.domObserver.flush();
-  if (this.inDOMChange && this.inDOMChange.stateUpdated(state)) { return }
-
-  var prevEditable = this.editable;
-  this.editable = getEditable(this);
-  updateCursorWrapper(this);
-  var innerDeco = viewDecorations(this), outerDeco = computeDocDeco(this);
-
-  var scroll = prev.config != state.config ? "reset"
-      : state.scrollToSelection > prev.scrollToSelection ? "to selection" : "preserve";
-  var updateDoc = !this.docView.matchesNode(state.doc, outerDeco, innerDeco);
-  var updateSel = updateDoc || !state.selection.eq(prev.selection) || this.selectionReader.domChanged();
-  var oldScrollPos = scroll == "preserve" && updateSel && storeScrollPos(this);
-
-  if (updateSel) {
-    this.domObserver.stop();
-    if (updateDoc) {
-      if (!this.docView.update(state.doc, outerDeco, innerDeco, this)) {
-        this.docView.destroy();
-        this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);
-      }
-      this.selectionReader.clearDOMState();
-    }
-    selectionToDOM(this);
-    this.domObserver.start();
-  }
-
-  if (prevEditable != this.editable) { this.selectionReader.editableChanged(); }
-  this.updatePluginViews(prev);
-
-  if (scroll == "reset") {
-    this.dom.scrollTop = 0;
-  } else if (scroll == "to selection") {
-    if (this.someProp("handleScrollToSelection", function (f) { return f(this$1); }))
-      ; // Handled
-    else if (state.selection instanceof dist$2.NodeSelection)
-      { scrollRectIntoView(this, this.docView.domAfterPos(state.selection.from).getBoundingClientRect()); }
-    else
-      { scrollRectIntoView(this, this.coordsAtPos(state.selection.head)); }
-  } else if (oldScrollPos) {
-    resetScrollPos(oldScrollPos);
-  }
-};
-
-EditorView.prototype.destroyPluginViews = function destroyPluginViews () {
-  var view;
-  while (view = this.pluginViews.pop()) { if (view.destroy) { view.destroy(); } }
-};
-
-EditorView.prototype.updatePluginViews = function updatePluginViews (prevState) {
-    var this$1 = this;
-
-  var plugins = this.state.plugins;
-  if (!prevState || prevState.plugins != plugins) {
-    this.destroyPluginViews();
-    for (var i = 0; i < plugins.length; i++) {
-      var plugin = plugins[i];
-      if (plugin.spec.view) { this$1.pluginViews.push(plugin.spec.view(this$1)); }
-    }
-  } else {
-    for (var i$1 = 0; i$1 < this.pluginViews.length; i$1++) {
-      var pluginView = this$1.pluginViews[i$1];
-      if (pluginView.update) { pluginView.update(this$1, prevState); }
-    }
-  }
-};
-
-// :: (string, ?(prop: *) → *) → *
-// Goes over the values of a prop, first those provided directly,
-// then those from plugins (in order), and calls `f` every time a
-// non-undefined value is found. When `f` returns a truthy value,
-// that is immediately returned. When `f` isn't provided, it is
-// treated as the identity function (the prop value is returned
-// directly).
-EditorView.prototype.someProp = function someProp (propName, f) {
-  var prop = this._props && this._props[propName], value;
-  if (prop != null && (value = f ? f(prop) : prop)) { return value }
-  var plugins = this.state.plugins;
-  if (plugins) { for (var i = 0; i < plugins.length; i++) {
-    var prop$1 = plugins[i].props[propName];
-    if (prop$1 != null && (value = f ? f(prop$1) : prop$1)) { return value }
-  } }
-};
-
-// :: () → bool
-// Query whether the view has focus.
-EditorView.prototype.hasFocus = function hasFocus () {
-  return this.root.activeElement == this.dom
-};
-
-// :: ()
-// Focus the editor.
-EditorView.prototype.focus = function focus () {
-  this.domObserver.stop();
-  selectionToDOM(this, true);
-  this.domObserver.start();
-  if (this.editable) { this.dom.focus(); }
-};
-
-// :: union<dom.Document, dom.DocumentFragment>
-// Get the document root in which the editor exists. This will
-// usually be the top-level `document`, but might be a [shadow
-// DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)
-// root if the editor is inside one.
-prototypeAccessors.root.get = function () {
-    var this$1 = this;
-
-  var cached = this._root;
-  if (cached == null) { for (var search = this.dom.parentNode; search; search = search.parentNode) {
-    if (search.nodeType == 9 || (search.nodeType == 11 && search.host))
-      { return this$1._root = search }
-  } }
-  return cached || document
-};
-
-// :: ({left: number, top: number}) → ?{pos: number, inside: number}
-// Given a pair of viewport coordinates, return the document
-// position that corresponds to them. May return null if the given
-// coordinates aren't inside of the visible editor. When an object
-// is returned, its `pos` property is the position nearest to the
-// coordinates, and its `inside` property holds the position of the
-// inner node that the position falls inside of, or -1 if it is at
-// the top level, not in any node.
-EditorView.prototype.posAtCoords = function posAtCoords$1 (coords) {
-  var pos = posAtCoords(this, coords);
-  if (this.inDOMChange && pos) {
-    pos.pos = this.inDOMChange.mapping.map(pos.pos);
-    if (pos.inside != -1) { pos.inside = this.inDOMChange.mapping.map(pos.inside); }
-  }
-  return pos
-};
-
-// :: (number) → {left: number, right: number, top: number, bottom: number}
-// Returns the viewport rectangle at a given document position. `left`
-// and `right` will be the same number, as this returns a flat
-// cursor-ish rectangle.
-EditorView.prototype.coordsAtPos = function coordsAtPos$1 (pos) {
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.invert().map(pos); }
-  return coordsAtPos(this, pos)
-};
-
-// :: (number) → {node: dom.Node, offset: number}
-// Find the DOM position that corresponds to the given document
-// position. Note that you should **not** mutate the editor's
-// internal DOM, only inspect it (and even that is usually not
-// necessary).
-EditorView.prototype.domAtPos = function domAtPos (pos) {
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.invert().map(pos); }
-  return this.docView.domFromPos(pos)
-};
-
-// :: (number) → ?dom.Node
-// Find the DOM node that represents the document node after the
-// given position. May return `null` when the position doesn't point
-// in front of a node or if the node is inside an opaque node view.
-//
-// This is intended to be able to call things like
-// `getBoundingClientRect` on that DOM node. Do **not** mutate the
-// editor DOM directly, or add styling this way, since that will be
-// immediately overriden by the editor as it redraws the node.
-EditorView.prototype.nodeDOM = function nodeDOM (pos) {
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.invert().map(pos); }
-  var desc = this.docView.descAt(pos);
-  return desc ? desc.nodeDOM : null
-};
-
-// :: (dom.Node, number, ?number) → number
-// Find the document position that corresponds to a given DOM
-// position. (Whenever possible, it is preferable to inspect the
-// document structure directly, rather than poking around in the
-// DOM, but sometimes—for example when interpreting an event
-// target—you don't have a choice.)
-//
-// The `bias` parameter can be used to influence which side of a DOM
-// node to use when the position is inside a leaf node.
-EditorView.prototype.posAtDOM = function posAtDOM (node, offset, bias) {
-    if ( bias === void 0 ) { bias = -1; }
-
-  var pos = this.docView.posFromDOM(node, offset, bias);
-  if (pos == null) { throw new RangeError("DOM position not inside the editor") }
-  if (this.inDOMChange)
-    { pos = this.inDOMChange.mapping.map(pos); }
-  return pos
-};
-
-// :: (union<"up", "down", "left", "right", "forward", "backward">, ?EditorState) → bool
-// Find out whether the selection is at the end of a textblock when
-// moving in a given direction. When, for example, given `"left"`,
-// it will return true if moving left from the current cursor
-// position would leave that position's parent textblock. Will apply
-// to the view's current state by default, but it is possible to
-// pass a different state.
-EditorView.prototype.endOfTextblock = function endOfTextblock$1 (dir, state) {
-  return endOfTextblock(this, state || this.state, dir)
-};
-
-// :: ()
-// Removes the editor from the DOM and destroys all [node
-// views](#view.NodeView).
-EditorView.prototype.destroy = function destroy () {
-  if (!this.docView) { return }
-  destroyInput(this);
-  this.destroyPluginViews();
-  this.selectionReader.destroy();
-  if (this.mounted) {
-    this.docView.update(this.state.doc, [], viewDecorations(this), this);
-    this.dom.textContent = "";
-  } else if (this.dom.parentNode) {
-    this.dom.parentNode.removeChild(this.dom);
-  }
-  this.docView.destroy();
-  this.docView = null;
-};
-
-// Used for testing.
-EditorView.prototype.dispatchEvent = function dispatchEvent$1 (event) {
-  return dispatchEvent(this, event)
-};
-
-// :: (Transaction)
-// Dispatch a transaction. Will call
-// [`dispatchTransaction`](#view.DirectEditorProps.dispatchTransaction)
-// when given, and otherwise defaults to applying the transaction to
-// the current state and calling
-// [`updateState`](#view.EditorView.updateState) with the result.
-// This method is bound to the view instance, so that it can be
-// easily passed around.
-EditorView.prototype.dispatch = function dispatch (tr) {
-  var dispatchTransaction = this._props.dispatchTransaction;
-  if (dispatchTransaction) { dispatchTransaction.call(this, tr); }
-  else { this.updateState(this.state.apply(tr)); }
-};
-
-Object.defineProperties( EditorView.prototype, prototypeAccessors );
-
-function computeDocDeco(view) {
-  var attrs = Object.create(null);
-  attrs.class = "ProseMirror" + (view.focused ? " ProseMirror-focused" : "");
-  attrs.contenteditable = String(view.editable);
-
-  view.someProp("attributes", function (value) {
-    if (typeof value == "function") { value = value(view.state); }
-    if (value) { for (var attr in value) {
-      if (attr == "class")
-        { attrs.class += " " + value[attr]; }
-      else if (!attrs[attr] && attr != "contenteditable" && attr != "nodeName")
-        { attrs[attr] = String(value[attr]); }
-    } }
-  });
-
-  return [Decoration.node(0, view.state.doc.content.size, attrs)]
-}
-
-function cursorWrapperDOM(visible) {
-  var span = document.createElement("span");
-  span.textContent = "\ufeff"; // zero-width non-breaking space
-  if (!visible) {
-    span.style.position = "absolute";
-    span.style.left = "-100000px";
-  }
-  return span
-}
-
-function updateCursorWrapper(view) {
-  var $pos = needsCursorWrapper(view.state);
-  // On IE/Edge, moving the DOM selection will abort a mouse drag, so
-  // there we delay the creation of the wrapper when the mouse is down.
-  if ($pos && !(result.ie && view.mouseDown)) {
-    var visible = view.state.selection.visible;
-    // Needs a cursor wrapper
-    var marks = view.state.storedMarks || $pos.marks(), dom;
-    if (!view.cursorWrapper || !dist.Mark.sameSet(view.cursorWrapper.deco.spec.marks, marks) ||
-        view.cursorWrapper.dom.textContent != "\ufeff" ||
-        view.cursorWrapper.deco.spec.visible != visible)
-      { dom = cursorWrapperDOM(visible); }
-    else if (view.cursorWrapper.deco.pos != $pos.pos)
-      { dom = view.cursorWrapper.dom; }
-    if (dom)
-      { view.cursorWrapper = {dom: dom, deco: Decoration.widget($pos.pos, dom, {isCursorWrapper: true, marks: marks, raw: true, visible: visible})}; }
-  } else {
-    view.cursorWrapper = null;
-  }
-}
-
-function getEditable(view) {
-  return !view.someProp("editable", function (value) { return value(view.state) === false; })
-}
-
-// EditorProps:: interface
-//
-// Props are configuration values that can be passed to an editor view
-// or included in a plugin. This interface lists the supported props.
-//
-// The various event-handling functions may all return `true` to
-// indicate that they handled the given event. The view will then take
-// care to call `preventDefault` on the event, except with
-// `handleDOMEvents`, where the handler itself is responsible for that.
-//
-// How a prop is resolved depends on the prop. Handler functions are
-// called one at a time, starting with the base props and then
-// searching through the plugins (in order of appearance) until one of
-// them returns true. For some props, the first plugin that yields a
-// value gets precedence.
-//
-//   handleDOMEvents:: ?Object<(view: EditorView, event: dom.Event) → bool>
-//   Can be an object mapping DOM event type names to functions that
-//   handle them. Such functions will be called before any handling
-//   ProseMirror does of events fired on the editable DOM element.
-//   Contrary to the other event handling props, when returning true
-//   from such a function, you are responsible for calling
-//   `preventDefault` yourself (or not, if you want to allow the
-//   default behavior).
-//
-//   handleKeyDown:: ?(view: EditorView, event: dom.KeyboardEvent) → bool
-//   Called when the editor receives a `keydown` event.
-//
-//   handleKeyPress:: ?(view: EditorView, event: dom.KeyboardEvent) → bool
-//   Handler for `keypress` events.
-//
-//   handleTextInput:: ?(view: EditorView, from: number, to: number, text: string) → bool
-//   Whenever the user directly input text, this handler is called
-//   before the input is applied. If it returns `true`, the default
-//   behavior of actually inserting the text is suppressed.
-//
-//   handleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-//   Called for each node around a click, from the inside out. The
-//   `direct` flag will be true for the inner node.
-//
-//   handleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-//   Called when the editor is clicked, after `handleClickOn` handlers
-//   have been called.
-//
-//   handleDoubleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-//   Called for each node around a double click.
-//
-//   handleDoubleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-//   Called when the editor is double-clicked, after `handleDoubleClickOn`.
-//
-//   handleTripleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-//   Called for each node around a triple click.
-//
-//   handleTripleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-//   Called when the editor is triple-clicked, after `handleTripleClickOn`.
-//
-//   handlePaste:: ?(view: EditorView, event: dom.Event, slice: Slice) → bool
-//   Can be used to override the behavior of pasting. `slice` is the
-//   pasted content parsed by the editor, but you can directly access
-//   the event to get at the raw content.
-//
-//   handleDrop:: ?(view: EditorView, event: dom.Event, slice: Slice, moved: bool) → bool
-//   Called when something is dropped on the editor. `moved` will be
-//   true if this drop moves from the current selection (which should
-//   thus be deleted).
-//
-//   handleScrollToSelection:: ?(view: EditorView) → bool
-//   Called when the view, after updating its state, tries to scroll
-//   the selection into view. A handler function may return false to
-//   indicate that it did not handle the scrolling and further
-//   handlers or the default behavior should be tried.
-//
-//   createSelectionBetween:: ?(view: EditorView, anchor: ResolvedPos, head: ResolvedPos) → ?Selection
-//   Can be used to override the way a selection is created when
-//   reading a DOM selection between the given anchor and head.
-//
-//   domParser:: ?DOMParser
-//   The [parser](#model.DOMParser) to use when reading editor changes
-//   from the DOM. Defaults to calling
-//   [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) on the
-//   editor's schema.
-//
-//   transformPastedHTML:: ?(html: string) → string
-//   Can be used to transform pasted HTML text, _before_ it is parsed,
-//   for example to clean it up.
-//
-//   clipboardParser:: ?DOMParser
-//   The [parser](#model.DOMParser) to use when reading content from
-//   the clipboard. When not given, the value of the
-//   [`domParser`](#view.EditorProps.domParser) prop is used.
-//
-//   transformPastedText:: ?(text: string) → string
-//   Transform pasted plain text.
-//
-//   clipboardTextParser:: ?(text: string, $context: ResolvedPos) → Slice
-//   A function to parse text from the clipboard into a document
-//   slice. Called after
-//   [`transformPastedText`](#view.EditorProps.transformPastedText).
-//   The default behavior is to split the text into lines, wrap them
-//   in `<p>` tags, and call
-//   [`clipboardParser`](#view.EditorProps.clipboardParser) on it.
-//
-//   transformPasted:: ?(Slice) → Slice
-//   Can be used to transform pasted content before it is applied to
-//   the document.
-//
-//   nodeViews:: ?Object<(node: Node, view: EditorView, getPos: () → number, decorations: [Decoration]) → NodeView>
-//   Allows you to pass custom rendering and behavior logic for nodes
-//   and marks. Should map node and mark names to constructor
-//   functions that produce a [`NodeView`](#view.NodeView) object
-//   implementing the node's display behavior. `getPos` is a function
-//   that can be called to get the node's current position, which can
-//   be useful when creating transactions to update it.
-//
-//   `decorations` is an array of node or inline decorations that are
-//   active around the node. They are automatically drawn in the
-//   normal way, and you will usually just want to ignore this, but
-//   they can also be used as a way to provide context information to
-//   the node view without adding it to the document itself.
-//
-//   clipboardSerializer:: ?DOMSerializer
-//   The DOM serializer to use when putting content onto the
-//   clipboard. If not given, the result of
-//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)
-//   will be used.
-//
-//   clipboardTextSerializer:: ?(Slice) → string
-//   A function that will be called to get the text for the current
-//   selection when copying text to the clipboard. By default, the
-//   editor will use [`textBetween`](#model.Node.textBetween) on the
-//   selected range.
-//
-//   decorations:: ?(state: EditorState) → ?DecorationSet
-//   A set of [document decorations](#view.Decoration) to show in the
-//   view.
-//
-//   editable:: ?(state: EditorState) → bool
-//   When this returns false, the content of the view is not directly
-//   editable.
-//
-//   attributes:: ?union<Object<string>, (EditorState) → ?Object<string>>
-//   Control the DOM attributes of the editable element. May be either
-//   an object or a function going from an editor state to an object.
-//   By default, the element will get a class `"ProseMirror"`, and
-//   will have its `contentEditable` attribute determined by the
-//   [`editable` prop](#view.EditorProps.editable). Additional classes
-//   provided here will be added to the class. For other attributes,
-//   the value provided first (as in
-//   [`someProp`](#view.EditorView.someProp)) will be used.
-//
-//   scrollThreshold:: ?number
-//   Determines the distance (in pixels) between the cursor and the
-//   end of the visible viewport at which point, when scrolling the
-//   cursor into view, scrolling takes place. Defaults to 0.
-//
-//   scrollMargin:: ?number
-//   Determines the extra space (in pixels) that is left above or
-//   below the cursor when it is scrolled into view. Defaults to 5.
-
-// DirectEditorProps:: interface extends EditorProps
-//
-// The props object given directly to the editor view supports two
-// fields that can't be used in plugins:
-//
-//   state:: EditorState
-//   The current state of the editor.
-//
-//   dispatchTransaction:: ?(tr: Transaction)
-//   The callback over which to send transactions (state updates)
-//   produced by the view. If you specify this, you probably want to
-//   make sure this ends up calling the view's
-//   [`updateState`](#view.EditorView.updateState) method with a new
-//   state that has the transaction
-//   [applied](#state.EditorState.apply). The callback will be bound to have
-//   the view instance as its `this` binding.
-
-exports.EditorView = EditorView;
-exports.Decoration = Decoration;
-exports.DecorationSet = DecorationSet;
-exports.__serializeForClipboard = serializeForClipboard;
-exports.__parseFromClipboard = parseFromClipboard;
-
-});
-
-unwrapExports(dist$3);
-var dist_1$3 = dist$3.EditorView;
-var dist_2$3 = dist$3.Decoration;
-var dist_3$3 = dist$3.DecorationSet;
-var dist_4$3 = dist$3.__serializeForClipboard;
-var dist_5$3 = dist$3.__parseFromClipboard;
-
-var dropcursor = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-var gecko = typeof navigator != "undefined" && /gecko\/\d/i.test(navigator.userAgent);
-var linux = typeof navigator != "undefined" && /linux/i.test(navigator.platform);
-
-function dropCursor(options) {
-  function dispatch(view, data) {
-    view.dispatch(view.state.tr.setMeta(plugin, data));
-  }
-
-  var timeout = null;
-  function scheduleRemoval(view, time) {
-    clearTimeout(timeout);
-    timeout = setTimeout(function () {
-      if (plugin.getState(view.state)) { dispatch(view, {type: "remove"}); }
-    }, time);
-  }
-
-  var plugin = new dist$2.Plugin({
-    state: {
-      init: function init() { return null },
-      apply: function apply(tr, prev, state) {
-        // Firefox on Linux gets really confused an breaks dragging when we
-        // mess with the nodes around the target node during a drag. So
-        // disable this plugin there. See https://bugzilla.mozilla.org/show_bug.cgi?id=1323170
-        if (gecko && linux) { return null }
-        var command = tr.getMeta("uiEvent") == "drop" ? {type: "remove"} : tr.getMeta(plugin);
-        if (!command) { return prev }
-        if (command.type == "set") { return pluginStateFor(state, command.pos, options) }
-        return null
-      }
-    },
-    props: {
-      handleDOMEvents: {
-        dragover: function dragover(view, event) {
-          var active = plugin.getState(view.state);
-          var pos = view.posAtCoords({left: event.clientX, top: event.clientY});
-          if (pos) {
-            var target = pos.pos;
-            if (view.dragging && view.dragging.slice) {
-              target = dist$1.dropPoint(view.state.doc, target, view.dragging.slice);
-              if (target == null) { target = pos.pos; }
-            }
-            if (!active || active.pos != target)
-              { dispatch(view, {type: "set", pos: target}); }
-          }
-          scheduleRemoval(view, 5000);
-          return false
-        },
-
-        dragend: function dragend(view) {
-          scheduleRemoval(view, 20);
-          return false
-        },
-
-        drop: function drop(view) {
-          scheduleRemoval(view, 20);
-          return false
-        },
-
-        dragleave: function dragleave(view, event) {
-          if (event.target == view.dom || !view.dom.contains(event.relatedTarget)) { dispatch(view, {type: "remove"}); }
-          return false
-        }
-      },
-      decorations: function decorations(state) {
-        var active = plugin.getState(state);
-        return active && active.deco
-      }
-    }
-  });
-  return plugin
-}
-
-function style(options, side) {
-  var width = (options && options.width) || 1;
-  var color = (options && options.color) || "black";
-  return ("border-" + side + ": " + width + "px solid " + color + "; margin-" + side + ": -" + width + "px")
-}
-
-function pluginStateFor(state, pos, options) {
-  var $pos = state.doc.resolve(pos), deco;
-  if (!$pos.parent.inlineContent) {
-    var before, after;
-    if (before = $pos.nodeBefore)
-      { deco = dist$3.Decoration.node(pos - before.nodeSize, pos, {nodeName: "div", style: style(options, "right")}); }
-    else if (after = $pos.nodeAfter)
-      { deco = dist$3.Decoration.node(pos, pos + after.nodeSize, {nodeName: "div", style: style(options, "left")}); }
-  }
-  if (!deco) {
-    var node = document.createElement("span");
-    node.textContent = "\u200b";
-    node.style.cssText = style(options, "left") + "; display: inline-block; pointer-events: none";
-    deco = dist$3.Decoration.widget(pos, node);
-  }
-  return {pos: pos, deco: dist$3.DecorationSet.create(state.doc, [deco])}
-}
-
-exports.dropCursor = dropCursor;
-
-});
-
-unwrapExports(dropcursor);
-var dropcursor_1 = dropcursor.dropCursor;
-
-var base = {
-  8: "Backspace",
-  9: "Tab",
-  10: "Enter",
-  12: "NumLock",
-  13: "Enter",
-  16: "Shift",
-  17: "Control",
-  18: "Alt",
-  20: "CapsLock",
-  27: "Escape",
-  32: " ",
-  33: "PageUp",
-  34: "PageDown",
-  35: "End",
-  36: "Home",
-  37: "ArrowLeft",
-  38: "ArrowUp",
-  39: "ArrowRight",
-  40: "ArrowDown",
-  44: "PrintScreen",
-  45: "Insert",
-  46: "Delete",
-  59: ";",
-  61: "=",
-  91: "Meta",
-  92: "Meta",
-  106: "*",
-  107: "+",
-  108: ",",
-  109: "-",
-  110: ".",
-  111: "/",
-  144: "NumLock",
-  145: "ScrollLock",
-  160: "Shift",
-  161: "Shift",
-  162: "Control",
-  163: "Control",
-  164: "Alt",
-  165: "Alt",
-  173: "-",
-  186: ";",
-  187: "=",
-  188: ",",
-  189: "-",
-  190: ".",
-  191: "/",
-  192: "`",
-  219: "[",
-  220: "\\",
-  221: "]",
-  222: "'",
-  229: "q"
-};
-var shift = {
-  48: ")",
-  49: "!",
-  50: "@",
-  51: "#",
-  52: "$",
-  53: "%",
-  54: "^",
-  55: "&",
-  56: "*",
-  57: "(",
-  59: ";",
-  61: "+",
-  173: "_",
-  186: ":",
-  187: "+",
-  188: "<",
-  189: "_",
-  190: ">",
-  191: "?",
-  192: "~",
-  219: "{",
-  220: "|",
-  221: "}",
-  222: "\"",
-  229: "Q"
-};
-
-var chrome = typeof navigator != "undefined" && /Chrome\/(\d+)/.exec(navigator.userAgent);
-var safari = typeof navigator != "undefined" && /Apple Computer/.test(navigator.vendor);
-var gecko = typeof navigator != "undefined" && /Gecko\/\d+/.test(navigator.userAgent);
-var mac = typeof navigator != "undefined" && /Mac/.test(navigator.platform);
-var brokenModifierNames = chrome && (mac || +chrome[1] < 57) || gecko && mac;
-
-// Fill in the digit keys
-for (var i = 0; i < 10; i++) { base[48 + i] = base[96 + i] = String(i); }
-
-// The function keys
-for (var i = 1; i <= 24; i++) { base[i + 111] = "F" + i; }
-
-// And the alphabetic keys
-for (var i = 65; i <= 90; i++) {
-  base[i] = String.fromCharCode(i + 32);
-  shift[i] = String.fromCharCode(i);
-}
-
-// For each code that doesn't have a shift-equivalent, copy the base name
-for (var code in base) { if (!shift.hasOwnProperty(code)) { shift[code] = base[code]; } }
-
-function keyName(event) {
-  // Don't trust event.key in Chrome when there are modifiers until
-  // they fix https://bugs.chromium.org/p/chromium/issues/detail?id=633838
-  var ignoreKey = brokenModifierNames && (event.ctrlKey || event.altKey || event.metaKey) ||
-    safari && event.shiftKey && event.key && event.key.length == 1;
-  var name = (!ignoreKey && event.key) ||
-    (event.shiftKey ? shift : base)[event.keyCode] ||
-    event.key || "Unidentified";
-  // Edge sometimes produces wrong names (Issue #3)
-  if (name == "Esc") { name = "Escape"; }
-  if (name == "Del") { name = "Delete"; }
-  // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/
-  if (name == "Left") { name = "ArrowLeft"; }
-  if (name == "Up") { name = "ArrowUp"; }
-  if (name == "Right") { name = "ArrowRight"; }
-  if (name == "Down") { name = "ArrowDown"; }
-  return name
-}
-
-var w3cKeyname = keyName;
-keyName.base = base;
-keyName.shift = shift;
-
-var keymap_1 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var keyName = _interopDefault(w3cKeyname);
-
-
-// declare global: navigator
-
-var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform) : false;
-
-function normalizeKeyName(name) {
-  var parts = name.split(/-(?!$)/), result = parts[parts.length - 1];
-  if (result == "Space") { result = " "; }
-  var alt, ctrl, shift, meta;
-  for (var i = 0; i < parts.length - 1; i++) {
-    var mod = parts[i];
-    if (/^(cmd|meta|m)$/i.test(mod)) { meta = true; }
-    else if (/^a(lt)?$/i.test(mod)) { alt = true; }
-    else if (/^(c|ctrl|control)$/i.test(mod)) { ctrl = true; }
-    else if (/^s(hift)?$/i.test(mod)) { shift = true; }
-    else if (/^mod$/i.test(mod)) { if (mac) { meta = true; } else { ctrl = true; } }
-    else { throw new Error("Unrecognized modifier name: " + mod) }
-  }
-  if (alt) { result = "Alt-" + result; }
-  if (ctrl) { result = "Ctrl-" + result; }
-  if (meta) { result = "Meta-" + result; }
-  if (shift) { result = "Shift-" + result; }
-  return result
-}
-
-function normalize(map) {
-  var copy = Object.create(null);
-  for (var prop in map) { copy[normalizeKeyName(prop)] = map[prop]; }
-  return copy
-}
-
-function modifiers(name, event, shift) {
-  if (event.altKey) { name = "Alt-" + name; }
-  if (event.ctrlKey) { name = "Ctrl-" + name; }
-  if (event.metaKey) { name = "Meta-" + name; }
-  if (shift !== false && event.shiftKey) { name = "Shift-" + name; }
-  return name
-}
-
-// :: (Object) → Plugin
-// Create a keymap plugin for the given set of bindings.
-//
-// Bindings should map key names to [command](#commands)-style
-// functions, which will be called with `(EditorState, dispatch,
-// EditorView)` arguments, and should return true when they've handled
-// the key. Note that the view argument isn't part of the command
-// protocol, but can be used as an escape hatch if a binding needs to
-// directly interact with the UI.
-//
-// Key names may be strings like `"Shift-Ctrl-Enter"`—a key
-// identifier prefixed with zero or more modifiers. Key identifiers
-// are based on the strings that can appear in
-// [`KeyEvent.key`](https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).
-// Use lowercase letters to refer to letter keys (or uppercase letters
-// if you want shift to be held). You may use `"Space"` as an alias
-// for the `" "` name.
-//
-// Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or
-// `a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or
-// `Meta-`) are recognized. For characters that are created by holding
-// shift, the `Shift-` prefix is implied, and should not be added
-// explicitly.
-//
-// You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on
-// other platforms.
-//
-// You can add multiple keymap plugins to an editor. The order in
-// which they appear determines their precedence (the ones early in
-// the array get to dispatch first).
-function keymap(bindings) {
-  return new dist$2.Plugin({props: {handleKeyDown: keydownHandler(bindings)}})
-}
-
-// :: (Object) → (view: EditorView, event: dom.Event) → bool
-// Given a set of bindings (using the same format as
-// [`keymap`](#keymap.keymap), return a [keydown
-// handler](#view.EditorProps.handleKeyDown) handles them.
-function keydownHandler(bindings) {
-  var map = normalize(bindings);
-  return function(view, event) {
-    var name = keyName(event), isChar = name.length == 1 && name != " ", baseName;
-    var direct = map[modifiers(name, event, !isChar)];
-    if (direct && direct(view.state, view.dispatch, view)) { return true }
-    if (isChar && (event.shiftKey || event.altKey || event.metaKey) &&
-        (baseName = keyName.base[event.keyCode]) && baseName != name) {
-      var fromCode = map[modifiers(baseName, event, true)];
-      if (fromCode && fromCode(view.state, view.dispatch, view)) { return true }
-    }
-    return false
-  }
-}
-
-exports.keymap = keymap;
-exports.keydownHandler = keydownHandler;
-
-});
-
-unwrapExports(keymap_1);
-var keymap_2 = keymap_1.keymap;
-var keymap_3 = keymap_1.keydownHandler;
-
-var dist$4 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-
-// ::- Gap cursor selections are represented using this class. Its
-// `$anchor` and `$head` properties both point at the cursor position.
-var GapCursor = (function (Selection$$1) {
-  function GapCursor($pos) {
-    Selection$$1.call(this, $pos, $pos);
-  }
-
-  if ( Selection$$1 ) { GapCursor.__proto__ = Selection$$1; }
-  GapCursor.prototype = Object.create( Selection$$1 && Selection$$1.prototype );
-  GapCursor.prototype.constructor = GapCursor;
-
-  GapCursor.prototype.map = function map (doc, mapping) {
-    var $pos = doc.resolve(mapping.map(this.head));
-    return GapCursor.valid($pos) ? new GapCursor($pos) : Selection$$1.near($pos)
-  };
-
-  GapCursor.prototype.content = function content () { return dist.Slice.empty };
-
-  GapCursor.prototype.eq = function eq (other) {
-    return other instanceof GapCursor && other.head == this.head
-  };
-
-  GapCursor.prototype.toJSON = function toJSON () {
-    return {type: "gapcursor", pos: this.head}
-  };
-
-  GapCursor.fromJSON = function fromJSON (doc, json) {
-    if (typeof json.pos != "number") { throw new RangeError("Invalid input for GapCursor.fromJSON") }
-    return new GapCursor(doc.resolve(json.pos))
-  };
-
-  GapCursor.prototype.getBookmark = function getBookmark () { return new GapBookmark(this.anchor) };
-
-  GapCursor.valid = function valid ($pos) {
-    var parent = $pos.parent;
-    if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos)) { return false }
-    var override = parent.type.spec.allowGapCursor;
-    if (override != null) { return override }
-    var deflt = parent.contentMatchAt($pos.index()).defaultType;
-    return deflt && deflt.isTextblock
-  };
-
-  GapCursor.findFrom = function findFrom ($pos, dir, mustMove) {
-    if (!mustMove && GapCursor.valid($pos)) { return $pos }
-
-    var pos = $pos.pos, next = null;
-    // Scan up from this position
-    for (var d = $pos.depth;; d--) {
-      var parent = $pos.node(d);
-      if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {
-        next = parent.maybeChild(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);
-        break
-      } else if (d == 0) {
-        return null
-      }
-      pos += dir;
-      var $cur = $pos.doc.resolve(pos);
-      if (GapCursor.valid($cur)) { return $cur }
-    }
-
-    // And then down into the next node
-    for (;;) {
-      next = dir > 0 ? next.firstChild : next.lastChild;
-      if (!next) { break }
-      pos += dir;
-      var $cur$1 = $pos.doc.resolve(pos);
-      if (GapCursor.valid($cur$1)) { return $cur$1 }
-    }
-
-    return null
-  };
-
-  return GapCursor;
-}(dist$2.Selection));
-
-GapCursor.prototype.visible = false;
-
-dist$2.Selection.jsonID("gapcursor", GapCursor);
-
-var GapBookmark = function GapBookmark(pos) {
-  this.pos = pos;
-};
-GapBookmark.prototype.map = function map (mapping) {
-  return new GapBookmark(mapping.map(this.pos))
-};
-GapBookmark.prototype.resolve = function resolve (doc) {
-  var $pos = doc.resolve(this.pos);
-  return GapCursor.valid($pos) ? new GapCursor($pos) : dist$2.Selection.near($pos)
-};
-
-function closedBefore($pos) {
-  for (var d = $pos.depth; d >= 0; d--) {
-    var index = $pos.index(d);
-    // At the start of this parent, look at next one
-    if (index == 0) { continue }
-    // See if the node before (or its first ancestor) is closed
-    for (var before = $pos.node(d).child(index - 1);; before = before.lastChild) {
-      if (before.isTextblock) { return false }
-      if (before.childCount == 0 || before.isAtom || before.type.spec.isolating) { return true }
-    }
-  }
-  // Hit start of document
-  return true
-}
-
-function closedAfter($pos) {
-  for (var d = $pos.depth; d >= 0; d--) {
-    var index = $pos.indexAfter(d), parent = $pos.node(d);
-    if (index == parent.childCount) { continue }
-    for (var after = parent.child(index);; after = after.firstChild) {
-      if (after.isTextblock) { return false }
-      if (after.childCount == 0 || after.isAtom || after.type.spec.isolating) { return true }
-    }
-  }
-  return true
-}
-
-// :: () → Plugin
-// Create a gap cursor plugin. When enabled, this will capture clicks
-// near and arrow-key-motion past places that don't have a normally
-// selectable position nearby, and create a gap cursor selection for
-// them. The cursor is drawn as an element with class
-// `ProseMirror-gapcursor`. You can either include
-// `style/gapcursor.css` from the package's directory or add your own
-// styles to make it visible.
-var gapCursor = function() {
-  return new dist$2.Plugin({
-    props: {
-      decorations: drawGapCursor,
-
-      createSelectionBetween: function createSelectionBetween(_view, $anchor, $head) {
-        if ($anchor.pos == $head.pos && GapCursor.valid($head)) { return new GapCursor($head) }
-      },
-
-      handleClick: handleClick,
-      handleKeyDown: handleKeyDown
-    }
-  })
-};
-
-var handleKeyDown = keymap_1.keydownHandler({
-  "ArrowLeft": arrow("horiz", -1),
-  "ArrowRight": arrow("horiz", 1),
-  "ArrowUp": arrow("vert", -1),
-  "ArrowDown": arrow("vert", 1)
-});
-
-function arrow(axis, dir) {
-  var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
-  return function(state, dispatch, view) {
-    var sel = state.selection;
-    var $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;
-    if (sel instanceof dist$2.TextSelection) {
-      if (!view.endOfTextblock(dirStr)) { return false }
-      mustMove = false;
-      $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());
-    }
-    var $found = GapCursor.findFrom($start, dir, mustMove);
-    if (!$found) { return false }
-    if (dispatch) { dispatch(state.tr.setSelection(new GapCursor($found))); }
-    return true
-  }
-}
-
-function handleClick(view, pos, event) {
-  var $pos = view.state.doc.resolve(pos);
-  if (!GapCursor.valid($pos)) { return false }
-  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
-  var inside = ref.inside;
-  if (inside > -1 && dist$2.NodeSelection.isSelectable(view.state.doc.nodeAt(inside))) { return false }
-  view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));
-  return true
-}
-
-function drawGapCursor(state) {
-  if (!(state.selection instanceof GapCursor)) { return null }
-  var node = document.createElement("div");
-  node.className = "ProseMirror-gapcursor";
-  return dist$3.DecorationSet.create(state.doc, [dist$3.Decoration.widget(state.selection.head, node, {key: "gapcursor"})])
-}
-
-exports.gapCursor = gapCursor;
-exports.GapCursor = GapCursor;
-
-});
-
-unwrapExports(dist$4);
-var dist_1$4 = dist$4.gapCursor;
-var dist_2$4 = dist$4.GapCursor;
-
-var GOOD_LEAF_SIZE = 200;
-
-// :: class<T> A rope sequence is a persistent sequence data structure
-// that supports appending, prepending, and slicing without doing a
-// full copy. It is represented as a mostly-balanced tree.
-var RopeSequence = function RopeSequence () {};
-
-RopeSequence.prototype.append = function append (other) {
-  if (!other.length) { return this }
-  other = RopeSequence.from(other);
-
-  return (!this.length && other) ||
-    (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||
-    (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||
-    this.appendInner(other)
-};
-
-// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>
-// Prepend an array or other rope to this one, returning a new rope.
-RopeSequence.prototype.prepend = function prepend (other) {
-  if (!other.length) { return this }
-  return RopeSequence.from(other).append(this)
-};
-
-RopeSequence.prototype.appendInner = function appendInner (other) {
-  return new Append(this, other)
-};
-
-// :: (?number, ?number) → RopeSequence<T>
-// Create a rope repesenting a sub-sequence of this rope.
-RopeSequence.prototype.slice = function slice (from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.length; }
-
-  if (from >= to) { return RopeSequence.empty }
-  return this.sliceInner(Math.max(0, from), Math.min(this.length, to))
-};
-
-// :: (number) → T
-// Retrieve the element at the given position from this rope.
-RopeSequence.prototype.get = function get (i) {
-  if (i < 0 || i >= this.length) { return undefined }
-  return this.getInner(i)
-};
-
-// :: ((element: T, index: number) → ?bool, ?number, ?number)
-// Call the given function for each element between the given
-// indices. This tends to be more efficient than looping over the
-// indices and calling `get`, because it doesn't have to descend the
-// tree for every element.
-RopeSequence.prototype.forEach = function forEach (f, from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.length; }
-
-  if (from <= to)
-    { this.forEachInner(f, from, to, 0); }
-  else
-    { this.forEachInvertedInner(f, from, to, 0); }
-};
-
-// :: ((element: T, index: number) → U, ?number, ?number) → [U]
-// Map the given functions over the elements of the rope, producing
-// a flat array.
-RopeSequence.prototype.map = function map (f, from, to) {
-    if ( from === void 0 ) { from = 0; }
-    if ( to === void 0 ) { to = this.length; }
-
-  var result = [];
-  this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);
-  return result
-};
-
-// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>
-// Create a rope representing the given array, or return the rope
-// itself if a rope was given.
-RopeSequence.from = function from (values) {
-  if (values instanceof RopeSequence) { return values }
-  return values && values.length ? new Leaf(values) : RopeSequence.empty
-};
-
-var Leaf = (function (RopeSequence) {
-  function Leaf(values) {
-    RopeSequence.call(this);
-    this.values = values;
-  }
-
-  if ( RopeSequence ) { Leaf.__proto__ = RopeSequence; }
-  Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );
-  Leaf.prototype.constructor = Leaf;
-
-  var prototypeAccessors = { length: {},depth: {} };
-
-  Leaf.prototype.flatten = function flatten () {
-    return this.values
-  };
-
-  Leaf.prototype.sliceInner = function sliceInner (from, to) {
-    if (from == 0 && to == this.length) { return this }
-    return new Leaf(this.values.slice(from, to))
-  };
-
-  Leaf.prototype.getInner = function getInner (i) {
-    return this.values[i]
-  };
-
-  Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {
-    var this$1 = this;
-
-    for (var i = from; i < to; i++)
-      { if (f(this$1.values[i], start + i) === false) { return false } }
-  };
-
-  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {
-    var this$1 = this;
-
-    for (var i = from - 1; i >= to; i--)
-      { if (f(this$1.values[i], start + i) === false) { return false } }
-  };
-
-  Leaf.prototype.leafAppend = function leafAppend (other) {
-    if (this.length + other.length <= GOOD_LEAF_SIZE)
-      { return new Leaf(this.values.concat(other.flatten())) }
-  };
-
-  Leaf.prototype.leafPrepend = function leafPrepend (other) {
-    if (this.length + other.length <= GOOD_LEAF_SIZE)
-      { return new Leaf(other.flatten().concat(this.values)) }
-  };
-
-  prototypeAccessors.length.get = function () { return this.values.length };
-
-  prototypeAccessors.depth.get = function () { return 0 };
-
-  Object.defineProperties( Leaf.prototype, prototypeAccessors );
-
-  return Leaf;
-}(RopeSequence));
-
-// :: RopeSequence
-// The empty rope sequence.
-RopeSequence.empty = new Leaf([]);
-
-var Append = (function (RopeSequence) {
-  function Append(left, right) {
-    RopeSequence.call(this);
-    this.left = left;
-    this.right = right;
-    this.length = left.length + right.length;
-    this.depth = Math.max(left.depth, right.depth) + 1;
-  }
-
-  if ( RopeSequence ) { Append.__proto__ = RopeSequence; }
-  Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );
-  Append.prototype.constructor = Append;
-
-  Append.prototype.flatten = function flatten () {
-    return this.left.flatten().concat(this.right.flatten())
-  };
-
-  Append.prototype.getInner = function getInner (i) {
-    return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)
-  };
-
-  Append.prototype.forEachInner = function forEachInner (f, from, to, start) {
-    var leftLen = this.left.length;
-    if (from < leftLen &&
-        this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)
-      { return false }
-    if (to > leftLen &&
-        this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)
-      { return false }
-  };
-
-  Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {
-    var leftLen = this.left.length;
-    if (from > leftLen &&
-        this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)
-      { return false }
-    if (to < leftLen &&
-        this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)
-      { return false }
-  };
-
-  Append.prototype.sliceInner = function sliceInner (from, to) {
-    if (from == 0 && to == this.length) { return this }
-    var leftLen = this.left.length;
-    if (to <= leftLen) { return this.left.slice(from, to) }
-    if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }
-    return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))
-  };
-
-  Append.prototype.leafAppend = function leafAppend (other) {
-    var inner = this.right.leafAppend(other);
-    if (inner) { return new Append(this.left, inner) }
-  };
-
-  Append.prototype.leafPrepend = function leafPrepend (other) {
-    var inner = this.left.leafPrepend(other);
-    if (inner) { return new Append(inner, this.right) }
-  };
-
-  Append.prototype.appendInner = function appendInner (other) {
-    if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)
-      { return new Append(this.left, new Append(this.right, other)) }
-    return new Append(this, other)
-  };
-
-  return Append;
-}(RopeSequence));
-
-var dist$5 = RopeSequence;
-
-var history_1 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-var RopeSequence = _interopDefault(dist$5);
-
-
-
-// ProseMirror's history isn't simply a way to roll back to a previous
-// state, because ProseMirror supports applying changes without adding
-// them to the history (for example during collaboration).
-//
-// To this end, each 'Branch' (one for the undo history and one for
-// the redo history) keeps an array of 'Items', which can optionally
-// hold a step (an actual undoable change), and always hold a position
-// map (which is needed to move changes below them to apply to the
-// current document).
-//
-// An item that has both a step and a selection bookmark is the start
-// of an 'event' — a group of changes that will be undone or redone at
-// once. (It stores only the bookmark, since that way we don't have to
-// provide a document until the selection is actually applied, which
-// is useful when compressing.)
-
-// Used to schedule history compression
-var max_empty_items = 500;
-
-var Branch = function Branch(items, eventCount) {
-  this.items = items;
-  this.eventCount = eventCount;
-};
-
-// : (Node, bool, ?Item) → ?{transform: Transform, selection: Object}
-// Pop the latest event off the branch's history and apply it
-// to a document transform.
-Branch.prototype.popEvent = function popEvent (state, preserveItems) {
-    var this$1 = this;
-
-  if (this.eventCount == 0) { return null }
-
-  var end = this.items.length;
-  for (;; end--) {
-    var next = this$1.items.get(end - 1);
-    if (next.selection) { --end; break }
-  }
-
-  var remap, mapFrom;
-  if (preserveItems) {
-    remap = this.remapping(end, this.items.length);
-    mapFrom = remap.maps.length;
-  }
-  var transform = state.tr;
-  var selection, remaining;
-  var addAfter = [], addBefore = [];
-
-  this.items.forEach(function (item, i) {
-    if (!item.step) {
-      if (!remap) {
-        remap = this$1.remapping(end, i + 1);
-        mapFrom = remap.maps.length;
-      }
-      mapFrom--;
-      addBefore.push(item);
-      return
-    }
-
-    if (remap) {
-      addBefore.push(new Item(item.map));
-      var step = item.step.map(remap.slice(mapFrom)), map;
-
-      if (step && transform.maybeStep(step).doc) {
-        map = transform.mapping.maps[transform.mapping.maps.length - 1];
-        addAfter.push(new Item(map, null, null, addAfter.length + addBefore.length));
-      }
-      mapFrom--;
-      if (map) { remap.appendMap(map, mapFrom); }
-    } else {
-      transform.maybeStep(item.step);
-    }
-
-    if (item.selection) {
-      selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;
-      remaining = new Branch(this$1.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this$1.eventCount - 1);
-      return false
-    }
-  }, this.items.length, 0);
-
-  return {remaining: remaining, transform: transform, selection: selection}
-};
-
-// : (Transform, Selection, Object)
-// Create a new branch with the given transform added.
-Branch.prototype.addTransform = function addTransform (transform, selection, histOptions, preserveItems) {
-  var newItems = [], eventCount = this.eventCount;
-  var oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;
-
-  for (var i = 0; i < transform.steps.length; i++) {
-    var step = transform.steps[i].invert(transform.docs[i]);
-    var item = new Item(transform.mapping.maps[i], step, selection), merged = (void 0);
-    if (merged = lastItem && lastItem.merge(item)) {
-      item = merged;
-      if (i) { newItems.pop(); }
-      else { oldItems = oldItems.slice(0, oldItems.length - 1); }
-    }
-    newItems.push(item);
-    if (selection) {
-      eventCount++;
-      selection = null;
-    }
-    if (!preserveItems) { lastItem = item; }
-  }
-  var overflow = eventCount - histOptions.depth;
-  if (overflow > DEPTH_OVERFLOW) {
-    oldItems = cutOffEvents(oldItems, overflow);
-    eventCount -= overflow;
-  }
-  return new Branch(oldItems.append(newItems), eventCount)
-};
-
-Branch.prototype.remapping = function remapping (from, to) {
-  var maps = [], mirrors = [];
-  this.items.forEach(function (item, i) {
-    if (item.mirrorOffset != null) {
-      var mirrorPos = i - item.mirrorOffset;
-      if (mirrorPos >= from) { mirrors.push(maps.length - item.mirrorOffset, maps.length); }
-    }
-    maps.push(item.map);
-  }, from, to);
-  return new dist$1.Mapping(maps, mirrors)
-};
-
-Branch.prototype.addMaps = function addMaps (array) {
-  if (this.eventCount == 0) { return this }
-  return new Branch(this.items.append(array.map(function (map) { return new Item(map); })), this.eventCount)
-};
-
-// : ([StepMap], Transform, [number])
-// When the collab module receives remote changes, the history has
-// to know about those, so that it can adjust the steps that were
-// rebased on top of the remote changes, and include the position
-// maps for the remote changes in its array of items.
-Branch.prototype.rebased = function rebased (rebasedTransform, rebasedCount) {
-  if (!this.eventCount) { return this }
-
-  var rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);
-
-  var mapping = rebasedTransform.mapping;
-  var newUntil = rebasedTransform.steps.length;
-  var eventCount = this.eventCount;
-  this.items.forEach(function (item) { if (item.selection) { eventCount--; } }, this.items.length - rebasedCount);
-
-  var iRebased = rebasedCount;
-  this.items.forEach(function (item) {
-    var pos = mapping.getMirror(--iRebased);
-    if (pos == null) { return }
-    newUntil = Math.min(newUntil, pos);
-    var map = mapping.maps[pos];
-    if (item.step) {
-      var step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);
-      var selection = item.selection && item.selection.map(mapping.slice(iRebased, pos));
-      if (selection) { eventCount++; }
-      rebasedItems.push(new Item(map, step, selection));
-    } else {
-      rebasedItems.push(new Item(map));
-    }
-  }, start);
-
-  var newMaps = [];
-  for (var i = rebasedCount; i < newUntil; i++)
-    { newMaps.push(new Item(mapping.maps[i])); }
-  var items = this.items.slice(0, start).append(newMaps).append(rebasedItems);
-  var branch = new Branch(items, eventCount);
-
-  if (branch.emptyItemCount() > max_empty_items)
-    { branch = branch.compress(this.items.length - rebasedItems.length); }
-  return branch
-};
-
-Branch.prototype.emptyItemCount = function emptyItemCount () {
-  var count = 0;
-  this.items.forEach(function (item) { if (!item.step) { count++; } });
-  return count
-};
-
-// Compressing a branch means rewriting it to push the air (map-only
-// items) out. During collaboration, these naturally accumulate
-// because each remote change adds one. The `upto` argument is used
-// to ensure that only the items below a given level are compressed,
-// because `rebased` relies on a clean, untouched set of items in
-// order to associate old items with rebased steps.
-Branch.prototype.compress = function compress (upto) {
-    if ( upto === void 0 ) { upto = this.items.length; }
-
-  var remap = this.remapping(0, upto), mapFrom = remap.maps.length;
-  var items = [], events = 0;
-  this.items.forEach(function (item, i) {
-    if (i >= upto) {
-      items.push(item);
-      if (item.selection) { events++; }
-    } else if (item.step) {
-      var step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();
-      mapFrom--;
-      if (map) { remap.appendMap(map, mapFrom); }
-      if (step) {
-        var selection = item.selection && item.selection.map(remap.slice(mapFrom));
-        if (selection) { events++; }
-        var newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;
-        if (merged = items.length && items[last].merge(newItem))
-          { items[last] = merged; }
-        else
-          { items.push(newItem); }
-      }
-    } else if (item.map) {
-      mapFrom--;
-    }
-  }, this.items.length, 0);
-  return new Branch(RopeSequence.from(items.reverse()), events)
-};
-
-Branch.empty = new Branch(RopeSequence.empty, 0);
-
-function cutOffEvents(items, n) {
-  var cutPoint;
-  items.forEach(function (item, i) {
-    if (item.selection && (n-- == 0)) {
-      cutPoint = i;
-      return false
-    }
-  });
-  return items.slice(cutPoint)
-}
-
-var Item = function Item(map, step, selection, mirrorOffset) {
-  this.map = map;
-  this.step = step;
-  this.selection = selection;
-  this.mirrorOffset = mirrorOffset;
-};
-
-Item.prototype.merge = function merge (other) {
-  if (this.step && other.step && !other.selection) {
-    var step = other.step.merge(this.step);
-    if (step) { return new Item(step.getMap().invert(), step, this.selection) }
-  }
-};
-
-// The value of the state field that tracks undo/redo history for that
-// state. Will be stored in the plugin state when the history plugin
-// is active.
-var HistoryState = function HistoryState(done, undone, prevMap, prevTime) {
-  this.done = done;
-  this.undone = undone;
-  this.prevMap = prevMap;
-  this.prevTime = prevTime;
-};
-
-var DEPTH_OVERFLOW = 20;
-
-// : (EditorState, EditorState, Selection, Object)
-// Record a transformation in undo history.
-function applyTransaction(history, state, tr, options) {
-  var newState = tr.getMeta(historyKey), rebased;
-  if (newState) { return newState }
-
-  if (tr.getMeta(closeHistoryKey)) { history = new HistoryState(history.done, history.undone, null, 0); }
-
-  var appended = tr.getMeta("appendedTransaction");
-  if (tr.steps.length == 0) {
-    return history
-  } else if ((appended || tr).getMeta("addToHistory") !== false) {
-    // Group transforms that occur in quick succession into one event.
-    var newGroup = history.prevTime < (tr.time || 0) - options.newGroupDelay ||
-        !appended && !isAdjacentToLastStep(tr, history.prevMap, history.done);
-    return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : null,
-                                                      options, mustPreserveItems(state)),
-                            Branch.empty, tr.mapping.maps[tr.steps.length - 1], tr.time)
-  } else if (rebased = tr.getMeta("rebased")) {
-    // Used by the collab module to tell the history that some of its
-    // content has been rebased.
-    return new HistoryState(history.done.rebased(tr, rebased),
-                            history.undone.rebased(tr, rebased),
-                            history.prevMap && tr.mapping.maps[tr.steps.length - 1], history.prevTime)
-  } else {
-    return new HistoryState(history.done.addMaps(tr.mapping.maps),
-                            history.undone.addMaps(tr.mapping.maps),
-                            history.prevMap, history.prevTime)
-  }
-}
-
-function isAdjacentToLastStep(transform, prevMap, done) {
-  if (!prevMap) { return false }
-  var firstMap = transform.mapping.maps[0], adjacent = false;
-  if (!firstMap) { return true }
-  firstMap.forEach(function (start, end) {
-    done.items.forEach(function (item) {
-      if (item.step) {
-        prevMap.forEach(function (_start, _end, rStart, rEnd) {
-          if (start <= rEnd && end >= rStart) { adjacent = true; }
-        });
-        return false
-      } else {
-        start = item.map.invert().map(start, -1);
-        end = item.map.invert().map(end, 1);
-      }
-    }, done.items.length, 0);
-  });
-  return adjacent
-}
-
-// : (HistoryState, EditorState, (tr: Transaction), bool)
-// Apply the latest event from one branch to the document and optionally
-// shift the event onto the other branch. Returns true when an event could
-// be shifted.
-function histTransaction(history, state, dispatch, redo) {
-  var preserveItems = mustPreserveItems(state), histOptions = historyKey.get(state).spec.config;
-  var pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);
-  if (!pop) { return }
-
-  var selection = pop.selection.resolve(pop.transform.doc);
-  var added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(),
-                                                                  histOptions, preserveItems);
-
-  var newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0);
-  dispatch(pop.transform.setSelection(selection).setMeta(historyKey, newHist).scrollIntoView());
-}
-
-var cachedPreserveItems = false;
-var cachedPreserveItemsPlugins = null;
-// Check whether any plugin in the given state has a
-// `historyPreserveItems` property in its spec, in which case we must
-// preserve steps exactly as they came in, so that they can be
-// rebased.
-function mustPreserveItems(state) {
-  var plugins = state.plugins;
-  if (cachedPreserveItemsPlugins != plugins) {
-    cachedPreserveItems = false;
-    cachedPreserveItemsPlugins = plugins;
-    for (var i = 0; i < plugins.length; i++) { if (plugins[i].spec.historyPreserveItems) {
-      cachedPreserveItems = true;
-      break
-    } }
-  }
-  return cachedPreserveItems
-}
-
-// :: (Transaction) → Transaction
-// Set a flag on the given transaction that will prevent further steps
-// from being appended to an existing history event (so that they
-// require a separate undo command to undo).
-function closeHistory(tr) {
-  return tr.setMeta(closeHistoryKey, true)
-}
-
-var historyKey = new dist$2.PluginKey("history");
-var closeHistoryKey = new dist$2.PluginKey("closeHistory");
-
-// :: (?Object) → Plugin
-// Returns a plugin that enables the undo history for an editor. The
-// plugin will track undo and redo stacks, which can be used with the
-// [`undo`](#history.undo) and [`redo`](#history.redo) commands.
-//
-// You can set an `"addToHistory"` [metadata
-// property](#state.Transaction.setMeta) of `false` on a transaction
-// to prevent it from being rolled back by undo.
-//
-//   config::-
-//   Supports the following configuration options:
-//
-//     depth:: ?number
-//     The amount of history events that are collected before the
-//     oldest events are discarded. Defaults to 100.
-//
-//     newGroupDelay:: ?number
-//     The delay between changes after which a new group should be
-//     started. Defaults to 500 (milliseconds). Note that when changes
-//     aren't adjacent, a new group is always started.
-function history(config) {
-  config = {depth: config && config.depth || 100,
-            newGroupDelay: config && config.newGroupDelay || 500};
-  return new dist$2.Plugin({
-    key: historyKey,
-
-    state: {
-      init: function init() {
-        return new HistoryState(Branch.empty, Branch.empty, null, 0)
-      },
-      apply: function apply(tr, hist, state) {
-        return applyTransaction(hist, state, tr, config)
-      }
-    },
-
-    config: config
-  })
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// A command function that undoes the last change, if any.
-function undo(state, dispatch) {
-  var hist = historyKey.getState(state);
-  if (!hist || hist.done.eventCount == 0) { return false }
-  if (dispatch) { histTransaction(hist, state, dispatch, false); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// A command function that redoes the last undone change, if any.
-function redo(state, dispatch) {
-  var hist = historyKey.getState(state);
-  if (!hist || hist.undone.eventCount == 0) { return false }
-  if (dispatch) { histTransaction(hist, state, dispatch, true); }
-  return true
-}
-
-// :: (EditorState) → number
-// The amount of undoable events available in a given state.
-function undoDepth(state) {
-  var hist = historyKey.getState(state);
-  return hist ? hist.done.eventCount : 0
-}
-
-// :: (EditorState) → number
-// The amount of redoable events available in a given editor state.
-function redoDepth(state) {
-  var hist = historyKey.getState(state);
-  return hist ? hist.undone.eventCount : 0
-}
-
-exports.HistoryState = HistoryState;
-exports.closeHistory = closeHistory;
-exports.history = history;
-exports.undo = undo;
-exports.redo = redo;
-exports.undoDepth = undoDepth;
-exports.redoDepth = redoDepth;
-
-});
-
-unwrapExports(history_1);
-var history_2 = history_1.HistoryState;
-var history_3 = history_1.closeHistory;
-var history_4 = history_1.history;
-var history_5 = history_1.undo;
-var history_6 = history_1.redo;
-var history_7 = history_1.undoDepth;
-var history_8 = history_1.redoDepth;
-
-var commands = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Delete the selection, if there is one.
-function deleteSelection(state, dispatch) {
-  if (state.selection.empty) { return false }
-  if (dispatch) { dispatch(state.tr.deleteSelection().scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// If the selection is empty and at the start of a textblock, try to
-// reduce the distance between that block and the one before it—if
-// there's a block directly before it that can be joined, join them.
-// If not, try to move the selected block closer to the next one in
-// the document structure by lifting it out of its parent or moving it
-// into a parent of the previous block. Will use the view for accurate
-// (bidi-aware) start-of-textblock detection if given.
-function joinBackward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("backward", state)
-                        : $cursor.parentOffset > 0))
-    { return false }
-
-  var $cut = findCutBefore($cursor);
-
-  // If there is no node before this, try to lift
-  if (!$cut) {
-    var range = $cursor.blockRange(), target = range && dist$1.liftTarget(range);
-    if (target == null) { return false }
-    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-    return true
-  }
-
-  var before = $cut.nodeBefore;
-  // Apply the joining algorithm
-  if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))
-    { return true }
-
-  // If the node below has no content and the node above is
-  // selectable, delete the node below and select the one above.
-  if ($cursor.parent.content.size == 0 &&
-      (textblockAt(before, "end") || dist$2.NodeSelection.isSelectable(before))) {
-    if (dispatch) {
-      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
-      tr.setSelection(textblockAt(before, "end") ? dist$2.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)
-                      : dist$2.NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));
-      dispatch(tr.scrollIntoView());
-    }
-    return true
-  }
-
-  // If the node before is an atom, delete it
-  if (before.isAtom && $cut.depth == $cursor.depth - 1) {
-    if (dispatch) { dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView()); }
-    return true
-  }
-
-  return false
-}
-
-function textblockAt(node, side) {
-  for (; node; node = (side == "start" ? node.firstChild : node.lastChild))
-    { if (node.isTextblock) { return true } }
-  return false
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// When the selection is empty and at the start of a textblock, select
-// the node before that textblock, if possible. This is intended to be
-// bound to keys like backspace, after
-// [`joinBackward`](#commands.joinBackward) or other deleting
-// commands, as a fall-back behavior when the schema doesn't allow
-// deletion at the selected point.
-function selectNodeBackward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("backward", state)
-                        : $cursor.parentOffset > 0))
-    { return false }
-
-  var $cut = findCutBefore($cursor), node = $cut && $cut.nodeBefore;
-  if (!node || !dist$2.NodeSelection.isSelectable(node)) { return false }
-  if (dispatch)
-    { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView()); }
-  return true
-}
-
-function findCutBefore($pos) {
-  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
-    if ($pos.index(i) > 0) { return $pos.doc.resolve($pos.before(i + 1)) }
-    if ($pos.node(i).type.spec.isolating) { break }
-  } }
-  return null
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// If the selection is empty and the cursor is at the end of a
-// textblock, try to reduce or remove the boundary between that block
-// and the one after it, either by joining them or by moving the other
-// block closer to this one in the tree structure. Will use the view
-// for accurate start-of-textblock detection if given.
-function joinForward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("forward", state)
-                        : $cursor.parentOffset < $cursor.parent.content.size))
-    { return false }
-
-  var $cut = findCutAfter($cursor);
-
-  // If there is no node after this, there's nothing to do
-  if (!$cut) { return false }
-
-  var after = $cut.nodeAfter;
-  // Try the joining algorithm
-  if (deleteBarrier(state, $cut, dispatch)) { return true }
-
-  // If the node above has no content and the node below is
-  // selectable, delete the node above and select the one below.
-  if ($cursor.parent.content.size == 0 &&
-      (textblockAt(after, "start") || dist$2.NodeSelection.isSelectable(after))) {
-    if (dispatch) {
-      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
-      tr.setSelection(textblockAt(after, "start") ? dist$2.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)
-                      : dist$2.NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));
-      dispatch(tr.scrollIntoView());
-    }
-    return true
-  }
-
-  // If the next node is an atom, delete it
-  if (after.isAtom && $cut.depth == $cursor.depth - 1) {
-    if (dispatch) { dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView()); }
-    return true
-  }
-
-  return false
-}
-
-// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// When the selection is empty and at the end of a textblock, select
-// the node coming after that textblock, if possible. This is intended
-// to be bound to keys like delete, after
-// [`joinForward`](#commands.joinForward) and similar deleting
-// commands, to provide a fall-back behavior when the schema doesn't
-// allow deletion at the selected point.
-function selectNodeForward(state, dispatch, view) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || (view ? !view.endOfTextblock("forward", state)
-                        : $cursor.parentOffset < $cursor.parent.content.size))
-    { return false }
-
-  var $cut = findCutAfter($cursor), node = $cut && $cut.nodeAfter;
-  if (!node || !dist$2.NodeSelection.isSelectable(node)) { return false }
-  if (dispatch)
-    { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, $cut.pos)).scrollIntoView()); }
-  return true
-}
-
-function findCutAfter($pos) {
-  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
-    var parent = $pos.node(i);
-    if ($pos.index(i) + 1 < parent.childCount) { return $pos.doc.resolve($pos.after(i + 1)) }
-    if (parent.type.spec.isolating) { break }
-  } }
-  return null
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Join the selected block or, if there is a text selection, the
-// closest ancestor block of the selection that can be joined, with
-// the sibling above it.
-function joinUp(state, dispatch) {
-  var sel = state.selection, nodeSel = sel instanceof dist$2.NodeSelection, point;
-  if (nodeSel) {
-    if (sel.node.isTextblock || !dist$1.canJoin(state.doc, sel.from)) { return false }
-    point = sel.from;
-  } else {
-    point = dist$1.joinPoint(state.doc, sel.from, -1);
-    if (point == null) { return false }
-  }
-  if (dispatch) {
-    var tr = state.tr.join(point);
-    if (nodeSel) { tr.setSelection(dist$2.NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize)); }
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Join the selected block, or the closest ancestor of the selection
-// that can be joined, with the sibling after it.
-function joinDown(state, dispatch) {
-  var sel = state.selection, point;
-  if (sel instanceof dist$2.NodeSelection) {
-    if (sel.node.isTextblock || !dist$1.canJoin(state.doc, sel.to)) { return false }
-    point = sel.to;
-  } else {
-    point = dist$1.joinPoint(state.doc, sel.to, 1);
-    if (point == null) { return false }
-  }
-  if (dispatch)
-    { dispatch(state.tr.join(point).scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Lift the selected block, or the closest ancestor block of the
-// selection that can be lifted, out of its parent node.
-function lift(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var $to = ref.$to;
-  var range = $from.blockRange($to), target = range && dist$1.liftTarget(range);
-  if (target == null) { return false }
-  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// If the selection is in a node whose type has a truthy
-// [`code`](#model.NodeSpec.code) property in its spec, replace the
-// selection with a newline character.
-function newlineInCode(state, dispatch) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
-  if (dispatch) { dispatch(state.tr.insertText("\n").scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// When the selection is in a node with a truthy
-// [`code`](#model.NodeSpec.code) property in its spec, create a
-// default block after the code block, and move the cursor there.
-function exitCode(state, dispatch) {
-  var ref = state.selection;
-  var $head = ref.$head;
-  var $anchor = ref.$anchor;
-  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
-  var above = $head.node(-1), after = $head.indexAfter(-1), type = above.contentMatchAt(after).defaultType;
-  if (!above.canReplaceWith(after, after, type)) { return false }
-  if (dispatch) {
-    var pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());
-    tr.setSelection(dist$2.Selection.near(tr.doc.resolve(pos), 1));
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// If a block node is selected, create an empty paragraph before (if
-// it is its parent's first child) or after it.
-function createParagraphNear(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var $to = ref.$to;
-  if ($from.parent.inlineContent || $to.parent.inlineContent) { return false }
-  var type = $from.parent.contentMatchAt($to.indexAfter()).defaultType;
-  if (!type || !type.isTextblock) { return false }
-  if (dispatch) {
-    var side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;
-    var tr = state.tr.insert(side, type.createAndFill());
-    tr.setSelection(dist$2.TextSelection.create(tr.doc, side + 1));
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// If the cursor is in an empty textblock that can be lifted, lift the
-// block.
-function liftEmptyBlock(state, dispatch) {
-  var ref = state.selection;
-  var $cursor = ref.$cursor;
-  if (!$cursor || $cursor.parent.content.size) { return false }
-  if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {
-    var before = $cursor.before();
-    if (dist$1.canSplit(state.doc, before)) {
-      if (dispatch) { dispatch(state.tr.split(before).scrollIntoView()); }
-      return true
-    }
-  }
-  var range = $cursor.blockRange(), target = range && dist$1.liftTarget(range);
-  if (target == null) { return false }
-  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Split the parent block of the selection. If the selection is a text
-// selection, also delete its content.
-function splitBlock(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var $to = ref.$to;
-  if (state.selection instanceof dist$2.NodeSelection && state.selection.node.isBlock) {
-    if (!$from.parentOffset || !dist$1.canSplit(state.doc, $from.pos)) { return false }
-    if (dispatch) { dispatch(state.tr.split($from.pos).scrollIntoView()); }
-    return true
-  }
-
-  if (!$from.parent.isBlock) { return false }
-
-  if (dispatch) {
-    var atEnd = $to.parentOffset == $to.parent.content.size;
-    var tr = state.tr;
-    if (state.selection instanceof dist$2.TextSelection) { tr.deleteSelection(); }
-    var deflt = $from.depth == 0 ? null : $from.node(-1).contentMatchAt($from.indexAfter(-1)).defaultType;
-    var types = atEnd && deflt ? [{type: deflt}] : null;
-    var can = dist$1.canSplit(tr.doc, $from.pos, 1, types);
-    if (!types && !can && dist$1.canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt && [{type: deflt}])) {
-      types = [{type: deflt}];
-      can = true;
-    }
-    if (can) {
-      tr.split(tr.mapping.map($from.pos), 1, types);
-      if (!atEnd && !$from.parentOffset && $from.parent.type != deflt &&
-          $from.node(-1).canReplace($from.index(-1), $from.indexAfter(-1), dist.Fragment.from(deflt.create(), $from.parent)))
-        { tr.setNodeMarkup(tr.mapping.map($from.before()), deflt); }
-    }
-    dispatch(tr.scrollIntoView());
-  }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Acts like [`splitBlock`](#commands.splitBlock), but without
-// resetting the set of active marks at the cursor.
-function splitBlockKeepMarks(state, dispatch) {
-  return splitBlock(state, dispatch && (function (tr) {
-    var marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());
-    if (marks) { tr.ensureMarks(marks); }
-    dispatch(tr);
-  }))
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Move the selection to the node wrapping the current selection, if
-// any. (Will not select the document node.)
-function selectParentNode(state, dispatch) {
-  var ref = state.selection;
-  var $from = ref.$from;
-  var to = ref.to;
-  var pos;
-  var same = $from.sharedDepth(to);
-  if (same == 0) { return false }
-  pos = $from.before(same);
-  if (dispatch) { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, pos))); }
-  return true
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Select the whole document.
-function selectAll(state, dispatch) {
-  if (dispatch) { dispatch(state.tr.setSelection(new dist$2.AllSelection(state.doc))); }
-  return true
-}
-
-function joinMaybeClear(state, $pos, dispatch) {
-  var before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();
-  if (!before || !after || !before.type.compatibleContent(after.type)) { return false }
-  if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {
-    if (dispatch) { dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView()); }
-    return true
-  }
-  if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || dist$1.canJoin(state.doc, $pos.pos)))
-    { return false }
-  if (dispatch)
-    { dispatch(state.tr
-             .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))
-             .join($pos.pos)
-             .scrollIntoView()); }
-  return true
-}
-
-function deleteBarrier(state, $cut, dispatch) {
-  var before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;
-  if (before.type.spec.isolating || after.type.spec.isolating) { return false }
-  if (joinMaybeClear(state, $cut, dispatch)) { return true }
-
-  if ($cut.parent.canReplace($cut.index(), $cut.index() + 1) &&
-      (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&
-      match.matchType(conn[0] || after.type).validEnd) {
-    if (dispatch) {
-      var end = $cut.pos + after.nodeSize, wrap = dist.Fragment.empty;
-      for (var i = conn.length - 1; i >= 0; i--)
-        { wrap = dist.Fragment.from(conn[i].create(null, wrap)); }
-      wrap = dist.Fragment.from(before.copy(wrap));
-      var tr = state.tr.step(new dist$1.ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new dist.Slice(wrap, 1, 0), conn.length, true));
-      var joinAt = end + 2 * conn.length;
-      if (dist$1.canJoin(tr.doc, joinAt)) { tr.join(joinAt); }
-      dispatch(tr.scrollIntoView());
-    }
-    return true
-  }
-
-  var selAfter = dist$2.Selection.findFrom($cut, 1);
-  var range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && dist$1.liftTarget(range);
-  if (target != null && target >= $cut.depth) {
-    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-    return true
-  }
-
-  return false
-}
-
-// Parameterized commands
-
-// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Wrap the selection in a node of the given type with the given
-// attributes.
-function wrapIn(nodeType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to), wrapping = range && dist$1.findWrapping(range, nodeType, attrs);
-    if (!wrapping) { return false }
-    if (dispatch) { dispatch(state.tr.wrap(range, wrapping).scrollIntoView()); }
-    return true
-  }
-}
-
-// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command that tries to set the selected textblocks to the
-// given node type with the given attributes.
-function setBlockType(nodeType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var from = ref.from;
-    var to = ref.to;
-    var applicable = false;
-    state.doc.nodesBetween(from, to, function (node, pos) {
-      if (applicable) { return false }
-      if (!node.isTextblock || node.hasMarkup(nodeType, attrs)) { return }
-      if (node.type == nodeType) {
-        applicable = true;
-      } else {
-        var $pos = state.doc.resolve(pos), index = $pos.index();
-        applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);
-      }
-    });
-    if (!applicable) { return false }
-    if (dispatch) { dispatch(state.tr.setBlockType(from, to, nodeType, attrs).scrollIntoView()); }
-    return true
-  }
-}
-
-function markApplies(doc, ranges, type) {
-  var loop = function ( i ) {
-    var ref = ranges[i];
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var can = $from.depth == 0 ? doc.type.allowsMarkType(type) : false;
-    doc.nodesBetween($from.pos, $to.pos, function (node) {
-      if (can) { return false }
-      can = node.inlineContent && node.type.allowsMarkType(type);
-    });
-    if (can) { return { v: true } }
-  };
-
-  for (var i = 0; i < ranges.length; i++) {
-    var returned = loop( i );
-
-    if ( returned ) { return returned.v; }
-  }
-  return false
-}
-
-// :: (MarkType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Create a command function that toggles the given mark with the
-// given attributes. Will return `false` when the current selection
-// doesn't support that mark. This will remove the mark if any marks
-// of that type exist in the selection, or add it otherwise. If the
-// selection is empty, this applies to the [stored
-// marks](#state.EditorState.storedMarks) instead of a range of the
-// document.
-function toggleMark(markType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var empty = ref.empty;
-    var $cursor = ref.$cursor;
-    var ranges = ref.ranges;
-    if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType)) { return false }
-    if (dispatch) {
-      if ($cursor) {
-        if (markType.isInSet(state.storedMarks || $cursor.marks()))
-          { dispatch(state.tr.removeStoredMark(markType)); }
-        else
-          { dispatch(state.tr.addStoredMark(markType.create(attrs))); }
-      } else {
-        var has = false, tr = state.tr;
-        for (var i = 0; !has && i < ranges.length; i++) {
-          var ref$1 = ranges[i];
-          var $from = ref$1.$from;
-          var $to = ref$1.$to;
-          has = state.doc.rangeHasMark($from.pos, $to.pos, markType);
-        }
-        for (var i$1 = 0; i$1 < ranges.length; i$1++) {
-          var ref$2 = ranges[i$1];
-          var $from$1 = ref$2.$from;
-          var $to$1 = ref$2.$to;
-          if (has) { tr.removeMark($from$1.pos, $to$1.pos, markType); }
-          else { tr.addMark($from$1.pos, $to$1.pos, markType.create(attrs)); }
-        }
-        dispatch(tr.scrollIntoView());
-      }
-    }
-    return true
-  }
-}
-
-function wrapDispatchForJoin(dispatch, isJoinable) {
-  return function (tr) {
-    if (!tr.isGeneric) { return dispatch(tr) }
-
-    var ranges = [];
-    for (var i = 0; i < tr.mapping.maps.length; i++) {
-      var map = tr.mapping.maps[i];
-      for (var j = 0; j < ranges.length; j++)
-        { ranges[j] = map.map(ranges[j]); }
-      map.forEach(function (_s, _e, from, to) { return ranges.push(from, to); });
-    }
-
-    // Figure out which joinable points exist inside those ranges,
-    // by checking all node boundaries in their parent nodes.
-    var joinable = [];
-    for (var i$1 = 0; i$1 < ranges.length; i$1 += 2) {
-      var from = ranges[i$1], to = ranges[i$1 + 1];
-      var $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);
-      for (var index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {
-        var after = parent.maybeChild(index);
-        if (!after) { break }
-        if (index && joinable.indexOf(pos) == -1) {
-          var before = parent.child(index - 1);
-          if (before.type == after.type && isJoinable(before, after))
-            { joinable.push(pos); }
-        }
-        pos += after.nodeSize;
-      }
-    }
-    // Join the joinable points
-    joinable.sort(function (a, b) { return a - b; });
-    for (var i$2 = joinable.length - 1; i$2 >= 0; i$2--) {
-      if (dist$1.canJoin(tr.doc, joinable[i$2])) { tr.join(joinable[i$2]); }
-    }
-    dispatch(tr);
-  }
-}
-
-// :: ((state: EditorState, ?(tr: Transaction)) → bool, union<(before: Node, after: Node) → bool, [string]>) → (state: EditorState, ?(tr: Transaction)) → bool
-// Wrap a command so that, when it produces a transform that causes
-// two joinable nodes to end up next to each other, those are joined.
-// Nodes are considered joinable when they are of the same type and
-// when the `isJoinable` predicate returns true for them or, if an
-// array of strings was passed, if their node type name is in that
-// array.
-function autoJoin(command, isJoinable) {
-  if (Array.isArray(isJoinable)) {
-    var types = isJoinable;
-    isJoinable = function (node) { return types.indexOf(node.type.name) > -1; };
-  }
-  return function (state, dispatch) { return command(state, dispatch && wrapDispatchForJoin(dispatch, isJoinable)); }
-}
-
-// :: (...[(EditorState, ?(tr: Transaction), ?EditorView) → bool]) → (EditorState, ?(tr: Transaction), ?EditorView) → bool
-// Combine a number of command functions into a single function (which
-// calls them one by one until one returns true).
-function chainCommands() {
-  var arguments$1 = arguments;
-
-  var commands = [], len = arguments.length;
-  while ( len-- ) { commands[ len ] = arguments$1[ len ]; }
-
-  return function(state, dispatch, view) {
-    for (var i = 0; i < commands.length; i++)
-      { if (commands[i](state, dispatch, view)) { return true } }
-    return false
-  }
-}
-
-var backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);
-var del = chainCommands(deleteSelection, joinForward, selectNodeForward);
-
-// :: Object
-// A basic keymap containing bindings not specific to any schema.
-// Binds the following keys (when multiple commands are listed, they
-// are chained with [`chainCommands`](#commands.chainCommands)):
-//
-// * **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`
-// * **Mod-Enter** to `exitCode`
-// * **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`
-// * **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
-// * **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
-// * **Mod-a** to `selectAll`
-var pcBaseKeymap = {
-  "Enter": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),
-  "Mod-Enter": exitCode,
-  "Backspace": backspace,
-  "Mod-Backspace": backspace,
-  "Delete": del,
-  "Mod-Delete": del,
-  "Mod-a": selectAll
-};
-
-// :: Object
-// A copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,
-// **Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and
-// **Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like
-// Ctrl-Delete.
-var macBaseKeymap = {
-  "Ctrl-h": pcBaseKeymap["Backspace"],
-  "Alt-Backspace": pcBaseKeymap["Mod-Backspace"],
-  "Ctrl-d": pcBaseKeymap["Delete"],
-  "Ctrl-Alt-Backspace": pcBaseKeymap["Mod-Delete"],
-  "Alt-Delete": pcBaseKeymap["Mod-Delete"],
-  "Alt-d": pcBaseKeymap["Mod-Delete"]
-};
-for (var key in pcBaseKeymap) { macBaseKeymap[key] = pcBaseKeymap[key]; }
-
-// declare global: os, navigator
-var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform)
-          : typeof os != "undefined" ? os.platform() == "darwin" : false;
-
-// :: Object
-// Depending on the detected platform, this will hold
-// [`pcBasekeymap`](#commands.pcBaseKeymap) or
-// [`macBaseKeymap`](#commands.macBaseKeymap).
-var baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;
-
-exports.deleteSelection = deleteSelection;
-exports.joinBackward = joinBackward;
-exports.selectNodeBackward = selectNodeBackward;
-exports.joinForward = joinForward;
-exports.selectNodeForward = selectNodeForward;
-exports.joinUp = joinUp;
-exports.joinDown = joinDown;
-exports.lift = lift;
-exports.newlineInCode = newlineInCode;
-exports.exitCode = exitCode;
-exports.createParagraphNear = createParagraphNear;
-exports.liftEmptyBlock = liftEmptyBlock;
-exports.splitBlock = splitBlock;
-exports.splitBlockKeepMarks = splitBlockKeepMarks;
-exports.selectParentNode = selectParentNode;
-exports.selectAll = selectAll;
-exports.wrapIn = wrapIn;
-exports.setBlockType = setBlockType;
-exports.toggleMark = toggleMark;
-exports.autoJoin = autoJoin;
-exports.chainCommands = chainCommands;
-exports.pcBaseKeymap = pcBaseKeymap;
-exports.macBaseKeymap = macBaseKeymap;
-exports.baseKeymap = baseKeymap;
-
-});
-
-unwrapExports(commands);
-var commands_1 = commands.deleteSelection;
-var commands_2 = commands.joinBackward;
-var commands_3 = commands.selectNodeBackward;
-var commands_4 = commands.joinForward;
-var commands_5 = commands.selectNodeForward;
-var commands_6 = commands.joinUp;
-var commands_7 = commands.joinDown;
-var commands_8 = commands.lift;
-var commands_9 = commands.newlineInCode;
-var commands_10 = commands.exitCode;
-var commands_11 = commands.createParagraphNear;
-var commands_12 = commands.liftEmptyBlock;
-var commands_13 = commands.splitBlock;
-var commands_14 = commands.splitBlockKeepMarks;
-var commands_15 = commands.selectParentNode;
-var commands_16 = commands.selectAll;
-var commands_17 = commands.wrapIn;
-var commands_18 = commands.setBlockType;
-var commands_19 = commands.toggleMark;
-var commands_20 = commands.autoJoin;
-var commands_21 = commands.chainCommands;
-var commands_22 = commands.pcBaseKeymap;
-var commands_23 = commands.macBaseKeymap;
-var commands_24 = commands.baseKeymap;
-
-var dist$6 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-// ::- Input rules are regular expressions describing a piece of text
-// that, when typed, causes something to happen. This might be
-// changing two dashes into an emdash, wrapping a paragraph starting
-// with `"> "` into a blockquote, or something entirely different.
-var InputRule = function InputRule(match, handler) {
-  this.match = match;
-  this.handler = typeof handler == "string" ? stringHandler(handler) : handler;
-};
-
-function stringHandler(string) {
-  return function(state, match, start, end) {
-    var insert = string;
-    if (match[1]) {
-      var offset = match[0].lastIndexOf(match[1]);
-      insert += match[0].slice(offset + match[1].length);
-      start += offset;
-      var cutOff = start - end;
-      if (cutOff > 0) {
-        insert = match[0].slice(offset - cutOff, offset) + insert;
-        start = end;
-      }
-    }
-    var marks = state.doc.resolve(start).marks();
-    return state.tr.replaceWith(start, end, state.schema.text(insert, marks))
-  }
-}
-
-var MAX_MATCH = 500;
-
-// :: (config: {rules: [InputRule]}) → Plugin
-// Create an input rules plugin. When enabled, it will cause text
-// input that matches any of the given rules to trigger the rule's
-// action.
-function inputRules(ref) {
-  var rules = ref.rules;
-
-  return new dist$2.Plugin({
-    state: {
-      init: function init() { return null },
-      apply: function apply(tr, prev) {
-        var stored = tr.getMeta(this);
-        if (stored) { return stored }
-        return tr.selectionSet || tr.docChanged ? null : prev
-      }
-    },
-
-    props: {
-      handleTextInput: function handleTextInput(view, from, to, text) {
-        var this$1 = this;
-
-        var state = view.state, $from = state.doc.resolve(from);
-        if ($from.parent.type.spec.code) { return false }
-        var textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset,
-                                                  null, "\ufffc") + text;
-        for (var i = 0; i < rules.length; i++) {
-          var match = rules[i].match.exec(textBefore);
-          var tr = match && rules[i].handler(state, match, from - (match[0].length - text.length), to);
-          if (!tr) { continue }
-          view.dispatch(tr.setMeta(this$1, {transform: tr, from: from, to: to, text: text}));
-          return true
-        }
-        return false
-      }
-    },
-
-    isInputRules: true
-  })
-}
-
-// :: (EditorState, ?(Transaction)) → bool
-// This is a command that will undo an input rule, if applying such a
-// rule was the last thing that the user did.
-function undoInputRule(state, dispatch) {
-  var plugins = state.plugins;
-  for (var i = 0; i < plugins.length; i++) {
-    var plugin = plugins[i], undoable = (void 0);
-    if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {
-      if (dispatch) {
-        var tr = state.tr, toUndo = undoable.transform;
-        for (var j = toUndo.steps.length - 1; j >= 0; j--)
-          { tr.step(toUndo.steps[j].invert(toUndo.docs[j])); }
-        var marks = tr.doc.resolve(undoable.from).marks();
-        dispatch(tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks)));
-      }
-      return true
-    }
-  }
-  return false
-}
-
-// :: InputRule Converts double dashes to an emdash.
-var emDash = new InputRule(/--$/, "—");
-// :: InputRule Converts three dots to an ellipsis character.
-var ellipsis = new InputRule(/\.\.\.$/, "…");
-// :: InputRule “Smart” opening double quotes.
-var openDoubleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(")$/, "“");
-// :: InputRule “Smart” closing double quotes.
-var closeDoubleQuote = new InputRule(/"$/, "”");
-// :: InputRule “Smart” opening single quotes.
-var openSingleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(')$/, "‘");
-// :: InputRule “Smart” closing single quotes.
-var closeSingleQuote = new InputRule(/'$/, "’");
-
-// :: [InputRule] Smart-quote related input rules.
-var smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];
-
-// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>, ?([string], Node) → bool) → InputRule
-// Build an input rule for automatically wrapping a textblock when a
-// given string is typed. The `regexp` argument is
-// directly passed through to the `InputRule` constructor. You'll
-// probably want the regexp to start with `^`, so that the pattern can
-// only occur at the start of a textblock.
-//
-// `nodeType` is the type of node to wrap in. If it needs attributes,
-// you can either pass them directly, or pass a function that will
-// compute them from the regular expression match.
-//
-// By default, if there's a node with the same type above the newly
-// wrapped node, the rule will try to [join](#transform.Transform.join) those
-// two nodes. You can pass a join predicate, which takes a regular
-// expression match and the node before the wrapped node, and can
-// return a boolean to indicate whether a join should happen.
-function wrappingInputRule(regexp, nodeType, getAttrs, joinPredicate) {
-  return new InputRule(regexp, function (state, match, start, end) {
-    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
-    var tr = state.tr.delete(start, end);
-    var $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && dist$1.findWrapping(range, nodeType, attrs);
-    if (!wrapping) { return null }
-    tr.wrap(range, wrapping);
-    var before = tr.doc.resolve(start - 1).nodeBefore;
-    if (before && before.type == nodeType && dist$1.canJoin(tr.doc, start - 1) &&
-        (!joinPredicate || joinPredicate(match, before)))
-      { tr.join(start - 1); }
-    return tr
-  })
-}
-
-// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>) → InputRule
-// Build an input rule that changes the type of a textblock when the
-// matched text is typed into it. You'll usually want to start your
-// regexp with `^` to that it is only matched at the start of a
-// textblock. The optional `getAttrs` parameter can be used to compute
-// the new node's attributes, and works the same as in the
-// `wrappingInputRule` function.
-function textblockTypeInputRule(regexp, nodeType, getAttrs) {
-  return new InputRule(regexp, function (state, match, start, end) {
-    var $start = state.doc.resolve(start);
-    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
-    if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType)) { return null }
-    return state.tr
-      .delete(start, end)
-      .setBlockType(start, start, nodeType, attrs)
-  })
-}
-
-exports.InputRule = InputRule;
-exports.inputRules = inputRules;
-exports.undoInputRule = undoInputRule;
-exports.emDash = emDash;
-exports.ellipsis = ellipsis;
-exports.openDoubleQuote = openDoubleQuote;
-exports.closeDoubleQuote = closeDoubleQuote;
-exports.openSingleQuote = openSingleQuote;
-exports.closeSingleQuote = closeSingleQuote;
-exports.smartQuotes = smartQuotes;
-exports.wrappingInputRule = wrappingInputRule;
-exports.textblockTypeInputRule = textblockTypeInputRule;
-
-});
-
-unwrapExports(dist$6);
-var dist_1$5 = dist$6.InputRule;
-var dist_2$5 = dist$6.inputRules;
-var dist_3$4 = dist$6.undoInputRule;
-var dist_4$4 = dist$6.emDash;
-var dist_5$4 = dist$6.ellipsis;
-var dist_6$3 = dist$6.openDoubleQuote;
-var dist_7$3 = dist$6.closeDoubleQuote;
-var dist_8$3 = dist$6.openSingleQuote;
-var dist_9$3 = dist$6.closeSingleQuote;
-var dist_10$2 = dist$6.smartQuotes;
-var dist_11$2 = dist$6.wrappingInputRule;
-var dist_12$2 = dist$6.textblockTypeInputRule;
-
-function buildMenuActions (ref) {
-	var schema = ref.schema;
-	var state = ref.state;
-	var commands = ref.commands;
-
-
-	var nodes = Object.entries(schema.nodes)
-		.map(function (ref) {
-			var name = ref[0];
-
-			var active = function (attrs) {
-				if ( attrs === void 0 ) attrs = {};
-
-				return nodeIsActive(state, schema.nodes[name], attrs);
-			};
-			var command = commands[name] ? commands[name] : function () {};
-			return { name: name, active: active, command: command }
-		})
-		.reduce(function (actions, ref) {
-			var obj;
-
-			var name = ref.name;
-			var active = ref.active;
-			var command = ref.command;
-			return Object.assign({}, actions, ( obj = {}, obj[name] = {
-				active: active,
-				command: command,
-			}, obj ));
-	}, {});
-		// .reduce((actions, { name, active, command }) => ({
-		// 	...actions,
-		// 	[name]: {
-		// 		active,
-		// 		command,
-		// 	},
-		// }), {})
-
-	var marks = Object.entries(schema.marks)
-		.map(function (ref) {
-			var name = ref[0];
-
-			var active = function () { return markIsActive(state, schema.marks[name]); };
-			var attrs = getMarkAttrs(state, schema.marks[name]);
-			var command = commands[name] ? commands[name] : function () {};
-			return {
-				name: name,
-				active: active,
-				attrs: attrs,
-				command: command,
-			}
-		})
-		.reduce(function (actions, ref) {
-			var obj;
-
-			var name = ref.name;
-			var active = ref.active;
-			var attrs = ref.attrs;
-			var command = ref.command;
-			return Object.assign({}, actions, ( obj = {}, obj[name] = {
-				active: active,
-				attrs: attrs,
-				command: command,
-			}, obj ));
-	}, {});
-		// .reduce((actions, { name, active, attrs, command }) => ({
-		// 	...actions,
-		// 	[name]: {
-		// 		active,
-		// 		attrs,
-		// 		command,
-		// 	},
-		// }), {})
-
-	return {
-		nodes: nodes,
-		marks: marks,
-	}
-
-}
-
-var keymap$$1 = {
-	'Mod-z': history_5,
-	'Shift-Mod-z': history_5,
-	'Mod-BracketLeft': commands_8,
-	Backspace: dist_3$4,
-	Escape: commands_15,
-};
-
-if (!isMac) {
-	keymap$$1['Mod-y'] = history_6;
-}
-
-/*!
- * Vue.js v2.5.17
- * (c) 2014-2018 Evan You
- * Released under the MIT License.
- */
-/*  */
-
-var emptyObject = Object.freeze({});
-
-// these helpers produces better vm code in JS engines due to their
-// explicitness and function inlining
-function isUndef (v) {
-  return v === undefined || v === null
-}
-
-function isDef (v) {
-  return v !== undefined && v !== null
-}
-
-function isTrue (v) {
-  return v === true
-}
-
-function isFalse (v) {
-  return v === false
-}
-
-/**
- * Check if value is primitive
- */
-function isPrimitive (value) {
-  return (
-    typeof value === 'string' ||
-    typeof value === 'number' ||
-    // $flow-disable-line
-    typeof value === 'symbol' ||
-    typeof value === 'boolean'
-  )
-}
-
-/**
- * Quick object check - this is primarily used to tell
- * Objects from primitive values when we know the value
- * is a JSON-compliant type.
- */
-function isObject (obj) {
-  return obj !== null && typeof obj === 'object'
-}
-
-/**
- * Get the raw type string of a value e.g. [object Object]
- */
-var _toString = Object.prototype.toString;
-
-function toRawType (value) {
-  return _toString.call(value).slice(8, -1)
-}
-
-/**
- * Strict object type check. Only returns true
- * for plain JavaScript objects.
- */
-function isPlainObject (obj) {
-  return _toString.call(obj) === '[object Object]'
-}
-
-function isRegExp (v) {
-  return _toString.call(v) === '[object RegExp]'
-}
-
-/**
- * Check if val is a valid array index.
- */
-function isValidArrayIndex (val) {
-  var n = parseFloat(String(val));
-  return n >= 0 && Math.floor(n) === n && isFinite(val)
-}
-
-/**
- * Convert a value to a string that is actually rendered.
- */
-function toString (val) {
-  return val == null
-    ? ''
-    : typeof val === 'object'
-      ? JSON.stringify(val, null, 2)
-      : String(val)
-}
-
-/**
- * Convert a input value to a number for persistence.
- * If the conversion fails, return original string.
- */
-function toNumber (val) {
-  var n = parseFloat(val);
-  return isNaN(n) ? val : n
-}
-
-/**
- * Make a map and return a function for checking if a key
- * is in that map.
- */
-function makeMap (
-  str,
-  expectsLowerCase
-) {
-  var map = Object.create(null);
-  var list = str.split(',');
-  for (var i = 0; i < list.length; i++) {
-    map[list[i]] = true;
-  }
-  return expectsLowerCase
-    ? function (val) { return map[val.toLowerCase()]; }
-    : function (val) { return map[val]; }
-}
-
-/**
- * Check if a tag is a built-in tag.
- */
-var isBuiltInTag = makeMap('slot,component', true);
-
-/**
- * Check if a attribute is a reserved attribute.
- */
-var isReservedAttribute = makeMap('key,ref,slot,slot-scope,is');
-
-/**
- * Remove an item from an array
- */
-function remove (arr, item) {
-  if (arr.length) {
-    var index = arr.indexOf(item);
-    if (index > -1) {
-      return arr.splice(index, 1)
-    }
-  }
-}
-
-/**
- * Check whether the object has the property.
- */
-var hasOwnProperty = Object.prototype.hasOwnProperty;
-function hasOwn (obj, key) {
-  return hasOwnProperty.call(obj, key)
-}
-
-/**
- * Create a cached version of a pure function.
- */
-function cached (fn) {
-  var cache = Object.create(null);
-  return (function cachedFn (str) {
-    var hit = cache[str];
-    return hit || (cache[str] = fn(str))
-  })
-}
-
-/**
- * Camelize a hyphen-delimited string.
- */
-var camelizeRE = /-(\w)/g;
-var camelize = cached(function (str) {
-  return str.replace(camelizeRE, function (_, c) { return c ? c.toUpperCase() : ''; })
-});
-
-/**
- * Capitalize a string.
- */
-var capitalize = cached(function (str) {
-  return str.charAt(0).toUpperCase() + str.slice(1)
-});
-
-/**
- * Hyphenate a camelCase string.
- */
-var hyphenateRE = /\B([A-Z])/g;
-var hyphenate = cached(function (str) {
-  return str.replace(hyphenateRE, '-$1').toLowerCase()
-});
-
-/**
- * Simple bind polyfill for environments that do not support it... e.g.
- * PhantomJS 1.x. Technically we don't need this anymore since native bind is
- * now more performant in most browsers, but removing it would be breaking for
- * code that was able to run in PhantomJS 1.x, so this must be kept for
- * backwards compatibility.
- */
-
-/* istanbul ignore next */
-function polyfillBind (fn, ctx) {
-  function boundFn (a) {
-    var l = arguments.length;
-    return l
-      ? l > 1
-        ? fn.apply(ctx, arguments)
-        : fn.call(ctx, a)
-      : fn.call(ctx)
-  }
-
-  boundFn._length = fn.length;
-  return boundFn
-}
-
-function nativeBind (fn, ctx) {
-  return fn.bind(ctx)
-}
-
-var bind = Function.prototype.bind
-  ? nativeBind
-  : polyfillBind;
-
-/**
- * Convert an Array-like object to a real Array.
- */
-function toArray (list, start) {
-  start = start || 0;
-  var i = list.length - start;
-  var ret = new Array(i);
-  while (i--) {
-    ret[i] = list[i + start];
-  }
-  return ret
-}
-
-/**
- * Mix properties into target object.
- */
-function extend (to, _from) {
-  for (var key in _from) {
-    to[key] = _from[key];
-  }
-  return to
-}
-
-/**
- * Merge an Array of Objects into a single Object.
- */
-function toObject (arr) {
-  var res = {};
-  for (var i = 0; i < arr.length; i++) {
-    if (arr[i]) {
-      extend(res, arr[i]);
-    }
-  }
-  return res
-}
-
-/**
- * Perform no operation.
- * Stubbing args to make Flow happy without leaving useless transpiled code
- * with ...rest (https://flow.org/blog/2017/05/07/Strict-Function-Call-Arity/)
- */
-function noop (a, b, c) {}
-
-/**
- * Always return false.
- */
-var no = function (a, b, c) { return false; };
-
-/**
- * Return same value
- */
-var identity = function (_) { return _; };
-
-/**
- * Generate a static keys string from compiler modules.
- */
-
-
-/**
- * Check if two values are loosely equal - that is,
- * if they are plain objects, do they have the same shape?
- */
-function looseEqual (a, b) {
-  if (a === b) { return true }
-  var isObjectA = isObject(a);
-  var isObjectB = isObject(b);
-  if (isObjectA && isObjectB) {
-    try {
-      var isArrayA = Array.isArray(a);
-      var isArrayB = Array.isArray(b);
-      if (isArrayA && isArrayB) {
-        return a.length === b.length && a.every(function (e, i) {
-          return looseEqual(e, b[i])
-        })
-      } else if (!isArrayA && !isArrayB) {
-        var keysA = Object.keys(a);
-        var keysB = Object.keys(b);
-        return keysA.length === keysB.length && keysA.every(function (key) {
-          return looseEqual(a[key], b[key])
-        })
-      } else {
-        /* istanbul ignore next */
-        return false
-      }
-    } catch (e) {
-      /* istanbul ignore next */
-      return false
-    }
-  } else if (!isObjectA && !isObjectB) {
-    return String(a) === String(b)
-  } else {
-    return false
-  }
-}
-
-function looseIndexOf (arr, val) {
-  for (var i = 0; i < arr.length; i++) {
-    if (looseEqual(arr[i], val)) { return i }
-  }
-  return -1
-}
-
-/**
- * Ensure a function is called only once.
- */
-function once (fn) {
-  var called = false;
-  return function () {
-    if (!called) {
-      called = true;
-      fn.apply(this, arguments);
-    }
-  }
-}
-
-var SSR_ATTR = 'data-server-rendered';
-
-var ASSET_TYPES = [
-  'component',
-  'directive',
-  'filter'
-];
-
-var LIFECYCLE_HOOKS = [
-  'beforeCreate',
-  'created',
-  'beforeMount',
-  'mounted',
-  'beforeUpdate',
-  'updated',
-  'beforeDestroy',
-  'destroyed',
-  'activated',
-  'deactivated',
-  'errorCaptured'
-];
-
-/*  */
-
-var config = ({
-  /**
-   * Option merge strategies (used in core/util/options)
-   */
-  // $flow-disable-line
-  optionMergeStrategies: Object.create(null),
-
-  /**
-   * Whether to suppress warnings.
-   */
-  silent: false,
-
-  /**
-   * Show production mode tip message on boot?
-   */
-  productionTip: process.env.NODE_ENV !== 'production',
-
-  /**
-   * Whether to enable devtools
-   */
-  devtools: process.env.NODE_ENV !== 'production',
-
-  /**
-   * Whether to record perf
-   */
-  performance: false,
-
-  /**
-   * Error handler for watcher errors
-   */
-  errorHandler: null,
-
-  /**
-   * Warn handler for watcher warns
-   */
-  warnHandler: null,
-
-  /**
-   * Ignore certain custom elements
-   */
-  ignoredElements: [],
-
-  /**
-   * Custom user key aliases for v-on
-   */
-  // $flow-disable-line
-  keyCodes: Object.create(null),
-
-  /**
-   * Check if a tag is reserved so that it cannot be registered as a
-   * component. This is platform-dependent and may be overwritten.
-   */
-  isReservedTag: no,
-
-  /**
-   * Check if an attribute is reserved so that it cannot be used as a component
-   * prop. This is platform-dependent and may be overwritten.
-   */
-  isReservedAttr: no,
-
-  /**
-   * Check if a tag is an unknown element.
-   * Platform-dependent.
-   */
-  isUnknownElement: no,
-
-  /**
-   * Get the namespace of an element
-   */
-  getTagNamespace: noop,
-
-  /**
-   * Parse the real tag name for the specific platform.
-   */
-  parsePlatformTagName: identity,
-
-  /**
-   * Check if an attribute must be bound using property, e.g. value
-   * Platform-dependent.
-   */
-  mustUseProp: no,
-
-  /**
-   * Exposed for legacy reasons
-   */
-  _lifecycleHooks: LIFECYCLE_HOOKS
-});
-
-/*  */
-
-/**
- * Check if a string starts with $ or _
- */
-function isReserved (str) {
-  var c = (str + '').charCodeAt(0);
-  return c === 0x24 || c === 0x5F
-}
-
-/**
- * Define a property.
- */
-function def (obj, key, val, enumerable) {
-  Object.defineProperty(obj, key, {
-    value: val,
-    enumerable: !!enumerable,
-    writable: true,
-    configurable: true
-  });
-}
-
-/**
- * Parse simple path.
- */
-var bailRE = /[^\w.$]/;
-function parsePath (path) {
-  if (bailRE.test(path)) {
-    return
-  }
-  var segments = path.split('.');
-  return function (obj) {
-    for (var i = 0; i < segments.length; i++) {
-      if (!obj) { return }
-      obj = obj[segments[i]];
-    }
-    return obj
-  }
-}
-
-/*  */
-
-// can we use __proto__?
-var hasProto = '__proto__' in {};
-
-// Browser environment sniffing
-var inBrowser = typeof window !== 'undefined';
-var inWeex = typeof WXEnvironment !== 'undefined' && !!WXEnvironment.platform;
-var weexPlatform = inWeex && WXEnvironment.platform.toLowerCase();
-var UA = inBrowser && window.navigator.userAgent.toLowerCase();
-var isIE = UA && /msie|trident/.test(UA);
-var isIE9 = UA && UA.indexOf('msie 9.0') > 0;
-var isEdge = UA && UA.indexOf('edge/') > 0;
-var isAndroid = (UA && UA.indexOf('android') > 0) || (weexPlatform === 'android');
-var isIOS = (UA && /iphone|ipad|ipod|ios/.test(UA)) || (weexPlatform === 'ios');
-var isChrome = UA && /chrome\/\d+/.test(UA) && !isEdge;
-
-// Firefox has a "watch" function on Object.prototype...
-var nativeWatch = ({}).watch;
-
-var supportsPassive = false;
-if (inBrowser) {
-  try {
-    var opts = {};
-    Object.defineProperty(opts, 'passive', ({
-      get: function get () {
-        /* istanbul ignore next */
-        supportsPassive = true;
-      }
-    })); // https://github.com/facebook/flow/issues/285
-    window.addEventListener('test-passive', null, opts);
-  } catch (e) {}
-}
-
-// this needs to be lazy-evaled because vue may be required before
-// vue-server-renderer can set VUE_ENV
-var _isServer;
-var isServerRendering = function () {
-  if (_isServer === undefined) {
-    /* istanbul ignore if */
-    if (!inBrowser && !inWeex && typeof global !== 'undefined') {
-      // detect presence of vue-server-renderer and avoid
-      // Webpack shimming the process
-      _isServer = global['process'].env.VUE_ENV === 'server';
-    } else {
-      _isServer = false;
-    }
-  }
-  return _isServer
-};
-
-// detect devtools
-var devtools = inBrowser && window.__VUE_DEVTOOLS_GLOBAL_HOOK__;
-
-/* istanbul ignore next */
-function isNative (Ctor) {
-  return typeof Ctor === 'function' && /native code/.test(Ctor.toString())
-}
-
-var hasSymbol =
-  typeof Symbol !== 'undefined' && isNative(Symbol) &&
-  typeof Reflect !== 'undefined' && isNative(Reflect.ownKeys);
-
-var _Set;
-/* istanbul ignore if */ // $flow-disable-line
-if (typeof Set !== 'undefined' && isNative(Set)) {
-  // use native Set when available.
-  _Set = Set;
-} else {
-  // a non-standard Set polyfill that only works with primitive keys.
-  _Set = (function () {
-    function Set () {
-      this.set = Object.create(null);
-    }
-    Set.prototype.has = function has (key) {
-      return this.set[key] === true
-    };
-    Set.prototype.add = function add (key) {
-      this.set[key] = true;
-    };
-    Set.prototype.clear = function clear () {
-      this.set = Object.create(null);
-    };
-
-    return Set;
-  }());
-}
-
-/*  */
-
-var warn = noop;
-var tip = noop;
-var generateComponentTrace = (noop); // work around flow check
-var formatComponentName = (noop);
-
-if (process.env.NODE_ENV !== 'production') {
-  var hasConsole = typeof console !== 'undefined';
-  var classifyRE = /(?:^|[-_])(\w)/g;
-  var classify = function (str) { return str
-    .replace(classifyRE, function (c) { return c.toUpperCase(); })
-    .replace(/[-_]/g, ''); };
-
-  warn = function (msg, vm) {
-    var trace = vm ? generateComponentTrace(vm) : '';
-
-    if (config.warnHandler) {
-      config.warnHandler.call(null, msg, vm, trace);
-    } else if (hasConsole && (!config.silent)) {
-      console.error(("[Vue warn]: " + msg + trace));
-    }
-  };
-
-  tip = function (msg, vm) {
-    if (hasConsole && (!config.silent)) {
-      console.warn("[Vue tip]: " + msg + (
-        vm ? generateComponentTrace(vm) : ''
-      ));
-    }
-  };
-
-  formatComponentName = function (vm, includeFile) {
-    if (vm.$root === vm) {
-      return '<Root>'
-    }
-    var options = typeof vm === 'function' && vm.cid != null
-      ? vm.options
-      : vm._isVue
-        ? vm.$options || vm.constructor.options
-        : vm || {};
-    var name = options.name || options._componentTag;
-    var file = options.__file;
-    if (!name && file) {
-      var match = file.match(/([^/\\]+)\.vue$/);
-      name = match && match[1];
-    }
-
-    return (
-      (name ? ("<" + (classify(name)) + ">") : "<Anonymous>") +
-      (file && includeFile !== false ? (" at " + file) : '')
-    )
-  };
-
-  var repeat = function (str, n) {
-    var res = '';
-    while (n) {
-      if (n % 2 === 1) { res += str; }
-      if (n > 1) { str += str; }
-      n >>= 1;
-    }
-    return res
-  };
-
-  generateComponentTrace = function (vm) {
-    if (vm._isVue && vm.$parent) {
-      var tree = [];
-      var currentRecursiveSequence = 0;
-      while (vm) {
-        if (tree.length > 0) {
-          var last = tree[tree.length - 1];
-          if (last.constructor === vm.constructor) {
-            currentRecursiveSequence++;
-            vm = vm.$parent;
-            continue
-          } else if (currentRecursiveSequence > 0) {
-            tree[tree.length - 1] = [last, currentRecursiveSequence];
-            currentRecursiveSequence = 0;
-          }
-        }
-        tree.push(vm);
-        vm = vm.$parent;
-      }
-      return '\n\nfound in\n\n' + tree
-        .map(function (vm, i) { return ("" + (i === 0 ? '---> ' : repeat(' ', 5 + i * 2)) + (Array.isArray(vm)
-            ? ((formatComponentName(vm[0])) + "... (" + (vm[1]) + " recursive calls)")
-            : formatComponentName(vm))); })
-        .join('\n')
-    } else {
-      return ("\n\n(found in " + (formatComponentName(vm)) + ")")
-    }
-  };
-}
-
-/*  */
-
-
-var uid = 0;
-
-/**
- * A dep is an observable that can have multiple
- * directives subscribing to it.
- */
-var Dep = function Dep () {
-  this.id = uid++;
-  this.subs = [];
-};
-
-Dep.prototype.addSub = function addSub (sub) {
-  this.subs.push(sub);
-};
-
-Dep.prototype.removeSub = function removeSub (sub) {
-  remove(this.subs, sub);
-};
-
-Dep.prototype.depend = function depend () {
-  if (Dep.target) {
-    Dep.target.addDep(this);
-  }
-};
-
-Dep.prototype.notify = function notify () {
-  // stabilize the subscriber list first
-  var subs = this.subs.slice();
-  for (var i = 0, l = subs.length; i < l; i++) {
-    subs[i].update();
-  }
-};
-
-// the current target watcher being evaluated.
-// this is globally unique because there could be only one
-// watcher being evaluated at any time.
-Dep.target = null;
-var targetStack = [];
-
-function pushTarget (_target) {
-  if (Dep.target) { targetStack.push(Dep.target); }
-  Dep.target = _target;
-}
-
-function popTarget () {
-  Dep.target = targetStack.pop();
-}
-
-/*  */
-
-var VNode = function VNode (
-  tag,
-  data,
-  children,
-  text,
-  elm,
-  context,
-  componentOptions,
-  asyncFactory
-) {
-  this.tag = tag;
-  this.data = data;
-  this.children = children;
-  this.text = text;
-  this.elm = elm;
-  this.ns = undefined;
-  this.context = context;
-  this.fnContext = undefined;
-  this.fnOptions = undefined;
-  this.fnScopeId = undefined;
-  this.key = data && data.key;
-  this.componentOptions = componentOptions;
-  this.componentInstance = undefined;
-  this.parent = undefined;
-  this.raw = false;
-  this.isStatic = false;
-  this.isRootInsert = true;
-  this.isComment = false;
-  this.isCloned = false;
-  this.isOnce = false;
-  this.asyncFactory = asyncFactory;
-  this.asyncMeta = undefined;
-  this.isAsyncPlaceholder = false;
-};
-
-var prototypeAccessors = { child: { configurable: true } };
-
-// DEPRECATED: alias for componentInstance for backwards compat.
-/* istanbul ignore next */
-prototypeAccessors.child.get = function () {
-  return this.componentInstance
-};
-
-Object.defineProperties( VNode.prototype, prototypeAccessors );
-
-var createEmptyVNode = function (text) {
-  if ( text === void 0 ) { text = ''; }
-
-  var node = new VNode();
-  node.text = text;
-  node.isComment = true;
-  return node
-};
-
-function createTextVNode (val) {
-  return new VNode(undefined, undefined, undefined, String(val))
-}
-
-// optimized shallow clone
-// used for static nodes and slot nodes because they may be reused across
-// multiple renders, cloning them avoids errors when DOM manipulations rely
-// on their elm reference.
-function cloneVNode (vnode) {
-  var cloned = new VNode(
-    vnode.tag,
-    vnode.data,
-    vnode.children,
-    vnode.text,
-    vnode.elm,
-    vnode.context,
-    vnode.componentOptions,
-    vnode.asyncFactory
-  );
-  cloned.ns = vnode.ns;
-  cloned.isStatic = vnode.isStatic;
-  cloned.key = vnode.key;
-  cloned.isComment = vnode.isComment;
-  cloned.fnContext = vnode.fnContext;
-  cloned.fnOptions = vnode.fnOptions;
-  cloned.fnScopeId = vnode.fnScopeId;
-  cloned.isCloned = true;
-  return cloned
-}
-
-/*
- * not type checking this file because flow doesn't play well with
- * dynamically accessing methods on Array prototype
- */
-
-var arrayProto = Array.prototype;
-var arrayMethods = Object.create(arrayProto);
-
-var methodsToPatch = [
-  'push',
-  'pop',
-  'shift',
-  'unshift',
-  'splice',
-  'sort',
-  'reverse'
-];
-
-/**
- * Intercept mutating methods and emit events
- */
-methodsToPatch.forEach(function (method) {
-  // cache original method
-  var original = arrayProto[method];
-  def(arrayMethods, method, function mutator () {
-    var arguments$1 = arguments;
-
-    var args = [], len = arguments.length;
-    while ( len-- ) { args[ len ] = arguments$1[ len ]; }
-
-    var result = original.apply(this, args);
-    var ob = this.__ob__;
-    var inserted;
-    switch (method) {
-      case 'push':
-      case 'unshift':
-        inserted = args;
-        break
-      case 'splice':
-        inserted = args.slice(2);
-        break
-    }
-    if (inserted) { ob.observeArray(inserted); }
-    // notify change
-    ob.dep.notify();
-    return result
-  });
-});
-
-/*  */
-
-var arrayKeys = Object.getOwnPropertyNames(arrayMethods);
-
-/**
- * In some cases we may want to disable observation inside a component's
- * update computation.
- */
-var shouldObserve = true;
-
-function toggleObserving (value) {
-  shouldObserve = value;
-}
-
-/**
- * Observer class that is attached to each observed
- * object. Once attached, the observer converts the target
- * object's property keys into getter/setters that
- * collect dependencies and dispatch updates.
- */
-var Observer = function Observer (value) {
-  this.value = value;
-  this.dep = new Dep();
-  this.vmCount = 0;
-  def(value, '__ob__', this);
-  if (Array.isArray(value)) {
-    var augment = hasProto
-      ? protoAugment
-      : copyAugment;
-    augment(value, arrayMethods, arrayKeys);
-    this.observeArray(value);
-  } else {
-    this.walk(value);
-  }
-};
-
-/**
- * Walk through each property and convert them into
- * getter/setters. This method should only be called when
- * value type is Object.
- */
-Observer.prototype.walk = function walk (obj) {
-  var keys = Object.keys(obj);
-  for (var i = 0; i < keys.length; i++) {
-    defineReactive(obj, keys[i]);
-  }
-};
-
-/**
- * Observe a list of Array items.
- */
-Observer.prototype.observeArray = function observeArray (items) {
-  for (var i = 0, l = items.length; i < l; i++) {
-    observe(items[i]);
-  }
-};
-
-// helpers
-
-/**
- * Augment an target Object or Array by intercepting
- * the prototype chain using __proto__
- */
-function protoAugment (target, src, keys) {
-  /* eslint-disable no-proto */
-  target.__proto__ = src;
-  /* eslint-enable no-proto */
-}
-
-/**
- * Augment an target Object or Array by defining
- * hidden properties.
- */
-/* istanbul ignore next */
-function copyAugment (target, src, keys) {
-  for (var i = 0, l = keys.length; i < l; i++) {
-    var key = keys[i];
-    def(target, key, src[key]);
-  }
-}
-
-/**
- * Attempt to create an observer instance for a value,
- * returns the new observer if successfully observed,
- * or the existing observer if the value already has one.
- */
-function observe (value, asRootData) {
-  if (!isObject(value) || value instanceof VNode) {
-    return
-  }
-  var ob;
-  if (hasOwn(value, '__ob__') && value.__ob__ instanceof Observer) {
-    ob = value.__ob__;
-  } else if (
-    shouldObserve &&
-    !isServerRendering() &&
-    (Array.isArray(value) || isPlainObject(value)) &&
-    Object.isExtensible(value) &&
-    !value._isVue
-  ) {
-    ob = new Observer(value);
-  }
-  if (asRootData && ob) {
-    ob.vmCount++;
-  }
-  return ob
-}
-
-/**
- * Define a reactive property on an Object.
- */
-function defineReactive (
-  obj,
-  key,
-  val,
-  customSetter,
-  shallow
-) {
-  var dep = new Dep();
-
-  var property = Object.getOwnPropertyDescriptor(obj, key);
-  if (property && property.configurable === false) {
-    return
-  }
-
-  // cater for pre-defined getter/setters
-  var getter = property && property.get;
-  if (!getter && arguments.length === 2) {
-    val = obj[key];
-  }
-  var setter = property && property.set;
-
-  var childOb = !shallow && observe(val);
-  Object.defineProperty(obj, key, {
-    enumerable: true,
-    configurable: true,
-    get: function reactiveGetter () {
-      var value = getter ? getter.call(obj) : val;
-      if (Dep.target) {
-        dep.depend();
-        if (childOb) {
-          childOb.dep.depend();
-          if (Array.isArray(value)) {
-            dependArray(value);
-          }
-        }
-      }
-      return value
-    },
-    set: function reactiveSetter (newVal) {
-      var value = getter ? getter.call(obj) : val;
-      /* eslint-disable no-self-compare */
-      if (newVal === value || (newVal !== newVal && value !== value)) {
-        return
-      }
-      /* eslint-enable no-self-compare */
-      if (process.env.NODE_ENV !== 'production' && customSetter) {
-        customSetter();
-      }
-      if (setter) {
-        setter.call(obj, newVal);
-      } else {
-        val = newVal;
-      }
-      childOb = !shallow && observe(newVal);
-      dep.notify();
-    }
-  });
-}
-
-/**
- * Set a property on an object. Adds the new property and
- * triggers change notification if the property doesn't
- * already exist.
- */
-function set (target, key, val) {
-  if (process.env.NODE_ENV !== 'production' &&
-    (isUndef(target) || isPrimitive(target))
-  ) {
-    warn(("Cannot set reactive property on undefined, null, or primitive value: " + ((target))));
-  }
-  if (Array.isArray(target) && isValidArrayIndex(key)) {
-    target.length = Math.max(target.length, key);
-    target.splice(key, 1, val);
-    return val
-  }
-  if (key in target && !(key in Object.prototype)) {
-    target[key] = val;
-    return val
-  }
-  var ob = (target).__ob__;
-  if (target._isVue || (ob && ob.vmCount)) {
-    process.env.NODE_ENV !== 'production' && warn(
-      'Avoid adding reactive properties to a Vue instance or its root $data ' +
-      'at runtime - declare it upfront in the data option.'
-    );
-    return val
-  }
-  if (!ob) {
-    target[key] = val;
-    return val
-  }
-  defineReactive(ob.value, key, val);
-  ob.dep.notify();
-  return val
-}
-
-/**
- * Delete a property and trigger change if necessary.
- */
-function del (target, key) {
-  if (process.env.NODE_ENV !== 'production' &&
-    (isUndef(target) || isPrimitive(target))
-  ) {
-    warn(("Cannot delete reactive property on undefined, null, or primitive value: " + ((target))));
-  }
-  if (Array.isArray(target) && isValidArrayIndex(key)) {
-    target.splice(key, 1);
-    return
-  }
-  var ob = (target).__ob__;
-  if (target._isVue || (ob && ob.vmCount)) {
-    process.env.NODE_ENV !== 'production' && warn(
-      'Avoid deleting properties on a Vue instance or its root $data ' +
-      '- just set it to null.'
-    );
-    return
-  }
-  if (!hasOwn(target, key)) {
-    return
-  }
-  delete target[key];
-  if (!ob) {
-    return
-  }
-  ob.dep.notify();
-}
-
-/**
- * Collect dependencies on array elements when the array is touched, since
- * we cannot intercept array element access like property getters.
- */
-function dependArray (value) {
-  for (var e = (void 0), i = 0, l = value.length; i < l; i++) {
-    e = value[i];
-    e && e.__ob__ && e.__ob__.dep.depend();
-    if (Array.isArray(e)) {
-      dependArray(e);
-    }
-  }
-}
-
-/*  */
-
-/**
- * Option overwriting strategies are functions that handle
- * how to merge a parent option value and a child option
- * value into the final value.
- */
-var strats = config.optionMergeStrategies;
-
-/**
- * Options with restrictions
- */
-if (process.env.NODE_ENV !== 'production') {
-  strats.el = strats.propsData = function (parent, child, vm, key) {
-    if (!vm) {
-      warn(
-        "option \"" + key + "\" can only be used during instance " +
-        'creation with the `new` keyword.'
-      );
-    }
-    return defaultStrat(parent, child)
-  };
-}
-
-/**
- * Helper that recursively merges two data objects together.
- */
-function mergeData (to, from) {
-  if (!from) { return to }
-  var key, toVal, fromVal;
-  var keys = Object.keys(from);
-  for (var i = 0; i < keys.length; i++) {
-    key = keys[i];
-    toVal = to[key];
-    fromVal = from[key];
-    if (!hasOwn(to, key)) {
-      set(to, key, fromVal);
-    } else if (isPlainObject(toVal) && isPlainObject(fromVal)) {
-      mergeData(toVal, fromVal);
-    }
-  }
-  return to
-}
-
-/**
- * Data
- */
-function mergeDataOrFn (
-  parentVal,
-  childVal,
-  vm
-) {
-  if (!vm) {
-    // in a Vue.extend merge, both should be functions
-    if (!childVal) {
-      return parentVal
-    }
-    if (!parentVal) {
-      return childVal
-    }
-    // when parentVal & childVal are both present,
-    // we need to return a function that returns the
-    // merged result of both functions... no need to
-    // check if parentVal is a function here because
-    // it has to be a function to pass previous merges.
-    return function mergedDataFn () {
-      return mergeData(
-        typeof childVal === 'function' ? childVal.call(this, this) : childVal,
-        typeof parentVal === 'function' ? parentVal.call(this, this) : parentVal
-      )
-    }
-  } else {
-    return function mergedInstanceDataFn () {
-      // instance merge
-      var instanceData = typeof childVal === 'function'
-        ? childVal.call(vm, vm)
-        : childVal;
-      var defaultData = typeof parentVal === 'function'
-        ? parentVal.call(vm, vm)
-        : parentVal;
-      if (instanceData) {
-        return mergeData(instanceData, defaultData)
-      } else {
-        return defaultData
-      }
-    }
-  }
-}
-
-strats.data = function (
-  parentVal,
-  childVal,
-  vm
-) {
-  if (!vm) {
-    if (childVal && typeof childVal !== 'function') {
-      process.env.NODE_ENV !== 'production' && warn(
-        'The "data" option should be a function ' +
-        'that returns a per-instance value in component ' +
-        'definitions.',
-        vm
-      );
-
-      return parentVal
-    }
-    return mergeDataOrFn(parentVal, childVal)
-  }
-
-  return mergeDataOrFn(parentVal, childVal, vm)
-};
-
-/**
- * Hooks and props are merged as arrays.
- */
-function mergeHook (
-  parentVal,
-  childVal
-) {
-  return childVal
-    ? parentVal
-      ? parentVal.concat(childVal)
-      : Array.isArray(childVal)
-        ? childVal
-        : [childVal]
-    : parentVal
-}
-
-LIFECYCLE_HOOKS.forEach(function (hook) {
-  strats[hook] = mergeHook;
-});
-
-/**
- * Assets
- *
- * When a vm is present (instance creation), we need to do
- * a three-way merge between constructor options, instance
- * options and parent options.
- */
-function mergeAssets (
-  parentVal,
-  childVal,
-  vm,
-  key
-) {
-  var res = Object.create(parentVal || null);
-  if (childVal) {
-    process.env.NODE_ENV !== 'production' && assertObjectType(key, childVal, vm);
-    return extend(res, childVal)
-  } else {
-    return res
-  }
-}
-
-ASSET_TYPES.forEach(function (type) {
-  strats[type + 's'] = mergeAssets;
-});
-
-/**
- * Watchers.
- *
- * Watchers hashes should not overwrite one
- * another, so we merge them as arrays.
- */
-strats.watch = function (
-  parentVal,
-  childVal,
-  vm,
-  key
-) {
-  // work around Firefox's Object.prototype.watch...
-  if (parentVal === nativeWatch) { parentVal = undefined; }
-  if (childVal === nativeWatch) { childVal = undefined; }
-  /* istanbul ignore if */
-  if (!childVal) { return Object.create(parentVal || null) }
-  if (process.env.NODE_ENV !== 'production') {
-    assertObjectType(key, childVal, vm);
-  }
-  if (!parentVal) { return childVal }
-  var ret = {};
-  extend(ret, parentVal);
-  for (var key$1 in childVal) {
-    var parent = ret[key$1];
-    var child = childVal[key$1];
-    if (parent && !Array.isArray(parent)) {
-      parent = [parent];
-    }
-    ret[key$1] = parent
-      ? parent.concat(child)
-      : Array.isArray(child) ? child : [child];
-  }
-  return ret
-};
-
-/**
- * Other object hashes.
- */
-strats.props =
-strats.methods =
-strats.inject =
-strats.computed = function (
-  parentVal,
-  childVal,
-  vm,
-  key
-) {
-  if (childVal && process.env.NODE_ENV !== 'production') {
-    assertObjectType(key, childVal, vm);
-  }
-  if (!parentVal) { return childVal }
-  var ret = Object.create(null);
-  extend(ret, parentVal);
-  if (childVal) { extend(ret, childVal); }
-  return ret
-};
-strats.provide = mergeDataOrFn;
-
-/**
- * Default strategy.
- */
-var defaultStrat = function (parentVal, childVal) {
-  return childVal === undefined
-    ? parentVal
-    : childVal
-};
-
-/**
- * Validate component names
- */
-function checkComponents (options) {
-  for (var key in options.components) {
-    validateComponentName(key);
-  }
-}
-
-function validateComponentName (name) {
-  if (!/^[a-zA-Z][\w-]*$/.test(name)) {
-    warn(
-      'Invalid component name: "' + name + '". Component names ' +
-      'can only contain alphanumeric characters and the hyphen, ' +
-      'and must start with a letter.'
-    );
-  }
-  if (isBuiltInTag(name) || config.isReservedTag(name)) {
-    warn(
-      'Do not use built-in or reserved HTML elements as component ' +
-      'id: ' + name
-    );
-  }
-}
-
-/**
- * Ensure all props option syntax are normalized into the
- * Object-based format.
- */
-function normalizeProps (options, vm) {
-  var props = options.props;
-  if (!props) { return }
-  var res = {};
-  var i, val, name;
-  if (Array.isArray(props)) {
-    i = props.length;
-    while (i--) {
-      val = props[i];
-      if (typeof val === 'string') {
-        name = camelize(val);
-        res[name] = { type: null };
-      } else if (process.env.NODE_ENV !== 'production') {
-        warn('props must be strings when using array syntax.');
-      }
-    }
-  } else if (isPlainObject(props)) {
-    for (var key in props) {
-      val = props[key];
-      name = camelize(key);
-      res[name] = isPlainObject(val)
-        ? val
-        : { type: val };
-    }
-  } else if (process.env.NODE_ENV !== 'production') {
-    warn(
-      "Invalid value for option \"props\": expected an Array or an Object, " +
-      "but got " + (toRawType(props)) + ".",
-      vm
-    );
-  }
-  options.props = res;
-}
-
-/**
- * Normalize all injections into Object-based format
- */
-function normalizeInject (options, vm) {
-  var inject = options.inject;
-  if (!inject) { return }
-  var normalized = options.inject = {};
-  if (Array.isArray(inject)) {
-    for (var i = 0; i < inject.length; i++) {
-      normalized[inject[i]] = { from: inject[i] };
-    }
-  } else if (isPlainObject(inject)) {
-    for (var key in inject) {
-      var val = inject[key];
-      normalized[key] = isPlainObject(val)
-        ? extend({ from: key }, val)
-        : { from: val };
-    }
-  } else if (process.env.NODE_ENV !== 'production') {
-    warn(
-      "Invalid value for option \"inject\": expected an Array or an Object, " +
-      "but got " + (toRawType(inject)) + ".",
-      vm
-    );
-  }
-}
-
-/**
- * Normalize raw function directives into object format.
- */
-function normalizeDirectives (options) {
-  var dirs = options.directives;
-  if (dirs) {
-    for (var key in dirs) {
-      var def = dirs[key];
-      if (typeof def === 'function') {
-        dirs[key] = { bind: def, update: def };
-      }
-    }
-  }
-}
-
-function assertObjectType (name, value, vm) {
-  if (!isPlainObject(value)) {
-    warn(
-      "Invalid value for option \"" + name + "\": expected an Object, " +
-      "but got " + (toRawType(value)) + ".",
-      vm
-    );
-  }
-}
-
-/**
- * Merge two option objects into a new one.
- * Core utility used in both instantiation and inheritance.
- */
-function mergeOptions (
-  parent,
-  child,
-  vm
-) {
-  if (process.env.NODE_ENV !== 'production') {
-    checkComponents(child);
-  }
-
-  if (typeof child === 'function') {
-    child = child.options;
-  }
-
-  normalizeProps(child, vm);
-  normalizeInject(child, vm);
-  normalizeDirectives(child);
-  var extendsFrom = child.extends;
-  if (extendsFrom) {
-    parent = mergeOptions(parent, extendsFrom, vm);
-  }
-  if (child.mixins) {
-    for (var i = 0, l = child.mixins.length; i < l; i++) {
-      parent = mergeOptions(parent, child.mixins[i], vm);
-    }
-  }
-  var options = {};
-  var key;
-  for (key in parent) {
-    mergeField(key);
-  }
-  for (key in child) {
-    if (!hasOwn(parent, key)) {
-      mergeField(key);
-    }
-  }
-  function mergeField (key) {
-    var strat = strats[key] || defaultStrat;
-    options[key] = strat(parent[key], child[key], vm, key);
-  }
-  return options
-}
-
-/**
- * Resolve an asset.
- * This function is used because child instances need access
- * to assets defined in its ancestor chain.
- */
-function resolveAsset (
-  options,
-  type,
-  id,
-  warnMissing
-) {
-  /* istanbul ignore if */
-  if (typeof id !== 'string') {
-    return
-  }
-  var assets = options[type];
-  // check local registration variations first
-  if (hasOwn(assets, id)) { return assets[id] }
-  var camelizedId = camelize(id);
-  if (hasOwn(assets, camelizedId)) { return assets[camelizedId] }
-  var PascalCaseId = capitalize(camelizedId);
-  if (hasOwn(assets, PascalCaseId)) { return assets[PascalCaseId] }
-  // fallback to prototype chain
-  var res = assets[id] || assets[camelizedId] || assets[PascalCaseId];
-  if (process.env.NODE_ENV !== 'production' && warnMissing && !res) {
-    warn(
-      'Failed to resolve ' + type.slice(0, -1) + ': ' + id,
-      options
-    );
-  }
-  return res
-}
-
-/*  */
-
-function validateProp (
-  key,
-  propOptions,
-  propsData,
-  vm
-) {
-  var prop = propOptions[key];
-  var absent = !hasOwn(propsData, key);
-  var value = propsData[key];
-  // boolean casting
-  var booleanIndex = getTypeIndex(Boolean, prop.type);
-  if (booleanIndex > -1) {
-    if (absent && !hasOwn(prop, 'default')) {
-      value = false;
-    } else if (value === '' || value === hyphenate(key)) {
-      // only cast empty string / same name to boolean if
-      // boolean has higher priority
-      var stringIndex = getTypeIndex(String, prop.type);
-      if (stringIndex < 0 || booleanIndex < stringIndex) {
-        value = true;
-      }
-    }
-  }
-  // check default value
-  if (value === undefined) {
-    value = getPropDefaultValue(vm, prop, key);
-    // since the default value is a fresh copy,
-    // make sure to observe it.
-    var prevShouldObserve = shouldObserve;
-    toggleObserving(true);
-    observe(value);
-    toggleObserving(prevShouldObserve);
-  }
-  if (
-    process.env.NODE_ENV !== 'production' &&
-    // skip validation for weex recycle-list child component props
-    !(false)
-  ) {
-    assertProp(prop, key, value, vm, absent);
-  }
-  return value
-}
-
-/**
- * Get the default value of a prop.
- */
-function getPropDefaultValue (vm, prop, key) {
-  // no default, return undefined
-  if (!hasOwn(prop, 'default')) {
-    return undefined
-  }
-  var def = prop.default;
-  // warn against non-factory defaults for Object & Array
-  if (process.env.NODE_ENV !== 'production' && isObject(def)) {
-    warn(
-      'Invalid default value for prop "' + key + '": ' +
-      'Props with type Object/Array must use a factory function ' +
-      'to return the default value.',
-      vm
-    );
-  }
-  // the raw prop value was also undefined from previous render,
-  // return previous default value to avoid unnecessary watcher trigger
-  if (vm && vm.$options.propsData &&
-    vm.$options.propsData[key] === undefined &&
-    vm._props[key] !== undefined
-  ) {
-    return vm._props[key]
-  }
-  // call factory function for non-Function types
-  // a value is Function if its prototype is function even across different execution context
-  return typeof def === 'function' && getType(prop.type) !== 'Function'
-    ? def.call(vm)
-    : def
-}
-
-/**
- * Assert whether a prop is valid.
- */
-function assertProp (
-  prop,
-  name,
-  value,
-  vm,
-  absent
-) {
-  if (prop.required && absent) {
-    warn(
-      'Missing required prop: "' + name + '"',
-      vm
-    );
-    return
-  }
-  if (value == null && !prop.required) {
-    return
-  }
-  var type = prop.type;
-  var valid = !type || type === true;
-  var expectedTypes = [];
-  if (type) {
-    if (!Array.isArray(type)) {
-      type = [type];
-    }
-    for (var i = 0; i < type.length && !valid; i++) {
-      var assertedType = assertType(value, type[i]);
-      expectedTypes.push(assertedType.expectedType || '');
-      valid = assertedType.valid;
-    }
-  }
-  if (!valid) {
-    warn(
-      "Invalid prop: type check failed for prop \"" + name + "\"." +
-      " Expected " + (expectedTypes.map(capitalize).join(', ')) +
-      ", got " + (toRawType(value)) + ".",
-      vm
-    );
-    return
-  }
-  var validator = prop.validator;
-  if (validator) {
-    if (!validator(value)) {
-      warn(
-        'Invalid prop: custom validator check failed for prop "' + name + '".',
-        vm
-      );
-    }
-  }
-}
-
-var simpleCheckRE = /^(String|Number|Boolean|Function|Symbol)$/;
-
-function assertType (value, type) {
-  var valid;
-  var expectedType = getType(type);
-  if (simpleCheckRE.test(expectedType)) {
-    var t = typeof value;
-    valid = t === expectedType.toLowerCase();
-    // for primitive wrapper objects
-    if (!valid && t === 'object') {
-      valid = value instanceof type;
-    }
-  } else if (expectedType === 'Object') {
-    valid = isPlainObject(value);
-  } else if (expectedType === 'Array') {
-    valid = Array.isArray(value);
-  } else {
-    valid = value instanceof type;
-  }
-  return {
-    valid: valid,
-    expectedType: expectedType
-  }
-}
-
-/**
- * Use function string name to check built-in types,
- * because a simple equality check will fail when running
- * across different vms / iframes.
- */
-function getType (fn) {
-  var match = fn && fn.toString().match(/^\s*function (\w+)/);
-  return match ? match[1] : ''
-}
-
-function isSameType (a, b) {
-  return getType(a) === getType(b)
-}
-
-function getTypeIndex (type, expectedTypes) {
-  if (!Array.isArray(expectedTypes)) {
-    return isSameType(expectedTypes, type) ? 0 : -1
-  }
-  for (var i = 0, len = expectedTypes.length; i < len; i++) {
-    if (isSameType(expectedTypes[i], type)) {
-      return i
-    }
-  }
-  return -1
-}
-
-/*  */
-
-function handleError (err, vm, info) {
-  if (vm) {
-    var cur = vm;
-    while ((cur = cur.$parent)) {
-      var hooks = cur.$options.errorCaptured;
-      if (hooks) {
-        for (var i = 0; i < hooks.length; i++) {
-          try {
-            var capture = hooks[i].call(cur, err, vm, info) === false;
-            if (capture) { return }
-          } catch (e) {
-            globalHandleError(e, cur, 'errorCaptured hook');
-          }
-        }
-      }
-    }
-  }
-  globalHandleError(err, vm, info);
-}
-
-function globalHandleError (err, vm, info) {
-  if (config.errorHandler) {
-    try {
-      return config.errorHandler.call(null, err, vm, info)
-    } catch (e) {
-      logError(e, null, 'config.errorHandler');
-    }
-  }
-  logError(err, vm, info);
-}
-
-function logError (err, vm, info) {
-  if (process.env.NODE_ENV !== 'production') {
-    warn(("Error in " + info + ": \"" + (err.toString()) + "\""), vm);
-  }
-  /* istanbul ignore else */
-  if ((inBrowser || inWeex) && typeof console !== 'undefined') {
-    console.error(err);
-  } else {
-    throw err
-  }
-}
-
-/*  */
-/* globals MessageChannel */
-
-var callbacks = [];
-var pending = false;
-
-function flushCallbacks () {
-  pending = false;
-  var copies = callbacks.slice(0);
-  callbacks.length = 0;
-  for (var i = 0; i < copies.length; i++) {
-    copies[i]();
-  }
-}
-
-// Here we have async deferring wrappers using both microtasks and (macro) tasks.
-// In < 2.4 we used microtasks everywhere, but there are some scenarios where
-// microtasks have too high a priority and fire in between supposedly
-// sequential events (e.g. #4521, #6690) or even between bubbling of the same
-// event (#6566). However, using (macro) tasks everywhere also has subtle problems
-// when state is changed right before repaint (e.g. #6813, out-in transitions).
-// Here we use microtask by default, but expose a way to force (macro) task when
-// needed (e.g. in event handlers attached by v-on).
-var microTimerFunc;
-var macroTimerFunc;
-var useMacroTask = false;
-
-// Determine (macro) task defer implementation.
-// Technically setImmediate should be the ideal choice, but it's only available
-// in IE. The only polyfill that consistently queues the callback after all DOM
-// events triggered in the same loop is by using MessageChannel.
-/* istanbul ignore if */
-if (typeof setImmediate !== 'undefined' && isNative(setImmediate)) {
-  macroTimerFunc = function () {
-    setImmediate(flushCallbacks);
-  };
-} else if (typeof MessageChannel !== 'undefined' && (
-  isNative(MessageChannel) ||
-  // PhantomJS
-  MessageChannel.toString() === '[object MessageChannelConstructor]'
-)) {
-  var channel = new MessageChannel();
-  var port = channel.port2;
-  channel.port1.onmessage = flushCallbacks;
-  macroTimerFunc = function () {
-    port.postMessage(1);
-  };
-} else {
-  /* istanbul ignore next */
-  macroTimerFunc = function () {
-    setTimeout(flushCallbacks, 0);
-  };
-}
-
-// Determine microtask defer implementation.
-/* istanbul ignore next, $flow-disable-line */
-if (typeof Promise !== 'undefined' && isNative(Promise)) {
-  var p = Promise.resolve();
-  microTimerFunc = function () {
-    p.then(flushCallbacks);
-    // in problematic UIWebViews, Promise.then doesn't completely break, but
-    // it can get stuck in a weird state where callbacks are pushed into the
-    // microtask queue but the queue isn't being flushed, until the browser
-    // needs to do some other work, e.g. handle a timer. Therefore we can
-    // "force" the microtask queue to be flushed by adding an empty timer.
-    if (isIOS) { setTimeout(noop); }
-  };
-} else {
-  // fallback to macro
-  microTimerFunc = macroTimerFunc;
-}
-
-/**
- * Wrap a function so that if any code inside triggers state change,
- * the changes are queued using a (macro) task instead of a microtask.
- */
-function withMacroTask (fn) {
-  return fn._withTask || (fn._withTask = function () {
-    useMacroTask = true;
-    var res = fn.apply(null, arguments);
-    useMacroTask = false;
-    return res
-  })
-}
-
-function nextTick (cb, ctx) {
-  var _resolve;
-  callbacks.push(function () {
-    if (cb) {
-      try {
-        cb.call(ctx);
-      } catch (e) {
-        handleError(e, ctx, 'nextTick');
-      }
-    } else if (_resolve) {
-      _resolve(ctx);
-    }
-  });
-  if (!pending) {
-    pending = true;
-    if (useMacroTask) {
-      macroTimerFunc();
-    } else {
-      microTimerFunc();
-    }
-  }
-  // $flow-disable-line
-  if (!cb && typeof Promise !== 'undefined') {
-    return new Promise(function (resolve) {
-      _resolve = resolve;
-    })
-  }
-}
-
-/*  */
-
-/* not type checking this file because flow doesn't play well with Proxy */
-
-var initProxy;
-
-if (process.env.NODE_ENV !== 'production') {
-  var allowedGlobals = makeMap(
-    'Infinity,undefined,NaN,isFinite,isNaN,' +
-    'parseFloat,parseInt,decodeURI,decodeURIComponent,encodeURI,encodeURIComponent,' +
-    'Math,Number,Date,Array,Object,Boolean,String,RegExp,Map,Set,JSON,Intl,' +
-    'require' // for Webpack/Browserify
-  );
-
-  var warnNonPresent = function (target, key) {
-    warn(
-      "Property or method \"" + key + "\" is not defined on the instance but " +
-      'referenced during render. Make sure that this property is reactive, ' +
-      'either in the data option, or for class-based components, by ' +
-      'initializing the property. ' +
-      'See: https://vuejs.org/v2/guide/reactivity.html#Declaring-Reactive-Properties.',
-      target
-    );
-  };
-
-  var hasProxy =
-    typeof Proxy !== 'undefined' && isNative(Proxy);
-
-  if (hasProxy) {
-    var isBuiltInModifier = makeMap('stop,prevent,self,ctrl,shift,alt,meta,exact');
-    config.keyCodes = new Proxy(config.keyCodes, {
-      set: function set (target, key, value) {
-        if (isBuiltInModifier(key)) {
-          warn(("Avoid overwriting built-in modifier in config.keyCodes: ." + key));
-          return false
-        } else {
-          target[key] = value;
-          return true
-        }
-      }
-    });
-  }
-
-  var hasHandler = {
-    has: function has (target, key) {
-      var has = key in target;
-      var isAllowed = allowedGlobals(key) || key.charAt(0) === '_';
-      if (!has && !isAllowed) {
-        warnNonPresent(target, key);
-      }
-      return has || !isAllowed
-    }
-  };
-
-  var getHandler = {
-    get: function get (target, key) {
-      if (typeof key === 'string' && !(key in target)) {
-        warnNonPresent(target, key);
-      }
-      return target[key]
-    }
-  };
-
-  initProxy = function initProxy (vm) {
-    if (hasProxy) {
-      // determine which proxy handler to use
-      var options = vm.$options;
-      var handlers = options.render && options.render._withStripped
-        ? getHandler
-        : hasHandler;
-      vm._renderProxy = new Proxy(vm, handlers);
-    } else {
-      vm._renderProxy = vm;
-    }
-  };
-}
-
-/*  */
-
-var seenObjects = new _Set();
-
-/**
- * Recursively traverse an object to evoke all converted
- * getters, so that every nested property inside the object
- * is collected as a "deep" dependency.
- */
-function traverse (val) {
-  _traverse(val, seenObjects);
-  seenObjects.clear();
-}
-
-function _traverse (val, seen) {
-  var i, keys;
-  var isA = Array.isArray(val);
-  if ((!isA && !isObject(val)) || Object.isFrozen(val) || val instanceof VNode) {
-    return
-  }
-  if (val.__ob__) {
-    var depId = val.__ob__.dep.id;
-    if (seen.has(depId)) {
-      return
-    }
-    seen.add(depId);
-  }
-  if (isA) {
-    i = val.length;
-    while (i--) { _traverse(val[i], seen); }
-  } else {
-    keys = Object.keys(val);
-    i = keys.length;
-    while (i--) { _traverse(val[keys[i]], seen); }
-  }
-}
-
-var mark;
-var measure;
-
-if (process.env.NODE_ENV !== 'production') {
-  var perf = inBrowser && window.performance;
-  /* istanbul ignore if */
-  if (
-    perf &&
-    perf.mark &&
-    perf.measure &&
-    perf.clearMarks &&
-    perf.clearMeasures
-  ) {
-    mark = function (tag) { return perf.mark(tag); };
-    measure = function (name, startTag, endTag) {
-      perf.measure(name, startTag, endTag);
-      perf.clearMarks(startTag);
-      perf.clearMarks(endTag);
-      perf.clearMeasures(name);
-    };
-  }
-}
-
-/*  */
-
-var normalizeEvent = cached(function (name) {
-  var passive = name.charAt(0) === '&';
-  name = passive ? name.slice(1) : name;
-  var once$$1 = name.charAt(0) === '~'; // Prefixed last, checked first
-  name = once$$1 ? name.slice(1) : name;
-  var capture = name.charAt(0) === '!';
-  name = capture ? name.slice(1) : name;
-  return {
-    name: name,
-    once: once$$1,
-    capture: capture,
-    passive: passive
-  }
-});
-
-function createFnInvoker (fns) {
-  function invoker () {
-    var arguments$1 = arguments;
-
-    var fns = invoker.fns;
-    if (Array.isArray(fns)) {
-      var cloned = fns.slice();
-      for (var i = 0; i < cloned.length; i++) {
-        cloned[i].apply(null, arguments$1);
-      }
-    } else {
-      // return handler return value for single handlers
-      return fns.apply(null, arguments)
-    }
-  }
-  invoker.fns = fns;
-  return invoker
-}
-
-function updateListeners (
-  on,
-  oldOn,
-  add,
-  remove$$1,
-  vm
-) {
-  var name, def, cur, old, event;
-  for (name in on) {
-    def = cur = on[name];
-    old = oldOn[name];
-    event = normalizeEvent(name);
-    /* istanbul ignore if */
-    if (isUndef(cur)) {
-      process.env.NODE_ENV !== 'production' && warn(
-        "Invalid handler for event \"" + (event.name) + "\": got " + String(cur),
-        vm
-      );
-    } else if (isUndef(old)) {
-      if (isUndef(cur.fns)) {
-        cur = on[name] = createFnInvoker(cur);
-      }
-      add(event.name, cur, event.once, event.capture, event.passive, event.params);
-    } else if (cur !== old) {
-      old.fns = cur;
-      on[name] = old;
-    }
-  }
-  for (name in oldOn) {
-    if (isUndef(on[name])) {
-      event = normalizeEvent(name);
-      remove$$1(event.name, oldOn[name], event.capture);
-    }
-  }
-}
-
-/*  */
-
-function mergeVNodeHook (def, hookKey, hook) {
-  if (def instanceof VNode) {
-    def = def.data.hook || (def.data.hook = {});
-  }
-  var invoker;
-  var oldHook = def[hookKey];
-
-  function wrappedHook () {
-    hook.apply(this, arguments);
-    // important: remove merged hook to ensure it's called only once
-    // and prevent memory leak
-    remove(invoker.fns, wrappedHook);
-  }
-
-  if (isUndef(oldHook)) {
-    // no existing hook
-    invoker = createFnInvoker([wrappedHook]);
-  } else {
-    /* istanbul ignore if */
-    if (isDef(oldHook.fns) && isTrue(oldHook.merged)) {
-      // already a merged invoker
-      invoker = oldHook;
-      invoker.fns.push(wrappedHook);
-    } else {
-      // existing plain hook
-      invoker = createFnInvoker([oldHook, wrappedHook]);
-    }
-  }
-
-  invoker.merged = true;
-  def[hookKey] = invoker;
-}
-
-/*  */
-
-function extractPropsFromVNodeData (
-  data,
-  Ctor,
-  tag
-) {
-  // we are only extracting raw values here.
-  // validation and default values are handled in the child
-  // component itself.
-  var propOptions = Ctor.options.props;
-  if (isUndef(propOptions)) {
-    return
-  }
-  var res = {};
-  var attrs = data.attrs;
-  var props = data.props;
-  if (isDef(attrs) || isDef(props)) {
-    for (var key in propOptions) {
-      var altKey = hyphenate(key);
-      if (process.env.NODE_ENV !== 'production') {
-        var keyInLowerCase = key.toLowerCase();
-        if (
-          key !== keyInLowerCase &&
-          attrs && hasOwn(attrs, keyInLowerCase)
-        ) {
-          tip(
-            "Prop \"" + keyInLowerCase + "\" is passed to component " +
-            (formatComponentName(tag || Ctor)) + ", but the declared prop name is" +
-            " \"" + key + "\". " +
-            "Note that HTML attributes are case-insensitive and camelCased " +
-            "props need to use their kebab-case equivalents when using in-DOM " +
-            "templates. You should probably use \"" + altKey + "\" instead of \"" + key + "\"."
-          );
-        }
-      }
-      checkProp(res, props, key, altKey, true) ||
-      checkProp(res, attrs, key, altKey, false);
-    }
-  }
-  return res
-}
-
-function checkProp (
-  res,
-  hash,
-  key,
-  altKey,
-  preserve
-) {
-  if (isDef(hash)) {
-    if (hasOwn(hash, key)) {
-      res[key] = hash[key];
-      if (!preserve) {
-        delete hash[key];
-      }
-      return true
-    } else if (hasOwn(hash, altKey)) {
-      res[key] = hash[altKey];
-      if (!preserve) {
-        delete hash[altKey];
-      }
-      return true
-    }
-  }
-  return false
-}
-
-/*  */
-
-// The template compiler attempts to minimize the need for normalization by
-// statically analyzing the template at compile time.
-//
-// For plain HTML markup, normalization can be completely skipped because the
-// generated render function is guaranteed to return Array<VNode>. There are
-// two cases where extra normalization is needed:
-
-// 1. When the children contains components - because a functional component
-// may return an Array instead of a single root. In this case, just a simple
-// normalization is needed - if any child is an Array, we flatten the whole
-// thing with Array.prototype.concat. It is guaranteed to be only 1-level deep
-// because functional components already normalize their own children.
-function simpleNormalizeChildren (children) {
-  for (var i = 0; i < children.length; i++) {
-    if (Array.isArray(children[i])) {
-      return Array.prototype.concat.apply([], children)
-    }
-  }
-  return children
-}
-
-// 2. When the children contains constructs that always generated nested Arrays,
-// e.g. <template>, <slot>, v-for, or when the children is provided by user
-// with hand-written render functions / JSX. In such cases a full normalization
-// is needed to cater to all possible types of children values.
-function normalizeChildren (children) {
-  return isPrimitive(children)
-    ? [createTextVNode(children)]
-    : Array.isArray(children)
-      ? normalizeArrayChildren(children)
-      : undefined
-}
-
-function isTextNode (node) {
-  return isDef(node) && isDef(node.text) && isFalse(node.isComment)
-}
-
-function normalizeArrayChildren (children, nestedIndex) {
-  var res = [];
-  var i, c, lastIndex, last;
-  for (i = 0; i < children.length; i++) {
-    c = children[i];
-    if (isUndef(c) || typeof c === 'boolean') { continue }
-    lastIndex = res.length - 1;
-    last = res[lastIndex];
-    //  nested
-    if (Array.isArray(c)) {
-      if (c.length > 0) {
-        c = normalizeArrayChildren(c, ((nestedIndex || '') + "_" + i));
-        // merge adjacent text nodes
-        if (isTextNode(c[0]) && isTextNode(last)) {
-          res[lastIndex] = createTextVNode(last.text + (c[0]).text);
-          c.shift();
-        }
-        res.push.apply(res, c);
-      }
-    } else if (isPrimitive(c)) {
-      if (isTextNode(last)) {
-        // merge adjacent text nodes
-        // this is necessary for SSR hydration because text nodes are
-        // essentially merged when rendered to HTML strings
-        res[lastIndex] = createTextVNode(last.text + c);
-      } else if (c !== '') {
-        // convert primitive to vnode
-        res.push(createTextVNode(c));
-      }
-    } else {
-      if (isTextNode(c) && isTextNode(last)) {
-        // merge adjacent text nodes
-        res[lastIndex] = createTextVNode(last.text + c.text);
-      } else {
-        // default key for nested array children (likely generated by v-for)
-        if (isTrue(children._isVList) &&
-          isDef(c.tag) &&
-          isUndef(c.key) &&
-          isDef(nestedIndex)) {
-          c.key = "__vlist" + nestedIndex + "_" + i + "__";
-        }
-        res.push(c);
-      }
-    }
-  }
-  return res
-}
-
-/*  */
-
-function ensureCtor (comp, base) {
-  if (
-    comp.__esModule ||
-    (hasSymbol && comp[Symbol.toStringTag] === 'Module')
-  ) {
-    comp = comp.default;
-  }
-  return isObject(comp)
-    ? base.extend(comp)
-    : comp
-}
-
-function createAsyncPlaceholder (
-  factory,
-  data,
-  context,
-  children,
-  tag
-) {
-  var node = createEmptyVNode();
-  node.asyncFactory = factory;
-  node.asyncMeta = { data: data, context: context, children: children, tag: tag };
-  return node
-}
-
-function resolveAsyncComponent (
-  factory,
-  baseCtor,
-  context
-) {
-  if (isTrue(factory.error) && isDef(factory.errorComp)) {
-    return factory.errorComp
-  }
-
-  if (isDef(factory.resolved)) {
-    return factory.resolved
-  }
-
-  if (isTrue(factory.loading) && isDef(factory.loadingComp)) {
-    return factory.loadingComp
-  }
-
-  if (isDef(factory.contexts)) {
-    // already pending
-    factory.contexts.push(context);
-  } else {
-    var contexts = factory.contexts = [context];
-    var sync = true;
-
-    var forceRender = function () {
-      for (var i = 0, l = contexts.length; i < l; i++) {
-        contexts[i].$forceUpdate();
-      }
-    };
-
-    var resolve = once(function (res) {
-      // cache resolved
-      factory.resolved = ensureCtor(res, baseCtor);
-      // invoke callbacks only if this is not a synchronous resolve
-      // (async resolves are shimmed as synchronous during SSR)
-      if (!sync) {
-        forceRender();
-      }
-    });
-
-    var reject = once(function (reason) {
-      process.env.NODE_ENV !== 'production' && warn(
-        "Failed to resolve async component: " + (String(factory)) +
-        (reason ? ("\nReason: " + reason) : '')
-      );
-      if (isDef(factory.errorComp)) {
-        factory.error = true;
-        forceRender();
-      }
-    });
-
-    var res = factory(resolve, reject);
-
-    if (isObject(res)) {
-      if (typeof res.then === 'function') {
-        // () => Promise
-        if (isUndef(factory.resolved)) {
-          res.then(resolve, reject);
-        }
-      } else if (isDef(res.component) && typeof res.component.then === 'function') {
-        res.component.then(resolve, reject);
-
-        if (isDef(res.error)) {
-          factory.errorComp = ensureCtor(res.error, baseCtor);
-        }
-
-        if (isDef(res.loading)) {
-          factory.loadingComp = ensureCtor(res.loading, baseCtor);
-          if (res.delay === 0) {
-            factory.loading = true;
-          } else {
-            setTimeout(function () {
-              if (isUndef(factory.resolved) && isUndef(factory.error)) {
-                factory.loading = true;
-                forceRender();
-              }
-            }, res.delay || 200);
-          }
-        }
-
-        if (isDef(res.timeout)) {
-          setTimeout(function () {
-            if (isUndef(factory.resolved)) {
-              reject(
-                process.env.NODE_ENV !== 'production'
-                  ? ("timeout (" + (res.timeout) + "ms)")
-                  : null
-              );
-            }
-          }, res.timeout);
-        }
-      }
-    }
-
-    sync = false;
-    // return in case resolved synchronously
-    return factory.loading
-      ? factory.loadingComp
-      : factory.resolved
-  }
-}
-
-/*  */
-
-function isAsyncPlaceholder (node) {
-  return node.isComment && node.asyncFactory
-}
-
-/*  */
-
-function getFirstComponentChild (children) {
-  if (Array.isArray(children)) {
-    for (var i = 0; i < children.length; i++) {
-      var c = children[i];
-      if (isDef(c) && (isDef(c.componentOptions) || isAsyncPlaceholder(c))) {
-        return c
-      }
-    }
-  }
-}
-
-/*  */
-
-/*  */
-
-function initEvents (vm) {
-  vm._events = Object.create(null);
-  vm._hasHookEvent = false;
-  // init parent attached events
-  var listeners = vm.$options._parentListeners;
-  if (listeners) {
-    updateComponentListeners(vm, listeners);
-  }
-}
-
-var target;
-
-function add (event, fn, once) {
-  if (once) {
-    target.$once(event, fn);
-  } else {
-    target.$on(event, fn);
-  }
-}
-
-function remove$1 (event, fn) {
-  target.$off(event, fn);
-}
-
-function updateComponentListeners (
-  vm,
-  listeners,
-  oldListeners
-) {
-  target = vm;
-  updateListeners(listeners, oldListeners || {}, add, remove$1, vm);
-  target = undefined;
-}
-
-function eventsMixin (Vue) {
-  var hookRE = /^hook:/;
-  Vue.prototype.$on = function (event, fn) {
-    var this$1 = this;
-
-    var vm = this;
-    if (Array.isArray(event)) {
-      for (var i = 0, l = event.length; i < l; i++) {
-        this$1.$on(event[i], fn);
-      }
-    } else {
-      (vm._events[event] || (vm._events[event] = [])).push(fn);
-      // optimize hook:event cost by using a boolean flag marked at registration
-      // instead of a hash lookup
-      if (hookRE.test(event)) {
-        vm._hasHookEvent = true;
-      }
-    }
-    return vm
-  };
-
-  Vue.prototype.$once = function (event, fn) {
-    var vm = this;
-    function on () {
-      vm.$off(event, on);
-      fn.apply(vm, arguments);
-    }
-    on.fn = fn;
-    vm.$on(event, on);
-    return vm
-  };
-
-  Vue.prototype.$off = function (event, fn) {
-    var this$1 = this;
-
-    var vm = this;
-    // all
-    if (!arguments.length) {
-      vm._events = Object.create(null);
-      return vm
-    }
-    // array of events
-    if (Array.isArray(event)) {
-      for (var i = 0, l = event.length; i < l; i++) {
-        this$1.$off(event[i], fn);
-      }
-      return vm
-    }
-    // specific event
-    var cbs = vm._events[event];
-    if (!cbs) {
-      return vm
-    }
-    if (!fn) {
-      vm._events[event] = null;
-      return vm
-    }
-    if (fn) {
-      // specific handler
-      var cb;
-      var i$1 = cbs.length;
-      while (i$1--) {
-        cb = cbs[i$1];
-        if (cb === fn || cb.fn === fn) {
-          cbs.splice(i$1, 1);
-          break
-        }
-      }
-    }
-    return vm
-  };
-
-  Vue.prototype.$emit = function (event) {
-    var vm = this;
-    if (process.env.NODE_ENV !== 'production') {
-      var lowerCaseEvent = event.toLowerCase();
-      if (lowerCaseEvent !== event && vm._events[lowerCaseEvent]) {
-        tip(
-          "Event \"" + lowerCaseEvent + "\" is emitted in component " +
-          (formatComponentName(vm)) + " but the handler is registered for \"" + event + "\". " +
-          "Note that HTML attributes are case-insensitive and you cannot use " +
-          "v-on to listen to camelCase events when using in-DOM templates. " +
-          "You should probably use \"" + (hyphenate(event)) + "\" instead of \"" + event + "\"."
-        );
-      }
-    }
-    var cbs = vm._events[event];
-    if (cbs) {
-      cbs = cbs.length > 1 ? toArray(cbs) : cbs;
-      var args = toArray(arguments, 1);
-      for (var i = 0, l = cbs.length; i < l; i++) {
-        try {
-          cbs[i].apply(vm, args);
-        } catch (e) {
-          handleError(e, vm, ("event handler for \"" + event + "\""));
-        }
-      }
-    }
-    return vm
-  };
-}
-
-/*  */
-
-
-
-/**
- * Runtime helper for resolving raw children VNodes into a slot object.
- */
-function resolveSlots (
-  children,
-  context
-) {
-  var slots = {};
-  if (!children) {
-    return slots
-  }
-  for (var i = 0, l = children.length; i < l; i++) {
-    var child = children[i];
-    var data = child.data;
-    // remove slot attribute if the node is resolved as a Vue slot node
-    if (data && data.attrs && data.attrs.slot) {
-      delete data.attrs.slot;
-    }
-    // named slots should only be respected if the vnode was rendered in the
-    // same context.
-    if ((child.context === context || child.fnContext === context) &&
-      data && data.slot != null
-    ) {
-      var name = data.slot;
-      var slot = (slots[name] || (slots[name] = []));
-      if (child.tag === 'template') {
-        slot.push.apply(slot, child.children || []);
-      } else {
-        slot.push(child);
-      }
-    } else {
-      (slots.default || (slots.default = [])).push(child);
-    }
-  }
-  // ignore slots that contains only whitespace
-  for (var name$1 in slots) {
-    if (slots[name$1].every(isWhitespace)) {
-      delete slots[name$1];
-    }
-  }
-  return slots
-}
-
-function isWhitespace (node) {
-  return (node.isComment && !node.asyncFactory) || node.text === ' '
-}
-
-function resolveScopedSlots (
-  fns, // see flow/vnode
-  res
-) {
-  res = res || {};
-  for (var i = 0; i < fns.length; i++) {
-    if (Array.isArray(fns[i])) {
-      resolveScopedSlots(fns[i], res);
-    } else {
-      res[fns[i].key] = fns[i].fn;
-    }
-  }
-  return res
-}
-
-/*  */
-
-var activeInstance = null;
-var isUpdatingChildComponent = false;
-
-function initLifecycle (vm) {
-  var options = vm.$options;
-
-  // locate first non-abstract parent
-  var parent = options.parent;
-  if (parent && !options.abstract) {
-    while (parent.$options.abstract && parent.$parent) {
-      parent = parent.$parent;
-    }
-    parent.$children.push(vm);
-  }
-
-  vm.$parent = parent;
-  vm.$root = parent ? parent.$root : vm;
-
-  vm.$children = [];
-  vm.$refs = {};
-
-  vm._watcher = null;
-  vm._inactive = null;
-  vm._directInactive = false;
-  vm._isMounted = false;
-  vm._isDestroyed = false;
-  vm._isBeingDestroyed = false;
-}
-
-function lifecycleMixin (Vue) {
-  Vue.prototype._update = function (vnode, hydrating) {
-    var vm = this;
-    if (vm._isMounted) {
-      callHook(vm, 'beforeUpdate');
-    }
-    var prevEl = vm.$el;
-    var prevVnode = vm._vnode;
-    var prevActiveInstance = activeInstance;
-    activeInstance = vm;
-    vm._vnode = vnode;
-    // Vue.prototype.__patch__ is injected in entry points
-    // based on the rendering backend used.
-    if (!prevVnode) {
-      // initial render
-      vm.$el = vm.__patch__(
-        vm.$el, vnode, hydrating, false /* removeOnly */,
-        vm.$options._parentElm,
-        vm.$options._refElm
-      );
-      // no need for the ref nodes after initial patch
-      // this prevents keeping a detached DOM tree in memory (#5851)
-      vm.$options._parentElm = vm.$options._refElm = null;
-    } else {
-      // updates
-      vm.$el = vm.__patch__(prevVnode, vnode);
-    }
-    activeInstance = prevActiveInstance;
-    // update __vue__ reference
-    if (prevEl) {
-      prevEl.__vue__ = null;
-    }
-    if (vm.$el) {
-      vm.$el.__vue__ = vm;
-    }
-    // if parent is an HOC, update its $el as well
-    if (vm.$vnode && vm.$parent && vm.$vnode === vm.$parent._vnode) {
-      vm.$parent.$el = vm.$el;
-    }
-    // updated hook is called by the scheduler to ensure that children are
-    // updated in a parent's updated hook.
-  };
-
-  Vue.prototype.$forceUpdate = function () {
-    var vm = this;
-    if (vm._watcher) {
-      vm._watcher.update();
-    }
-  };
-
-  Vue.prototype.$destroy = function () {
-    var vm = this;
-    if (vm._isBeingDestroyed) {
-      return
-    }
-    callHook(vm, 'beforeDestroy');
-    vm._isBeingDestroyed = true;
-    // remove self from parent
-    var parent = vm.$parent;
-    if (parent && !parent._isBeingDestroyed && !vm.$options.abstract) {
-      remove(parent.$children, vm);
-    }
-    // teardown watchers
-    if (vm._watcher) {
-      vm._watcher.teardown();
-    }
-    var i = vm._watchers.length;
-    while (i--) {
-      vm._watchers[i].teardown();
-    }
-    // remove reference from data ob
-    // frozen object may not have observer.
-    if (vm._data.__ob__) {
-      vm._data.__ob__.vmCount--;
-    }
-    // call the last hook...
-    vm._isDestroyed = true;
-    // invoke destroy hooks on current rendered tree
-    vm.__patch__(vm._vnode, null);
-    // fire destroyed hook
-    callHook(vm, 'destroyed');
-    // turn off all instance listeners.
-    vm.$off();
-    // remove __vue__ reference
-    if (vm.$el) {
-      vm.$el.__vue__ = null;
-    }
-    // release circular reference (#6759)
-    if (vm.$vnode) {
-      vm.$vnode.parent = null;
-    }
-  };
-}
-
-function mountComponent (
-  vm,
-  el,
-  hydrating
-) {
-  vm.$el = el;
-  if (!vm.$options.render) {
-    vm.$options.render = createEmptyVNode;
-    if (process.env.NODE_ENV !== 'production') {
-      /* istanbul ignore if */
-      if ((vm.$options.template && vm.$options.template.charAt(0) !== '#') ||
-        vm.$options.el || el) {
-        warn(
-          'You are using the runtime-only build of Vue where the template ' +
-          'compiler is not available. Either pre-compile the templates into ' +
-          'render functions, or use the compiler-included build.',
-          vm
-        );
-      } else {
-        warn(
-          'Failed to mount component: template or render function not defined.',
-          vm
-        );
-      }
-    }
-  }
-  callHook(vm, 'beforeMount');
-
-  var updateComponent;
-  /* istanbul ignore if */
-  if (process.env.NODE_ENV !== 'production' && config.performance && mark) {
-    updateComponent = function () {
-      var name = vm._name;
-      var id = vm._uid;
-      var startTag = "vue-perf-start:" + id;
-      var endTag = "vue-perf-end:" + id;
-
-      mark(startTag);
-      var vnode = vm._render();
-      mark(endTag);
-      measure(("vue " + name + " render"), startTag, endTag);
-
-      mark(startTag);
-      vm._update(vnode, hydrating);
-      mark(endTag);
-      measure(("vue " + name + " patch"), startTag, endTag);
-    };
-  } else {
-    updateComponent = function () {
-      vm._update(vm._render(), hydrating);
-    };
-  }
-
-  // we set this to vm._watcher inside the watcher's constructor
-  // since the watcher's initial patch may call $forceUpdate (e.g. inside child
-  // component's mounted hook), which relies on vm._watcher being already defined
-  new Watcher(vm, updateComponent, noop, null, true /* isRenderWatcher */);
-  hydrating = false;
-
-  // manually mounted instance, call mounted on self
-  // mounted is called for render-created child components in its inserted hook
-  if (vm.$vnode == null) {
-    vm._isMounted = true;
-    callHook(vm, 'mounted');
-  }
-  return vm
-}
-
-function updateChildComponent (
-  vm,
-  propsData,
-  listeners,
-  parentVnode,
-  renderChildren
-) {
-  if (process.env.NODE_ENV !== 'production') {
-    isUpdatingChildComponent = true;
-  }
-
-  // determine whether component has slot children
-  // we need to do this before overwriting $options._renderChildren
-  var hasChildren = !!(
-    renderChildren ||               // has new static slots
-    vm.$options._renderChildren ||  // has old static slots
-    parentVnode.data.scopedSlots || // has new scoped slots
-    vm.$scopedSlots !== emptyObject // has old scoped slots
-  );
-
-  vm.$options._parentVnode = parentVnode;
-  vm.$vnode = parentVnode; // update vm's placeholder node without re-render
-
-  if (vm._vnode) { // update child tree's parent
-    vm._vnode.parent = parentVnode;
-  }
-  vm.$options._renderChildren = renderChildren;
-
-  // update $attrs and $listeners hash
-  // these are also reactive so they may trigger child update if the child
-  // used them during render
-  vm.$attrs = parentVnode.data.attrs || emptyObject;
-  vm.$listeners = listeners || emptyObject;
-
-  // update props
-  if (propsData && vm.$options.props) {
-    toggleObserving(false);
-    var props = vm._props;
-    var propKeys = vm.$options._propKeys || [];
-    for (var i = 0; i < propKeys.length; i++) {
-      var key = propKeys[i];
-      var propOptions = vm.$options.props; // wtf flow?
-      props[key] = validateProp(key, propOptions, propsData, vm);
-    }
-    toggleObserving(true);
-    // keep a copy of raw propsData
-    vm.$options.propsData = propsData;
-  }
-
-  // update listeners
-  listeners = listeners || emptyObject;
-  var oldListeners = vm.$options._parentListeners;
-  vm.$options._parentListeners = listeners;
-  updateComponentListeners(vm, listeners, oldListeners);
-
-  // resolve slots + force update if has children
-  if (hasChildren) {
-    vm.$slots = resolveSlots(renderChildren, parentVnode.context);
-    vm.$forceUpdate();
-  }
-
-  if (process.env.NODE_ENV !== 'production') {
-    isUpdatingChildComponent = false;
-  }
-}
-
-function isInInactiveTree (vm) {
-  while (vm && (vm = vm.$parent)) {
-    if (vm._inactive) { return true }
-  }
-  return false
-}
-
-function activateChildComponent (vm, direct) {
-  if (direct) {
-    vm._directInactive = false;
-    if (isInInactiveTree(vm)) {
-      return
-    }
-  } else if (vm._directInactive) {
-    return
-  }
-  if (vm._inactive || vm._inactive === null) {
-    vm._inactive = false;
-    for (var i = 0; i < vm.$children.length; i++) {
-      activateChildComponent(vm.$children[i]);
-    }
-    callHook(vm, 'activated');
-  }
-}
-
-function deactivateChildComponent (vm, direct) {
-  if (direct) {
-    vm._directInactive = true;
-    if (isInInactiveTree(vm)) {
-      return
-    }
-  }
-  if (!vm._inactive) {
-    vm._inactive = true;
-    for (var i = 0; i < vm.$children.length; i++) {
-      deactivateChildComponent(vm.$children[i]);
-    }
-    callHook(vm, 'deactivated');
-  }
-}
-
-function callHook (vm, hook) {
-  // #7573 disable dep collection when invoking lifecycle hooks
-  pushTarget();
-  var handlers = vm.$options[hook];
-  if (handlers) {
-    for (var i = 0, j = handlers.length; i < j; i++) {
-      try {
-        handlers[i].call(vm);
-      } catch (e) {
-        handleError(e, vm, (hook + " hook"));
-      }
-    }
-  }
-  if (vm._hasHookEvent) {
-    vm.$emit('hook:' + hook);
-  }
-  popTarget();
-}
-
-/*  */
-
-
-var MAX_UPDATE_COUNT = 100;
-
-var queue = [];
-var activatedChildren = [];
-var has = {};
-var circular = {};
-var waiting = false;
-var flushing = false;
-var index$6 = 0;
-
-/**
- * Reset the scheduler's state.
- */
-function resetSchedulerState () {
-  index$6 = queue.length = activatedChildren.length = 0;
-  has = {};
-  if (process.env.NODE_ENV !== 'production') {
-    circular = {};
-  }
-  waiting = flushing = false;
-}
-
-/**
- * Flush both queues and run the watchers.
- */
-function flushSchedulerQueue () {
-  flushing = true;
-  var watcher, id;
-
-  // Sort queue before flush.
-  // This ensures that:
-  // 1. Components are updated from parent to child. (because parent is always
-  //    created before the child)
-  // 2. A component's user watchers are run before its render watcher (because
-  //    user watchers are created before the render watcher)
-  // 3. If a component is destroyed during a parent component's watcher run,
-  //    its watchers can be skipped.
-  queue.sort(function (a, b) { return a.id - b.id; });
-
-  // do not cache length because more watchers might be pushed
-  // as we run existing watchers
-  for (index$6 = 0; index$6 < queue.length; index$6++) {
-    watcher = queue[index$6];
-    id = watcher.id;
-    has[id] = null;
-    watcher.run();
-    // in dev build, check and stop circular updates.
-    if (process.env.NODE_ENV !== 'production' && has[id] != null) {
-      circular[id] = (circular[id] || 0) + 1;
-      if (circular[id] > MAX_UPDATE_COUNT) {
-        warn(
-          'You may have an infinite update loop ' + (
-            watcher.user
-              ? ("in watcher with expression \"" + (watcher.expression) + "\"")
-              : "in a component render function."
-          ),
-          watcher.vm
-        );
-        break
-      }
-    }
-  }
-
-  // keep copies of post queues before resetting state
-  var activatedQueue = activatedChildren.slice();
-  var updatedQueue = queue.slice();
-
-  resetSchedulerState();
-
-  // call component updated and activated hooks
-  callActivatedHooks(activatedQueue);
-  callUpdatedHooks(updatedQueue);
-
-  // devtool hook
-  /* istanbul ignore if */
-  if (devtools && config.devtools) {
-    devtools.emit('flush');
-  }
-}
-
-function callUpdatedHooks (queue) {
-  var i = queue.length;
-  while (i--) {
-    var watcher = queue[i];
-    var vm = watcher.vm;
-    if (vm._watcher === watcher && vm._isMounted) {
-      callHook(vm, 'updated');
-    }
-  }
-}
-
-/**
- * Queue a kept-alive component that was activated during patch.
- * The queue will be processed after the entire tree has been patched.
- */
-function queueActivatedComponent (vm) {
-  // setting _inactive to false here so that a render function can
-  // rely on checking whether it's in an inactive tree (e.g. router-view)
-  vm._inactive = false;
-  activatedChildren.push(vm);
-}
-
-function callActivatedHooks (queue) {
-  for (var i = 0; i < queue.length; i++) {
-    queue[i]._inactive = true;
-    activateChildComponent(queue[i], true /* true */);
-  }
-}
-
-/**
- * Push a watcher into the watcher queue.
- * Jobs with duplicate IDs will be skipped unless it's
- * pushed when the queue is being flushed.
- */
-function queueWatcher (watcher) {
-  var id = watcher.id;
-  if (has[id] == null) {
-    has[id] = true;
-    if (!flushing) {
-      queue.push(watcher);
-    } else {
-      // if already flushing, splice the watcher based on its id
-      // if already past its id, it will be run next immediately.
-      var i = queue.length - 1;
-      while (i > index$6 && queue[i].id > watcher.id) {
-        i--;
-      }
-      queue.splice(i + 1, 0, watcher);
-    }
-    // queue the flush
-    if (!waiting) {
-      waiting = true;
-      nextTick(flushSchedulerQueue);
-    }
-  }
-}
-
-/*  */
-
-var uid$1 = 0;
-
-/**
- * A watcher parses an expression, collects dependencies,
- * and fires callback when the expression value changes.
- * This is used for both the $watch() api and directives.
- */
-var Watcher = function Watcher (
-  vm,
-  expOrFn,
-  cb,
-  options,
-  isRenderWatcher
-) {
-  this.vm = vm;
-  if (isRenderWatcher) {
-    vm._watcher = this;
-  }
-  vm._watchers.push(this);
-  // options
-  if (options) {
-    this.deep = !!options.deep;
-    this.user = !!options.user;
-    this.lazy = !!options.lazy;
-    this.sync = !!options.sync;
-  } else {
-    this.deep = this.user = this.lazy = this.sync = false;
-  }
-  this.cb = cb;
-  this.id = ++uid$1; // uid for batching
-  this.active = true;
-  this.dirty = this.lazy; // for lazy watchers
-  this.deps = [];
-  this.newDeps = [];
-  this.depIds = new _Set();
-  this.newDepIds = new _Set();
-  this.expression = process.env.NODE_ENV !== 'production'
-    ? expOrFn.toString()
-    : '';
-  // parse expression for getter
-  if (typeof expOrFn === 'function') {
-    this.getter = expOrFn;
-  } else {
-    this.getter = parsePath(expOrFn);
-    if (!this.getter) {
-      this.getter = function () {};
-      process.env.NODE_ENV !== 'production' && warn(
-        "Failed watching path: \"" + expOrFn + "\" " +
-        'Watcher only accepts simple dot-delimited paths. ' +
-        'For full control, use a function instead.',
-        vm
-      );
-    }
-  }
-  this.value = this.lazy
-    ? undefined
-    : this.get();
-};
-
-/**
- * Evaluate the getter, and re-collect dependencies.
- */
-Watcher.prototype.get = function get () {
-  pushTarget(this);
-  var value;
-  var vm = this.vm;
-  try {
-    value = this.getter.call(vm, vm);
-  } catch (e) {
-    if (this.user) {
-      handleError(e, vm, ("getter for watcher \"" + (this.expression) + "\""));
-    } else {
-      throw e
-    }
-  } finally {
-    // "touch" every property so they are all tracked as
-    // dependencies for deep watching
-    if (this.deep) {
-      traverse(value);
-    }
-    popTarget();
-    this.cleanupDeps();
-  }
-  return value
-};
-
-/**
- * Add a dependency to this directive.
- */
-Watcher.prototype.addDep = function addDep (dep) {
-  var id = dep.id;
-  if (!this.newDepIds.has(id)) {
-    this.newDepIds.add(id);
-    this.newDeps.push(dep);
-    if (!this.depIds.has(id)) {
-      dep.addSub(this);
-    }
-  }
-};
-
-/**
- * Clean up for dependency collection.
- */
-Watcher.prototype.cleanupDeps = function cleanupDeps () {
-    var this$1 = this;
-
-  var i = this.deps.length;
-  while (i--) {
-    var dep = this$1.deps[i];
-    if (!this$1.newDepIds.has(dep.id)) {
-      dep.removeSub(this$1);
-    }
-  }
-  var tmp = this.depIds;
-  this.depIds = this.newDepIds;
-  this.newDepIds = tmp;
-  this.newDepIds.clear();
-  tmp = this.deps;
-  this.deps = this.newDeps;
-  this.newDeps = tmp;
-  this.newDeps.length = 0;
-};
-
-/**
- * Subscriber interface.
- * Will be called when a dependency changes.
- */
-Watcher.prototype.update = function update () {
-  /* istanbul ignore else */
-  if (this.lazy) {
-    this.dirty = true;
-  } else if (this.sync) {
-    this.run();
-  } else {
-    queueWatcher(this);
-  }
-};
-
-/**
- * Scheduler job interface.
- * Will be called by the scheduler.
- */
-Watcher.prototype.run = function run () {
-  if (this.active) {
-    var value = this.get();
-    if (
-      value !== this.value ||
-      // Deep watchers and watchers on Object/Arrays should fire even
-      // when the value is the same, because the value may
-      // have mutated.
-      isObject(value) ||
-      this.deep
-    ) {
-      // set new value
-      var oldValue = this.value;
-      this.value = value;
-      if (this.user) {
-        try {
-          this.cb.call(this.vm, value, oldValue);
-        } catch (e) {
-          handleError(e, this.vm, ("callback for watcher \"" + (this.expression) + "\""));
-        }
-      } else {
-        this.cb.call(this.vm, value, oldValue);
-      }
-    }
-  }
-};
-
-/**
- * Evaluate the value of the watcher.
- * This only gets called for lazy watchers.
- */
-Watcher.prototype.evaluate = function evaluate () {
-  this.value = this.get();
-  this.dirty = false;
-};
-
-/**
- * Depend on all deps collected by this watcher.
- */
-Watcher.prototype.depend = function depend () {
-    var this$1 = this;
-
-  var i = this.deps.length;
-  while (i--) {
-    this$1.deps[i].depend();
-  }
-};
-
-/**
- * Remove self from all dependencies' subscriber list.
- */
-Watcher.prototype.teardown = function teardown () {
-    var this$1 = this;
-
-  if (this.active) {
-    // remove self from vm's watcher list
-    // this is a somewhat expensive operation so we skip it
-    // if the vm is being destroyed.
-    if (!this.vm._isBeingDestroyed) {
-      remove(this.vm._watchers, this);
-    }
-    var i = this.deps.length;
-    while (i--) {
-      this$1.deps[i].removeSub(this$1);
-    }
-    this.active = false;
-  }
-};
-
-/*  */
-
-var sharedPropertyDefinition = {
-  enumerable: true,
-  configurable: true,
-  get: noop,
-  set: noop
-};
-
-function proxy (target, sourceKey, key) {
-  sharedPropertyDefinition.get = function proxyGetter () {
-    return this[sourceKey][key]
-  };
-  sharedPropertyDefinition.set = function proxySetter (val) {
-    this[sourceKey][key] = val;
-  };
-  Object.defineProperty(target, key, sharedPropertyDefinition);
-}
-
-function initState (vm) {
-  vm._watchers = [];
-  var opts = vm.$options;
-  if (opts.props) { initProps(vm, opts.props); }
-  if (opts.methods) { initMethods(vm, opts.methods); }
-  if (opts.data) {
-    initData(vm);
-  } else {
-    observe(vm._data = {}, true /* asRootData */);
-  }
-  if (opts.computed) { initComputed(vm, opts.computed); }
-  if (opts.watch && opts.watch !== nativeWatch) {
-    initWatch(vm, opts.watch);
-  }
-}
-
-function initProps (vm, propsOptions) {
-  var propsData = vm.$options.propsData || {};
-  var props = vm._props = {};
-  // cache prop keys so that future props updates can iterate using Array
-  // instead of dynamic object key enumeration.
-  var keys = vm.$options._propKeys = [];
-  var isRoot = !vm.$parent;
-  // root instance props should be converted
-  if (!isRoot) {
-    toggleObserving(false);
-  }
-  var loop = function ( key ) {
-    keys.push(key);
-    var value = validateProp(key, propsOptions, propsData, vm);
-    /* istanbul ignore else */
-    if (process.env.NODE_ENV !== 'production') {
-      var hyphenatedKey = hyphenate(key);
-      if (isReservedAttribute(hyphenatedKey) ||
-          config.isReservedAttr(hyphenatedKey)) {
-        warn(
-          ("\"" + hyphenatedKey + "\" is a reserved attribute and cannot be used as component prop."),
-          vm
-        );
-      }
-      defineReactive(props, key, value, function () {
-        if (vm.$parent && !isUpdatingChildComponent) {
-          warn(
-            "Avoid mutating a prop directly since the value will be " +
-            "overwritten whenever the parent component re-renders. " +
-            "Instead, use a data or computed property based on the prop's " +
-            "value. Prop being mutated: \"" + key + "\"",
-            vm
-          );
-        }
-      });
-    } else {
-      defineReactive(props, key, value);
-    }
-    // static props are already proxied on the component's prototype
-    // during Vue.extend(). We only need to proxy props defined at
-    // instantiation here.
-    if (!(key in vm)) {
-      proxy(vm, "_props", key);
-    }
-  };
-
-  for (var key in propsOptions) { loop( key ); }
-  toggleObserving(true);
-}
-
-function initData (vm) {
-  var data = vm.$options.data;
-  data = vm._data = typeof data === 'function'
-    ? getData(data, vm)
-    : data || {};
-  if (!isPlainObject(data)) {
-    data = {};
-    process.env.NODE_ENV !== 'production' && warn(
-      'data functions should return an object:\n' +
-      'https://vuejs.org/v2/guide/components.html#data-Must-Be-a-Function',
-      vm
-    );
-  }
-  // proxy data on instance
-  var keys = Object.keys(data);
-  var props = vm.$options.props;
-  var methods = vm.$options.methods;
-  var i = keys.length;
-  while (i--) {
-    var key = keys[i];
-    if (process.env.NODE_ENV !== 'production') {
-      if (methods && hasOwn(methods, key)) {
-        warn(
-          ("Method \"" + key + "\" has already been defined as a data property."),
-          vm
-        );
-      }
-    }
-    if (props && hasOwn(props, key)) {
-      process.env.NODE_ENV !== 'production' && warn(
-        "The data property \"" + key + "\" is already declared as a prop. " +
-        "Use prop default value instead.",
-        vm
-      );
-    } else if (!isReserved(key)) {
-      proxy(vm, "_data", key);
-    }
-  }
-  // observe data
-  observe(data, true /* asRootData */);
-}
-
-function getData (data, vm) {
-  // #7573 disable dep collection when invoking data getters
-  pushTarget();
-  try {
-    return data.call(vm, vm)
-  } catch (e) {
-    handleError(e, vm, "data()");
-    return {}
-  } finally {
-    popTarget();
-  }
-}
-
-var computedWatcherOptions = { lazy: true };
-
-function initComputed (vm, computed) {
-  // $flow-disable-line
-  var watchers = vm._computedWatchers = Object.create(null);
-  // computed properties are just getters during SSR
-  var isSSR = isServerRendering();
-
-  for (var key in computed) {
-    var userDef = computed[key];
-    var getter = typeof userDef === 'function' ? userDef : userDef.get;
-    if (process.env.NODE_ENV !== 'production' && getter == null) {
-      warn(
-        ("Getter is missing for computed property \"" + key + "\"."),
-        vm
-      );
-    }
-
-    if (!isSSR) {
-      // create internal watcher for the computed property.
-      watchers[key] = new Watcher(
-        vm,
-        getter || noop,
-        noop,
-        computedWatcherOptions
-      );
-    }
-
-    // component-defined computed properties are already defined on the
-    // component prototype. We only need to define computed properties defined
-    // at instantiation here.
-    if (!(key in vm)) {
-      defineComputed(vm, key, userDef);
-    } else if (process.env.NODE_ENV !== 'production') {
-      if (key in vm.$data) {
-        warn(("The computed property \"" + key + "\" is already defined in data."), vm);
-      } else if (vm.$options.props && key in vm.$options.props) {
-        warn(("The computed property \"" + key + "\" is already defined as a prop."), vm);
-      }
-    }
-  }
-}
-
-function defineComputed (
-  target,
-  key,
-  userDef
-) {
-  var shouldCache = !isServerRendering();
-  if (typeof userDef === 'function') {
-    sharedPropertyDefinition.get = shouldCache
-      ? createComputedGetter(key)
-      : userDef;
-    sharedPropertyDefinition.set = noop;
-  } else {
-    sharedPropertyDefinition.get = userDef.get
-      ? shouldCache && userDef.cache !== false
-        ? createComputedGetter(key)
-        : userDef.get
-      : noop;
-    sharedPropertyDefinition.set = userDef.set
-      ? userDef.set
-      : noop;
-  }
-  if (process.env.NODE_ENV !== 'production' &&
-      sharedPropertyDefinition.set === noop) {
-    sharedPropertyDefinition.set = function () {
-      warn(
-        ("Computed property \"" + key + "\" was assigned to but it has no setter."),
-        this
-      );
-    };
-  }
-  Object.defineProperty(target, key, sharedPropertyDefinition);
-}
-
-function createComputedGetter (key) {
-  return function computedGetter () {
-    var watcher = this._computedWatchers && this._computedWatchers[key];
-    if (watcher) {
-      if (watcher.dirty) {
-        watcher.evaluate();
-      }
-      if (Dep.target) {
-        watcher.depend();
-      }
-      return watcher.value
-    }
-  }
-}
-
-function initMethods (vm, methods) {
-  var props = vm.$options.props;
-  for (var key in methods) {
-    if (process.env.NODE_ENV !== 'production') {
-      if (methods[key] == null) {
-        warn(
-          "Method \"" + key + "\" has an undefined value in the component definition. " +
-          "Did you reference the function correctly?",
-          vm
-        );
-      }
-      if (props && hasOwn(props, key)) {
-        warn(
-          ("Method \"" + key + "\" has already been defined as a prop."),
-          vm
-        );
-      }
-      if ((key in vm) && isReserved(key)) {
-        warn(
-          "Method \"" + key + "\" conflicts with an existing Vue instance method. " +
-          "Avoid defining component methods that start with _ or $."
-        );
-      }
-    }
-    vm[key] = methods[key] == null ? noop : bind(methods[key], vm);
-  }
-}
-
-function initWatch (vm, watch) {
-  for (var key in watch) {
-    var handler = watch[key];
-    if (Array.isArray(handler)) {
-      for (var i = 0; i < handler.length; i++) {
-        createWatcher(vm, key, handler[i]);
-      }
-    } else {
-      createWatcher(vm, key, handler);
-    }
-  }
-}
-
-function createWatcher (
-  vm,
-  expOrFn,
-  handler,
-  options
-) {
-  if (isPlainObject(handler)) {
-    options = handler;
-    handler = handler.handler;
-  }
-  if (typeof handler === 'string') {
-    handler = vm[handler];
-  }
-  return vm.$watch(expOrFn, handler, options)
-}
-
-function stateMixin (Vue) {
-  // flow somehow has problems with directly declared definition object
-  // when using Object.defineProperty, so we have to procedurally build up
-  // the object here.
-  var dataDef = {};
-  dataDef.get = function () { return this._data };
-  var propsDef = {};
-  propsDef.get = function () { return this._props };
-  if (process.env.NODE_ENV !== 'production') {
-    dataDef.set = function (newData) {
-      warn(
-        'Avoid replacing instance root $data. ' +
-        'Use nested data properties instead.',
-        this
-      );
-    };
-    propsDef.set = function () {
-      warn("$props is readonly.", this);
-    };
-  }
-  Object.defineProperty(Vue.prototype, '$data', dataDef);
-  Object.defineProperty(Vue.prototype, '$props', propsDef);
-
-  Vue.prototype.$set = set;
-  Vue.prototype.$delete = del;
-
-  Vue.prototype.$watch = function (
-    expOrFn,
-    cb,
-    options
-  ) {
-    var vm = this;
-    if (isPlainObject(cb)) {
-      return createWatcher(vm, expOrFn, cb, options)
-    }
-    options = options || {};
-    options.user = true;
-    var watcher = new Watcher(vm, expOrFn, cb, options);
-    if (options.immediate) {
-      cb.call(vm, watcher.value);
-    }
-    return function unwatchFn () {
-      watcher.teardown();
-    }
-  };
-}
-
-/*  */
-
-function initProvide (vm) {
-  var provide = vm.$options.provide;
-  if (provide) {
-    vm._provided = typeof provide === 'function'
-      ? provide.call(vm)
-      : provide;
-  }
-}
-
-function initInjections (vm) {
-  var result = resolveInject(vm.$options.inject, vm);
-  if (result) {
-    toggleObserving(false);
-    Object.keys(result).forEach(function (key) {
-      /* istanbul ignore else */
-      if (process.env.NODE_ENV !== 'production') {
-        defineReactive(vm, key, result[key], function () {
-          warn(
-            "Avoid mutating an injected value directly since the changes will be " +
-            "overwritten whenever the provided component re-renders. " +
-            "injection being mutated: \"" + key + "\"",
-            vm
-          );
-        });
-      } else {
-        defineReactive(vm, key, result[key]);
-      }
-    });
-    toggleObserving(true);
-  }
-}
-
-function resolveInject (inject, vm) {
-  if (inject) {
-    // inject is :any because flow is not smart enough to figure out cached
-    var result = Object.create(null);
-    var keys = hasSymbol
-      ? Reflect.ownKeys(inject).filter(function (key) {
-        /* istanbul ignore next */
-        return Object.getOwnPropertyDescriptor(inject, key).enumerable
-      })
-      : Object.keys(inject);
-
-    for (var i = 0; i < keys.length; i++) {
-      var key = keys[i];
-      var provideKey = inject[key].from;
-      var source = vm;
-      while (source) {
-        if (source._provided && hasOwn(source._provided, provideKey)) {
-          result[key] = source._provided[provideKey];
-          break
-        }
-        source = source.$parent;
-      }
-      if (!source) {
-        if ('default' in inject[key]) {
-          var provideDefault = inject[key].default;
-          result[key] = typeof provideDefault === 'function'
-            ? provideDefault.call(vm)
-            : provideDefault;
-        } else if (process.env.NODE_ENV !== 'production') {
-          warn(("Injection \"" + key + "\" not found"), vm);
-        }
-      }
-    }
-    return result
-  }
-}
-
-/*  */
-
-/**
- * Runtime helper for rendering v-for lists.
- */
-function renderList (
-  val,
-  render
-) {
-  var ret, i, l, keys, key;
-  if (Array.isArray(val) || typeof val === 'string') {
-    ret = new Array(val.length);
-    for (i = 0, l = val.length; i < l; i++) {
-      ret[i] = render(val[i], i);
-    }
-  } else if (typeof val === 'number') {
-    ret = new Array(val);
-    for (i = 0; i < val; i++) {
-      ret[i] = render(i + 1, i);
-    }
-  } else if (isObject(val)) {
-    keys = Object.keys(val);
-    ret = new Array(keys.length);
-    for (i = 0, l = keys.length; i < l; i++) {
-      key = keys[i];
-      ret[i] = render(val[key], key, i);
-    }
-  }
-  if (isDef(ret)) {
-    (ret)._isVList = true;
-  }
-  return ret
-}
-
-/*  */
-
-/**
- * Runtime helper for rendering <slot>
- */
-function renderSlot (
-  name,
-  fallback,
-  props,
-  bindObject
-) {
-  var scopedSlotFn = this.$scopedSlots[name];
-  var nodes;
-  if (scopedSlotFn) { // scoped slot
-    props = props || {};
-    if (bindObject) {
-      if (process.env.NODE_ENV !== 'production' && !isObject(bindObject)) {
-        warn(
-          'slot v-bind without argument expects an Object',
-          this
-        );
-      }
-      props = extend(extend({}, bindObject), props);
-    }
-    nodes = scopedSlotFn(props) || fallback;
-  } else {
-    var slotNodes = this.$slots[name];
-    // warn duplicate slot usage
-    if (slotNodes) {
-      if (process.env.NODE_ENV !== 'production' && slotNodes._rendered) {
-        warn(
-          "Duplicate presence of slot \"" + name + "\" found in the same render tree " +
-          "- this will likely cause render errors.",
-          this
-        );
-      }
-      slotNodes._rendered = true;
-    }
-    nodes = slotNodes || fallback;
-  }
-
-  var target = props && props.slot;
-  if (target) {
-    return this.$createElement('template', { slot: target }, nodes)
-  } else {
-    return nodes
-  }
-}
-
-/*  */
-
-/**
- * Runtime helper for resolving filters
- */
-function resolveFilter (id) {
-  return resolveAsset(this.$options, 'filters', id, true) || identity
-}
-
-/*  */
-
-function isKeyNotMatch (expect, actual) {
-  if (Array.isArray(expect)) {
-    return expect.indexOf(actual) === -1
-  } else {
-    return expect !== actual
-  }
-}
-
-/**
- * Runtime helper for checking keyCodes from config.
- * exposed as Vue.prototype._k
- * passing in eventKeyName as last argument separately for backwards compat
- */
-function checkKeyCodes (
-  eventKeyCode,
-  key,
-  builtInKeyCode,
-  eventKeyName,
-  builtInKeyName
-) {
-  var mappedKeyCode = config.keyCodes[key] || builtInKeyCode;
-  if (builtInKeyName && eventKeyName && !config.keyCodes[key]) {
-    return isKeyNotMatch(builtInKeyName, eventKeyName)
-  } else if (mappedKeyCode) {
-    return isKeyNotMatch(mappedKeyCode, eventKeyCode)
-  } else if (eventKeyName) {
-    return hyphenate(eventKeyName) !== key
-  }
-}
-
-/*  */
-
-/**
- * Runtime helper for merging v-bind="object" into a VNode's data.
- */
-function bindObjectProps (
-  data,
-  tag,
-  value,
-  asProp,
-  isSync
-) {
-  if (value) {
-    if (!isObject(value)) {
-      process.env.NODE_ENV !== 'production' && warn(
-        'v-bind without argument expects an Object or Array value',
-        this
-      );
-    } else {
-      if (Array.isArray(value)) {
-        value = toObject(value);
-      }
-      var hash;
-      var loop = function ( key ) {
-        if (
-          key === 'class' ||
-          key === 'style' ||
-          isReservedAttribute(key)
-        ) {
-          hash = data;
-        } else {
-          var type = data.attrs && data.attrs.type;
-          hash = asProp || config.mustUseProp(tag, type, key)
-            ? data.domProps || (data.domProps = {})
-            : data.attrs || (data.attrs = {});
-        }
-        if (!(key in hash)) {
-          hash[key] = value[key];
-
-          if (isSync) {
-            var on = data.on || (data.on = {});
-            on[("update:" + key)] = function ($event) {
-              value[key] = $event;
-            };
-          }
-        }
-      };
-
-      for (var key in value) { loop( key ); }
-    }
-  }
-  return data
-}
-
-/*  */
-
-/**
- * Runtime helper for rendering static trees.
- */
-function renderStatic (
-  index,
-  isInFor
-) {
-  var cached = this._staticTrees || (this._staticTrees = []);
-  var tree = cached[index];
-  // if has already-rendered static tree and not inside v-for,
-  // we can reuse the same tree.
-  if (tree && !isInFor) {
-    return tree
-  }
-  // otherwise, render a fresh tree.
-  tree = cached[index] = this.$options.staticRenderFns[index].call(
-    this._renderProxy,
-    null,
-    this // for render fns generated for functional component templates
-  );
-  markStatic(tree, ("__static__" + index), false);
-  return tree
-}
-
-/**
- * Runtime helper for v-once.
- * Effectively it means marking the node as static with a unique key.
- */
-function markOnce (
-  tree,
-  index,
-  key
-) {
-  markStatic(tree, ("__once__" + index + (key ? ("_" + key) : "")), true);
-  return tree
-}
-
-function markStatic (
-  tree,
-  key,
-  isOnce
-) {
-  if (Array.isArray(tree)) {
-    for (var i = 0; i < tree.length; i++) {
-      if (tree[i] && typeof tree[i] !== 'string') {
-        markStaticNode(tree[i], (key + "_" + i), isOnce);
-      }
-    }
-  } else {
-    markStaticNode(tree, key, isOnce);
-  }
-}
-
-function markStaticNode (node, key, isOnce) {
-  node.isStatic = true;
-  node.key = key;
-  node.isOnce = isOnce;
-}
-
-/*  */
-
-function bindObjectListeners (data, value) {
-  if (value) {
-    if (!isPlainObject(value)) {
-      process.env.NODE_ENV !== 'production' && warn(
-        'v-on without argument expects an Object value',
-        this
-      );
-    } else {
-      var on = data.on = data.on ? extend({}, data.on) : {};
-      for (var key in value) {
-        var existing = on[key];
-        var ours = value[key];
-        on[key] = existing ? [].concat(existing, ours) : ours;
-      }
-    }
-  }
-  return data
-}
-
-/*  */
-
-function installRenderHelpers (target) {
-  target._o = markOnce;
-  target._n = toNumber;
-  target._s = toString;
-  target._l = renderList;
-  target._t = renderSlot;
-  target._q = looseEqual;
-  target._i = looseIndexOf;
-  target._m = renderStatic;
-  target._f = resolveFilter;
-  target._k = checkKeyCodes;
-  target._b = bindObjectProps;
-  target._v = createTextVNode;
-  target._e = createEmptyVNode;
-  target._u = resolveScopedSlots;
-  target._g = bindObjectListeners;
-}
-
-/*  */
-
-function FunctionalRenderContext (
-  data,
-  props,
-  children,
-  parent,
-  Ctor
-) {
-  var options = Ctor.options;
-  // ensure the createElement function in functional components
-  // gets a unique context - this is necessary for correct named slot check
-  var contextVm;
-  if (hasOwn(parent, '_uid')) {
-    contextVm = Object.create(parent);
-    // $flow-disable-line
-    contextVm._original = parent;
-  } else {
-    // the context vm passed in is a functional context as well.
-    // in this case we want to make sure we are able to get a hold to the
-    // real context instance.
-    contextVm = parent;
-    // $flow-disable-line
-    parent = parent._original;
-  }
-  var isCompiled = isTrue(options._compiled);
-  var needNormalization = !isCompiled;
-
-  this.data = data;
-  this.props = props;
-  this.children = children;
-  this.parent = parent;
-  this.listeners = data.on || emptyObject;
-  this.injections = resolveInject(options.inject, parent);
-  this.slots = function () { return resolveSlots(children, parent); };
-
-  // support for compiled functional template
-  if (isCompiled) {
-    // exposing $options for renderStatic()
-    this.$options = options;
-    // pre-resolve slots for renderSlot()
-    this.$slots = this.slots();
-    this.$scopedSlots = data.scopedSlots || emptyObject;
-  }
-
-  if (options._scopeId) {
-    this._c = function (a, b, c, d) {
-      var vnode = createElement(contextVm, a, b, c, d, needNormalization);
-      if (vnode && !Array.isArray(vnode)) {
-        vnode.fnScopeId = options._scopeId;
-        vnode.fnContext = parent;
-      }
-      return vnode
-    };
-  } else {
-    this._c = function (a, b, c, d) { return createElement(contextVm, a, b, c, d, needNormalization); };
-  }
-}
-
-installRenderHelpers(FunctionalRenderContext.prototype);
-
-function createFunctionalComponent (
-  Ctor,
-  propsData,
-  data,
-  contextVm,
-  children
-) {
-  var options = Ctor.options;
-  var props = {};
-  var propOptions = options.props;
-  if (isDef(propOptions)) {
-    for (var key in propOptions) {
-      props[key] = validateProp(key, propOptions, propsData || emptyObject);
-    }
-  } else {
-    if (isDef(data.attrs)) { mergeProps(props, data.attrs); }
-    if (isDef(data.props)) { mergeProps(props, data.props); }
-  }
-
-  var renderContext = new FunctionalRenderContext(
-    data,
-    props,
-    children,
-    contextVm,
-    Ctor
-  );
-
-  var vnode = options.render.call(null, renderContext._c, renderContext);
-
-  if (vnode instanceof VNode) {
-    return cloneAndMarkFunctionalResult(vnode, data, renderContext.parent, options)
-  } else if (Array.isArray(vnode)) {
-    var vnodes = normalizeChildren(vnode) || [];
-    var res = new Array(vnodes.length);
-    for (var i = 0; i < vnodes.length; i++) {
-      res[i] = cloneAndMarkFunctionalResult(vnodes[i], data, renderContext.parent, options);
-    }
-    return res
-  }
-}
-
-function cloneAndMarkFunctionalResult (vnode, data, contextVm, options) {
-  // #7817 clone node before setting fnContext, otherwise if the node is reused
-  // (e.g. it was from a cached normal slot) the fnContext causes named slots
-  // that should not be matched to match.
-  var clone = cloneVNode(vnode);
-  clone.fnContext = contextVm;
-  clone.fnOptions = options;
-  if (data.slot) {
-    (clone.data || (clone.data = {})).slot = data.slot;
-  }
-  return clone
-}
-
-function mergeProps (to, from) {
-  for (var key in from) {
-    to[camelize(key)] = from[key];
-  }
-}
-
-/*  */
-
-
-
-
-// Register the component hook to weex native render engine.
-// The hook will be triggered by native, not javascript.
-
-
-// Updates the state of the component to weex native render engine.
-
-/*  */
-
-// https://github.com/Hanks10100/weex-native-directive/tree/master/component
-
-// listening on native callback
-
-/*  */
-
-/*  */
-
-// inline hooks to be invoked on component VNodes during patch
-var componentVNodeHooks = {
-  init: function init (
-    vnode,
-    hydrating,
-    parentElm,
-    refElm
-  ) {
-    if (
-      vnode.componentInstance &&
-      !vnode.componentInstance._isDestroyed &&
-      vnode.data.keepAlive
-    ) {
-      // kept-alive components, treat as a patch
-      var mountedNode = vnode; // work around flow
-      componentVNodeHooks.prepatch(mountedNode, mountedNode);
-    } else {
-      var child = vnode.componentInstance = createComponentInstanceForVnode(
-        vnode,
-        activeInstance,
-        parentElm,
-        refElm
-      );
-      child.$mount(hydrating ? vnode.elm : undefined, hydrating);
-    }
-  },
-
-  prepatch: function prepatch (oldVnode, vnode) {
-    var options = vnode.componentOptions;
-    var child = vnode.componentInstance = oldVnode.componentInstance;
-    updateChildComponent(
-      child,
-      options.propsData, // updated props
-      options.listeners, // updated listeners
-      vnode, // new parent vnode
-      options.children // new children
-    );
-  },
-
-  insert: function insert (vnode) {
-    var context = vnode.context;
-    var componentInstance = vnode.componentInstance;
-    if (!componentInstance._isMounted) {
-      componentInstance._isMounted = true;
-      callHook(componentInstance, 'mounted');
-    }
-    if (vnode.data.keepAlive) {
-      if (context._isMounted) {
-        // vue-router#1212
-        // During updates, a kept-alive component's child components may
-        // change, so directly walking the tree here may call activated hooks
-        // on incorrect children. Instead we push them into a queue which will
-        // be processed after the whole patch process ended.
-        queueActivatedComponent(componentInstance);
-      } else {
-        activateChildComponent(componentInstance, true /* direct */);
-      }
-    }
-  },
-
-  destroy: function destroy (vnode) {
-    var componentInstance = vnode.componentInstance;
-    if (!componentInstance._isDestroyed) {
-      if (!vnode.data.keepAlive) {
-        componentInstance.$destroy();
-      } else {
-        deactivateChildComponent(componentInstance, true /* direct */);
-      }
-    }
-  }
-};
-
-var hooksToMerge = Object.keys(componentVNodeHooks);
-
-function createComponent (
-  Ctor,
-  data,
-  context,
-  children,
-  tag
-) {
-  if (isUndef(Ctor)) {
-    return
-  }
-
-  var baseCtor = context.$options._base;
-
-  // plain options object: turn it into a constructor
-  if (isObject(Ctor)) {
-    Ctor = baseCtor.extend(Ctor);
-  }
-
-  // if at this stage it's not a constructor or an async component factory,
-  // reject.
-  if (typeof Ctor !== 'function') {
-    if (process.env.NODE_ENV !== 'production') {
-      warn(("Invalid Component definition: " + (String(Ctor))), context);
-    }
-    return
-  }
-
-  // async component
-  var asyncFactory;
-  if (isUndef(Ctor.cid)) {
-    asyncFactory = Ctor;
-    Ctor = resolveAsyncComponent(asyncFactory, baseCtor, context);
-    if (Ctor === undefined) {
-      // return a placeholder node for async component, which is rendered
-      // as a comment node but preserves all the raw information for the node.
-      // the information will be used for async server-rendering and hydration.
-      return createAsyncPlaceholder(
-        asyncFactory,
-        data,
-        context,
-        children,
-        tag
-      )
-    }
-  }
-
-  data = data || {};
-
-  // resolve constructor options in case global mixins are applied after
-  // component constructor creation
-  resolveConstructorOptions(Ctor);
-
-  // transform component v-model data into props & events
-  if (isDef(data.model)) {
-    transformModel(Ctor.options, data);
-  }
-
-  // extract props
-  var propsData = extractPropsFromVNodeData(data, Ctor, tag);
-
-  // functional component
-  if (isTrue(Ctor.options.functional)) {
-    return createFunctionalComponent(Ctor, propsData, data, context, children)
-  }
-
-  // extract listeners, since these needs to be treated as
-  // child component listeners instead of DOM listeners
-  var listeners = data.on;
-  // replace with listeners with .native modifier
-  // so it gets processed during parent component patch.
-  data.on = data.nativeOn;
-
-  if (isTrue(Ctor.options.abstract)) {
-    // abstract components do not keep anything
-    // other than props & listeners & slot
-
-    // work around flow
-    var slot = data.slot;
-    data = {};
-    if (slot) {
-      data.slot = slot;
-    }
-  }
-
-  // install component management hooks onto the placeholder node
-  installComponentHooks(data);
-
-  // return a placeholder vnode
-  var name = Ctor.options.name || tag;
-  var vnode = new VNode(
-    ("vue-component-" + (Ctor.cid) + (name ? ("-" + name) : '')),
-    data, undefined, undefined, undefined, context,
-    { Ctor: Ctor, propsData: propsData, listeners: listeners, tag: tag, children: children },
-    asyncFactory
-  );
-
-  // Weex specific: invoke recycle-list optimized @render function for
-  // extracting cell-slot template.
-  // https://github.com/Hanks10100/weex-native-directive/tree/master/component
-  /* istanbul ignore if */
-  return vnode
-}
-
-function createComponentInstanceForVnode (
-  vnode, // we know it's MountedComponentVNode but flow doesn't
-  parent, // activeInstance in lifecycle state
-  parentElm,
-  refElm
-) {
-  var options = {
-    _isComponent: true,
-    parent: parent,
-    _parentVnode: vnode,
-    _parentElm: parentElm || null,
-    _refElm: refElm || null
-  };
-  // check inline-template render functions
-  var inlineTemplate = vnode.data.inlineTemplate;
-  if (isDef(inlineTemplate)) {
-    options.render = inlineTemplate.render;
-    options.staticRenderFns = inlineTemplate.staticRenderFns;
-  }
-  return new vnode.componentOptions.Ctor(options)
-}
-
-function installComponentHooks (data) {
-  var hooks = data.hook || (data.hook = {});
-  for (var i = 0; i < hooksToMerge.length; i++) {
-    var key = hooksToMerge[i];
-    hooks[key] = componentVNodeHooks[key];
-  }
-}
-
-// transform component v-model info (value and callback) into
-// prop and event handler respectively.
-function transformModel (options, data) {
-  var prop = (options.model && options.model.prop) || 'value';
-  var event = (options.model && options.model.event) || 'input';(data.props || (data.props = {}))[prop] = data.model.value;
-  var on = data.on || (data.on = {});
-  if (isDef(on[event])) {
-    on[event] = [data.model.callback].concat(on[event]);
-  } else {
-    on[event] = data.model.callback;
-  }
-}
-
-/*  */
-
-var SIMPLE_NORMALIZE = 1;
-var ALWAYS_NORMALIZE = 2;
-
-// wrapper function for providing a more flexible interface
-// without getting yelled at by flow
-function createElement (
-  context,
-  tag,
-  data,
-  children,
-  normalizationType,
-  alwaysNormalize
-) {
-  if (Array.isArray(data) || isPrimitive(data)) {
-    normalizationType = children;
-    children = data;
-    data = undefined;
-  }
-  if (isTrue(alwaysNormalize)) {
-    normalizationType = ALWAYS_NORMALIZE;
-  }
-  return _createElement(context, tag, data, children, normalizationType)
-}
-
-function _createElement (
-  context,
-  tag,
-  data,
-  children,
-  normalizationType
-) {
-  if (isDef(data) && isDef((data).__ob__)) {
-    process.env.NODE_ENV !== 'production' && warn(
-      "Avoid using observed data object as vnode data: " + (JSON.stringify(data)) + "\n" +
-      'Always create fresh vnode data objects in each render!',
-      context
-    );
-    return createEmptyVNode()
-  }
-  // object syntax in v-bind
-  if (isDef(data) && isDef(data.is)) {
-    tag = data.is;
-  }
-  if (!tag) {
-    // in case of component :is set to falsy value
-    return createEmptyVNode()
-  }
-  // warn against non-primitive key
-  if (process.env.NODE_ENV !== 'production' &&
-    isDef(data) && isDef(data.key) && !isPrimitive(data.key)
-  ) {
-    {
-      warn(
-        'Avoid using non-primitive value as key, ' +
-        'use string/number value instead.',
-        context
-      );
-    }
-  }
-  // support single function children as default scoped slot
-  if (Array.isArray(children) &&
-    typeof children[0] === 'function'
-  ) {
-    data = data || {};
-    data.scopedSlots = { default: children[0] };
-    children.length = 0;
-  }
-  if (normalizationType === ALWAYS_NORMALIZE) {
-    children = normalizeChildren(children);
-  } else if (normalizationType === SIMPLE_NORMALIZE) {
-    children = simpleNormalizeChildren(children);
-  }
-  var vnode, ns;
-  if (typeof tag === 'string') {
-    var Ctor;
-    ns = (context.$vnode && context.$vnode.ns) || config.getTagNamespace(tag);
-    if (config.isReservedTag(tag)) {
-      // platform built-in elements
-      vnode = new VNode(
-        config.parsePlatformTagName(tag), data, children,
-        undefined, undefined, context
-      );
-    } else if (isDef(Ctor = resolveAsset(context.$options, 'components', tag))) {
-      // component
-      vnode = createComponent(Ctor, data, context, children, tag);
-    } else {
-      // unknown or unlisted namespaced elements
-      // check at runtime because it may get assigned a namespace when its
-      // parent normalizes children
-      vnode = new VNode(
-        tag, data, children,
-        undefined, undefined, context
-      );
-    }
-  } else {
-    // direct component options / constructor
-    vnode = createComponent(tag, data, context, children);
-  }
-  if (Array.isArray(vnode)) {
-    return vnode
-  } else if (isDef(vnode)) {
-    if (isDef(ns)) { applyNS(vnode, ns); }
-    if (isDef(data)) { registerDeepBindings(data); }
-    return vnode
-  } else {
-    return createEmptyVNode()
-  }
-}
-
-function applyNS (vnode, ns, force) {
-  vnode.ns = ns;
-  if (vnode.tag === 'foreignObject') {
-    // use default namespace inside foreignObject
-    ns = undefined;
-    force = true;
-  }
-  if (isDef(vnode.children)) {
-    for (var i = 0, l = vnode.children.length; i < l; i++) {
-      var child = vnode.children[i];
-      if (isDef(child.tag) && (
-        isUndef(child.ns) || (isTrue(force) && child.tag !== 'svg'))) {
-        applyNS(child, ns, force);
-      }
-    }
-  }
-}
-
-// ref #5318
-// necessary to ensure parent re-render when deep bindings like :style and
-// :class are used on slot nodes
-function registerDeepBindings (data) {
-  if (isObject(data.style)) {
-    traverse(data.style);
-  }
-  if (isObject(data.class)) {
-    traverse(data.class);
-  }
-}
-
-/*  */
-
-function initRender (vm) {
-  vm._vnode = null; // the root of the child tree
-  vm._staticTrees = null; // v-once cached trees
-  var options = vm.$options;
-  var parentVnode = vm.$vnode = options._parentVnode; // the placeholder node in parent tree
-  var renderContext = parentVnode && parentVnode.context;
-  vm.$slots = resolveSlots(options._renderChildren, renderContext);
-  vm.$scopedSlots = emptyObject;
-  // bind the createElement fn to this instance
-  // so that we get proper render context inside it.
-  // args order: tag, data, children, normalizationType, alwaysNormalize
-  // internal version is used by render functions compiled from templates
-  vm._c = function (a, b, c, d) { return createElement(vm, a, b, c, d, false); };
-  // normalization is always applied for the public version, used in
-  // user-written render functions.
-  vm.$createElement = function (a, b, c, d) { return createElement(vm, a, b, c, d, true); };
-
-  // $attrs & $listeners are exposed for easier HOC creation.
-  // they need to be reactive so that HOCs using them are always updated
-  var parentData = parentVnode && parentVnode.data;
-
-  /* istanbul ignore else */
-  if (process.env.NODE_ENV !== 'production') {
-    defineReactive(vm, '$attrs', parentData && parentData.attrs || emptyObject, function () {
-      !isUpdatingChildComponent && warn("$attrs is readonly.", vm);
-    }, true);
-    defineReactive(vm, '$listeners', options._parentListeners || emptyObject, function () {
-      !isUpdatingChildComponent && warn("$listeners is readonly.", vm);
-    }, true);
-  } else {
-    defineReactive(vm, '$attrs', parentData && parentData.attrs || emptyObject, null, true);
-    defineReactive(vm, '$listeners', options._parentListeners || emptyObject, null, true);
-  }
-}
-
-function renderMixin (Vue) {
-  // install runtime convenience helpers
-  installRenderHelpers(Vue.prototype);
-
-  Vue.prototype.$nextTick = function (fn) {
-    return nextTick(fn, this)
-  };
-
-  Vue.prototype._render = function () {
-    var vm = this;
-    var ref = vm.$options;
-    var render = ref.render;
-    var _parentVnode = ref._parentVnode;
-
-    // reset _rendered flag on slots for duplicate slot check
-    if (process.env.NODE_ENV !== 'production') {
-      for (var key in vm.$slots) {
-        // $flow-disable-line
-        vm.$slots[key]._rendered = false;
-      }
-    }
-
-    if (_parentVnode) {
-      vm.$scopedSlots = _parentVnode.data.scopedSlots || emptyObject;
-    }
-
-    // set parent vnode. this allows render functions to have access
-    // to the data on the placeholder node.
-    vm.$vnode = _parentVnode;
-    // render self
-    var vnode;
-    try {
-      vnode = render.call(vm._renderProxy, vm.$createElement);
-    } catch (e) {
-      handleError(e, vm, "render");
-      // return error render result,
-      // or previous vnode to prevent render error causing blank component
-      /* istanbul ignore else */
-      if (process.env.NODE_ENV !== 'production') {
-        if (vm.$options.renderError) {
-          try {
-            vnode = vm.$options.renderError.call(vm._renderProxy, vm.$createElement, e);
-          } catch (e) {
-            handleError(e, vm, "renderError");
-            vnode = vm._vnode;
-          }
-        } else {
-          vnode = vm._vnode;
-        }
-      } else {
-        vnode = vm._vnode;
-      }
-    }
-    // return empty vnode in case the render function errored out
-    if (!(vnode instanceof VNode)) {
-      if (process.env.NODE_ENV !== 'production' && Array.isArray(vnode)) {
-        warn(
-          'Multiple root nodes returned from render function. Render function ' +
-          'should return a single root node.',
-          vm
-        );
-      }
-      vnode = createEmptyVNode();
-    }
-    // set parent
-    vnode.parent = _parentVnode;
-    return vnode
-  };
-}
-
-/*  */
-
-var uid$3 = 0;
-
-function initMixin (Vue) {
-  Vue.prototype._init = function (options) {
-    var vm = this;
-    // a uid
-    vm._uid = uid$3++;
-
-    var startTag, endTag;
-    /* istanbul ignore if */
-    if (process.env.NODE_ENV !== 'production' && config.performance && mark) {
-      startTag = "vue-perf-start:" + (vm._uid);
-      endTag = "vue-perf-end:" + (vm._uid);
-      mark(startTag);
-    }
-
-    // a flag to avoid this being observed
-    vm._isVue = true;
-    // merge options
-    if (options && options._isComponent) {
-      // optimize internal component instantiation
-      // since dynamic options merging is pretty slow, and none of the
-      // internal component options needs special treatment.
-      initInternalComponent(vm, options);
-    } else {
-      vm.$options = mergeOptions(
-        resolveConstructorOptions(vm.constructor),
-        options || {},
-        vm
-      );
-    }
-    /* istanbul ignore else */
-    if (process.env.NODE_ENV !== 'production') {
-      initProxy(vm);
-    } else {
-      vm._renderProxy = vm;
-    }
-    // expose real self
-    vm._self = vm;
-    initLifecycle(vm);
-    initEvents(vm);
-    initRender(vm);
-    callHook(vm, 'beforeCreate');
-    initInjections(vm); // resolve injections before data/props
-    initState(vm);
-    initProvide(vm); // resolve provide after data/props
-    callHook(vm, 'created');
-
-    /* istanbul ignore if */
-    if (process.env.NODE_ENV !== 'production' && config.performance && mark) {
-      vm._name = formatComponentName(vm, false);
-      mark(endTag);
-      measure(("vue " + (vm._name) + " init"), startTag, endTag);
-    }
-
-    if (vm.$options.el) {
-      vm.$mount(vm.$options.el);
-    }
-  };
-}
-
-function initInternalComponent (vm, options) {
-  var opts = vm.$options = Object.create(vm.constructor.options);
-  // doing this because it's faster than dynamic enumeration.
-  var parentVnode = options._parentVnode;
-  opts.parent = options.parent;
-  opts._parentVnode = parentVnode;
-  opts._parentElm = options._parentElm;
-  opts._refElm = options._refElm;
-
-  var vnodeComponentOptions = parentVnode.componentOptions;
-  opts.propsData = vnodeComponentOptions.propsData;
-  opts._parentListeners = vnodeComponentOptions.listeners;
-  opts._renderChildren = vnodeComponentOptions.children;
-  opts._componentTag = vnodeComponentOptions.tag;
-
-  if (options.render) {
-    opts.render = options.render;
-    opts.staticRenderFns = options.staticRenderFns;
-  }
-}
-
-function resolveConstructorOptions (Ctor) {
-  var options = Ctor.options;
-  if (Ctor.super) {
-    var superOptions = resolveConstructorOptions(Ctor.super);
-    var cachedSuperOptions = Ctor.superOptions;
-    if (superOptions !== cachedSuperOptions) {
-      // super option changed,
-      // need to resolve new options.
-      Ctor.superOptions = superOptions;
-      // check if there are any late-modified/attached options (#4976)
-      var modifiedOptions = resolveModifiedOptions(Ctor);
-      // update base extend options
-      if (modifiedOptions) {
-        extend(Ctor.extendOptions, modifiedOptions);
-      }
-      options = Ctor.options = mergeOptions(superOptions, Ctor.extendOptions);
-      if (options.name) {
-        options.components[options.name] = Ctor;
-      }
-    }
-  }
-  return options
-}
-
-function resolveModifiedOptions (Ctor) {
-  var modified;
-  var latest = Ctor.options;
-  var extended = Ctor.extendOptions;
-  var sealed = Ctor.sealedOptions;
-  for (var key in latest) {
-    if (latest[key] !== sealed[key]) {
-      if (!modified) { modified = {}; }
-      modified[key] = dedupe(latest[key], extended[key], sealed[key]);
-    }
-  }
-  return modified
-}
-
-function dedupe (latest, extended, sealed) {
-  // compare latest and sealed to ensure lifecycle hooks won't be duplicated
-  // between merges
-  if (Array.isArray(latest)) {
-    var res = [];
-    sealed = Array.isArray(sealed) ? sealed : [sealed];
-    extended = Array.isArray(extended) ? extended : [extended];
-    for (var i = 0; i < latest.length; i++) {
-      // push original options and not sealed options to exclude duplicated options
-      if (extended.indexOf(latest[i]) >= 0 || sealed.indexOf(latest[i]) < 0) {
-        res.push(latest[i]);
-      }
-    }
-    return res
-  } else {
-    return latest
-  }
-}
-
-function Vue (options) {
-  if (process.env.NODE_ENV !== 'production' &&
-    !(this instanceof Vue)
-  ) {
-    warn('Vue is a constructor and should be called with the `new` keyword');
-  }
-  this._init(options);
-}
-
-initMixin(Vue);
-stateMixin(Vue);
-eventsMixin(Vue);
-lifecycleMixin(Vue);
-renderMixin(Vue);
-
-/*  */
-
-function initUse (Vue) {
-  Vue.use = function (plugin) {
-    var installedPlugins = (this._installedPlugins || (this._installedPlugins = []));
-    if (installedPlugins.indexOf(plugin) > -1) {
-      return this
-    }
-
-    // additional parameters
-    var args = toArray(arguments, 1);
-    args.unshift(this);
-    if (typeof plugin.install === 'function') {
-      plugin.install.apply(plugin, args);
-    } else if (typeof plugin === 'function') {
-      plugin.apply(null, args);
-    }
-    installedPlugins.push(plugin);
-    return this
-  };
-}
-
-/*  */
-
-function initMixin$1 (Vue) {
-  Vue.mixin = function (mixin) {
-    this.options = mergeOptions(this.options, mixin);
-    return this
-  };
-}
-
-/*  */
-
-function initExtend (Vue) {
-  /**
-   * Each instance constructor, including Vue, has a unique
-   * cid. This enables us to create wrapped "child
-   * constructors" for prototypal inheritance and cache them.
-   */
-  Vue.cid = 0;
-  var cid = 1;
-
-  /**
-   * Class inheritance
-   */
-  Vue.extend = function (extendOptions) {
-    extendOptions = extendOptions || {};
-    var Super = this;
-    var SuperId = Super.cid;
-    var cachedCtors = extendOptions._Ctor || (extendOptions._Ctor = {});
-    if (cachedCtors[SuperId]) {
-      return cachedCtors[SuperId]
-    }
-
-    var name = extendOptions.name || Super.options.name;
-    if (process.env.NODE_ENV !== 'production' && name) {
-      validateComponentName(name);
-    }
-
-    var Sub = function VueComponent (options) {
-      this._init(options);
-    };
-    Sub.prototype = Object.create(Super.prototype);
-    Sub.prototype.constructor = Sub;
-    Sub.cid = cid++;
-    Sub.options = mergeOptions(
-      Super.options,
-      extendOptions
-    );
-    Sub['super'] = Super;
-
-    // For props and computed properties, we define the proxy getters on
-    // the Vue instances at extension time, on the extended prototype. This
-    // avoids Object.defineProperty calls for each instance created.
-    if (Sub.options.props) {
-      initProps$1(Sub);
-    }
-    if (Sub.options.computed) {
-      initComputed$1(Sub);
-    }
-
-    // allow further extension/mixin/plugin usage
-    Sub.extend = Super.extend;
-    Sub.mixin = Super.mixin;
-    Sub.use = Super.use;
-
-    // create asset registers, so extended classes
-    // can have their private assets too.
-    ASSET_TYPES.forEach(function (type) {
-      Sub[type] = Super[type];
-    });
-    // enable recursive self-lookup
-    if (name) {
-      Sub.options.components[name] = Sub;
-    }
-
-    // keep a reference to the super options at extension time.
-    // later at instantiation we can check if Super's options have
-    // been updated.
-    Sub.superOptions = Super.options;
-    Sub.extendOptions = extendOptions;
-    Sub.sealedOptions = extend({}, Sub.options);
-
-    // cache constructor
-    cachedCtors[SuperId] = Sub;
-    return Sub
-  };
-}
-
-function initProps$1 (Comp) {
-  var props = Comp.options.props;
-  for (var key in props) {
-    proxy(Comp.prototype, "_props", key);
-  }
-}
-
-function initComputed$1 (Comp) {
-  var computed = Comp.options.computed;
-  for (var key in computed) {
-    defineComputed(Comp.prototype, key, computed[key]);
-  }
-}
-
-/*  */
-
-function initAssetRegisters (Vue) {
-  /**
-   * Create asset registration methods.
-   */
-  ASSET_TYPES.forEach(function (type) {
-    Vue[type] = function (
-      id,
-      definition
-    ) {
-      if (!definition) {
-        return this.options[type + 's'][id]
-      } else {
-        /* istanbul ignore if */
-        if (process.env.NODE_ENV !== 'production' && type === 'component') {
-          validateComponentName(id);
-        }
-        if (type === 'component' && isPlainObject(definition)) {
-          definition.name = definition.name || id;
-          definition = this.options._base.extend(definition);
-        }
-        if (type === 'directive' && typeof definition === 'function') {
-          definition = { bind: definition, update: definition };
-        }
-        this.options[type + 's'][id] = definition;
-        return definition
-      }
-    };
-  });
-}
-
-/*  */
-
-function getComponentName (opts) {
-  return opts && (opts.Ctor.options.name || opts.tag)
-}
-
-function matches (pattern, name) {
-  if (Array.isArray(pattern)) {
-    return pattern.indexOf(name) > -1
-  } else if (typeof pattern === 'string') {
-    return pattern.split(',').indexOf(name) > -1
-  } else if (isRegExp(pattern)) {
-    return pattern.test(name)
-  }
-  /* istanbul ignore next */
-  return false
-}
-
-function pruneCache (keepAliveInstance, filter) {
-  var cache = keepAliveInstance.cache;
-  var keys = keepAliveInstance.keys;
-  var _vnode = keepAliveInstance._vnode;
-  for (var key in cache) {
-    var cachedNode = cache[key];
-    if (cachedNode) {
-      var name = getComponentName(cachedNode.componentOptions);
-      if (name && !filter(name)) {
-        pruneCacheEntry(cache, key, keys, _vnode);
-      }
-    }
-  }
-}
-
-function pruneCacheEntry (
-  cache,
-  key,
-  keys,
-  current
-) {
-  var cached$$1 = cache[key];
-  if (cached$$1 && (!current || cached$$1.tag !== current.tag)) {
-    cached$$1.componentInstance.$destroy();
-  }
-  cache[key] = null;
-  remove(keys, key);
-}
-
-var patternTypes = [String, RegExp, Array];
-
-var KeepAlive = {
-  name: 'keep-alive',
-  abstract: true,
-
-  props: {
-    include: patternTypes,
-    exclude: patternTypes,
-    max: [String, Number]
-  },
-
-  created: function created () {
-    this.cache = Object.create(null);
-    this.keys = [];
-  },
-
-  destroyed: function destroyed () {
-    var this$1 = this;
-
-    for (var key in this$1.cache) {
-      pruneCacheEntry(this$1.cache, key, this$1.keys);
-    }
-  },
-
-  mounted: function mounted () {
-    var this$1 = this;
-
-    this.$watch('include', function (val) {
-      pruneCache(this$1, function (name) { return matches(val, name); });
-    });
-    this.$watch('exclude', function (val) {
-      pruneCache(this$1, function (name) { return !matches(val, name); });
-    });
-  },
-
-  render: function render () {
-    var slot = this.$slots.default;
-    var vnode = getFirstComponentChild(slot);
-    var componentOptions = vnode && vnode.componentOptions;
-    if (componentOptions) {
-      // check pattern
-      var name = getComponentName(componentOptions);
-      var ref = this;
-      var include = ref.include;
-      var exclude = ref.exclude;
-      if (
-        // not included
-        (include && (!name || !matches(include, name))) ||
-        // excluded
-        (exclude && name && matches(exclude, name))
-      ) {
-        return vnode
-      }
-
-      var ref$1 = this;
-      var cache = ref$1.cache;
-      var keys = ref$1.keys;
-      var key = vnode.key == null
-        // same constructor may get registered as different local components
-        // so cid alone is not enough (#3269)
-        ? componentOptions.Ctor.cid + (componentOptions.tag ? ("::" + (componentOptions.tag)) : '')
-        : vnode.key;
-      if (cache[key]) {
-        vnode.componentInstance = cache[key].componentInstance;
-        // make current key freshest
-        remove(keys, key);
-        keys.push(key);
-      } else {
-        cache[key] = vnode;
-        keys.push(key);
-        // prune oldest entry
-        if (this.max && keys.length > parseInt(this.max)) {
-          pruneCacheEntry(cache, keys[0], keys, this._vnode);
-        }
-      }
-
-      vnode.data.keepAlive = true;
-    }
-    return vnode || (slot && slot[0])
-  }
-};
-
-var builtInComponents = {
-  KeepAlive: KeepAlive
-};
-
-/*  */
-
-function initGlobalAPI (Vue) {
-  // config
-  var configDef = {};
-  configDef.get = function () { return config; };
-  if (process.env.NODE_ENV !== 'production') {
-    configDef.set = function () {
-      warn(
-        'Do not replace the Vue.config object, set individual fields instead.'
-      );
-    };
-  }
-  Object.defineProperty(Vue, 'config', configDef);
-
-  // exposed util methods.
-  // NOTE: these are not considered part of the public API - avoid relying on
-  // them unless you are aware of the risk.
-  Vue.util = {
-    warn: warn,
-    extend: extend,
-    mergeOptions: mergeOptions,
-    defineReactive: defineReactive
-  };
-
-  Vue.set = set;
-  Vue.delete = del;
-  Vue.nextTick = nextTick;
-
-  Vue.options = Object.create(null);
-  ASSET_TYPES.forEach(function (type) {
-    Vue.options[type + 's'] = Object.create(null);
-  });
-
-  // this is used to identify the "base" constructor to extend all plain-object
-  // components with in Weex's multi-instance scenarios.
-  Vue.options._base = Vue;
-
-  extend(Vue.options.components, builtInComponents);
-
-  initUse(Vue);
-  initMixin$1(Vue);
-  initExtend(Vue);
-  initAssetRegisters(Vue);
-}
-
-initGlobalAPI(Vue);
-
-Object.defineProperty(Vue.prototype, '$isServer', {
-  get: isServerRendering
-});
-
-Object.defineProperty(Vue.prototype, '$ssrContext', {
-  get: function get () {
-    /* istanbul ignore next */
-    return this.$vnode && this.$vnode.ssrContext
-  }
-});
-
-// expose FunctionalRenderContext for ssr runtime helper installation
-Object.defineProperty(Vue, 'FunctionalRenderContext', {
-  value: FunctionalRenderContext
-});
-
-Vue.version = '2.5.17';
-
-/*  */
-
-// these are reserved for web because they are directly compiled away
-// during template compilation
-var isReservedAttr = makeMap('style,class');
-
-// attributes that should be using props for binding
-var acceptValue = makeMap('input,textarea,option,select,progress');
-var mustUseProp = function (tag, type, attr) {
-  return (
-    (attr === 'value' && acceptValue(tag)) && type !== 'button' ||
-    (attr === 'selected' && tag === 'option') ||
-    (attr === 'checked' && tag === 'input') ||
-    (attr === 'muted' && tag === 'video')
-  )
-};
-
-var isEnumeratedAttr = makeMap('contenteditable,draggable,spellcheck');
-
-var isBooleanAttr = makeMap(
-  'allowfullscreen,async,autofocus,autoplay,checked,compact,controls,declare,' +
-  'default,defaultchecked,defaultmuted,defaultselected,defer,disabled,' +
-  'enabled,formnovalidate,hidden,indeterminate,inert,ismap,itemscope,loop,multiple,' +
-  'muted,nohref,noresize,noshade,novalidate,nowrap,open,pauseonexit,readonly,' +
-  'required,reversed,scoped,seamless,selected,sortable,translate,' +
-  'truespeed,typemustmatch,visible'
-);
-
-var xlinkNS = 'http://www.w3.org/1999/xlink';
-
-var isXlink = function (name) {
-  return name.charAt(5) === ':' && name.slice(0, 5) === 'xlink'
-};
-
-var getXlinkProp = function (name) {
-  return isXlink(name) ? name.slice(6, name.length) : ''
-};
-
-var isFalsyAttrValue = function (val) {
-  return val == null || val === false
-};
-
-/*  */
-
-function genClassForVnode (vnode) {
-  var data = vnode.data;
-  var parentNode = vnode;
-  var childNode = vnode;
-  while (isDef(childNode.componentInstance)) {
-    childNode = childNode.componentInstance._vnode;
-    if (childNode && childNode.data) {
-      data = mergeClassData(childNode.data, data);
-    }
-  }
-  while (isDef(parentNode = parentNode.parent)) {
-    if (parentNode && parentNode.data) {
-      data = mergeClassData(data, parentNode.data);
-    }
-  }
-  return renderClass(data.staticClass, data.class)
-}
-
-function mergeClassData (child, parent) {
-  return {
-    staticClass: concat(child.staticClass, parent.staticClass),
-    class: isDef(child.class)
-      ? [child.class, parent.class]
-      : parent.class
-  }
-}
-
-function renderClass (
-  staticClass,
-  dynamicClass
-) {
-  if (isDef(staticClass) || isDef(dynamicClass)) {
-    return concat(staticClass, stringifyClass(dynamicClass))
-  }
-  /* istanbul ignore next */
-  return ''
-}
-
-function concat (a, b) {
-  return a ? b ? (a + ' ' + b) : a : (b || '')
-}
-
-function stringifyClass (value) {
-  if (Array.isArray(value)) {
-    return stringifyArray(value)
-  }
-  if (isObject(value)) {
-    return stringifyObject(value)
-  }
-  if (typeof value === 'string') {
-    return value
-  }
-  /* istanbul ignore next */
-  return ''
-}
-
-function stringifyArray (value) {
-  var res = '';
-  var stringified;
-  for (var i = 0, l = value.length; i < l; i++) {
-    if (isDef(stringified = stringifyClass(value[i])) && stringified !== '') {
-      if (res) { res += ' '; }
-      res += stringified;
-    }
-  }
-  return res
-}
-
-function stringifyObject (value) {
-  var res = '';
-  for (var key in value) {
-    if (value[key]) {
-      if (res) { res += ' '; }
-      res += key;
-    }
-  }
-  return res
-}
-
-/*  */
-
-var namespaceMap = {
-  svg: 'http://www.w3.org/2000/svg',
-  math: 'http://www.w3.org/1998/Math/MathML'
-};
-
-var isHTMLTag = makeMap(
-  'html,body,base,head,link,meta,style,title,' +
-  'address,article,aside,footer,header,h1,h2,h3,h4,h5,h6,hgroup,nav,section,' +
-  'div,dd,dl,dt,figcaption,figure,picture,hr,img,li,main,ol,p,pre,ul,' +
-  'a,b,abbr,bdi,bdo,br,cite,code,data,dfn,em,i,kbd,mark,q,rp,rt,rtc,ruby,' +
-  's,samp,small,span,strong,sub,sup,time,u,var,wbr,area,audio,map,track,video,' +
-  'embed,object,param,source,canvas,script,noscript,del,ins,' +
-  'caption,col,colgroup,table,thead,tbody,td,th,tr,' +
-  'button,datalist,fieldset,form,input,label,legend,meter,optgroup,option,' +
-  'output,progress,select,textarea,' +
-  'details,dialog,menu,menuitem,summary,' +
-  'content,element,shadow,template,blockquote,iframe,tfoot'
-);
-
-// this map is intentionally selective, only covering SVG elements that may
-// contain child elements.
-var isSVG = makeMap(
-  'svg,animate,circle,clippath,cursor,defs,desc,ellipse,filter,font-face,' +
-  'foreignObject,g,glyph,image,line,marker,mask,missing-glyph,path,pattern,' +
-  'polygon,polyline,rect,switch,symbol,text,textpath,tspan,use,view',
-  true
-);
-
-
-
-var isReservedTag = function (tag) {
-  return isHTMLTag(tag) || isSVG(tag)
-};
-
-function getTagNamespace (tag) {
-  if (isSVG(tag)) {
-    return 'svg'
-  }
-  // basic support for MathML
-  // note it doesn't support other MathML elements being component roots
-  if (tag === 'math') {
-    return 'math'
-  }
-}
-
-var unknownElementCache = Object.create(null);
-function isUnknownElement (tag) {
-  /* istanbul ignore if */
-  if (!inBrowser) {
-    return true
-  }
-  if (isReservedTag(tag)) {
-    return false
-  }
-  tag = tag.toLowerCase();
-  /* istanbul ignore if */
-  if (unknownElementCache[tag] != null) {
-    return unknownElementCache[tag]
-  }
-  var el = document.createElement(tag);
-  if (tag.indexOf('-') > -1) {
-    // http://stackoverflow.com/a/28210364/1070244
-    return (unknownElementCache[tag] = (
-      el.constructor === window.HTMLUnknownElement ||
-      el.constructor === window.HTMLElement
-    ))
-  } else {
-    return (unknownElementCache[tag] = /HTMLUnknownElement/.test(el.toString()))
-  }
-}
-
-var isTextInputType = makeMap('text,number,password,search,email,tel,url');
-
-/*  */
-
-/**
- * Query an element selector if it's not an element already.
- */
-function query (el) {
-  if (typeof el === 'string') {
-    var selected = document.querySelector(el);
-    if (!selected) {
-      process.env.NODE_ENV !== 'production' && warn(
-        'Cannot find element: ' + el
-      );
-      return document.createElement('div')
-    }
-    return selected
-  } else {
-    return el
-  }
-}
-
-/*  */
-
-function createElement$1 (tagName, vnode) {
-  var elm = document.createElement(tagName);
-  if (tagName !== 'select') {
-    return elm
-  }
-  // false or null will remove the attribute but undefined will not
-  if (vnode.data && vnode.data.attrs && vnode.data.attrs.multiple !== undefined) {
-    elm.setAttribute('multiple', 'multiple');
-  }
-  return elm
-}
-
-function createElementNS (namespace, tagName) {
-  return document.createElementNS(namespaceMap[namespace], tagName)
-}
-
-function createTextNode (text) {
-  return document.createTextNode(text)
-}
-
-function createComment (text) {
-  return document.createComment(text)
-}
-
-function insertBefore (parentNode, newNode, referenceNode) {
-  parentNode.insertBefore(newNode, referenceNode);
-}
-
-function removeChild (node, child) {
-  node.removeChild(child);
-}
-
-function appendChild (node, child) {
-  node.appendChild(child);
-}
-
-function parentNode (node) {
-  return node.parentNode
-}
-
-function nextSibling (node) {
-  return node.nextSibling
-}
-
-function tagName (node) {
-  return node.tagName
-}
-
-function setTextContent (node, text) {
-  node.textContent = text;
-}
-
-function setStyleScope (node, scopeId) {
-  node.setAttribute(scopeId, '');
-}
-
-
-var nodeOps = Object.freeze({
-	createElement: createElement$1,
-	createElementNS: createElementNS,
-	createTextNode: createTextNode,
-	createComment: createComment,
-	insertBefore: insertBefore,
-	removeChild: removeChild,
-	appendChild: appendChild,
-	parentNode: parentNode,
-	nextSibling: nextSibling,
-	tagName: tagName,
-	setTextContent: setTextContent,
-	setStyleScope: setStyleScope
-});
-
-/*  */
-
-var ref = {
-  create: function create (_, vnode) {
-    registerRef(vnode);
-  },
-  update: function update (oldVnode, vnode) {
-    if (oldVnode.data.ref !== vnode.data.ref) {
-      registerRef(oldVnode, true);
-      registerRef(vnode);
-    }
-  },
-  destroy: function destroy (vnode) {
-    registerRef(vnode, true);
-  }
-};
-
-function registerRef (vnode, isRemoval) {
-  var key = vnode.data.ref;
-  if (!isDef(key)) { return }
-
-  var vm = vnode.context;
-  var ref = vnode.componentInstance || vnode.elm;
-  var refs = vm.$refs;
-  if (isRemoval) {
-    if (Array.isArray(refs[key])) {
-      remove(refs[key], ref);
-    } else if (refs[key] === ref) {
-      refs[key] = undefined;
-    }
-  } else {
-    if (vnode.data.refInFor) {
-      if (!Array.isArray(refs[key])) {
-        refs[key] = [ref];
-      } else if (refs[key].indexOf(ref) < 0) {
-        // $flow-disable-line
-        refs[key].push(ref);
-      }
-    } else {
-      refs[key] = ref;
-    }
-  }
-}
-
-/**
- * Virtual DOM patching algorithm based on Snabbdom by
- * Simon Friis Vindum (@paldepind)
- * Licensed under the MIT License
- * https://github.com/paldepind/snabbdom/blob/master/LICENSE
- *
- * modified by Evan You (@yyx990803)
- *
- * Not type-checking this because this file is perf-critical and the cost
- * of making flow understand it is not worth it.
- */
-
-var emptyNode = new VNode('', {}, []);
-
-var hooks = ['create', 'activate', 'update', 'remove', 'destroy'];
-
-function sameVnode (a, b) {
-  return (
-    a.key === b.key && (
-      (
-        a.tag === b.tag &&
-        a.isComment === b.isComment &&
-        isDef(a.data) === isDef(b.data) &&
-        sameInputType(a, b)
-      ) || (
-        isTrue(a.isAsyncPlaceholder) &&
-        a.asyncFactory === b.asyncFactory &&
-        isUndef(b.asyncFactory.error)
-      )
-    )
-  )
-}
-
-function sameInputType (a, b) {
-  if (a.tag !== 'input') { return true }
-  var i;
-  var typeA = isDef(i = a.data) && isDef(i = i.attrs) && i.type;
-  var typeB = isDef(i = b.data) && isDef(i = i.attrs) && i.type;
-  return typeA === typeB || isTextInputType(typeA) && isTextInputType(typeB)
-}
-
-function createKeyToOldIdx (children, beginIdx, endIdx) {
-  var i, key;
-  var map = {};
-  for (i = beginIdx; i <= endIdx; ++i) {
-    key = children[i].key;
-    if (isDef(key)) { map[key] = i; }
-  }
-  return map
-}
-
-function createPatchFunction (backend) {
-  var i, j;
-  var cbs = {};
-
-  var modules = backend.modules;
-  var nodeOps = backend.nodeOps;
-
-  for (i = 0; i < hooks.length; ++i) {
-    cbs[hooks[i]] = [];
-    for (j = 0; j < modules.length; ++j) {
-      if (isDef(modules[j][hooks[i]])) {
-        cbs[hooks[i]].push(modules[j][hooks[i]]);
-      }
-    }
-  }
-
-  function emptyNodeAt (elm) {
-    return new VNode(nodeOps.tagName(elm).toLowerCase(), {}, [], undefined, elm)
-  }
-
-  function createRmCb (childElm, listeners) {
-    function remove () {
-      if (--remove.listeners === 0) {
-        removeNode(childElm);
-      }
-    }
-    remove.listeners = listeners;
-    return remove
-  }
-
-  function removeNode (el) {
-    var parent = nodeOps.parentNode(el);
-    // element may have already been removed due to v-html / v-text
-    if (isDef(parent)) {
-      nodeOps.removeChild(parent, el);
-    }
-  }
-
-  function isUnknownElement$$1 (vnode, inVPre) {
-    return (
-      !inVPre &&
-      !vnode.ns &&
-      !(
-        config.ignoredElements.length &&
-        config.ignoredElements.some(function (ignore) {
-          return isRegExp(ignore)
-            ? ignore.test(vnode.tag)
-            : ignore === vnode.tag
-        })
-      ) &&
-      config.isUnknownElement(vnode.tag)
-    )
-  }
-
-  var creatingElmInVPre = 0;
-
-  function createElm (
-    vnode,
-    insertedVnodeQueue,
-    parentElm,
-    refElm,
-    nested,
-    ownerArray,
-    index
-  ) {
-    if (isDef(vnode.elm) && isDef(ownerArray)) {
-      // This vnode was used in a previous render!
-      // now it's used as a new node, overwriting its elm would cause
-      // potential patch errors down the road when it's used as an insertion
-      // reference node. Instead, we clone the node on-demand before creating
-      // associated DOM element for it.
-      vnode = ownerArray[index] = cloneVNode(vnode);
-    }
-
-    vnode.isRootInsert = !nested; // for transition enter check
-    if (createComponent(vnode, insertedVnodeQueue, parentElm, refElm)) {
-      return
-    }
-
-    var data = vnode.data;
-    var children = vnode.children;
-    var tag = vnode.tag;
-    if (isDef(tag)) {
-      if (process.env.NODE_ENV !== 'production') {
-        if (data && data.pre) {
-          creatingElmInVPre++;
-        }
-        if (isUnknownElement$$1(vnode, creatingElmInVPre)) {
-          warn(
-            'Unknown custom element: <' + tag + '> - did you ' +
-            'register the component correctly? For recursive components, ' +
-            'make sure to provide the "name" option.',
-            vnode.context
-          );
-        }
-      }
-
-      vnode.elm = vnode.ns
-        ? nodeOps.createElementNS(vnode.ns, tag)
-        : nodeOps.createElement(tag, vnode);
-      setScope(vnode);
-
-      /* istanbul ignore if */
-      {
-        createChildren(vnode, children, insertedVnodeQueue);
-        if (isDef(data)) {
-          invokeCreateHooks(vnode, insertedVnodeQueue);
-        }
-        insert(parentElm, vnode.elm, refElm);
-      }
-
-      if (process.env.NODE_ENV !== 'production' && data && data.pre) {
-        creatingElmInVPre--;
-      }
-    } else if (isTrue(vnode.isComment)) {
-      vnode.elm = nodeOps.createComment(vnode.text);
-      insert(parentElm, vnode.elm, refElm);
-    } else {
-      vnode.elm = nodeOps.createTextNode(vnode.text);
-      insert(parentElm, vnode.elm, refElm);
-    }
-  }
-
-  function createComponent (vnode, insertedVnodeQueue, parentElm, refElm) {
-    var i = vnode.data;
-    if (isDef(i)) {
-      var isReactivated = isDef(vnode.componentInstance) && i.keepAlive;
-      if (isDef(i = i.hook) && isDef(i = i.init)) {
-        i(vnode, false /* hydrating */, parentElm, refElm);
-      }
-      // after calling the init hook, if the vnode is a child component
-      // it should've created a child instance and mounted it. the child
-      // component also has set the placeholder vnode's elm.
-      // in that case we can just return the element and be done.
-      if (isDef(vnode.componentInstance)) {
-        initComponent(vnode, insertedVnodeQueue);
-        if (isTrue(isReactivated)) {
-          reactivateComponent(vnode, insertedVnodeQueue, parentElm, refElm);
-        }
-        return true
-      }
-    }
-  }
-
-  function initComponent (vnode, insertedVnodeQueue) {
-    if (isDef(vnode.data.pendingInsert)) {
-      insertedVnodeQueue.push.apply(insertedVnodeQueue, vnode.data.pendingInsert);
-      vnode.data.pendingInsert = null;
-    }
-    vnode.elm = vnode.componentInstance.$el;
-    if (isPatchable(vnode)) {
-      invokeCreateHooks(vnode, insertedVnodeQueue);
-      setScope(vnode);
-    } else {
-      // empty component root.
-      // skip all element-related modules except for ref (#3455)
-      registerRef(vnode);
-      // make sure to invoke the insert hook
-      insertedVnodeQueue.push(vnode);
-    }
-  }
-
-  function reactivateComponent (vnode, insertedVnodeQueue, parentElm, refElm) {
-    var i;
-    // hack for #4339: a reactivated component with inner transition
-    // does not trigger because the inner node's created hooks are not called
-    // again. It's not ideal to involve module-specific logic in here but
-    // there doesn't seem to be a better way to do it.
-    var innerNode = vnode;
-    while (innerNode.componentInstance) {
-      innerNode = innerNode.componentInstance._vnode;
-      if (isDef(i = innerNode.data) && isDef(i = i.transition)) {
-        for (i = 0; i < cbs.activate.length; ++i) {
-          cbs.activate[i](emptyNode, innerNode);
-        }
-        insertedVnodeQueue.push(innerNode);
-        break
-      }
-    }
-    // unlike a newly created component,
-    // a reactivated keep-alive component doesn't insert itself
-    insert(parentElm, vnode.elm, refElm);
-  }
-
-  function insert (parent, elm, ref$$1) {
-    if (isDef(parent)) {
-      if (isDef(ref$$1)) {
-        if (ref$$1.parentNode === parent) {
-          nodeOps.insertBefore(parent, elm, ref$$1);
-        }
-      } else {
-        nodeOps.appendChild(parent, elm);
-      }
-    }
-  }
-
-  function createChildren (vnode, children, insertedVnodeQueue) {
-    if (Array.isArray(children)) {
-      if (process.env.NODE_ENV !== 'production') {
-        checkDuplicateKeys(children);
-      }
-      for (var i = 0; i < children.length; ++i) {
-        createElm(children[i], insertedVnodeQueue, vnode.elm, null, true, children, i);
-      }
-    } else if (isPrimitive(vnode.text)) {
-      nodeOps.appendChild(vnode.elm, nodeOps.createTextNode(String(vnode.text)));
-    }
-  }
-
-  function isPatchable (vnode) {
-    while (vnode.componentInstance) {
-      vnode = vnode.componentInstance._vnode;
-    }
-    return isDef(vnode.tag)
-  }
-
-  function invokeCreateHooks (vnode, insertedVnodeQueue) {
-    for (var i$1 = 0; i$1 < cbs.create.length; ++i$1) {
-      cbs.create[i$1](emptyNode, vnode);
-    }
-    i = vnode.data.hook; // Reuse variable
-    if (isDef(i)) {
-      if (isDef(i.create)) { i.create(emptyNode, vnode); }
-      if (isDef(i.insert)) { insertedVnodeQueue.push(vnode); }
-    }
-  }
-
-  // set scope id attribute for scoped CSS.
-  // this is implemented as a special case to avoid the overhead
-  // of going through the normal attribute patching process.
-  function setScope (vnode) {
-    var i;
-    if (isDef(i = vnode.fnScopeId)) {
-      nodeOps.setStyleScope(vnode.elm, i);
-    } else {
-      var ancestor = vnode;
-      while (ancestor) {
-        if (isDef(i = ancestor.context) && isDef(i = i.$options._scopeId)) {
-          nodeOps.setStyleScope(vnode.elm, i);
-        }
-        ancestor = ancestor.parent;
-      }
-    }
-    // for slot content they should also get the scopeId from the host instance.
-    if (isDef(i = activeInstance) &&
-      i !== vnode.context &&
-      i !== vnode.fnContext &&
-      isDef(i = i.$options._scopeId)
-    ) {
-      nodeOps.setStyleScope(vnode.elm, i);
-    }
-  }
-
-  function addVnodes (parentElm, refElm, vnodes, startIdx, endIdx, insertedVnodeQueue) {
-    for (; startIdx <= endIdx; ++startIdx) {
-      createElm(vnodes[startIdx], insertedVnodeQueue, parentElm, refElm, false, vnodes, startIdx);
-    }
-  }
-
-  function invokeDestroyHook (vnode) {
-    var i, j;
-    var data = vnode.data;
-    if (isDef(data)) {
-      if (isDef(i = data.hook) && isDef(i = i.destroy)) { i(vnode); }
-      for (i = 0; i < cbs.destroy.length; ++i) { cbs.destroy[i](vnode); }
-    }
-    if (isDef(i = vnode.children)) {
-      for (j = 0; j < vnode.children.length; ++j) {
-        invokeDestroyHook(vnode.children[j]);
-      }
-    }
-  }
-
-  function removeVnodes (parentElm, vnodes, startIdx, endIdx) {
-    for (; startIdx <= endIdx; ++startIdx) {
-      var ch = vnodes[startIdx];
-      if (isDef(ch)) {
-        if (isDef(ch.tag)) {
-          removeAndInvokeRemoveHook(ch);
-          invokeDestroyHook(ch);
-        } else { // Text node
-          removeNode(ch.elm);
-        }
-      }
-    }
-  }
-
-  function removeAndInvokeRemoveHook (vnode, rm) {
-    if (isDef(rm) || isDef(vnode.data)) {
-      var i;
-      var listeners = cbs.remove.length + 1;
-      if (isDef(rm)) {
-        // we have a recursively passed down rm callback
-        // increase the listeners count
-        rm.listeners += listeners;
-      } else {
-        // directly removing
-        rm = createRmCb(vnode.elm, listeners);
-      }
-      // recursively invoke hooks on child component root node
-      if (isDef(i = vnode.componentInstance) && isDef(i = i._vnode) && isDef(i.data)) {
-        removeAndInvokeRemoveHook(i, rm);
-      }
-      for (i = 0; i < cbs.remove.length; ++i) {
-        cbs.remove[i](vnode, rm);
-      }
-      if (isDef(i = vnode.data.hook) && isDef(i = i.remove)) {
-        i(vnode, rm);
-      } else {
-        rm();
-      }
-    } else {
-      removeNode(vnode.elm);
-    }
-  }
-
-  function updateChildren (parentElm, oldCh, newCh, insertedVnodeQueue, removeOnly) {
-    var oldStartIdx = 0;
-    var newStartIdx = 0;
-    var oldEndIdx = oldCh.length - 1;
-    var oldStartVnode = oldCh[0];
-    var oldEndVnode = oldCh[oldEndIdx];
-    var newEndIdx = newCh.length - 1;
-    var newStartVnode = newCh[0];
-    var newEndVnode = newCh[newEndIdx];
-    var oldKeyToIdx, idxInOld, vnodeToMove, refElm;
-
-    // removeOnly is a special flag used only by <transition-group>
-    // to ensure removed elements stay in correct relative positions
-    // during leaving transitions
-    var canMove = !removeOnly;
-
-    if (process.env.NODE_ENV !== 'production') {
-      checkDuplicateKeys(newCh);
-    }
-
-    while (oldStartIdx <= oldEndIdx && newStartIdx <= newEndIdx) {
-      if (isUndef(oldStartVnode)) {
-        oldStartVnode = oldCh[++oldStartIdx]; // Vnode has been moved left
-      } else if (isUndef(oldEndVnode)) {
-        oldEndVnode = oldCh[--oldEndIdx];
-      } else if (sameVnode(oldStartVnode, newStartVnode)) {
-        patchVnode(oldStartVnode, newStartVnode, insertedVnodeQueue);
-        oldStartVnode = oldCh[++oldStartIdx];
-        newStartVnode = newCh[++newStartIdx];
-      } else if (sameVnode(oldEndVnode, newEndVnode)) {
-        patchVnode(oldEndVnode, newEndVnode, insertedVnodeQueue);
-        oldEndVnode = oldCh[--oldEndIdx];
-        newEndVnode = newCh[--newEndIdx];
-      } else if (sameVnode(oldStartVnode, newEndVnode)) { // Vnode moved right
-        patchVnode(oldStartVnode, newEndVnode, insertedVnodeQueue);
-        canMove && nodeOps.insertBefore(parentElm, oldStartVnode.elm, nodeOps.nextSibling(oldEndVnode.elm));
-        oldStartVnode = oldCh[++oldStartIdx];
-        newEndVnode = newCh[--newEndIdx];
-      } else if (sameVnode(oldEndVnode, newStartVnode)) { // Vnode moved left
-        patchVnode(oldEndVnode, newStartVnode, insertedVnodeQueue);
-        canMove && nodeOps.insertBefore(parentElm, oldEndVnode.elm, oldStartVnode.elm);
-        oldEndVnode = oldCh[--oldEndIdx];
-        newStartVnode = newCh[++newStartIdx];
-      } else {
-        if (isUndef(oldKeyToIdx)) { oldKeyToIdx = createKeyToOldIdx(oldCh, oldStartIdx, oldEndIdx); }
-        idxInOld = isDef(newStartVnode.key)
-          ? oldKeyToIdx[newStartVnode.key]
-          : findIdxInOld(newStartVnode, oldCh, oldStartIdx, oldEndIdx);
-        if (isUndef(idxInOld)) { // New element
-          createElm(newStartVnode, insertedVnodeQueue, parentElm, oldStartVnode.elm, false, newCh, newStartIdx);
-        } else {
-          vnodeToMove = oldCh[idxInOld];
-          if (sameVnode(vnodeToMove, newStartVnode)) {
-            patchVnode(vnodeToMove, newStartVnode, insertedVnodeQueue);
-            oldCh[idxInOld] = undefined;
-            canMove && nodeOps.insertBefore(parentElm, vnodeToMove.elm, oldStartVnode.elm);
-          } else {
-            // same key but different element. treat as new element
-            createElm(newStartVnode, insertedVnodeQueue, parentElm, oldStartVnode.elm, false, newCh, newStartIdx);
-          }
-        }
-        newStartVnode = newCh[++newStartIdx];
-      }
-    }
-    if (oldStartIdx > oldEndIdx) {
-      refElm = isUndef(newCh[newEndIdx + 1]) ? null : newCh[newEndIdx + 1].elm;
-      addVnodes(parentElm, refElm, newCh, newStartIdx, newEndIdx, insertedVnodeQueue);
-    } else if (newStartIdx > newEndIdx) {
-      removeVnodes(parentElm, oldCh, oldStartIdx, oldEndIdx);
-    }
-  }
-
-  function checkDuplicateKeys (children) {
-    var seenKeys = {};
-    for (var i = 0; i < children.length; i++) {
-      var vnode = children[i];
-      var key = vnode.key;
-      if (isDef(key)) {
-        if (seenKeys[key]) {
-          warn(
-            ("Duplicate keys detected: '" + key + "'. This may cause an update error."),
-            vnode.context
-          );
-        } else {
-          seenKeys[key] = true;
-        }
-      }
-    }
-  }
-
-  function findIdxInOld (node, oldCh, start, end) {
-    for (var i = start; i < end; i++) {
-      var c = oldCh[i];
-      if (isDef(c) && sameVnode(node, c)) { return i }
-    }
-  }
-
-  function patchVnode (oldVnode, vnode, insertedVnodeQueue, removeOnly) {
-    if (oldVnode === vnode) {
-      return
-    }
-
-    var elm = vnode.elm = oldVnode.elm;
-
-    if (isTrue(oldVnode.isAsyncPlaceholder)) {
-      if (isDef(vnode.asyncFactory.resolved)) {
-        hydrate(oldVnode.elm, vnode, insertedVnodeQueue);
-      } else {
-        vnode.isAsyncPlaceholder = true;
-      }
-      return
-    }
-
-    // reuse element for static trees.
-    // note we only do this if the vnode is cloned -
-    // if the new node is not cloned it means the render functions have been
-    // reset by the hot-reload-api and we need to do a proper re-render.
-    if (isTrue(vnode.isStatic) &&
-      isTrue(oldVnode.isStatic) &&
-      vnode.key === oldVnode.key &&
-      (isTrue(vnode.isCloned) || isTrue(vnode.isOnce))
-    ) {
-      vnode.componentInstance = oldVnode.componentInstance;
-      return
-    }
-
-    var i;
-    var data = vnode.data;
-    if (isDef(data) && isDef(i = data.hook) && isDef(i = i.prepatch)) {
-      i(oldVnode, vnode);
-    }
-
-    var oldCh = oldVnode.children;
-    var ch = vnode.children;
-    if (isDef(data) && isPatchable(vnode)) {
-      for (i = 0; i < cbs.update.length; ++i) { cbs.update[i](oldVnode, vnode); }
-      if (isDef(i = data.hook) && isDef(i = i.update)) { i(oldVnode, vnode); }
-    }
-    if (isUndef(vnode.text)) {
-      if (isDef(oldCh) && isDef(ch)) {
-        if (oldCh !== ch) { updateChildren(elm, oldCh, ch, insertedVnodeQueue, removeOnly); }
-      } else if (isDef(ch)) {
-        if (isDef(oldVnode.text)) { nodeOps.setTextContent(elm, ''); }
-        addVnodes(elm, null, ch, 0, ch.length - 1, insertedVnodeQueue);
-      } else if (isDef(oldCh)) {
-        removeVnodes(elm, oldCh, 0, oldCh.length - 1);
-      } else if (isDef(oldVnode.text)) {
-        nodeOps.setTextContent(elm, '');
-      }
-    } else if (oldVnode.text !== vnode.text) {
-      nodeOps.setTextContent(elm, vnode.text);
-    }
-    if (isDef(data)) {
-      if (isDef(i = data.hook) && isDef(i = i.postpatch)) { i(oldVnode, vnode); }
-    }
-  }
-
-  function invokeInsertHook (vnode, queue, initial) {
-    // delay insert hooks for component root nodes, invoke them after the
-    // element is really inserted
-    if (isTrue(initial) && isDef(vnode.parent)) {
-      vnode.parent.data.pendingInsert = queue;
-    } else {
-      for (var i = 0; i < queue.length; ++i) {
-        queue[i].data.hook.insert(queue[i]);
-      }
-    }
-  }
-
-  var hydrationBailed = false;
-  // list of modules that can skip create hook during hydration because they
-  // are already rendered on the client or has no need for initialization
-  // Note: style is excluded because it relies on initial clone for future
-  // deep updates (#7063).
-  var isRenderedModule = makeMap('attrs,class,staticClass,staticStyle,key');
-
-  // Note: this is a browser-only function so we can assume elms are DOM nodes.
-  function hydrate (elm, vnode, insertedVnodeQueue, inVPre) {
-    var i;
-    var tag = vnode.tag;
-    var data = vnode.data;
-    var children = vnode.children;
-    inVPre = inVPre || (data && data.pre);
-    vnode.elm = elm;
-
-    if (isTrue(vnode.isComment) && isDef(vnode.asyncFactory)) {
-      vnode.isAsyncPlaceholder = true;
-      return true
-    }
-    // assert node match
-    if (process.env.NODE_ENV !== 'production') {
-      if (!assertNodeMatch(elm, vnode, inVPre)) {
-        return false
-      }
-    }
-    if (isDef(data)) {
-      if (isDef(i = data.hook) && isDef(i = i.init)) { i(vnode, true /* hydrating */); }
-      if (isDef(i = vnode.componentInstance)) {
-        // child component. it should have hydrated its own tree.
-        initComponent(vnode, insertedVnodeQueue);
-        return true
-      }
-    }
-    if (isDef(tag)) {
-      if (isDef(children)) {
-        // empty element, allow client to pick up and populate children
-        if (!elm.hasChildNodes()) {
-          createChildren(vnode, children, insertedVnodeQueue);
-        } else {
-          // v-html and domProps: innerHTML
-          if (isDef(i = data) && isDef(i = i.domProps) && isDef(i = i.innerHTML)) {
-            if (i !== elm.innerHTML) {
-              /* istanbul ignore if */
-              if (process.env.NODE_ENV !== 'production' &&
-                typeof console !== 'undefined' &&
-                !hydrationBailed
-              ) {
-                hydrationBailed = true;
-                console.warn('Parent: ', elm);
-                console.warn('server innerHTML: ', i);
-                console.warn('client innerHTML: ', elm.innerHTML);
-              }
-              return false
-            }
-          } else {
-            // iterate and compare children lists
-            var childrenMatch = true;
-            var childNode = elm.firstChild;
-            for (var i$1 = 0; i$1 < children.length; i$1++) {
-              if (!childNode || !hydrate(childNode, children[i$1], insertedVnodeQueue, inVPre)) {
-                childrenMatch = false;
-                break
-              }
-              childNode = childNode.nextSibling;
-            }
-            // if childNode is not null, it means the actual childNodes list is
-            // longer than the virtual children list.
-            if (!childrenMatch || childNode) {
-              /* istanbul ignore if */
-              if (process.env.NODE_ENV !== 'production' &&
-                typeof console !== 'undefined' &&
-                !hydrationBailed
-              ) {
-                hydrationBailed = true;
-                console.warn('Parent: ', elm);
-                console.warn('Mismatching childNodes vs. VNodes: ', elm.childNodes, children);
-              }
-              return false
-            }
-          }
-        }
-      }
-      if (isDef(data)) {
-        var fullInvoke = false;
-        for (var key in data) {
-          if (!isRenderedModule(key)) {
-            fullInvoke = true;
-            invokeCreateHooks(vnode, insertedVnodeQueue);
-            break
-          }
-        }
-        if (!fullInvoke && data['class']) {
-          // ensure collecting deps for deep class bindings for future updates
-          traverse(data['class']);
-        }
-      }
-    } else if (elm.data !== vnode.text) {
-      elm.data = vnode.text;
-    }
-    return true
-  }
-
-  function assertNodeMatch (node, vnode, inVPre) {
-    if (isDef(vnode.tag)) {
-      return vnode.tag.indexOf('vue-component') === 0 || (
-        !isUnknownElement$$1(vnode, inVPre) &&
-        vnode.tag.toLowerCase() === (node.tagName && node.tagName.toLowerCase())
-      )
-    } else {
-      return node.nodeType === (vnode.isComment ? 8 : 3)
-    }
-  }
-
-  return function patch (oldVnode, vnode, hydrating, removeOnly, parentElm, refElm) {
-    if (isUndef(vnode)) {
-      if (isDef(oldVnode)) { invokeDestroyHook(oldVnode); }
-      return
-    }
-
-    var isInitialPatch = false;
-    var insertedVnodeQueue = [];
-
-    if (isUndef(oldVnode)) {
-      // empty mount (likely as component), create new root element
-      isInitialPatch = true;
-      createElm(vnode, insertedVnodeQueue, parentElm, refElm);
-    } else {
-      var isRealElement = isDef(oldVnode.nodeType);
-      if (!isRealElement && sameVnode(oldVnode, vnode)) {
-        // patch existing root node
-        patchVnode(oldVnode, vnode, insertedVnodeQueue, removeOnly);
-      } else {
-        if (isRealElement) {
-          // mounting to a real element
-          // check if this is server-rendered content and if we can perform
-          // a successful hydration.
-          if (oldVnode.nodeType === 1 && oldVnode.hasAttribute(SSR_ATTR)) {
-            oldVnode.removeAttribute(SSR_ATTR);
-            hydrating = true;
-          }
-          if (isTrue(hydrating)) {
-            if (hydrate(oldVnode, vnode, insertedVnodeQueue)) {
-              invokeInsertHook(vnode, insertedVnodeQueue, true);
-              return oldVnode
-            } else if (process.env.NODE_ENV !== 'production') {
-              warn(
-                'The client-side rendered virtual DOM tree is not matching ' +
-                'server-rendered content. This is likely caused by incorrect ' +
-                'HTML markup, for example nesting block-level elements inside ' +
-                '<p>, or missing <tbody>. Bailing hydration and performing ' +
-                'full client-side render.'
-              );
-            }
-          }
-          // either not server-rendered, or hydration failed.
-          // create an empty node and replace it
-          oldVnode = emptyNodeAt(oldVnode);
-        }
-
-        // replacing existing element
-        var oldElm = oldVnode.elm;
-        var parentElm$1 = nodeOps.parentNode(oldElm);
-
-        // create new node
-        createElm(
-          vnode,
-          insertedVnodeQueue,
-          // extremely rare edge case: do not insert if old element is in a
-          // leaving transition. Only happens when combining transition +
-          // keep-alive + HOCs. (#4590)
-          oldElm._leaveCb ? null : parentElm$1,
-          nodeOps.nextSibling(oldElm)
-        );
-
-        // update parent placeholder node element, recursively
-        if (isDef(vnode.parent)) {
-          var ancestor = vnode.parent;
-          var patchable = isPatchable(vnode);
-          while (ancestor) {
-            for (var i = 0; i < cbs.destroy.length; ++i) {
-              cbs.destroy[i](ancestor);
-            }
-            ancestor.elm = vnode.elm;
-            if (patchable) {
-              for (var i$1 = 0; i$1 < cbs.create.length; ++i$1) {
-                cbs.create[i$1](emptyNode, ancestor);
-              }
-              // #6513
-              // invoke insert hooks that may have been merged by create hooks.
-              // e.g. for directives that uses the "inserted" hook.
-              var insert = ancestor.data.hook.insert;
-              if (insert.merged) {
-                // start at index 1 to avoid re-invoking component mounted hook
-                for (var i$2 = 1; i$2 < insert.fns.length; i$2++) {
-                  insert.fns[i$2]();
-                }
-              }
-            } else {
-              registerRef(ancestor);
-            }
-            ancestor = ancestor.parent;
-          }
-        }
-
-        // destroy old node
-        if (isDef(parentElm$1)) {
-          removeVnodes(parentElm$1, [oldVnode], 0, 0);
-        } else if (isDef(oldVnode.tag)) {
-          invokeDestroyHook(oldVnode);
-        }
-      }
-    }
-
-    invokeInsertHook(vnode, insertedVnodeQueue, isInitialPatch);
-    return vnode.elm
-  }
-}
-
-/*  */
-
-var directives = {
-  create: updateDirectives,
-  update: updateDirectives,
-  destroy: function unbindDirectives (vnode) {
-    updateDirectives(vnode, emptyNode);
-  }
-};
-
-function updateDirectives (oldVnode, vnode) {
-  if (oldVnode.data.directives || vnode.data.directives) {
-    _update(oldVnode, vnode);
-  }
-}
-
-function _update (oldVnode, vnode) {
-  var isCreate = oldVnode === emptyNode;
-  var isDestroy = vnode === emptyNode;
-  var oldDirs = normalizeDirectives$1(oldVnode.data.directives, oldVnode.context);
-  var newDirs = normalizeDirectives$1(vnode.data.directives, vnode.context);
-
-  var dirsWithInsert = [];
-  var dirsWithPostpatch = [];
-
-  var key, oldDir, dir;
-  for (key in newDirs) {
-    oldDir = oldDirs[key];
-    dir = newDirs[key];
-    if (!oldDir) {
-      // new directive, bind
-      callHook$1(dir, 'bind', vnode, oldVnode);
-      if (dir.def && dir.def.inserted) {
-        dirsWithInsert.push(dir);
-      }
-    } else {
-      // existing directive, update
-      dir.oldValue = oldDir.value;
-      callHook$1(dir, 'update', vnode, oldVnode);
-      if (dir.def && dir.def.componentUpdated) {
-        dirsWithPostpatch.push(dir);
-      }
-    }
-  }
-
-  if (dirsWithInsert.length) {
-    var callInsert = function () {
-      for (var i = 0; i < dirsWithInsert.length; i++) {
-        callHook$1(dirsWithInsert[i], 'inserted', vnode, oldVnode);
-      }
-    };
-    if (isCreate) {
-      mergeVNodeHook(vnode, 'insert', callInsert);
-    } else {
-      callInsert();
-    }
-  }
-
-  if (dirsWithPostpatch.length) {
-    mergeVNodeHook(vnode, 'postpatch', function () {
-      for (var i = 0; i < dirsWithPostpatch.length; i++) {
-        callHook$1(dirsWithPostpatch[i], 'componentUpdated', vnode, oldVnode);
-      }
-    });
-  }
-
-  if (!isCreate) {
-    for (key in oldDirs) {
-      if (!newDirs[key]) {
-        // no longer present, unbind
-        callHook$1(oldDirs[key], 'unbind', oldVnode, oldVnode, isDestroy);
-      }
-    }
-  }
-}
-
-var emptyModifiers = Object.create(null);
-
-function normalizeDirectives$1 (
-  dirs,
-  vm
-) {
-  var res = Object.create(null);
-  if (!dirs) {
-    // $flow-disable-line
-    return res
-  }
-  var i, dir;
-  for (i = 0; i < dirs.length; i++) {
-    dir = dirs[i];
-    if (!dir.modifiers) {
-      // $flow-disable-line
-      dir.modifiers = emptyModifiers;
-    }
-    res[getRawDirName(dir)] = dir;
-    dir.def = resolveAsset(vm.$options, 'directives', dir.name, true);
-  }
-  // $flow-disable-line
-  return res
-}
-
-function getRawDirName (dir) {
-  return dir.rawName || ((dir.name) + "." + (Object.keys(dir.modifiers || {}).join('.')))
-}
-
-function callHook$1 (dir, hook, vnode, oldVnode, isDestroy) {
-  var fn = dir.def && dir.def[hook];
-  if (fn) {
-    try {
-      fn(vnode.elm, dir, vnode, oldVnode, isDestroy);
-    } catch (e) {
-      handleError(e, vnode.context, ("directive " + (dir.name) + " " + hook + " hook"));
-    }
-  }
-}
-
-var baseModules = [
-  ref,
-  directives
-];
-
-/*  */
-
-function updateAttrs (oldVnode, vnode) {
-  var opts = vnode.componentOptions;
-  if (isDef(opts) && opts.Ctor.options.inheritAttrs === false) {
-    return
-  }
-  if (isUndef(oldVnode.data.attrs) && isUndef(vnode.data.attrs)) {
-    return
-  }
-  var key, cur, old;
-  var elm = vnode.elm;
-  var oldAttrs = oldVnode.data.attrs || {};
-  var attrs = vnode.data.attrs || {};
-  // clone observed objects, as the user probably wants to mutate it
-  if (isDef(attrs.__ob__)) {
-    attrs = vnode.data.attrs = extend({}, attrs);
-  }
-
-  for (key in attrs) {
-    cur = attrs[key];
-    old = oldAttrs[key];
-    if (old !== cur) {
-      setAttr(elm, key, cur);
-    }
-  }
-  // #4391: in IE9, setting type can reset value for input[type=radio]
-  // #6666: IE/Edge forces progress value down to 1 before setting a max
-  /* istanbul ignore if */
-  if ((isIE || isEdge) && attrs.value !== oldAttrs.value) {
-    setAttr(elm, 'value', attrs.value);
-  }
-  for (key in oldAttrs) {
-    if (isUndef(attrs[key])) {
-      if (isXlink(key)) {
-        elm.removeAttributeNS(xlinkNS, getXlinkProp(key));
-      } else if (!isEnumeratedAttr(key)) {
-        elm.removeAttribute(key);
-      }
-    }
-  }
-}
-
-function setAttr (el, key, value) {
-  if (el.tagName.indexOf('-') > -1) {
-    baseSetAttr(el, key, value);
-  } else if (isBooleanAttr(key)) {
-    // set attribute for blank value
-    // e.g. <option disabled>Select one</option>
-    if (isFalsyAttrValue(value)) {
-      el.removeAttribute(key);
-    } else {
-      // technically allowfullscreen is a boolean attribute for <iframe>,
-      // but Flash expects a value of "true" when used on <embed> tag
-      value = key === 'allowfullscreen' && el.tagName === 'EMBED'
-        ? 'true'
-        : key;
-      el.setAttribute(key, value);
-    }
-  } else if (isEnumeratedAttr(key)) {
-    el.setAttribute(key, isFalsyAttrValue(value) || value === 'false' ? 'false' : 'true');
-  } else if (isXlink(key)) {
-    if (isFalsyAttrValue(value)) {
-      el.removeAttributeNS(xlinkNS, getXlinkProp(key));
-    } else {
-      el.setAttributeNS(xlinkNS, key, value);
-    }
-  } else {
-    baseSetAttr(el, key, value);
-  }
-}
-
-function baseSetAttr (el, key, value) {
-  if (isFalsyAttrValue(value)) {
-    el.removeAttribute(key);
-  } else {
-    // #7138: IE10 & 11 fires input event when setting placeholder on
-    // <textarea>... block the first input event and remove the blocker
-    // immediately.
-    /* istanbul ignore if */
-    if (
-      isIE && !isIE9 &&
-      el.tagName === 'TEXTAREA' &&
-      key === 'placeholder' && !el.__ieph
-    ) {
-      var blocker = function (e) {
-        e.stopImmediatePropagation();
-        el.removeEventListener('input', blocker);
-      };
-      el.addEventListener('input', blocker);
-      // $flow-disable-line
-      el.__ieph = true; /* IE placeholder patched */
-    }
-    el.setAttribute(key, value);
-  }
-}
-
-var attrs = {
-  create: updateAttrs,
-  update: updateAttrs
-};
-
-/*  */
-
-function updateClass (oldVnode, vnode) {
-  var el = vnode.elm;
-  var data = vnode.data;
-  var oldData = oldVnode.data;
-  if (
-    isUndef(data.staticClass) &&
-    isUndef(data.class) && (
-      isUndef(oldData) || (
-        isUndef(oldData.staticClass) &&
-        isUndef(oldData.class)
-      )
-    )
-  ) {
-    return
-  }
-
-  var cls = genClassForVnode(vnode);
-
-  // handle transition classes
-  var transitionClass = el._transitionClasses;
-  if (isDef(transitionClass)) {
-    cls = concat(cls, stringifyClass(transitionClass));
-  }
-
-  // set the class
-  if (cls !== el._prevClass) {
-    el.setAttribute('class', cls);
-    el._prevClass = cls;
-  }
-}
-
-var klass = {
-  create: updateClass,
-  update: updateClass
-};
-
-/*  */
-
-/*  */
-
-
-
-
-
-
-
-
-
-// add a raw attr (use this in preTransforms)
-
-
-
-
-
-
-
-
-// note: this only removes the attr from the Array (attrsList) so that it
-// doesn't get processed by processAttrs.
-// By default it does NOT remove it from the map (attrsMap) because the map is
-// needed during codegen.
-
-/*  */
-
-/**
- * Cross-platform code generation for component v-model
- */
-
-
-/**
- * Cross-platform codegen helper for generating v-model value assignment code.
- */
-
-/*  */
-
-// in some cases, the event used has to be determined at runtime
-// so we used some reserved tokens during compile.
-var RANGE_TOKEN = '__r';
-var CHECKBOX_RADIO_TOKEN = '__c';
-
-/*  */
-
-// normalize v-model event tokens that can only be determined at runtime.
-// it's important to place the event as the first in the array because
-// the whole point is ensuring the v-model callback gets called before
-// user-attached handlers.
-function normalizeEvents (on) {
-  /* istanbul ignore if */
-  if (isDef(on[RANGE_TOKEN])) {
-    // IE input[type=range] only supports `change` event
-    var event = isIE ? 'change' : 'input';
-    on[event] = [].concat(on[RANGE_TOKEN], on[event] || []);
-    delete on[RANGE_TOKEN];
-  }
-  // This was originally intended to fix #4521 but no longer necessary
-  // after 2.5. Keeping it for backwards compat with generated code from < 2.4
-  /* istanbul ignore if */
-  if (isDef(on[CHECKBOX_RADIO_TOKEN])) {
-    on.change = [].concat(on[CHECKBOX_RADIO_TOKEN], on.change || []);
-    delete on[CHECKBOX_RADIO_TOKEN];
-  }
-}
-
-var target$1;
-
-function createOnceHandler (handler, event, capture) {
-  var _target = target$1; // save current target element in closure
-  return function onceHandler () {
-    var res = handler.apply(null, arguments);
-    if (res !== null) {
-      remove$2(event, onceHandler, capture, _target);
-    }
-  }
-}
-
-function add$1 (
-  event,
-  handler,
-  once$$1,
-  capture,
-  passive
-) {
-  handler = withMacroTask(handler);
-  if (once$$1) { handler = createOnceHandler(handler, event, capture); }
-  target$1.addEventListener(
-    event,
-    handler,
-    supportsPassive
-      ? { capture: capture, passive: passive }
-      : capture
-  );
-}
-
-function remove$2 (
-  event,
-  handler,
-  capture,
-  _target
-) {
-  (_target || target$1).removeEventListener(
-    event,
-    handler._withTask || handler,
-    capture
-  );
-}
-
-function updateDOMListeners (oldVnode, vnode) {
-  if (isUndef(oldVnode.data.on) && isUndef(vnode.data.on)) {
-    return
-  }
-  var on = vnode.data.on || {};
-  var oldOn = oldVnode.data.on || {};
-  target$1 = vnode.elm;
-  normalizeEvents(on);
-  updateListeners(on, oldOn, add$1, remove$2, vnode.context);
-  target$1 = undefined;
-}
-
-var events = {
-  create: updateDOMListeners,
-  update: updateDOMListeners
-};
-
-/*  */
-
-function updateDOMProps (oldVnode, vnode) {
-  if (isUndef(oldVnode.data.domProps) && isUndef(vnode.data.domProps)) {
-    return
-  }
-  var key, cur;
-  var elm = vnode.elm;
-  var oldProps = oldVnode.data.domProps || {};
-  var props = vnode.data.domProps || {};
-  // clone observed objects, as the user probably wants to mutate it
-  if (isDef(props.__ob__)) {
-    props = vnode.data.domProps = extend({}, props);
-  }
-
-  for (key in oldProps) {
-    if (isUndef(props[key])) {
-      elm[key] = '';
-    }
-  }
-  for (key in props) {
-    cur = props[key];
-    // ignore children if the node has textContent or innerHTML,
-    // as these will throw away existing DOM nodes and cause removal errors
-    // on subsequent patches (#3360)
-    if (key === 'textContent' || key === 'innerHTML') {
-      if (vnode.children) { vnode.children.length = 0; }
-      if (cur === oldProps[key]) { continue }
-      // #6601 work around Chrome version <= 55 bug where single textNode
-      // replaced by innerHTML/textContent retains its parentNode property
-      if (elm.childNodes.length === 1) {
-        elm.removeChild(elm.childNodes[0]);
-      }
-    }
-
-    if (key === 'value') {
-      // store value as _value as well since
-      // non-string values will be stringified
-      elm._value = cur;
-      // avoid resetting cursor position when value is the same
-      var strCur = isUndef(cur) ? '' : String(cur);
-      if (shouldUpdateValue(elm, strCur)) {
-        elm.value = strCur;
-      }
-    } else {
-      elm[key] = cur;
-    }
-  }
-}
-
-// check platforms/web/util/attrs.js acceptValue
-
-
-function shouldUpdateValue (elm, checkVal) {
-  return (!elm.composing && (
-    elm.tagName === 'OPTION' ||
-    isNotInFocusAndDirty(elm, checkVal) ||
-    isDirtyWithModifiers(elm, checkVal)
-  ))
-}
-
-function isNotInFocusAndDirty (elm, checkVal) {
-  // return true when textbox (.number and .trim) loses focus and its value is
-  // not equal to the updated value
-  var notInFocus = true;
-  // #6157
-  // work around IE bug when accessing document.activeElement in an iframe
-  try { notInFocus = document.activeElement !== elm; } catch (e) {}
-  return notInFocus && elm.value !== checkVal
-}
-
-function isDirtyWithModifiers (elm, newVal) {
-  var value = elm.value;
-  var modifiers = elm._vModifiers; // injected by v-model runtime
-  if (isDef(modifiers)) {
-    if (modifiers.lazy) {
-      // inputs with lazy should only be updated when not in focus
-      return false
-    }
-    if (modifiers.number) {
-      return toNumber(value) !== toNumber(newVal)
-    }
-    if (modifiers.trim) {
-      return value.trim() !== newVal.trim()
-    }
-  }
-  return value !== newVal
-}
-
-var domProps = {
-  create: updateDOMProps,
-  update: updateDOMProps
-};
-
-/*  */
-
-var parseStyleText = cached(function (cssText) {
-  var res = {};
-  var listDelimiter = /;(?![^(]*\))/g;
-  var propertyDelimiter = /:(.+)/;
-  cssText.split(listDelimiter).forEach(function (item) {
-    if (item) {
-      var tmp = item.split(propertyDelimiter);
-      tmp.length > 1 && (res[tmp[0].trim()] = tmp[1].trim());
-    }
-  });
-  return res
-});
-
-// merge static and dynamic style data on the same vnode
-function normalizeStyleData (data) {
-  var style = normalizeStyleBinding(data.style);
-  // static style is pre-processed into an object during compilation
-  // and is always a fresh object, so it's safe to merge into it
-  return data.staticStyle
-    ? extend(data.staticStyle, style)
-    : style
-}
-
-// normalize possible array / string values into Object
-function normalizeStyleBinding (bindingStyle) {
-  if (Array.isArray(bindingStyle)) {
-    return toObject(bindingStyle)
-  }
-  if (typeof bindingStyle === 'string') {
-    return parseStyleText(bindingStyle)
-  }
-  return bindingStyle
-}
-
-/**
- * parent component style should be after child's
- * so that parent component's style could override it
- */
-function getStyle (vnode, checkChild) {
-  var res = {};
-  var styleData;
-
-  if (checkChild) {
-    var childNode = vnode;
-    while (childNode.componentInstance) {
-      childNode = childNode.componentInstance._vnode;
-      if (
-        childNode && childNode.data &&
-        (styleData = normalizeStyleData(childNode.data))
-      ) {
-        extend(res, styleData);
-      }
-    }
-  }
-
-  if ((styleData = normalizeStyleData(vnode.data))) {
-    extend(res, styleData);
-  }
-
-  var parentNode = vnode;
-  while ((parentNode = parentNode.parent)) {
-    if (parentNode.data && (styleData = normalizeStyleData(parentNode.data))) {
-      extend(res, styleData);
-    }
-  }
-  return res
-}
-
-/*  */
-
-var cssVarRE = /^--/;
-var importantRE = /\s*!important$/;
-var setProp = function (el, name, val) {
-  /* istanbul ignore if */
-  if (cssVarRE.test(name)) {
-    el.style.setProperty(name, val);
-  } else if (importantRE.test(val)) {
-    el.style.setProperty(name, val.replace(importantRE, ''), 'important');
-  } else {
-    var normalizedName = normalize(name);
-    if (Array.isArray(val)) {
-      // Support values array created by autoprefixer, e.g.
-      // {display: ["-webkit-box", "-ms-flexbox", "flex"]}
-      // Set them one by one, and the browser will only set those it can recognize
-      for (var i = 0, len = val.length; i < len; i++) {
-        el.style[normalizedName] = val[i];
-      }
-    } else {
-      el.style[normalizedName] = val;
-    }
-  }
-};
-
-var vendorNames = ['Webkit', 'Moz', 'ms'];
-
-var emptyStyle;
-var normalize = cached(function (prop) {
-  emptyStyle = emptyStyle || document.createElement('div').style;
-  prop = camelize(prop);
-  if (prop !== 'filter' && (prop in emptyStyle)) {
-    return prop
-  }
-  var capName = prop.charAt(0).toUpperCase() + prop.slice(1);
-  for (var i = 0; i < vendorNames.length; i++) {
-    var name = vendorNames[i] + capName;
-    if (name in emptyStyle) {
-      return name
-    }
-  }
-});
-
-function updateStyle (oldVnode, vnode) {
-  var data = vnode.data;
-  var oldData = oldVnode.data;
-
-  if (isUndef(data.staticStyle) && isUndef(data.style) &&
-    isUndef(oldData.staticStyle) && isUndef(oldData.style)
-  ) {
-    return
-  }
-
-  var cur, name;
-  var el = vnode.elm;
-  var oldStaticStyle = oldData.staticStyle;
-  var oldStyleBinding = oldData.normalizedStyle || oldData.style || {};
-
-  // if static style exists, stylebinding already merged into it when doing normalizeStyleData
-  var oldStyle = oldStaticStyle || oldStyleBinding;
-
-  var style = normalizeStyleBinding(vnode.data.style) || {};
-
-  // store normalized style under a different key for next diff
-  // make sure to clone it if it's reactive, since the user likely wants
-  // to mutate it.
-  vnode.data.normalizedStyle = isDef(style.__ob__)
-    ? extend({}, style)
-    : style;
-
-  var newStyle = getStyle(vnode, true);
-
-  for (name in oldStyle) {
-    if (isUndef(newStyle[name])) {
-      setProp(el, name, '');
-    }
-  }
-  for (name in newStyle) {
-    cur = newStyle[name];
-    if (cur !== oldStyle[name]) {
-      // ie9 setting to null has no effect, must use empty string
-      setProp(el, name, cur == null ? '' : cur);
-    }
-  }
-}
-
-var style = {
-  create: updateStyle,
-  update: updateStyle
-};
-
-/*  */
-
-/**
- * Add class with compatibility for SVG since classList is not supported on
- * SVG elements in IE
- */
-function addClass (el, cls) {
-  /* istanbul ignore if */
-  if (!cls || !(cls = cls.trim())) {
-    return
-  }
-
-  /* istanbul ignore else */
-  if (el.classList) {
-    if (cls.indexOf(' ') > -1) {
-      cls.split(/\s+/).forEach(function (c) { return el.classList.add(c); });
-    } else {
-      el.classList.add(cls);
-    }
-  } else {
-    var cur = " " + (el.getAttribute('class') || '') + " ";
-    if (cur.indexOf(' ' + cls + ' ') < 0) {
-      el.setAttribute('class', (cur + cls).trim());
-    }
-  }
-}
-
-/**
- * Remove class with compatibility for SVG since classList is not supported on
- * SVG elements in IE
- */
-function removeClass (el, cls) {
-  /* istanbul ignore if */
-  if (!cls || !(cls = cls.trim())) {
-    return
-  }
-
-  /* istanbul ignore else */
-  if (el.classList) {
-    if (cls.indexOf(' ') > -1) {
-      cls.split(/\s+/).forEach(function (c) { return el.classList.remove(c); });
-    } else {
-      el.classList.remove(cls);
-    }
-    if (!el.classList.length) {
-      el.removeAttribute('class');
-    }
-  } else {
-    var cur = " " + (el.getAttribute('class') || '') + " ";
-    var tar = ' ' + cls + ' ';
-    while (cur.indexOf(tar) >= 0) {
-      cur = cur.replace(tar, ' ');
-    }
-    cur = cur.trim();
-    if (cur) {
-      el.setAttribute('class', cur);
-    } else {
-      el.removeAttribute('class');
-    }
-  }
-}
-
-/*  */
-
-function resolveTransition (def) {
-  if (!def) {
-    return
-  }
-  /* istanbul ignore else */
-  if (typeof def === 'object') {
-    var res = {};
-    if (def.css !== false) {
-      extend(res, autoCssTransition(def.name || 'v'));
-    }
-    extend(res, def);
-    return res
-  } else if (typeof def === 'string') {
-    return autoCssTransition(def)
-  }
-}
-
-var autoCssTransition = cached(function (name) {
-  return {
-    enterClass: (name + "-enter"),
-    enterToClass: (name + "-enter-to"),
-    enterActiveClass: (name + "-enter-active"),
-    leaveClass: (name + "-leave"),
-    leaveToClass: (name + "-leave-to"),
-    leaveActiveClass: (name + "-leave-active")
-  }
-});
-
-var hasTransition = inBrowser && !isIE9;
-var TRANSITION = 'transition';
-var ANIMATION = 'animation';
-
-// Transition property/event sniffing
-var transitionProp = 'transition';
-var transitionEndEvent = 'transitionend';
-var animationProp = 'animation';
-var animationEndEvent = 'animationend';
-if (hasTransition) {
-  /* istanbul ignore if */
-  if (window.ontransitionend === undefined &&
-    window.onwebkittransitionend !== undefined
-  ) {
-    transitionProp = 'WebkitTransition';
-    transitionEndEvent = 'webkitTransitionEnd';
-  }
-  if (window.onanimationend === undefined &&
-    window.onwebkitanimationend !== undefined
-  ) {
-    animationProp = 'WebkitAnimation';
-    animationEndEvent = 'webkitAnimationEnd';
-  }
-}
-
-// binding to window is necessary to make hot reload work in IE in strict mode
-var raf = inBrowser
-  ? window.requestAnimationFrame
-    ? window.requestAnimationFrame.bind(window)
-    : setTimeout
-  : /* istanbul ignore next */ function (fn) { return fn(); };
-
-function nextFrame (fn) {
-  raf(function () {
-    raf(fn);
-  });
-}
-
-function addTransitionClass (el, cls) {
-  var transitionClasses = el._transitionClasses || (el._transitionClasses = []);
-  if (transitionClasses.indexOf(cls) < 0) {
-    transitionClasses.push(cls);
-    addClass(el, cls);
-  }
-}
-
-function removeTransitionClass (el, cls) {
-  if (el._transitionClasses) {
-    remove(el._transitionClasses, cls);
-  }
-  removeClass(el, cls);
-}
-
-function whenTransitionEnds (
-  el,
-  expectedType,
-  cb
-) {
-  var ref = getTransitionInfo(el, expectedType);
-  var type = ref.type;
-  var timeout = ref.timeout;
-  var propCount = ref.propCount;
-  if (!type) { return cb() }
-  var event = type === TRANSITION ? transitionEndEvent : animationEndEvent;
-  var ended = 0;
-  var end = function () {
-    el.removeEventListener(event, onEnd);
-    cb();
-  };
-  var onEnd = function (e) {
-    if (e.target === el) {
-      if (++ended >= propCount) {
-        end();
-      }
-    }
-  };
-  setTimeout(function () {
-    if (ended < propCount) {
-      end();
-    }
-  }, timeout + 1);
-  el.addEventListener(event, onEnd);
-}
-
-var transformRE = /\b(transform|all)(,|$)/;
-
-function getTransitionInfo (el, expectedType) {
-  var styles = window.getComputedStyle(el);
-  var transitionDelays = styles[transitionProp + 'Delay'].split(', ');
-  var transitionDurations = styles[transitionProp + 'Duration'].split(', ');
-  var transitionTimeout = getTimeout(transitionDelays, transitionDurations);
-  var animationDelays = styles[animationProp + 'Delay'].split(', ');
-  var animationDurations = styles[animationProp + 'Duration'].split(', ');
-  var animationTimeout = getTimeout(animationDelays, animationDurations);
-
-  var type;
-  var timeout = 0;
-  var propCount = 0;
-  /* istanbul ignore if */
-  if (expectedType === TRANSITION) {
-    if (transitionTimeout > 0) {
-      type = TRANSITION;
-      timeout = transitionTimeout;
-      propCount = transitionDurations.length;
-    }
-  } else if (expectedType === ANIMATION) {
-    if (animationTimeout > 0) {
-      type = ANIMATION;
-      timeout = animationTimeout;
-      propCount = animationDurations.length;
-    }
-  } else {
-    timeout = Math.max(transitionTimeout, animationTimeout);
-    type = timeout > 0
-      ? transitionTimeout > animationTimeout
-        ? TRANSITION
-        : ANIMATION
-      : null;
-    propCount = type
-      ? type === TRANSITION
-        ? transitionDurations.length
-        : animationDurations.length
-      : 0;
-  }
-  var hasTransform =
-    type === TRANSITION &&
-    transformRE.test(styles[transitionProp + 'Property']);
-  return {
-    type: type,
-    timeout: timeout,
-    propCount: propCount,
-    hasTransform: hasTransform
-  }
-}
-
-function getTimeout (delays, durations) {
-  /* istanbul ignore next */
-  while (delays.length < durations.length) {
-    delays = delays.concat(delays);
-  }
-
-  return Math.max.apply(null, durations.map(function (d, i) {
-    return toMs(d) + toMs(delays[i])
-  }))
-}
-
-function toMs (s) {
-  return Number(s.slice(0, -1)) * 1000
-}
-
-/*  */
-
-function enter (vnode, toggleDisplay) {
-  var el = vnode.elm;
-
-  // call leave callback now
-  if (isDef(el._leaveCb)) {
-    el._leaveCb.cancelled = true;
-    el._leaveCb();
-  }
-
-  var data = resolveTransition(vnode.data.transition);
-  if (isUndef(data)) {
-    return
-  }
-
-  /* istanbul ignore if */
-  if (isDef(el._enterCb) || el.nodeType !== 1) {
-    return
-  }
-
-  var css = data.css;
-  var type = data.type;
-  var enterClass = data.enterClass;
-  var enterToClass = data.enterToClass;
-  var enterActiveClass = data.enterActiveClass;
-  var appearClass = data.appearClass;
-  var appearToClass = data.appearToClass;
-  var appearActiveClass = data.appearActiveClass;
-  var beforeEnter = data.beforeEnter;
-  var enter = data.enter;
-  var afterEnter = data.afterEnter;
-  var enterCancelled = data.enterCancelled;
-  var beforeAppear = data.beforeAppear;
-  var appear = data.appear;
-  var afterAppear = data.afterAppear;
-  var appearCancelled = data.appearCancelled;
-  var duration = data.duration;
-
-  // activeInstance will always be the <transition> component managing this
-  // transition. One edge case to check is when the <transition> is placed
-  // as the root node of a child component. In that case we need to check
-  // <transition>'s parent for appear check.
-  var context = activeInstance;
-  var transitionNode = activeInstance.$vnode;
-  while (transitionNode && transitionNode.parent) {
-    transitionNode = transitionNode.parent;
-    context = transitionNode.context;
-  }
-
-  var isAppear = !context._isMounted || !vnode.isRootInsert;
-
-  if (isAppear && !appear && appear !== '') {
-    return
-  }
-
-  var startClass = isAppear && appearClass
-    ? appearClass
-    : enterClass;
-  var activeClass = isAppear && appearActiveClass
-    ? appearActiveClass
-    : enterActiveClass;
-  var toClass = isAppear && appearToClass
-    ? appearToClass
-    : enterToClass;
-
-  var beforeEnterHook = isAppear
-    ? (beforeAppear || beforeEnter)
-    : beforeEnter;
-  var enterHook = isAppear
-    ? (typeof appear === 'function' ? appear : enter)
-    : enter;
-  var afterEnterHook = isAppear
-    ? (afterAppear || afterEnter)
-    : afterEnter;
-  var enterCancelledHook = isAppear
-    ? (appearCancelled || enterCancelled)
-    : enterCancelled;
-
-  var explicitEnterDuration = toNumber(
-    isObject(duration)
-      ? duration.enter
-      : duration
-  );
-
-  if (process.env.NODE_ENV !== 'production' && explicitEnterDuration != null) {
-    checkDuration(explicitEnterDuration, 'enter', vnode);
-  }
-
-  var expectsCSS = css !== false && !isIE9;
-  var userWantsControl = getHookArgumentsLength(enterHook);
-
-  var cb = el._enterCb = once(function () {
-    if (expectsCSS) {
-      removeTransitionClass(el, toClass);
-      removeTransitionClass(el, activeClass);
-    }
-    if (cb.cancelled) {
-      if (expectsCSS) {
-        removeTransitionClass(el, startClass);
-      }
-      enterCancelledHook && enterCancelledHook(el);
-    } else {
-      afterEnterHook && afterEnterHook(el);
-    }
-    el._enterCb = null;
-  });
-
-  if (!vnode.data.show) {
-    // remove pending leave element on enter by injecting an insert hook
-    mergeVNodeHook(vnode, 'insert', function () {
-      var parent = el.parentNode;
-      var pendingNode = parent && parent._pending && parent._pending[vnode.key];
-      if (pendingNode &&
-        pendingNode.tag === vnode.tag &&
-        pendingNode.elm._leaveCb
-      ) {
-        pendingNode.elm._leaveCb();
-      }
-      enterHook && enterHook(el, cb);
-    });
-  }
-
-  // start enter transition
-  beforeEnterHook && beforeEnterHook(el);
-  if (expectsCSS) {
-    addTransitionClass(el, startClass);
-    addTransitionClass(el, activeClass);
-    nextFrame(function () {
-      removeTransitionClass(el, startClass);
-      if (!cb.cancelled) {
-        addTransitionClass(el, toClass);
-        if (!userWantsControl) {
-          if (isValidDuration(explicitEnterDuration)) {
-            setTimeout(cb, explicitEnterDuration);
-          } else {
-            whenTransitionEnds(el, type, cb);
-          }
-        }
-      }
-    });
-  }
-
-  if (vnode.data.show) {
-    toggleDisplay && toggleDisplay();
-    enterHook && enterHook(el, cb);
-  }
-
-  if (!expectsCSS && !userWantsControl) {
-    cb();
-  }
-}
-
-function leave (vnode, rm) {
-  var el = vnode.elm;
-
-  // call enter callback now
-  if (isDef(el._enterCb)) {
-    el._enterCb.cancelled = true;
-    el._enterCb();
-  }
-
-  var data = resolveTransition(vnode.data.transition);
-  if (isUndef(data) || el.nodeType !== 1) {
-    return rm()
-  }
-
-  /* istanbul ignore if */
-  if (isDef(el._leaveCb)) {
-    return
-  }
-
-  var css = data.css;
-  var type = data.type;
-  var leaveClass = data.leaveClass;
-  var leaveToClass = data.leaveToClass;
-  var leaveActiveClass = data.leaveActiveClass;
-  var beforeLeave = data.beforeLeave;
-  var leave = data.leave;
-  var afterLeave = data.afterLeave;
-  var leaveCancelled = data.leaveCancelled;
-  var delayLeave = data.delayLeave;
-  var duration = data.duration;
-
-  var expectsCSS = css !== false && !isIE9;
-  var userWantsControl = getHookArgumentsLength(leave);
-
-  var explicitLeaveDuration = toNumber(
-    isObject(duration)
-      ? duration.leave
-      : duration
-  );
-
-  if (process.env.NODE_ENV !== 'production' && isDef(explicitLeaveDuration)) {
-    checkDuration(explicitLeaveDuration, 'leave', vnode);
-  }
-
-  var cb = el._leaveCb = once(function () {
-    if (el.parentNode && el.parentNode._pending) {
-      el.parentNode._pending[vnode.key] = null;
-    }
-    if (expectsCSS) {
-      removeTransitionClass(el, leaveToClass);
-      removeTransitionClass(el, leaveActiveClass);
-    }
-    if (cb.cancelled) {
-      if (expectsCSS) {
-        removeTransitionClass(el, leaveClass);
-      }
-      leaveCancelled && leaveCancelled(el);
-    } else {
-      rm();
-      afterLeave && afterLeave(el);
-    }
-    el._leaveCb = null;
-  });
-
-  if (delayLeave) {
-    delayLeave(performLeave);
-  } else {
-    performLeave();
-  }
-
-  function performLeave () {
-    // the delayed leave may have already been cancelled
-    if (cb.cancelled) {
-      return
-    }
-    // record leaving element
-    if (!vnode.data.show) {
-      (el.parentNode._pending || (el.parentNode._pending = {}))[(vnode.key)] = vnode;
-    }
-    beforeLeave && beforeLeave(el);
-    if (expectsCSS) {
-      addTransitionClass(el, leaveClass);
-      addTransitionClass(el, leaveActiveClass);
-      nextFrame(function () {
-        removeTransitionClass(el, leaveClass);
-        if (!cb.cancelled) {
-          addTransitionClass(el, leaveToClass);
-          if (!userWantsControl) {
-            if (isValidDuration(explicitLeaveDuration)) {
-              setTimeout(cb, explicitLeaveDuration);
-            } else {
-              whenTransitionEnds(el, type, cb);
-            }
-          }
-        }
-      });
-    }
-    leave && leave(el, cb);
-    if (!expectsCSS && !userWantsControl) {
-      cb();
-    }
-  }
-}
-
-// only used in dev mode
-function checkDuration (val, name, vnode) {
-  if (typeof val !== 'number') {
-    warn(
-      "<transition> explicit " + name + " duration is not a valid number - " +
-      "got " + (JSON.stringify(val)) + ".",
-      vnode.context
-    );
-  } else if (isNaN(val)) {
-    warn(
-      "<transition> explicit " + name + " duration is NaN - " +
-      'the duration expression might be incorrect.',
-      vnode.context
-    );
-  }
-}
-
-function isValidDuration (val) {
-  return typeof val === 'number' && !isNaN(val)
-}
-
-/**
- * Normalize a transition hook's argument length. The hook may be:
- * - a merged hook (invoker) with the original in .fns
- * - a wrapped component method (check ._length)
- * - a plain function (.length)
- */
-function getHookArgumentsLength (fn) {
-  if (isUndef(fn)) {
-    return false
-  }
-  var invokerFns = fn.fns;
-  if (isDef(invokerFns)) {
-    // invoker
-    return getHookArgumentsLength(
-      Array.isArray(invokerFns)
-        ? invokerFns[0]
-        : invokerFns
-    )
-  } else {
-    return (fn._length || fn.length) > 1
-  }
-}
-
-function _enter (_, vnode) {
-  if (vnode.data.show !== true) {
-    enter(vnode);
-  }
-}
-
-var transition = inBrowser ? {
-  create: _enter,
-  activate: _enter,
-  remove: function remove$$1 (vnode, rm) {
-    /* istanbul ignore else */
-    if (vnode.data.show !== true) {
-      leave(vnode, rm);
-    } else {
-      rm();
-    }
-  }
-} : {};
-
-var platformModules = [
-  attrs,
-  klass,
-  events,
-  domProps,
-  style,
-  transition
-];
-
-/*  */
-
-// the directive module should be applied last, after all
-// built-in modules have been applied.
-var modules = platformModules.concat(baseModules);
-
-var patch = createPatchFunction({ nodeOps: nodeOps, modules: modules });
-
-/**
- * Not type checking this file because flow doesn't like attaching
- * properties to Elements.
- */
-
-/* istanbul ignore if */
-if (isIE9) {
-  // http://www.matts411.com/post/internet-explorer-9-oninput/
-  document.addEventListener('selectionchange', function () {
-    var el = document.activeElement;
-    if (el && el.vmodel) {
-      trigger(el, 'input');
-    }
-  });
-}
-
-var directive = {
-  inserted: function inserted (el, binding, vnode, oldVnode) {
-    if (vnode.tag === 'select') {
-      // #6903
-      if (oldVnode.elm && !oldVnode.elm._vOptions) {
-        mergeVNodeHook(vnode, 'postpatch', function () {
-          directive.componentUpdated(el, binding, vnode);
-        });
-      } else {
-        setSelected(el, binding, vnode.context);
-      }
-      el._vOptions = [].map.call(el.options, getValue);
-    } else if (vnode.tag === 'textarea' || isTextInputType(el.type)) {
-      el._vModifiers = binding.modifiers;
-      if (!binding.modifiers.lazy) {
-        el.addEventListener('compositionstart', onCompositionStart);
-        el.addEventListener('compositionend', onCompositionEnd);
-        // Safari < 10.2 & UIWebView doesn't fire compositionend when
-        // switching focus before confirming composition choice
-        // this also fixes the issue where some browsers e.g. iOS Chrome
-        // fires "change" instead of "input" on autocomplete.
-        el.addEventListener('change', onCompositionEnd);
-        /* istanbul ignore if */
-        if (isIE9) {
-          el.vmodel = true;
-        }
-      }
-    }
-  },
-
-  componentUpdated: function componentUpdated (el, binding, vnode) {
-    if (vnode.tag === 'select') {
-      setSelected(el, binding, vnode.context);
-      // in case the options rendered by v-for have changed,
-      // it's possible that the value is out-of-sync with the rendered options.
-      // detect such cases and filter out values that no longer has a matching
-      // option in the DOM.
-      var prevOptions = el._vOptions;
-      var curOptions = el._vOptions = [].map.call(el.options, getValue);
-      if (curOptions.some(function (o, i) { return !looseEqual(o, prevOptions[i]); })) {
-        // trigger change event if
-        // no matching option found for at least one value
-        var needReset = el.multiple
-          ? binding.value.some(function (v) { return hasNoMatchingOption(v, curOptions); })
-          : binding.value !== binding.oldValue && hasNoMatchingOption(binding.value, curOptions);
-        if (needReset) {
-          trigger(el, 'change');
-        }
-      }
-    }
-  }
-};
-
-function setSelected (el, binding, vm) {
-  actuallySetSelected(el, binding, vm);
-  /* istanbul ignore if */
-  if (isIE || isEdge) {
-    setTimeout(function () {
-      actuallySetSelected(el, binding, vm);
-    }, 0);
-  }
-}
-
-function actuallySetSelected (el, binding, vm) {
-  var value = binding.value;
-  var isMultiple = el.multiple;
-  if (isMultiple && !Array.isArray(value)) {
-    process.env.NODE_ENV !== 'production' && warn(
-      "<select multiple v-model=\"" + (binding.expression) + "\"> " +
-      "expects an Array value for its binding, but got " + (Object.prototype.toString.call(value).slice(8, -1)),
-      vm
-    );
-    return
-  }
-  var selected, option;
-  for (var i = 0, l = el.options.length; i < l; i++) {
-    option = el.options[i];
-    if (isMultiple) {
-      selected = looseIndexOf(value, getValue(option)) > -1;
-      if (option.selected !== selected) {
-        option.selected = selected;
-      }
-    } else {
-      if (looseEqual(getValue(option), value)) {
-        if (el.selectedIndex !== i) {
-          el.selectedIndex = i;
-        }
-        return
-      }
-    }
-  }
-  if (!isMultiple) {
-    el.selectedIndex = -1;
-  }
-}
-
-function hasNoMatchingOption (value, options) {
-  return options.every(function (o) { return !looseEqual(o, value); })
-}
-
-function getValue (option) {
-  return '_value' in option
-    ? option._value
-    : option.value
-}
-
-function onCompositionStart (e) {
-  e.target.composing = true;
-}
-
-function onCompositionEnd (e) {
-  // prevent triggering an input event for no reason
-  if (!e.target.composing) { return }
-  e.target.composing = false;
-  trigger(e.target, 'input');
-}
-
-function trigger (el, type) {
-  var e = document.createEvent('HTMLEvents');
-  e.initEvent(type, true, true);
-  el.dispatchEvent(e);
-}
-
-/*  */
-
-// recursively search for possible transition defined inside the component root
-function locateNode (vnode) {
-  return vnode.componentInstance && (!vnode.data || !vnode.data.transition)
-    ? locateNode(vnode.componentInstance._vnode)
-    : vnode
-}
-
-var show = {
-  bind: function bind (el, ref, vnode) {
-    var value = ref.value;
-
-    vnode = locateNode(vnode);
-    var transition$$1 = vnode.data && vnode.data.transition;
-    var originalDisplay = el.__vOriginalDisplay =
-      el.style.display === 'none' ? '' : el.style.display;
-    if (value && transition$$1) {
-      vnode.data.show = true;
-      enter(vnode, function () {
-        el.style.display = originalDisplay;
-      });
-    } else {
-      el.style.display = value ? originalDisplay : 'none';
-    }
-  },
-
-  update: function update (el, ref, vnode) {
-    var value = ref.value;
-    var oldValue = ref.oldValue;
-
-    /* istanbul ignore if */
-    if (!value === !oldValue) { return }
-    vnode = locateNode(vnode);
-    var transition$$1 = vnode.data && vnode.data.transition;
-    if (transition$$1) {
-      vnode.data.show = true;
-      if (value) {
-        enter(vnode, function () {
-          el.style.display = el.__vOriginalDisplay;
-        });
-      } else {
-        leave(vnode, function () {
-          el.style.display = 'none';
-        });
-      }
-    } else {
-      el.style.display = value ? el.__vOriginalDisplay : 'none';
-    }
-  },
-
-  unbind: function unbind (
-    el,
-    binding,
-    vnode,
-    oldVnode,
-    isDestroy
-  ) {
-    if (!isDestroy) {
-      el.style.display = el.__vOriginalDisplay;
-    }
-  }
-};
-
-var platformDirectives = {
-  model: directive,
-  show: show
-};
-
-/*  */
-
-// Provides transition support for a single element/component.
-// supports transition mode (out-in / in-out)
-
-var transitionProps = {
-  name: String,
-  appear: Boolean,
-  css: Boolean,
-  mode: String,
-  type: String,
-  enterClass: String,
-  leaveClass: String,
-  enterToClass: String,
-  leaveToClass: String,
-  enterActiveClass: String,
-  leaveActiveClass: String,
-  appearClass: String,
-  appearActiveClass: String,
-  appearToClass: String,
-  duration: [Number, String, Object]
-};
-
-// in case the child is also an abstract component, e.g. <keep-alive>
-// we want to recursively retrieve the real component to be rendered
-function getRealChild (vnode) {
-  var compOptions = vnode && vnode.componentOptions;
-  if (compOptions && compOptions.Ctor.options.abstract) {
-    return getRealChild(getFirstComponentChild(compOptions.children))
-  } else {
-    return vnode
-  }
-}
-
-function extractTransitionData (comp) {
-  var data = {};
-  var options = comp.$options;
-  // props
-  for (var key in options.propsData) {
-    data[key] = comp[key];
-  }
-  // events.
-  // extract listeners and pass them directly to the transition methods
-  var listeners = options._parentListeners;
-  for (var key$1 in listeners) {
-    data[camelize(key$1)] = listeners[key$1];
-  }
-  return data
-}
-
-function placeholder (h, rawChild) {
-  if (/\d-keep-alive$/.test(rawChild.tag)) {
-    return h('keep-alive', {
-      props: rawChild.componentOptions.propsData
-    })
-  }
-}
-
-function hasParentTransition (vnode) {
-  while ((vnode = vnode.parent)) {
-    if (vnode.data.transition) {
-      return true
-    }
-  }
-}
-
-function isSameChild (child, oldChild) {
-  return oldChild.key === child.key && oldChild.tag === child.tag
-}
-
-var Transition = {
-  name: 'transition',
-  props: transitionProps,
-  abstract: true,
-
-  render: function render (h) {
-    var this$1 = this;
-
-    var children = this.$slots.default;
-    if (!children) {
-      return
-    }
-
-    // filter out text nodes (possible whitespaces)
-    children = children.filter(function (c) { return c.tag || isAsyncPlaceholder(c); });
-    /* istanbul ignore if */
-    if (!children.length) {
-      return
-    }
-
-    // warn multiple elements
-    if (process.env.NODE_ENV !== 'production' && children.length > 1) {
-      warn(
-        '<transition> can only be used on a single element. Use ' +
-        '<transition-group> for lists.',
-        this.$parent
-      );
-    }
-
-    var mode = this.mode;
-
-    // warn invalid mode
-    if (process.env.NODE_ENV !== 'production' &&
-      mode && mode !== 'in-out' && mode !== 'out-in'
-    ) {
-      warn(
-        'invalid <transition> mode: ' + mode,
-        this.$parent
-      );
-    }
-
-    var rawChild = children[0];
-
-    // if this is a component root node and the component's
-    // parent container node also has transition, skip.
-    if (hasParentTransition(this.$vnode)) {
-      return rawChild
-    }
-
-    // apply transition data to child
-    // use getRealChild() to ignore abstract components e.g. keep-alive
-    var child = getRealChild(rawChild);
-    /* istanbul ignore if */
-    if (!child) {
-      return rawChild
-    }
-
-    if (this._leaving) {
-      return placeholder(h, rawChild)
-    }
-
-    // ensure a key that is unique to the vnode type and to this transition
-    // component instance. This key will be used to remove pending leaving nodes
-    // during entering.
-    var id = "__transition-" + (this._uid) + "-";
-    child.key = child.key == null
-      ? child.isComment
-        ? id + 'comment'
-        : id + child.tag
-      : isPrimitive(child.key)
-        ? (String(child.key).indexOf(id) === 0 ? child.key : id + child.key)
-        : child.key;
-
-    var data = (child.data || (child.data = {})).transition = extractTransitionData(this);
-    var oldRawChild = this._vnode;
-    var oldChild = getRealChild(oldRawChild);
-
-    // mark v-show
-    // so that the transition module can hand over the control to the directive
-    if (child.data.directives && child.data.directives.some(function (d) { return d.name === 'show'; })) {
-      child.data.show = true;
-    }
-
-    if (
-      oldChild &&
-      oldChild.data &&
-      !isSameChild(child, oldChild) &&
-      !isAsyncPlaceholder(oldChild) &&
-      // #6687 component root is a comment node
-      !(oldChild.componentInstance && oldChild.componentInstance._vnode.isComment)
-    ) {
-      // replace old child transition data with fresh one
-      // important for dynamic transitions!
-      var oldData = oldChild.data.transition = extend({}, data);
-      // handle transition mode
-      if (mode === 'out-in') {
-        // return placeholder node and queue update when leave finishes
-        this._leaving = true;
-        mergeVNodeHook(oldData, 'afterLeave', function () {
-          this$1._leaving = false;
-          this$1.$forceUpdate();
-        });
-        return placeholder(h, rawChild)
-      } else if (mode === 'in-out') {
-        if (isAsyncPlaceholder(child)) {
-          return oldRawChild
-        }
-        var delayedLeave;
-        var performLeave = function () { delayedLeave(); };
-        mergeVNodeHook(data, 'afterEnter', performLeave);
-        mergeVNodeHook(data, 'enterCancelled', performLeave);
-        mergeVNodeHook(oldData, 'delayLeave', function (leave) { delayedLeave = leave; });
-      }
-    }
-
-    return rawChild
-  }
-};
-
-/*  */
-
-// Provides transition support for list items.
-// supports move transitions using the FLIP technique.
-
-// Because the vdom's children update algorithm is "unstable" - i.e.
-// it doesn't guarantee the relative positioning of removed elements,
-// we force transition-group to update its children into two passes:
-// in the first pass, we remove all nodes that need to be removed,
-// triggering their leaving transition; in the second pass, we insert/move
-// into the final desired state. This way in the second pass removed
-// nodes will remain where they should be.
-
-var props = extend({
-  tag: String,
-  moveClass: String
-}, transitionProps);
-
-delete props.mode;
-
-var TransitionGroup = {
-  props: props,
-
-  render: function render (h) {
-    var tag = this.tag || this.$vnode.data.tag || 'span';
-    var map = Object.create(null);
-    var prevChildren = this.prevChildren = this.children;
-    var rawChildren = this.$slots.default || [];
-    var children = this.children = [];
-    var transitionData = extractTransitionData(this);
-
-    for (var i = 0; i < rawChildren.length; i++) {
-      var c = rawChildren[i];
-      if (c.tag) {
-        if (c.key != null && String(c.key).indexOf('__vlist') !== 0) {
-          children.push(c);
-          map[c.key] = c
-          ;(c.data || (c.data = {})).transition = transitionData;
-        } else if (process.env.NODE_ENV !== 'production') {
-          var opts = c.componentOptions;
-          var name = opts ? (opts.Ctor.options.name || opts.tag || '') : c.tag;
-          warn(("<transition-group> children must be keyed: <" + name + ">"));
-        }
-      }
-    }
-
-    if (prevChildren) {
-      var kept = [];
-      var removed = [];
-      for (var i$1 = 0; i$1 < prevChildren.length; i$1++) {
-        var c$1 = prevChildren[i$1];
-        c$1.data.transition = transitionData;
-        c$1.data.pos = c$1.elm.getBoundingClientRect();
-        if (map[c$1.key]) {
-          kept.push(c$1);
-        } else {
-          removed.push(c$1);
-        }
-      }
-      this.kept = h(tag, null, kept);
-      this.removed = removed;
-    }
-
-    return h(tag, null, children)
-  },
-
-  beforeUpdate: function beforeUpdate () {
-    // force removing pass
-    this.__patch__(
-      this._vnode,
-      this.kept,
-      false, // hydrating
-      true // removeOnly (!important, avoids unnecessary moves)
-    );
-    this._vnode = this.kept;
-  },
-
-  updated: function updated () {
-    var children = this.prevChildren;
-    var moveClass = this.moveClass || ((this.name || 'v') + '-move');
-    if (!children.length || !this.hasMove(children[0].elm, moveClass)) {
-      return
-    }
-
-    // we divide the work into three loops to avoid mixing DOM reads and writes
-    // in each iteration - which helps prevent layout thrashing.
-    children.forEach(callPendingCbs);
-    children.forEach(recordPosition);
-    children.forEach(applyTranslation);
-
-    // force reflow to put everything in position
-    // assign to this to avoid being removed in tree-shaking
-    // $flow-disable-line
-    this._reflow = document.body.offsetHeight;
-
-    children.forEach(function (c) {
-      if (c.data.moved) {
-        var el = c.elm;
-        var s = el.style;
-        addTransitionClass(el, moveClass);
-        s.transform = s.WebkitTransform = s.transitionDuration = '';
-        el.addEventListener(transitionEndEvent, el._moveCb = function cb (e) {
-          if (!e || /transform$/.test(e.propertyName)) {
-            el.removeEventListener(transitionEndEvent, cb);
-            el._moveCb = null;
-            removeTransitionClass(el, moveClass);
-          }
-        });
-      }
-    });
-  },
-
-  methods: {
-    hasMove: function hasMove (el, moveClass) {
-      /* istanbul ignore if */
-      if (!hasTransition) {
-        return false
-      }
-      /* istanbul ignore if */
-      if (this._hasMove) {
-        return this._hasMove
-      }
-      // Detect whether an element with the move class applied has
-      // CSS transitions. Since the element may be inside an entering
-      // transition at this very moment, we make a clone of it and remove
-      // all other transition classes applied to ensure only the move class
-      // is applied.
-      var clone = el.cloneNode();
-      if (el._transitionClasses) {
-        el._transitionClasses.forEach(function (cls) { removeClass(clone, cls); });
-      }
-      addClass(clone, moveClass);
-      clone.style.display = 'none';
-      this.$el.appendChild(clone);
-      var info = getTransitionInfo(clone);
-      this.$el.removeChild(clone);
-      return (this._hasMove = info.hasTransform)
-    }
-  }
-};
-
-function callPendingCbs (c) {
-  /* istanbul ignore if */
-  if (c.elm._moveCb) {
-    c.elm._moveCb();
-  }
-  /* istanbul ignore if */
-  if (c.elm._enterCb) {
-    c.elm._enterCb();
-  }
-}
-
-function recordPosition (c) {
-  c.data.newPos = c.elm.getBoundingClientRect();
-}
-
-function applyTranslation (c) {
-  var oldPos = c.data.pos;
-  var newPos = c.data.newPos;
-  var dx = oldPos.left - newPos.left;
-  var dy = oldPos.top - newPos.top;
-  if (dx || dy) {
-    c.data.moved = true;
-    var s = c.elm.style;
-    s.transform = s.WebkitTransform = "translate(" + dx + "px," + dy + "px)";
-    s.transitionDuration = '0s';
-  }
-}
-
-var platformComponents = {
-  Transition: Transition,
-  TransitionGroup: TransitionGroup
-};
-
-/*  */
-
-// install platform specific utils
-Vue.config.mustUseProp = mustUseProp;
-Vue.config.isReservedTag = isReservedTag;
-Vue.config.isReservedAttr = isReservedAttr;
-Vue.config.getTagNamespace = getTagNamespace;
-Vue.config.isUnknownElement = isUnknownElement;
-
-// install platform runtime directives & components
-extend(Vue.options.directives, platformDirectives);
-extend(Vue.options.components, platformComponents);
-
-// install platform patch function
-Vue.prototype.__patch__ = inBrowser ? patch : noop;
-
-// public mount method
-Vue.prototype.$mount = function (
-  el,
-  hydrating
-) {
-  el = el && inBrowser ? query(el) : undefined;
-  return mountComponent(this, el, hydrating)
-};
-
-// devtools global hook
-/* istanbul ignore next */
-if (inBrowser) {
-  setTimeout(function () {
-    if (config.devtools) {
-      if (devtools) {
-        devtools.emit('init', Vue);
-      } else if (
-        process.env.NODE_ENV !== 'production' &&
-        process.env.NODE_ENV !== 'test' &&
-        isChrome
-      ) {
-        console[console.info ? 'info' : 'log'](
-          'Download the Vue Devtools extension for a better development experience:\n' +
-          'https://github.com/vuejs/vue-devtools'
-        );
-      }
-    }
-    if (process.env.NODE_ENV !== 'production' &&
-      process.env.NODE_ENV !== 'test' &&
-      config.productionTip !== false &&
-      typeof console !== 'undefined'
-    ) {
-      console[console.info ? 'info' : 'log'](
-        "You are running Vue in development mode.\n" +
-        "Make sure to turn on production mode when deploying for production.\n" +
-        "See more tips at https://vuejs.org/guide/deployment.html"
-      );
-    }
-  }, 0);
-}
-
-var ComponentView = function ComponentView(component, ref) {
-	var node = ref.node;
-	var view = ref.view;
-	var getPos = ref.getPos;
-	var decorations = ref.decorations;
-	var editable = ref.editable;
-
-	this.component = component;
-	this.node = node;
-	this.view = view;
-	this.getPos = getPos;
-	this.decorations = decorations;
-	this.editable = editable;
-
-	this.dom = this.createDOM();
-	this.contentDOM = this._vm.$refs.content;
-};
-
-ComponentView.prototype.createDOM = function createDOM () {
-		var this$1 = this;
-
-	var Component = Vue.extend(this.component);
-	this._vm = new Component({
-		propsData: {
-			node: this.node,
-			view: this.view,
-			getPos: this.getPos,
-			decorations: this.decorations,
-			editable: this.editable,
-			updateAttrs: function (attrs) { return this$1.updateAttrs(attrs); },
-			updateContent: function (content) { return this$1.updateContent(content); },
-		},
-	}).$mount();
-	return this._vm.$el
-};
-
-ComponentView.prototype.updateAttrs = function updateAttrs (attrs) {
-	var transaction = this.view.state.tr.setNodeMarkup(this.getPos(), null, Object.assign({}, this.node.attrs,
-		attrs));
-	this.view.dispatch(transaction);
-};
-
-ComponentView.prototype.updateContent = function updateContent (content) {
-	var transaction = this.view.state.tr.setNodeMarkup(this.getPos(), this.node.type, { content: content });
-	this.view.dispatch(transaction);
-};
-
-ComponentView.prototype.ignoreMutation = function ignoreMutation () {
-	return true
-};
-
-ComponentView.prototype.stopEvent = function stopEvent () {
-	return true
-};
-
-ComponentView.prototype.update = function update (node, decorations) {
-	if (node.type !== this.node.type) {
-		return false
-	}
-
-	if (node === this.node && this.decorations === decorations) {
-		return true
-	}
-
-	this.node = node;
-	this.decorations = decorations;
-	this._vm._props.node = node;
-	this._vm._props.decorations = decorations;
-	return true
-};
-
-ComponentView.prototype.destroy = function destroy () {
-	this._vm.$destroy();
-};
-
-function initNodeViews$$1(ref) {
-  var nodes = ref.nodes;
-  var editable = ref.editable;
-
-  var nodeViews = {};
-  Object.keys(nodes).forEach(function (nodeName) {
-    nodeViews[nodeName] = function (node, view, getPos, decorations) {
-      var component = nodes[nodeName];
-      return new ComponentView(component, {
-        node: node,
-        view: view,
-        getPos: getPos,
-        decorations: decorations,
-        editable: editable,
-      })
-    };
-  });
-  return nodeViews
-}
-
-var isMac = typeof navigator !== 'undefined' ? /Mac/.test(navigator.platform) : false;
-
-function getMarkAttrs (state, type) {
-	var ref = state.selection;
-	var from = ref.from;
-	var to = ref.to;
-	var marks = [];
-
-	state.doc.nodesBetween(from, to, function (node) {
-		marks = marks.concat( node.marks);
-	});
-
-	var mark = marks.find(function (mark) { return mark.type.name === type.name; });
-
-	if (mark) {
-		return mark.attrs
-	}
-
-	return {}
-}
-
-function markIsActive (state, type) {
-	var ref = state.selection;
-	var from = ref.from;
-	var $from = ref.$from;
-	var to = ref.to;
-	var empty = ref.empty;
-
-	if (empty) {
-		return !!type.isInSet(state.storedMarks || $from.marks())
-	}
-
-	return !!state.doc.rangeHasMark(from, to, type)
-}
-
-var dist$7 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-
-
-// Because working with row and column-spanning cells is not quite
-// trivial, this code builds up a descriptive structure for a given
-// table node. The structures are cached with the (persistent) table
-// nodes as key, so that they only have to be recomputed when the
-// content of the table changes.
-//
-// This does mean that they have to store table-relative, not
-// document-relative positions. So code that uses them will typically
-// compute the start position of the table and offset positions passed
-// to or gotten from this structure by that amount.
-
-var readFromCache, addToCache;
-// Prefer using a weak map to cache table maps. Fall back on a
-// fixed-size cache if that's not supported.
-if (typeof WeakMap != "undefined") {
-  var cache = new WeakMap;
-  readFromCache = function (key) { return cache.get(key); };
-  addToCache = function (key, value) {
-    cache.set(key, value);
-    return value
-  };
-} else {
-  var cache$1 = [], cacheSize = 10, cachePos = 0;
-  readFromCache = function (key) {
-    for (var i = 0; i < cache$1.length; i += 2)
-      { if (cache$1[i] == key) { return cache$1[i + 1] } }
-  };
-  addToCache = function (key, value) {
-    if (cachePos == cacheSize) { cachePos = 0; }
-    cache$1[cachePos++] = key;
-    return cache$1[cachePos++] = value
-  };
-}
-
-var Rect = function Rect(left, top, right, bottom) {
-  this.left = left; this.top = top; this.right = right; this.bottom = bottom;
-};
-
-// ::- A table map describes the structore of a given table. To avoid
-// recomputing them all the time, they are cached per table node. To
-// be able to do that, positions saved in the map are relative to the
-// start of the table, rather than the start of the document.
-var TableMap = function TableMap(width, height, map, problems) {
-  // :: number The width of the table
-  this.width = width;
-  // :: number The table's height
-  this.height = height;
-  // :: [number] A width * height array with the start position of
-  // the cell covering that part of the table in each slot
-  this.map = map;
-  // An optional array of problems (cell overlap or non-rectangular
-  // shape) for the table, used by the table normalizer.
-  this.problems = problems;
-};
-
-// :: (number) → Rect
-// Find the dimensions of the cell at the given position.
-TableMap.prototype.findCell = function findCell (pos) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.map.length; i++) {
-    var curPos = this$1.map[i];
-    if (curPos != pos) { continue }
-    var left = i % this$1.width, top = (i / this$1.width) | 0;
-    var right = left + 1, bottom = top + 1;
-    for (var j = 1; right < this.width && this.map[i + j] == curPos; j++) { right++; }
-    for (var j$1 = 1; bottom < this.height && this.map[i + (this.width * j$1)] == curPos; j$1++) { bottom++; }
-    return new Rect(left, top, right, bottom)
-  }
-  throw new RangeError("No cell with offset " + pos + " found")
-};
-
-// :: (number) → number
-// Find the left side of the cell at the given position.
-TableMap.prototype.colCount = function colCount (pos) {
-    var this$1 = this;
-
-  for (var i = 0; i < this.map.length; i++)
-    { if (this$1.map[i] == pos) { return i % this$1.width } }
-  throw new RangeError("No cell with offset " + pos + " found")
-};
-
-// :: (number, string, number) → ?number
-// Find the next cell in the given direction, starting from the cell
-// at `pos`, if any.
-TableMap.prototype.nextCell = function nextCell (pos, axis, dir) {
-  var ref = this.findCell(pos);
-    var left = ref.left;
-    var right = ref.right;
-    var top = ref.top;
-    var bottom = ref.bottom;
-  if (axis == "horiz") {
-    if (dir < 0 ? left == 0 : right == this.width) { return null }
-    return this.map[top * this.width + (dir < 0 ? left - 1 : right)]
-  } else {
-    if (dir < 0 ? top == 0 : bottom == this.height) { return null }
-    return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)]
-  }
-};
-
-// :: (number, number) → Rect
-// Get the rectangle spanning the two given cells.
-TableMap.prototype.rectBetween = function rectBetween (a, b) {
-  var ref = this.findCell(a);
-    var leftA = ref.left;
-    var rightA = ref.right;
-    var topA = ref.top;
-    var bottomA = ref.bottom;
-  var ref$1 = this.findCell(b);
-    var leftB = ref$1.left;
-    var rightB = ref$1.right;
-    var topB = ref$1.top;
-    var bottomB = ref$1.bottom;
-  return new Rect(Math.min(leftA, leftB), Math.min(topA, topB),
-                  Math.max(rightA, rightB), Math.max(bottomA, bottomB))
-};
-
-// :: (Rect) → [number]
-// Return the position of all cells that have the top left corner in
-// the given rectangle.
-TableMap.prototype.cellsInRect = function cellsInRect (rect) {
-    var this$1 = this;
-
-  var result = [], seen = [];
-  for (var row = rect.top; row < rect.bottom; row++) {
-    for (var col = rect.left; col < rect.right; col++) {
-      var index = row * this$1.width + col, pos = this$1.map[index];
-      if (seen.indexOf(pos) > -1) { continue }
-      seen.push(pos);
-      if ((col != rect.left || !col || this$1.map[index - 1] != pos) &&
-          (row != rect.top || !row || this$1.map[index - this$1.width] != pos))
-        { result.push(pos); }
-    }
-  }
-  return result
-};
-
-// :: (number, number, Node) → number
-// Return the position at which the cell at the given row and column
-// starts, or would start, if a cell started there.
-TableMap.prototype.positionAt = function positionAt (row, col, table) {
-    var this$1 = this;
-
-  for (var i = 0, rowStart = 0;; i++) {
-    var rowEnd = rowStart + table.child(i).nodeSize;
-    if (i == row) {
-      var index = col + row * this$1.width, rowEndIndex = (row + 1) * this$1.width;
-      // Skip past cells from previous rows (via rowspan)
-      while (index < rowEndIndex && this.map[index] < rowStart) { index++; }
-      return index == rowEndIndex ? rowEnd - 1 : this$1.map[index]
-    }
-    rowStart = rowEnd;
-  }
-};
-
-// :: (Node) → TableMap
-// Find the table map for the given table node.
-TableMap.get = function get (table) {
-  return readFromCache(table) || addToCache(table, computeMap(table))
-};
-
-// Compute a table map.
-function computeMap(table) {
-  if (table.type.spec.tableRole != "table") { throw new RangeError("Not a table node: " + table.type.name) }
-  var width = findWidth(table), height = table.childCount;
-  var map = [], mapPos = 0, problems = null, colWidths = [];
-  for (var i = 0, e = width * height; i < e; i++) { map[i] = 0; }
-
-  for (var row = 0, pos = 0; row < height; row++) {
-    var rowNode = table.child(row);
-    pos++;
-    for (var i$1 = 0;; i$1++) {
-      while (mapPos < map.length && map[mapPos] != 0) { mapPos++; }
-      if (i$1 == rowNode.childCount) { break }
-      var cellNode = rowNode.child(i$1);
-      var ref = cellNode.attrs;
-      var colspan = ref.colspan;
-      var rowspan = ref.rowspan;
-      var colwidth = ref.colwidth;
-      for (var h = 0; h < rowspan; h++) {
-        if (h + row >= height) {
-          (problems || (problems = [])).push({type: "overlong_rowspan", pos: pos, n: rowspan - h});
-          break
-        }
-        var start = mapPos + (h * width);
-        for (var w = 0; w < colspan; w++) {
-          if (map[start + w] == 0)
-            { map[start + w] = pos; }
-          else
-            { (problems || (problems = [])).push({type: "collision", row: row, pos: pos, n: colspan - w}); }
-          var colW = colwidth && colwidth[w];
-          if (colW) {
-            var widthIndex = ((start + w) % width) * 2, prev = colWidths[widthIndex];
-            if (prev == null || (prev != colW && colWidths[widthIndex + 1] == 1)) {
-              colWidths[widthIndex] = colW;
-              colWidths[widthIndex + 1] = 1;
-            } else if (prev == colW) {
-              colWidths[widthIndex + 1]++;
-            }
-          }
-        }
-      }
-      mapPos += colspan;
-      pos += cellNode.nodeSize;
-    }
-    var expectedPos = (row + 1) * width, missing = 0;
-    while (mapPos < expectedPos) { if (map[mapPos++] == 0) { missing++; } }
-    if (missing) { (problems || (problems = [])).push({type: "missing", row: row, n: missing}); }
-    pos++;
-  }
-
-  var tableMap = new TableMap(width, height, map, problems), badWidths = false;
-
-  // For columns that have defined widths, but whose widths disagree
-  // between rows, fix up the cells whose width doesn't match the
-  // computed one.
-  for (var i$2 = 0; !badWidths && i$2 < colWidths.length; i$2 += 2)
-    { if (colWidths[i$2] != null && colWidths[i$2 + 1] < height) { badWidths = true; } }
-  if (badWidths) { findBadColWidths(tableMap, colWidths, table); }
-
-  return tableMap
-}
-
-function findWidth(table) {
-  var width = -1, hasRowSpan = false;
-  for (var row = 0; row < table.childCount; row++) {
-    var rowNode = table.child(row), rowWidth = 0;
-    if (hasRowSpan) { for (var j = 0; j < row; j++) {
-      var prevRow = table.child(j);
-      for (var i = 0; i < prevRow.childCount; i++) {
-        var cell = prevRow.child(i);
-        if (j + cell.attrs.rowspan > row) { rowWidth += cell.attrs.colspan; }
-      }
-    } }
-    for (var i$1 = 0; i$1 < rowNode.childCount; i$1++) {
-      var cell$1 = rowNode.child(i$1);
-      rowWidth += cell$1.attrs.colspan;
-      if (cell$1.attrs.rowspan > 1) { hasRowSpan = true; }
-    }
-    if (width == -1)
-      { width = rowWidth; }
-    else if (width != rowWidth)
-      { width = Math.max(width, rowWidth); }
-  }
-  return width
-}
-
-function findBadColWidths(map, colWidths, table) {
-  if (!map.problems) { map.problems = []; }
-  for (var i = 0, seen = []; i < map.map.length; i++) {
-    var pos = map.map[i];
-    if (seen.indexOf(pos) > -1) { continue }
-    seen.push(pos);
-    var node = table.nodeAt(pos), updated = null;
-    for (var j = 0; j < node.attrs.colspan; j++) {
-      var col = (i + j) % map.width, colWidth = colWidths[col * 2];
-      if (colWidth != null && (!node.attrs.colwidth || node.attrs.colwidth[j] != colWidth))
-        { (updated || (updated = freshColWidth(node.attrs)))[j] = colWidth; }
-    }
-    if (updated) { map.problems.unshift({type: "colwidth mismatch", pos: pos, colwidth: updated}); }
-  }
-}
-
-function freshColWidth(attrs) {
-  if (attrs.colwidth) { return attrs.colwidth.slice() }
-  var result = [];
-  for (var i = 0; i < attrs.colspan; i++) { result.push(0); }
-  return result
-}
-
-// Various helper function for working with tables
-
-var key = new dist$2.PluginKey("selectingCells");
-
-function cellAround($pos) {
-  for (var d = $pos.depth - 1; d > 0; d--)
-    { if ($pos.node(d).type.spec.tableRole == "row") { return $pos.node(0).resolve($pos.before(d + 1)) } }
-  return null
-}
-
-function cellWrapping($pos) {
-  for (var d = $pos.depth - 1; d > 0; d--) {
-    var role = $pos.node(d).type.spec.tableRole;
-    if (role === "cell" || role === 'header_cell') { return $pos.node(d) }
-  }
-  return null
-}
-
-function isInTable(state) {
-  var $head = state.selection.$head;
-  for (var d = $head.depth; d > 0; d--) { if ($head.node(d).type.spec.tableRole == "row") { return true } }
-  return false
-}
-
-function selectionCell(state) {
-  var sel = state.selection;
-  if (sel.$anchorCell) {
-    return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;
-  } else if (sel.node && sel.node.type.spec.tableRole == "cell") {
-    return sel.$anchor
-  }
-  return cellAround(sel.$head) || cellNear(sel.$head)
-}
-
-function cellNear($pos) {
-  for (var after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {
-    var role = after.type.spec.tableRole;
-    if (role == "cell" || role == "header_cell") { return $pos.doc.resolve(pos) }
-  }
-  for (var before = $pos.nodeBefore, pos$1 = $pos.pos; before; before = before.lastChild, pos$1--) {
-    var role$1 = before.type.spec.tableRole;
-    if (role$1 == "cell" || role$1 == "header_cell") { return $pos.doc.resolve(pos$1 - before.nodeSize) }
-  }
-}
-
-function pointsAtCell($pos) {
-  return $pos.parent.type.spec.tableRole == "row" && $pos.nodeAfter
-}
-
-function moveCellForward($pos) {
-  return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize)
-}
-
-function inSameTable($a, $b) {
-  return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1)
-}
-
-function findCell($pos) {
-  return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1))
-}
-
-function colCount($pos) {
-  return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1))
-}
-
-function nextCell($pos, axis, dir) {
-  var start = $pos.start(-1), map = TableMap.get($pos.node(-1));
-  var moved = map.nextCell($pos.pos - start, axis, dir);
-  return moved == null ? null : $pos.node(0).resolve(start + moved)
-}
-
-function setAttr(attrs, name, value) {
-  var result = {};
-  for (var prop in attrs) { result[prop] = attrs[prop]; }
-  result[name] = value;
-  return result
-}
-
-function rmColSpan(attrs, pos, n) {
-  if ( n === void 0 ) { n=1; }
-
-  var result = setAttr(attrs, "colspan", attrs.colspan - n);
-  if (result.colwidth) {
-    result.colwidth = result.colwidth.slice();
-    result.colwidth.splice(pos, n);
-    if (!result.colwidth.some(function (w) { return w > 0; })) { result.colwidth = null; }
-  }
-  return result
-}
-
-function addColSpan(attrs, pos, n) {
-  if ( n === void 0 ) { n=1; }
-
-  var result = setAttr(attrs, "colspan", attrs.colspan + n);
-  if (result.colwidth) {
-    result.colwidth = result.colwidth.slice();
-    for (var i = 0; i < n; i++) { result.colwidth.splice(pos, 0, 0); }
-  }
-  return result
-}
-
-// This file defines a ProseMirror selection subclass that models
-
-// ::- A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)
-// subclass that represents a cell selection spanning part of a table.
-// With the plugin enabled, these will be created when the user
-// selects across cells, and will be drawn by giving selected cells a
-// `selectedCell` CSS class.
-var CellSelection = (function (Selection) {
-  function CellSelection($anchorCell, $headCell) {
-    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-    var table = $anchorCell.node(-1), map = TableMap.get(table), start = $anchorCell.start(-1);
-    var rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start);
-    var doc = $anchorCell.node(0);
-    var cells = map.cellsInRect(rect).filter(function (p) { return p != $headCell.pos - start; });
-    // Make the head cell the first range, so that it counts as the
-    // primary part of the selection
-    cells.unshift($headCell.pos - start);
-    var ranges = cells.map(function (pos) {
-      var cell = table.nodeAt(pos), from = pos + start + 1;
-      return new dist$2.SelectionRange(doc.resolve(from), doc.resolve(from + cell.content.size))
-    });
-    Selection.call(this, ranges[0].$from, ranges[0].$to, ranges);
-    // :: ResolvedPos
-    // A resolved position pointing _in front of_ the anchor cell (the one
-    // that doesn't move when extending the selection).
-    this.$anchorCell = $anchorCell;
-    // :: ResolvedPos
-    // A resolved position pointing in front of the head cell (the one
-    // moves when extending the selection).
-    this.$headCell = $headCell;
-  }
-
-  if ( Selection ) { CellSelection.__proto__ = Selection; }
-  CellSelection.prototype = Object.create( Selection && Selection.prototype );
-  CellSelection.prototype.constructor = CellSelection;
-
-  CellSelection.prototype.map = function map (doc, mapping) {
-    var $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));
-    var $headCell = doc.resolve(mapping.map(this.$headCell.pos));
-    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {
-      var tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);
-      if (tableChanged && this.isRowSelection())
-        { return CellSelection.rowSelection($anchorCell, $headCell) }
-      else if (tableChanged && this.isColSelection())
-        { return CellSelection.colSelection($anchorCell, $headCell) }
-      else
-        { return new CellSelection($anchorCell, $headCell) }
-    }
-    return dist$2.TextSelection.between($anchorCell, $headCell)
-  };
-
-  // :: () → Slice
-  // Returns a rectangular slice of table rows containing the selected
-  // cells.
-  CellSelection.prototype.content = function content () {
-    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
-    var rect = map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start);
-    var seen = [], rows = [];
-    for (var row = rect.top; row < rect.bottom; row++) {
-      var rowContent = [];
-      for (var index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {
-        var pos = map.map[index];
-        if (seen.indexOf(pos) == -1) {
-          seen.push(pos);
-          var cellRect = map.findCell(pos), cell = table.nodeAt(pos);
-          var extraLeft = rect.left - cellRect.left, extraRight = cellRect.right - rect.right;
-          if (extraLeft > 0 || extraRight > 0) {
-            var attrs = cell.attrs;
-            if (extraLeft > 0) { attrs = rmColSpan(attrs, 0, extraLeft); }
-            if (extraRight > 0) { attrs = rmColSpan(attrs, attrs.colspan - extraRight, extraRight); }
-            if (cellRect.left < rect.left) { cell = cell.type.createAndFill(attrs); }
-            else { cell = cell.type.create(attrs, cell.content); }
-          }
-          if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {
-            var attrs$1 = setAttr(cell.attrs, "rowspan", Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top));
-            if (cellRect.top < rect.top) { cell = cell.type.createAndFill(attrs$1); }
-            else { cell = cell.type.create(attrs$1, cell.content); }
-          }
-          rowContent.push(cell);
-        }
-      }
-      rows.push(table.child(row).copy(dist.Fragment.from(rowContent)));
-    }
-
-    var fragment = this.isColSelection() && this.isRowSelection() ? table : rows;
-    return new dist.Slice(dist.Fragment.from(fragment), 1, 1)
-  };
-
-  CellSelection.prototype.replace = function replace (tr, content) {
-    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-    var mapFrom = tr.steps.length, ranges = this.ranges;
-    for (var i = 0; i < ranges.length; i++) {
-      var ref = ranges[i];
-      var $from = ref.$from;
-      var $to = ref.$to;
-      var mapping = tr.mapping.slice(mapFrom);
-      tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? dist.Slice.empty : content);
-    }
-    var sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1);
-    if (sel) { tr.setSelection(sel); }
-  };
-
-  CellSelection.prototype.replaceWith = function replaceWith (tr, node) {
-    this.replace(tr, new dist.Slice(dist.Fragment.from(node), 0, 0));
-  };
-
-  CellSelection.prototype.forEachCell = function forEachCell (f) {
-    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
-    var cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start));
-    for (var i = 0; i < cells.length; i++)
-      { f(table.nodeAt(cells[i]), start + cells[i]); }
-  };
-
-  // :: () → bool
-  // True if this selection goes all the way from the top to the
-  // bottom of the table.
-  CellSelection.prototype.isColSelection = function isColSelection () {
-    var anchorTop = this.$anchorCell.index(-1), headTop = this.$headCell.index(-1);
-    if (Math.min(anchorTop, headTop) > 0) { return false }
-    var anchorBot = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan,
-        headBot = headTop + this.$headCell.nodeAfter.attrs.rowspan;
-    return Math.max(anchorBot, headBot) == this.$headCell.node(-1).childCount
-  };
-
-  // :: (ResolvedPos, ?ResolvedPos) → CellSelection
-  // Returns the smallest column selection that covers the given anchor
-  // and head cell.
-  CellSelection.colSelection = function colSelection ($anchorCell, $headCell) {
-    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
-    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
-    var doc = $anchorCell.node(0);
-    if (anchorRect.top <= headRect.top) {
-      if (anchorRect.top > 0)
-        { $anchorCell = doc.resolve(start + map.map[anchorRect.left]); }
-      if (headRect.bottom < map.height)
-        { $headCell = doc.resolve(start + map.map[map.width * (map.height - 1) + headRect.right - 1]); }
-    } else {
-      if (headRect.top > 0)
-        { $headCell = doc.resolve(start + map.map[headRect.left]); }
-      if (anchorRect.bottom < map.height)
-        { $anchorCell = doc.resolve(start + map.map[map.width * (map.height - 1) + anchorRect.right - 1]); }
-    }
-    return new CellSelection($anchorCell, $headCell)
-  };
-
-  // :: () → bool
-  // True if this selection goes all the way from the left to the
-  // right of the table.
-  CellSelection.prototype.isRowSelection = function isRowSelection () {
-    var map = TableMap.get(this.$anchorCell.node(-1)), start = this.$anchorCell.start(-1);
-    var anchorLeft = map.colCount(this.$anchorCell.pos - start),
-        headLeft = map.colCount(this.$headCell.pos - start);
-    if (Math.min(anchorLeft, headLeft) > 0) { return false }
-    var anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan,
-        headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;
-    return Math.max(anchorRight, headRight) == map.width
-  };
-
-  CellSelection.prototype.eq = function eq (other) {
-    return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos &&
-      other.$headCell.pos == this.$headCell.pos
-  };
-
-  // :: (ResolvedPos, ?ResolvedPos) → CellSelection
-  // Returns the smallest row selection that covers the given anchor
-  // and head cell.
-  CellSelection.rowSelection = function rowSelection ($anchorCell, $headCell) {
-    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
-    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
-    var doc = $anchorCell.node(0);
-    if (anchorRect.left <= headRect.left) {
-      if (anchorRect.left > 0)
-        { $anchorCell = doc.resolve(start + map.map[anchorRect.top * map.width]); }
-      if (headRect.right < map.width)
-        { $headCell = doc.resolve(start + map.map[map.width * (headRect.top + 1) - 1]); }
-    } else {
-      if (headRect.left > 0)
-        { $headCell = doc.resolve(start + map.map[headRect.top * map.width]); }
-      if (anchorRect.right < map.width)
-        { $anchorCell = doc.resolve(start + map.map[map.width * (anchorRect.top + 1) - 1]); }
-    }
-    return new CellSelection($anchorCell, $headCell)
-  };
-
-  CellSelection.prototype.toJSON = function toJSON () {
-    return {type: "cell", anchor: this.$anchorCell.pos, head: this.$headCell.pos}
-  };
-
-  CellSelection.fromJSON = function fromJSON (doc, json) {
-    return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head))
-  };
-
-  // :: (Node, number, ?number) → CellSelection
-  CellSelection.create = function create (doc, anchorCell, headCell) {
-    if ( headCell === void 0 ) { headCell = anchorCell; }
-
-    return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell))
-  };
-
-  CellSelection.prototype.getBookmark = function getBookmark () { return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos) };
-
-  return CellSelection;
-}(dist$2.Selection));
-
-CellSelection.prototype.visible = false;
-
-dist$2.Selection.jsonID("cell", CellSelection);
-
-var CellBookmark = function CellBookmark(anchor, head) {
-  this.anchor = anchor;
-  this.head = head;
-};
-CellBookmark.prototype.map = function map (mapping) {
-  return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head))
-};
-CellBookmark.prototype.resolve = function resolve (doc) {
-  var $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);
-  if ($anchorCell.parent.type.spec.tableRole == "row" &&
-      $headCell.parent.type.spec.tableRole == "row" &&
-      $anchorCell.index() < $anchorCell.parent.childCount &&
-      $headCell.index() < $headCell.parent.childCount &&
-      inSameTable($anchorCell, $headCell))
-    { return new CellSelection($anchorCell, $headCell) }
-  else
-    { return dist$2.Selection.near($headCell, 1) }
-};
-
-function drawCellSelection(state) {
-  if (!(state.selection instanceof CellSelection)) { return null }
-  var cells = [];
-  state.selection.forEachCell(function (node, pos) {
-    cells.push(dist$3.Decoration.node(pos, pos + node.nodeSize, {class: "selectedCell"}));
-  });
-  return dist$3.DecorationSet.create(state.doc, cells)
-}
-
-function isCellBoundarySelection(ref) {
-  var $from = ref.$from;
-  var $to = ref.$to;
-
-  if ($from.pos == $to.pos || $from.pos < $from.pos - 6) { return false } // Cheap elimination
-  var afterFrom = $from.pos, beforeTo = $to.pos, depth = $from.depth;
-  for (; depth >= 0; depth--, afterFrom++)
-    { if ($from.after(depth + 1) < $from.end(depth)) { break } }
-  for (var d = $to.depth; d >= 0; d--, beforeTo--)
-    { if ($to.before(d + 1) > $to.start(d)) { break } }
-  return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole)
-}
-
-function normalizeSelection(state, tr) {
-  var sel = (tr || state).selection, doc = (tr || state).doc, normalize, role;
-  if (sel instanceof dist$2.NodeSelection && (role = sel.node.type.spec.tableRole)) {
-    if (role == "cell" || role == "header_cell") {
-      normalize = CellSelection.create(doc, sel.from);
-    } else if (role == "row") {
-      var $cell = doc.resolve(sel.from + 1);
-      normalize = CellSelection.rowSelection($cell, $cell);
-    } else {
-      var map = TableMap.get(sel.node), start = sel.from + 1;
-      var lastCell = start + map.map[map.width * map.height - 1];
-      normalize = CellSelection.create(doc, start + 1, lastCell);
-    }
-  } else if (sel instanceof dist$2.TextSelection && isCellBoundarySelection(sel)) {
-    normalize = dist$2.TextSelection.create(doc, sel.from);
-  }
-  if (normalize)
-    { (tr || (tr = state.tr)).setSelection(normalize); }
-  return tr
-}
-
-// Helper for creating a schema that supports tables.
-
-function getCellAttrs(dom, extraAttrs) {
-  var widthAttr = dom.getAttribute("data-colwidth");
-  var widths = widthAttr && /^\d+(,\d+)*$/.test(widthAttr) ? widthAttr.split(",").map(function (s) { return Number(s); }) : null;
-  var colspan = Number(dom.getAttribute("colspan") || 1);
-  var result = {
-    colspan: colspan,
-    rowspan: Number(dom.getAttribute("rowspan") || 1),
-    colwidth: widths && widths.length == colspan ? widths : null
-  };
-  for (var prop in extraAttrs) {
-    var getter = extraAttrs[prop].getFromDOM;
-    var value = getter && getter(dom);
-    if (value != null) { result[prop] = value; }
-  }
-  return result
-}
-
-function setCellAttrs(node, extraAttrs) {
-  var attrs = {};
-  if (node.attrs.colspan != 1) { attrs.colspan = node.attrs.colspan; }
-  if (node.attrs.rowspan != 1) { attrs.rowspan = node.attrs.rowspan; }
-  if (node.attrs.colwidth)
-    { attrs["data-colwidth"] = node.attrs.colwidth.join(","); }
-  for (var prop in extraAttrs) {
-    var setter = extraAttrs[prop].setDOMAttr;
-    if (setter) { setter(node.attrs[prop], attrs); }
-  }
-  return attrs
-}
-
-// :: (Object) → Object
-//
-// This function creates a set of [node
-// specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for
-// `table`, `table_row`, and `table_cell` nodes types as used by this
-// module. The result can then be added to the set of nodes when
-// creating a a schema.
-//
-//   options::- The following options are understood:
-//
-//     tableGroup:: ?string
-//     A group name (something like `"block"`) to add to the table
-//     node type.
-//
-//     cellContent:: string
-//     The content expression for table cells.
-//
-//     cellAttributes:: ?Object
-//     Additional attributes to add to cells. Maps attribute names to
-//     objects with the following properties:
-//
-//       default:: any
-//       The attribute's default value.
-//
-//       getFromDOM:: ?(dom.Node) → any
-//       A function to read the attribute's value from a DOM node.
-//
-//       setDOMAttr:: ?(value: any, attrs: Object)
-//       A function to add the attribute's value to an attribute
-//       object that's used to render the cell's DOM.
-function tableNodes(options) {
-  var extraAttrs = options.cellAttributes || {};
-  var cellAttrs = {
-    colspan: {default: 1},
-    rowspan: {default: 1},
-    colwidth: {default: null}
-  };
-  for (var prop in extraAttrs)
-    { cellAttrs[prop] = {default: extraAttrs[prop].default}; }
-
-  return {
-    table: {
-      content: "table_row+",
-      tableRole: "table",
-      isolating: true,
-      group: options.tableGroup,
-      parseDOM: [{tag: "table"}],
-      toDOM: function toDOM() { return ["table", ["tbody", 0]] }
-    },
-    table_row: {
-      content: "(table_cell | table_header)*",
-      tableRole: "row",
-      parseDOM: [{tag: "tr"}],
-      toDOM: function toDOM() { return ["tr", 0] }
-    },
-    table_cell: {
-      content: options.cellContent,
-      attrs: cellAttrs,
-      tableRole: "cell",
-      isolating: true,
-      parseDOM: [{tag: "td", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
-      toDOM: function toDOM(node) { return ["td", setCellAttrs(node, extraAttrs), 0] }
-    },
-    table_header: {
-      content: options.cellContent,
-      attrs: cellAttrs,
-      tableRole: "header_cell",
-      isolating: true,
-      parseDOM: [{tag: "th", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
-      toDOM: function toDOM(node) { return ["th", setCellAttrs(node, extraAttrs), 0] }
-    }
-  }
-}
-
-function tableNodeTypes(schema) {
-  var result = schema.cached.tableNodeTypes;
-  if (!result) {
-    result = schema.cached.tableNodeTypes = {};
-    for (var name in schema.nodes) {
-      var type = schema.nodes[name], role = type.spec.tableRole;
-      if (role) { result[role] = type; }
-    }
-  }
-  return result
-}
-
-// Utilities used for copy/paste handling.
-
-// Utilities to help with copying and pasting table cells
-
-// : (Slice) → ?{width: number, height: number, rows: [Fragment]}
-// Get a rectangular area of cells from a slice, or null if the outer
-// nodes of the slice aren't table cells or rows.
-function pastedCells(slice) {
-  if (!slice.size) { return null }
-  var content = slice.content;
-  var openStart = slice.openStart;
-  var openEnd = slice.openEnd;
-  while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.firstChild.type.spec.tableRole == "table")) {
-    openStart--;
-    openEnd--;
-    content = content.firstChild.content;
-  }
-  var first = content.firstChild, role = first.type.spec.tableRole;
-  var schema = first.type.schema, rows = [];
-  if (role == "row") {
-    for (var i = 0; i < content.childCount; i++) {
-      var cells = content.child(i).content;
-      var left = i ? 0 : Math.max(0, openStart - 1);
-      var right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);
-      if (left || right) { cells = fitSlice(tableNodeTypes(schema).row, new dist.Slice(cells, left, right)).content; }
-      rows.push(cells);
-    }
-  } else if (role == "cell" || role == "header_cell") {
-    rows.push(openStart || openEnd ? fitSlice(tableNodeTypes(schema).row, new dist.Slice(content, openStart, openEnd)).content : content);
-  } else {
-    return null
-  }
-  return ensureRectangular(schema, rows)
-}
-
-// : (Schema, [Fragment]) → {width: number, height: number, rows: [Fragment]}
-// Compute the width and height of a set of cells, and make sure each
-// row has the same number of cells.
-function ensureRectangular(schema, rows) {
-  var widths = [];
-  for (var i = 0; i < rows.length; i++) {
-    var row = rows[i];
-    for (var j = row.childCount - 1; j >= 0; j--) {
-      var ref = row.child(j).attrs;
-      var rowspan = ref.rowspan;
-      var colspan = ref.colspan;
-      for (var r = i; r < i + rowspan; r++)
-        { widths[r] = (widths[r] || 0) + colspan; }
-    }
-  }
-  var width = 0;
-  for (var r$1 = 0; r$1 < widths.length; r$1++) { width = Math.max(width, widths[r$1]); }
-  for (var r$2 = 0; r$2 < widths.length; r$2++) {
-    if (r$2 >= rows.length) { rows.push(dist.Fragment.empty); }
-    if (widths[r$2] < width) {
-      var empty = tableNodeTypes(schema).cell.createAndFill(), cells = [];
-      for (var i$1 = widths[r$2]; i$1 < width; i$1++) { cells.push(empty); }
-      rows[r$2] = rows[r$2].append(dist.Fragment.from(cells));
-    }
-  }
-  return {height: rows.length, width: width, rows: rows}
-}
-
-function fitSlice(nodeType, slice) {
-  var node = nodeType.createAndFill();
-  var tr = new dist$1.Transform(node).replace(0, node.content.size, slice);
-  return tr.doc
-}
-
-// : ({width: number, height: number, rows: [Fragment]}, number, number) → {width: number, height: number, rows: [Fragment]}
-// Clip or extend (repeat) the given set of cells to cover the given
-// width and height. Will clip rowspan/colspan cells at the edges when
-// they stick out.
-function clipCells(ref, newWidth, newHeight) {
-  var width = ref.width;
-  var height = ref.height;
-  var rows = ref.rows;
-
-  if (width != newWidth) {
-    var added = [], newRows = [];
-    for (var row = 0; row < rows.length; row++) {
-      var frag = rows[row], cells = [];
-      for (var col = added[row] || 0, i = 0; col < newWidth; i++) {
-        var cell = frag.child(i % frag.childCount);
-        if (col + cell.attrs.colspan > newWidth)
-          { cell = cell.type.create(rmColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content); }
-        cells.push(cell);
-        col += cell.attrs.colspan;
-        for (var j = 1; j < cell.attrs.rowspan; j++)
-          { added[row + j] = (added[row + j] || 0) + cell.attrs.colspan; }
-      }
-      newRows.push(dist.Fragment.from(cells));
-    }
-    rows = newRows;
-    width = newWidth;
-  }
-
-  if (height != newHeight) {
-    var newRows$1 = [];
-    for (var row$1 = 0, i$1 = 0; row$1 < newHeight; row$1++, i$1++) {
-      var cells$1 = [], source = rows[i$1 % height];
-      for (var j$1 = 0; j$1 < source.childCount; j$1++) {
-        var cell$1 = source.child(j$1);
-        if (row$1 + cell$1.attrs.rowspan > newHeight)
-          { cell$1 = cell$1.type.create(setAttr(cell$1.attrs, "rowspan", newHeight - cell$1.attrs.rowspan), cell$1.content); }
-        cells$1.push(cell$1);
-      }
-      newRows$1.push(dist.Fragment.from(cells$1));
-    }
-    rows = newRows$1;
-    height = newHeight;
-  }
-
-  return {width: width, height: height, rows: rows}
-}
-
-// Make sure a table has at least the given width and height. Return
-// true if something was changed.
-function growTable(tr, map, table, start, width, height, mapFrom) {
-  var schema = tr.doc.type.schema, types = tableNodeTypes(schema), empty, emptyHead;
-  if (width > map.width) {
-    for (var row = 0, rowEnd = 0; row < map.height; row++) {
-      var rowNode = table.child(row);
-      rowEnd += rowNode.nodeSize;
-      var cells = [], add = (void 0);
-      if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)
-        { add = empty || (empty = types.cell.createAndFill()); }
-      else
-        { add = emptyHead || (emptyHead = types.header_cell.createAndFill()); }
-      for (var i = map.width; i < width; i++) { cells.push(add); }
-      tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);
-    }
-  }
-  if (height > map.height) {
-    var cells$1 = [];
-    for (var i$1 = 0, start$1 = (map.height - 1) * map.width; i$1 < Math.max(map.width, width); i$1++) {
-      var header = i$1 >= map.width ? false :
-          table.nodeAt(map.map[start$1 + i$1]).type == types.header_cell;
-      cells$1.push(header
-                 ? (emptyHead || (emptyHead = types.header_cell.createAndFill()))
-                 : (empty || (empty = types.cell.createAndFill())));
-    }
-
-    var emptyRow = types.row.create(null, dist.Fragment.from(cells$1)), rows = [];
-    for (var i$2 = map.height; i$2 < height; i$2++) { rows.push(emptyRow); }
-    tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);
-  }
-  return !!(empty || emptyHead)
-}
-
-// Make sure the given line (left, top) to (right, top) doesn't cross
-// any rowspan cells by splitting cells that cross it. Return true if
-// something changed.
-function isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {
-  if (top == 0 || top == map.height) { return false }
-  var found = false;
-  for (var col = left; col < right; col++) {
-    var index = top * map.width + col, pos = map.map[index];
-    if (map.map[index - map.width] == pos) {
-      found = true;
-      var cell = table.nodeAt(pos);
-      var ref = map.findCell(pos);
-      var cellTop = ref.top;
-      var cellLeft = ref.left;
-      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, setAttr(cell.attrs, "rowspan", top - cellTop));
-      tr.insert(tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),
-                cell.type.createAndFill(setAttr(cell.attrs, "rowspan", (cellTop + cell.attrs.rowspan) - top)));
-      col += cell.attrs.colspan - 1;
-    }
-  }
-  return found
-}
-
-// Make sure the given line (left, top) to (left, bottom) doesn't
-// cross any colspan cells by splitting cells that cross it. Return
-// true if something changed.
-function isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {
-  if (left == 0 || left == map.width) { return false }
-  var found = false;
-  for (var row = top; row < bottom; row++) {
-    var index = row * map.width + left, pos = map.map[index];
-    if (map.map[index - 1] == pos) {
-      found = true;
-      var cell = table.nodeAt(pos), cellLeft = map.colCount(pos);
-      var updatePos = tr.mapping.slice(mapFrom).map(pos + start);
-      tr.setNodeMarkup(updatePos, null, rmColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)));
-      tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(rmColSpan(cell.attrs, 0, left - cellLeft)));
-      row += cell.attrs.rowspan - 1;
-    }
-  }
-  return found
-}
-
-// Insert the given set of cells (as returned by `pastedCells`) into a
-// table, at the position pointed at by rect.
-function insertCells(state, dispatch, tableStart, rect, cells) {
-  var table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc, map = TableMap.get(table);
-  var top = rect.top;
-  var left = rect.left;
-  var right = left + cells.width, bottom = top + cells.height;
-  var tr = state.tr, mapFrom = 0;
-  function recomp() {
-    table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;
-    map = TableMap.get(table);
-    mapFrom = tr.mapping.maps.length;
-  }
-  // Prepare the table to be large enough and not have any cells
-  // crossing the boundaries of the rectangle that we want to
-  // insert into. If anything about it changes, recompute the table
-  // map so that subsequent operations can see the current shape.
-  if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) { recomp(); }
-  if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom)) { recomp(); }
-  if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)) { recomp(); }
-  if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom)) { recomp(); }
-  if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom)) { recomp(); }
-
-  for (var row = top; row < bottom; row++) {
-    var from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);
-    tr.replace(tr.mapping.slice(mapFrom).map(from + tableStart), tr.mapping.slice(mapFrom).map(to + tableStart),
-               new dist.Slice(cells.rows[row - top], 0, 0));
-  }
-  recomp();
-  tr.setSelection(new CellSelection(tr.doc.resolve(tableStart + map.positionAt(top, left, table)),
-                                    tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))));
-  dispatch(tr);
-}
-
-// This file defines a number of helpers for wiring up user input to
-
-var handleKeyDown = keymap_1.keydownHandler({
-  "ArrowLeft": arrow("horiz", -1),
-  "ArrowRight": arrow("horiz", 1),
-  "ArrowUp": arrow("vert", -1),
-  "ArrowDown": arrow("vert", 1),
-
-  "Shift-ArrowLeft": shiftArrow("horiz", -1),
-  "Shift-ArrowRight": shiftArrow("horiz", 1),
-  "Shift-ArrowUp": shiftArrow("vert", -1),
-  "Shift-ArrowDown": shiftArrow("vert", 1),
-
-  "Backspace": deleteCellSelection,
-  "Mod-Backspace": deleteCellSelection,
-  "Delete": deleteCellSelection,
-  "Mod-Delete": deleteCellSelection
-});
-
-function maybeSetSelection(state, dispatch, selection) {
-  if (selection.eq(state.selection)) { return false }
-  if (dispatch) { dispatch(state.tr.setSelection(selection)); }
-  return true
-}
-
-function arrow(axis, dir) {
-  return function (state, dispatch, view) {
-    var sel = state.selection;
-    if (sel instanceof CellSelection) {
-      return maybeSetSelection(state, dispatch, dist$2.Selection.near(sel.$headCell, dir))
-    }
-    if (axis != "horiz" && !sel.empty) { return false }
-    var end = atEndOfCell(view, axis, dir);
-    if (end == null) { return false }
-    if (axis == "horiz") {
-      return maybeSetSelection(state, dispatch, dist$2.Selection.near(state.doc.resolve(sel.head + dir), dir))
-    } else {
-      var $cell = state.doc.resolve(end), $next = nextCell($cell, axis, dir), newSel;
-      if ($next) { newSel = dist$2.Selection.near($next, 1); }
-      else if (dir < 0) { newSel = dist$2.Selection.near(state.doc.resolve($cell.before(-1)), -1); }
-      else { newSel = dist$2.Selection.near(state.doc.resolve($cell.after(-1)), 1); }
-      return maybeSetSelection(state, dispatch, newSel)
-    }
-  }
-}
-
-function shiftArrow(axis, dir) {
-  return function (state, dispatch, view) {
-    var sel = state.selection;
-    if (!(sel instanceof CellSelection)) {
-      var end = atEndOfCell(view, axis, dir);
-      if (end == null) { return false }
-      sel = new CellSelection(state.doc.resolve(end));
-    }
-    var $head = nextCell(sel.$headCell, axis, dir);
-    if (!$head) { return false }
-    return maybeSetSelection(state, dispatch, new CellSelection(sel.$anchorCell, $head))
-  }
-}
-
-function deleteCellSelection(state, dispatch) {
-  var sel = state.selection;
-  if (!(sel instanceof CellSelection)) { return false }
-  if (dispatch) {
-    var tr = state.tr, baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;
-    sel.forEachCell(function (cell, pos) {
-      if (!cell.content.eq(baseContent))
-        { tr.replace(tr.mapping.map(pos + 1), tr.mapping.map(pos + cell.nodeSize - 1),
-                   new dist.Slice(baseContent, 0, 0)); }
-    });
-    if (tr.docChanged) { dispatch(tr); }
-  }
-  return true
-}
-
-function handleTripleClick(view, pos) {
-  var doc = view.state.doc, $cell = cellAround(doc.resolve(pos));
-  if (!$cell) { return false }
-  view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));
-  return true
-}
-
-function handlePaste(view, _, slice) {
-  if (!isInTable(view.state)) { return false }
-  var cells = pastedCells(slice), sel = view.state.selection;
-  if (sel instanceof CellSelection) {
-    if (!cells) { cells = {width: 1, height: 1, rows: [dist.Fragment.from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]}; }
-    var table = sel.$anchorCell.node(-1), start = sel.$anchorCell.start(-1);
-    var rect = TableMap.get(table).rectBetween(sel.$anchorCell.pos - start, sel.$headCell.pos - start);
-    cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);
-    insertCells(view.state, view.dispatch, start, rect, cells);
-    return true
-  } else if (cells) {
-    var $cell = selectionCell(view.state), start$1 = $cell.start(-1);
-    insertCells(view.state, view.dispatch, start$1, TableMap.get($cell.node(-1)).findCell($cell.pos - start$1), cells);
-    return true
-  } else {
-    return false
-  }
-}
-
-function handleMouseDown(view, startEvent) {
-  if (startEvent.ctrlKey || startEvent.metaKey) { return }
-
-  var startDOMCell = domInCell(view, startEvent.target), $anchor;
-  if (startEvent.shiftKey && (view.state.selection instanceof CellSelection)) {
-    // Adding to an existing cell selection
-    setCellSelection(view.state.selection.$anchorCell, startEvent);
-    startEvent.preventDefault();
-  } else if (startEvent.shiftKey && startDOMCell &&
-             ($anchor = cellAround(view.state.selection.$anchor)) != null &&
-             cellUnderMouse(view, startEvent).pos != $anchor.pos) {
-    // Adding to a selection that starts in another cell (causing a
-    // cell selection to be created).
-    setCellSelection($anchor, startEvent);
-    startEvent.preventDefault();
-  } else if (!startDOMCell) {
-    // Not in a cell, let the default behavior happen.
-    return
-  }
-
-  // Create and dispatch a cell selection between the given anchor and
-  // the position under the mouse.
-  function setCellSelection($anchor, event) {
-    var $head = cellUnderMouse(view, event);
-    var starting = key.getState(view.state) == null;
-    if (!$head || !inSameTable($anchor, $head)) {
-      if (starting) { $head = $anchor; }
-      else { return }
-    }
-    var selection = new CellSelection($anchor, $head);
-    if (starting || !view.state.selection.eq(selection)) {
-      var tr = view.state.tr.setSelection(selection);
-      if (starting) { tr.setMeta(key, $anchor.pos); }
-      view.dispatch(tr);
-    }
-  }
-
-  // Stop listening to mouse motion events.
-  function stop() {
-    view.root.removeEventListener("mouseup", stop);
-    view.root.removeEventListener("dragstart", stop);
-    view.root.removeEventListener("mousemove", move);
-    if (key.getState(view.state) != null) { view.dispatch(view.state.tr.setMeta(key, -1)); }
-  }
-
-  function move(event) {
-    var anchor = key.getState(view.state), $anchor;
-    if (anchor != null) {
-      // Continuing an existing cross-cell selection
-      $anchor = view.state.doc.resolve(anchor);
-    } else if (domInCell(view, event.target) != startDOMCell) {
-      // Moving out of the initial cell -- start a new cell selection
-      $anchor = cellUnderMouse(view, startEvent);
-      if (!$anchor) { return stop() }
-    }
-    if ($anchor) { setCellSelection($anchor, event); }
-  }
-  view.root.addEventListener("mouseup", stop);
-  view.root.addEventListener("dragstart", stop);
-  view.root.addEventListener("mousemove", move);
-}
-
-// Check whether the cursor is at the end of a cell (so that further
-// motion would move out of the cell)
-function atEndOfCell(view, axis, dir) {
-  if (!(view.state.selection instanceof dist$2.TextSelection)) { return null }
-  var ref = view.state.selection;
-  var $head = ref.$head;
-  for (var d = $head.depth - 1; d >= 0; d--) {
-    var parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d);
-    if (index != (dir < 0 ? 0 : parent.childCount)) { return null }
-    if (parent.type.spec.tableRole == "cell" || parent.type.spec.tableRole == "header_cell") {
-      var cellPos = $head.before(d);
-      var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
-      return view.endOfTextblock(dirStr) ? cellPos : null
-    }
-  }
-  return null
-}
-
-function domInCell(view, dom) {
-  for (; dom && dom != view.dom; dom = dom.parentNode)
-    { if (dom.nodeName == "TD" || dom.nodeName == "TH") { return dom } }
-}
-
-function cellUnderMouse(view, event) {
-  var mousePos = view.posAtCoords({left: event.clientX, top: event.clientY});
-  if (!mousePos) { return null }
-  return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null
-}
-
-// This file defines helpers for normalizing tables, making sure no
-
-// Helper for iterating through the nodes in a document that changed
-// compared to the given previous document. Useful for avoiding
-// duplicate work on each transaction.
-function changedDescendants(old, cur, offset, f) {
-  var oldSize = old.childCount, curSize = cur.childCount;
-  outer: for (var i = 0, j = 0; i < curSize; i++) {
-    var child = cur.child(i);
-    for (var scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {
-      if (old.child(scan) == child) {
-        j = scan + 1;
-        offset += child.nodeSize;
-        continue outer
-      }
-    }
-    f(child, offset);
-    if (j < oldSize && old.child(j).sameMarkup(child))
-      { changedDescendants(old.child(j), child, offset + 1, f); }
-    else
-      { child.nodesBetween(0, child.content.size, f, offset + 1); }
-    offset += child.nodeSize;
-  }
-}
-
-// :: (EditorState, ?EditorState) → ?Transaction
-// Inspect all tables in the given state's document and return a
-// transaction that fixes them, if necessary. If `oldState` was
-// provided, that is assumed to hold a previous, known-good state,
-// which will be used to avoid re-scanning unchanged parts of the
-// document.
-function fixTables(state, oldState) {
-  var tr, check = function (node, pos) {
-    if (node.type.spec.tableRole == "table") { tr = fixTable(state, node, pos, tr); }
-  };
-  if (!oldState) { state.doc.descendants(check); }
-  else if (oldState.doc != state.doc) { changedDescendants(oldState.doc, state.doc, 0, check); }
-  return tr
-}
-
-// : (EditorState, Node, number, ?Transaction) → ?Transaction
-// Fix the given table, if necessary. Will append to the transaction
-// it was given, if non-null, or create a new one if necessary.
-function fixTable(state, table, tablePos, tr) {
-  var map = TableMap.get(table);
-  if (!map.problems) { return tr }
-  if (!tr) { tr = state.tr; }
-
-  // Track which rows we must add cells to, so that we can adjust that
-  // when fixing collisions.
-  var mustAdd = [];
-  for (var i = 0; i < map.height; i++) { mustAdd.push(0); }
-  for (var i$1 = 0; i$1 < map.problems.length; i$1++) {
-    var prob = map.problems[i$1];
-    if (prob.type == "collision") {
-      var cell = table.nodeAt(prob.pos);
-      for (var j = 0; j < cell.attrs.rowspan; j++) { mustAdd[prob.row + j] += prob.n; }
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, rmColSpan(cell.attrs, cell.attrs.colspan - prob.n, prob.n));
-    } else if (prob.type == "missing") {
-      mustAdd[prob.row] += prob.n;
-    } else if (prob.type == "overlong_rowspan") {
-      var cell$1 = table.nodeAt(prob.pos);
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$1.attrs, "rowspan", cell$1.attrs.rowspan - prob.n));
-    } else if (prob.type == "colwidth mismatch") {
-      var cell$2 = table.nodeAt(prob.pos);
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$2.attrs, "colwidth", prob.colwidth));
-    }
-  }
-  var first, last;
-  for (var i$2 = 0; i$2 < mustAdd.length; i$2++) { if (mustAdd[i$2]) {
-    if (first == null) { first = i$2; }
-    last = i$2;
-  } }
-  // Add the necessary cells, using a heuristic for whether to add the
-  // cells at the start or end of the rows (if it looks like a 'bite'
-  // was taken out of the table, add cells at the start of the row
-  // after the bite. Otherwise add them at the end).
-  for (var i$3 = 0, pos = tablePos + 1; i$3 < map.height; i$3++) {
-    var end = pos + table.child(i$3).nodeSize;
-    var add = mustAdd[i$3];
-    if (add > 0) {
-      var nodes = [];
-      for (var j$1 = 0; j$1 < add; j$1++)
-        { nodes.push(tableNodeTypes(state.schema).cell.createAndFill()); }
-      var side = (i$3 == 0 || first == i$3 - 1) && last == i$3 ? pos + 1 : end - 1;
-      tr.insert(tr.mapping.map(side), nodes);
-    }
-    pos = end;
-  }
-  return tr
-}
-
-// This file defines a number of table-related commands.
-
-// Helper to get the selected rectangle in a table, if any. Adds table
-// map, table node, and table start offset to the object for
-// convenience.
-function selectedRect(state) {
-  var sel = state.selection, $pos = selectionCell(state);
-  var table = $pos.node(-1), tableStart = $pos.start(-1), map = TableMap.get(table);
-  var rect;
-  if (sel instanceof CellSelection)
-    { rect = map.rectBetween(sel.$anchorCell.pos - tableStart, sel.$headCell.pos - tableStart); }
-  else
-    { rect = map.findCell($pos.pos - tableStart); }
-  rect.tableStart = tableStart;
-  rect.map = map;
-  rect.table = table;
-  return rect
-}
-
-function columnIsHeader(map, table, col) {
-  var headerCell = tableNodeTypes(table.type.schema).header_cell;
-  for (var row = 0; row < map.height; row++)
-    { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
-      { return false } }
-  return true
-}
-
-// Add a column at the given position in a table.
-function addColumn(tr, ref, col) {
-  var map = ref.map;
-  var tableStart = ref.tableStart;
-  var table = ref.table;
-
-  var refColumn = col > 0 ? -1 : 0;
-  if (columnIsHeader(map, table, col + refColumn))
-    { refColumn = col == 0 || col == map.width ? null : 0; }
-
-  for (var row = 0; row < map.height; row++) {
-    var index = row * map.width + col;
-    // If this position falls inside a col-spanning cell
-    if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {
-      var pos = map.map[index], cell = table.nodeAt(pos);
-      tr.setNodeMarkup(tr.mapping.map(tableStart + pos), null,
-                       addColSpan(cell.attrs, col - map.colCount(pos)));
-      // Skip ahead if rowspan > 1
-      row += cell.attrs.rowspan - 1;
-    } else {
-      var type = refColumn == null ? tableNodeTypes(table.type.schema).cell
-          : table.nodeAt(map.map[index + refColumn]).type;
-      var pos$1 = map.positionAt(row, col, table);
-      tr.insert(tr.mapping.map(tableStart + pos$1), type.createAndFill());
-    }
-  }
-  return tr
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Command to add a column before the column with the selection.
-function addColumnBefore(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addColumn(state.tr, rect, rect.left));
-  }
-  return true
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Command to add a column after the column with the selection.
-function addColumnAfter(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addColumn(state.tr, rect, rect.right));
-  }
-  return true
-}
-
-function removeColumn(tr, ref, col) {
-  var map = ref.map;
-  var table = ref.table;
-  var tableStart = ref.tableStart;
-
-  var mapStart = tr.mapping.maps.length;
-  for (var row = 0; row < map.height;) {
-    var index = row * map.width + col, pos = map.map[index], cell = table.nodeAt(pos);
-    // If this is part of a col-spanning cell
-    if ((col > 0 && map.map[index - 1] == pos) || (col < map.width - 1 && map.map[index + 1] == pos)) {
-      tr.setNodeMarkup(tr.mapping.slice(mapStart).map(tableStart + pos), null,
-                       rmColSpan(cell.attrs, col - map.colCount(pos)));
-    } else {
-      var start = tr.mapping.slice(mapStart).map(tableStart + pos);
-      tr.delete(start, start + cell.nodeSize);
-    }
-    row += cell.attrs.rowspan;
-  }
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Command function that removes the selected columns from a table.
-function deleteColumn(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state), tr = state.tr;
-    if (rect.left == 0 && rect.right == rect.map.width) { return false }
-    for (var i = rect.right - 1;; i--) {
-      removeColumn(tr, rect, i);
-      if (i == rect.left) { break }
-      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
-      rect.map = TableMap.get(rect.table);
-    }
-    dispatch(tr);
-  }
-  return true
-}
-
-function rowIsHeader(map, table, row) {
-  var headerCell = tableNodeTypes(table.type.schema).header_cell;
-  for (var col = 0; col < map.width; col++)
-    { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
-      { return false } }
-  return true
-}
-
-function addRow(tr, ref, row) {
-  var map = ref.map;
-  var tableStart = ref.tableStart;
-  var table = ref.table;
-
-  var rowPos = tableStart;
-  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
-  var cells = [], refRow = row > 0 ? -1 : 0;
-  if (rowIsHeader(map, table, row + refRow))
-    { refRow = row == 0 || row == map.height ? null : 0; }
-  for (var col = 0, index = map.width * row; col < map.width; col++, index++) {
-    // Covered by a rowspan cell
-    if (row > 0 && row < map.height && map.map[index] == map.map[index - map.width]) {
-      var pos = map.map[index], attrs = table.nodeAt(pos).attrs;
-      tr.setNodeMarkup(tableStart + pos, null, setAttr(attrs, "rowspan", attrs.rowspan + 1));
-      col += attrs.colspan - 1;
-    } else {
-      var type = refRow == null ? tableNodeTypes(table.type.schema).cell
-          : table.nodeAt(map.map[index + refRow * map.width]).type;
-      cells.push(type.createAndFill());
-    }
-  }
-  tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells));
-  return tr
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Add a table row before the selection.
-function addRowBefore(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addRow(state.tr, rect, rect.top));
-  }
-  return true
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Add a table row after the selection.
-function addRowAfter(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state);
-    dispatch(addRow(state.tr, rect, rect.bottom));
-  }
-  return true
-}
-
-function removeRow(tr, ref, row) {
-  var map = ref.map;
-  var table = ref.table;
-  var tableStart = ref.tableStart;
-
-  var rowPos = 0;
-  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
-  var nextRow = rowPos + table.child(row).nodeSize;
-
-  var mapFrom = tr.mapping.maps.length;
-  tr.delete(rowPos + tableStart, nextRow + tableStart);
-
-  for (var col = 0, index = row * map.width; col < map.width; col++, index++) {
-    var pos = map.map[index];
-    if (row > 0 && pos == map.map[index - map.width]) {
-      // If this cell starts in the row above, simply reduce its rowspan
-      var attrs = table.nodeAt(pos).attrs;
-      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + tableStart), null, setAttr(attrs, "rowspan", attrs.rowspan - 1));
-      col += attrs.colspan - 1;
-    } else if (row < map.width && pos == map.map[index + map.width]) {
-      // Else, if it continues in the row below, it has to be moved down
-      var cell = table.nodeAt(pos);
-      var copy = cell.type.create(setAttr(cell.attrs, "rowspan", cell.attrs.rowspan - 1), cell.content);
-      var newPos = map.positionAt(row + 1, col, table);
-      tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy);
-      col += cell.attrs.colspan - 1;
-    }
-  }
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Remove the selected rows from a table.
-function deleteRow(state, dispatch) {
-  if (!isInTable(state)) { return false }
-  if (dispatch) {
-    var rect = selectedRect(state), tr = state.tr;
-    if (rect.top == 0 && rect.bottom == rect.map.height) { return false }
-    for (var i = rect.bottom - 1;; i--) {
-      removeRow(tr, rect, i);
-      if (i == rect.top) { break }
-      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
-      rect.map = TableMap.get(rect.table);
-    }
-    dispatch(tr);
-  }
-  return true
-}
-
-function isEmpty(cell) {
-  var c = cell.content;
-  return c.childCount == 1 && c.firstChild.isTextblock && c.firstChild.childCount == 0
-}
-
-function cellsOverlapRectangle(ref, rect) {
-  var width = ref.width;
-  var height = ref.height;
-  var map = ref.map;
-
-  var indexTop = rect.top * width + rect.left, indexLeft = indexTop;
-  var indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1);
-  for (var i = rect.top; i < rect.bottom; i++) {
-    if (rect.left > 0 && map[indexLeft] == map[indexLeft - 1] ||
-        rect.right < width && map[indexRight] == map[indexRight + 1]) { return true }
-    indexLeft += width; indexRight += width;
-  }
-  for (var i$1 = rect.left; i$1 < rect.right; i$1++) {
-    if (rect.top > 0 && map[indexTop] == map[indexTop - width] ||
-        rect.bottom < height && map[indexBottom] == map[indexBottom + width]) { return true }
-    indexTop++; indexBottom++;
-  }
-  return false
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Merge the selected cells into a single cell. Only available when
-// the selected cells' outline forms a rectangle.
-function mergeCells(state, dispatch) {
-  var sel = state.selection;
-  if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos) { return false }
-  var rect = selectedRect(state);
-  var map = rect.map;
-  if (cellsOverlapRectangle(map, rect)) { return false }
-  if (dispatch) {
-    var tr = state.tr, seen = [], content = dist.Fragment.empty, mergedPos, mergedCell;
-    for (var row = rect.top; row < rect.bottom; row++) {
-      for (var col = rect.left; col < rect.right; col++) {
-        var cellPos = map.map[row * map.width + col], cell = rect.table.nodeAt(cellPos);
-        if (seen.indexOf(cellPos) > -1) { continue }
-        seen.push(cellPos);
-        if (mergedPos == null) {
-          mergedPos = cellPos;
-          mergedCell = cell;
-        } else {
-          if (!isEmpty(cell)) { content = content.append(cell.content); }
-          var mapped = tr.mapping.map(cellPos + rect.tableStart);
-          tr.delete(mapped, mapped + cell.nodeSize);
-        }
-      }
-    }
-    tr.setNodeMarkup(mergedPos + rect.tableStart, null,
-                     setAttr(addColSpan(mergedCell.attrs, mergedCell.attrs.colspan, (rect.right - rect.left) - mergedCell.attrs.colspan),
-                             "rowspan", rect.bottom - rect.top));
-    if (content.size) {
-      var end = mergedPos + 1 + mergedCell.content.size;
-      var start = isEmpty(mergedCell) ? mergedPos + 1 : end;
-      tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content);
-    }
-    tr.setSelection(new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart)));
-    dispatch(tr);
-  }
-  return true
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Split a selected cell, whose rowpan or colspan is greater than one,
-// into smaller cells.
-function splitCell(state, dispatch) {
-  var sel = state.selection;
-  var cellNode, cellPos;
-  if (!(sel instanceof CellSelection)) {
-    cellNode = cellWrapping(sel.$from);
-    if (!cellNode) { return false }
-    cellPos = cellAround(sel.$from).pos;
-  } else {
-    if (sel.$anchorCell.pos != sel.$headCell.pos) { return false }
-    cellNode = sel.$anchorCell.nodeAfter;
-    cellPos = sel.$anchorCell.pos;
-  }
-  if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {return false}
-  if (dispatch) {
-    var baseAttrs = cellNode.attrs, attrs = [], colwidth = baseAttrs.colwidth;
-    if (baseAttrs.rowspan > 1) { baseAttrs = setAttr(baseAttrs, "rowspan", 1); }
-    if (baseAttrs.colspan > 1) { baseAttrs = setAttr(baseAttrs, "colspan", 1); }
-    var rect = selectedRect(state), tr = state.tr;
-    for (var i = 0; i < rect.right - rect.left; i++)
-      { attrs.push(colwidth ? setAttr(baseAttrs, "colwidth", colwidth && colwidth[i] ? [colwidth[i]] : null) : baseAttrs); }
-    var lastCell, cellType = tableNodeTypes(state.schema)[cellNode.type.spec.tableRole];
-    for (var row = 0; row < rect.bottom; row++) {
-      if (row >= rect.top) {
-        var pos = rect.map.positionAt(row, rect.left, rect.table);
-        if (row == rect.top) { pos += cellNode.nodeSize; }
-        for (var col = rect.left, i$1 = 0; col < rect.right; col++, i$1++) {
-          if (col == rect.left && row == rect.top) { continue }
-          tr.insert(lastCell = tr.mapping.map(pos + rect.tableStart, 1), cellType.createAndFill(attrs[i$1]));
-        }
-      }
-    }
-    tr.setNodeMarkup(cellPos, null, attrs[0]);
-    if (sel instanceof CellSelection)
-      { tr.setSelection(new CellSelection(tr.doc.resolve(sel.$anchorCell.pos),
-                                        lastCell && tr.doc.resolve(lastCell))); }
-    dispatch(tr);
-  }
-  return true
-}
-
-// :: (string, any) → (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command that sets the given attribute to the given value,
-// and is only available when the currently selected cell doesn't
-// already have that attribute set to that value.
-function setCellAttr(name, value) {
-  return function(state, dispatch) {
-    if (!isInTable(state)) { return false }
-    var $cell = selectionCell(state);
-    if ($cell.nodeAfter.attrs[name] === value) { return false }
-    if (dispatch) {
-      var tr = state.tr;
-      if (state.selection instanceof CellSelection)
-        { state.selection.forEachCell(function (node, pos) {
-          if (node.attrs[name] !== value)
-            { tr.setNodeMarkup(pos, null, setAttr(node.attrs, name, value)); }
-        }); }
-      else
-        { tr.setNodeMarkup($cell.pos, null, setAttr($cell.nodeAfter.attrs, name, value)); }
-      dispatch(tr);
-    }
-    return true
-  }
-}
-
-function toggleHeader(type) {
-  return function(state, dispatch) {
-    if (!isInTable(state)) { return false }
-    if (dispatch) {
-      var types = tableNodeTypes(state.schema);
-      var rect = selectedRect(state), tr = state.tr;
-      var cells = rect.map.cellsInRect(type == "column" ? new Rect(rect.left, 0, rect.right, rect.map.height) :
-                                       type == "row" ? new Rect(0, rect.top, rect.map.width, rect.bottom) : rect);
-      var nodes = cells.map(function (pos) { return rect.table.nodeAt(pos); });
-      for (var i = 0; i < cells.length; i++) // Remove headers, if any
-        { if (nodes[i].type == types.header_cell)
-          { tr.setNodeMarkup(rect.tableStart + cells[i], types.cell, nodes[i].attrs); } }
-      if (tr.steps.length == 0) { for (var i$1 = 0; i$1 < cells.length; i$1++) // No headers removed, add instead
-        { tr.setNodeMarkup(rect.tableStart + cells[i$1], types.header_cell, nodes[i$1].attrs); } }
-      dispatch(tr);
-    }
-    return true
-  }
-}
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Toggles whether the selected row contains header cells.
-var toggleHeaderRow = toggleHeader("row");
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Toggles whether the selected column contains header cells.
-var toggleHeaderColumn = toggleHeader("column");
-
-// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Toggles whether the selected cells are header cells.
-var toggleHeaderCell = toggleHeader("cell");
-
-function findNextCell($cell, dir) {
-  if (dir < 0) {
-    var before = $cell.nodeBefore;
-    if (before) { return $cell.pos - before.nodeSize }
-    for (var row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {
-      var rowNode = $cell.node(-1).child(row);
-      if (rowNode.childCount) { return rowEnd - 1 - rowNode.lastChild.nodeSize }
-      rowEnd -= rowNode.nodeSize;
-    }
-  } else {
-    if ($cell.index() < $cell.parent.childCount - 1) { return $cell.pos + $cell.nodeAfter.nodeSize }
-    var table = $cell.node(-1);
-    for (var row$1 = $cell.indexAfter(-1), rowStart = $cell.after(); row$1 < table.childCount; row$1++) {
-      var rowNode$1 = table.child(row$1);
-      if (rowNode$1.childCount) { return rowStart + 1 }
-      rowStart += rowNode$1.nodeSize;
-    }
-  }
-}
-
-// :: (number) → (EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command for selecting the next (direction=1) or previous
-// (direction=-1) cell in a table.
-function goToNextCell(direction) {
-  return function(state, dispatch) {
-    if (!isInTable(state)) { return false }
-    var cell = findNextCell(selectionCell(state), direction);
-    if (cell == null) { return }
-    if (dispatch) {
-      var $cell = state.doc.resolve(cell);
-      dispatch(state.tr.setSelection(dist$2.TextSelection.between($cell, moveCellForward($cell))).scrollIntoView());
-    }
-    return true
-  }
-}
-
-// :: (EditorState, ?(tr: Transaction)) → bool
-// Deletes the table around the selection, if any.
-function deleteTable(state, dispatch) {
-  var $pos = state.selection.$anchor;
-  for (var d = $pos.depth; d > 0; d--) {
-    var node = $pos.node(d);
-    if (node.type.spec.tableRole == "table") {
-      if (dispatch) { dispatch(state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView()); }
-      return true
-    }
-  }
-  return false
-}
-
-var TableView = function TableView(node, cellMinWidth) {
-  this.node = node;
-  this.cellMinWidth = cellMinWidth;
-  this.dom = document.createElement("div");
-  this.dom.className = "tableWrapper";
-  this.table = this.dom.appendChild(document.createElement("table"));
-  this.colgroup = this.table.appendChild(document.createElement("colgroup"));
-  updateColumns(node, this.colgroup, this.table, cellMinWidth);
-  this.contentDOM = this.table.appendChild(document.createElement("tbody"));
-};
-
-TableView.prototype.update = function update (node) {
-  if (node.type != this.node.type) { return false }
-  this.node = node;
-  updateColumns(node, this.colgroup, this.table, this.cellMinWidth);
-  return true
-};
-
-TableView.prototype.ignoreMutation = function ignoreMutation (record) {
-  return record.type == "attributes" && (record.target == this.table || this.colgroup.contains(record.target))
-};
-
-function updateColumns(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {
-  var totalWidth = 0, fixedWidth = true;
-  var nextDOM = colgroup.firstChild, row = node.firstChild;
-  for (var i = 0, col = 0; i < row.childCount; i++) {
-    var ref = row.child(i).attrs;
-    var colspan = ref.colspan;
-    var colwidth = ref.colwidth;
-    for (var j = 0; j < colspan; j++, col++) {
-      var hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j];
-      var cssWidth = hasWidth ? hasWidth + "px" : "";
-      totalWidth += hasWidth || cellMinWidth;
-      if (!hasWidth) { fixedWidth = false; }
-      if (!nextDOM) {
-        colgroup.appendChild(document.createElement("col")).style.width = cssWidth;
-      } else {
-        if (nextDOM.style.width != cssWidth) { nextDOM.style.width = cssWidth; }
-        nextDOM = nextDOM.nextSibling;
-      }
-    }
-  }
-
-  while (nextDOM) {
-    var after = nextDOM.nextSibling;
-    nextDOM.parentNode.removeChild(nextDOM);
-    nextDOM = after;
-  }
-
-  if (fixedWidth) {
-    table.style.width = totalWidth + "px";
-    table.style.minWidth = "";
-  } else {
-    table.style.width = "";
-    table.style.minWidth = totalWidth + "px";
-  }
-}
-
-var key$1 = new dist$2.PluginKey("tableColumnResizing");
-
-function columnResizing(ref) {
-  if ( ref === void 0 ) { ref = {}; }
-  var handleWidth = ref.handleWidth; if ( handleWidth === void 0 ) { handleWidth = 5; }
-  var cellMinWidth = ref.cellMinWidth; if ( cellMinWidth === void 0 ) { cellMinWidth = 25; }
-  var View = ref.View; if ( View === void 0 ) { View = TableView; }
-  var lastColumnResizable = ref.lastColumnResizable; if ( lastColumnResizable === void 0 ) { lastColumnResizable = true; }
-
-  var plugin = new dist$2.Plugin({
-    key: key$1,
-    state: {
-      init: function init(_, state) {
-        this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] =
-          function (node, view) { return new View(node, cellMinWidth, view); };
-        return new ResizeState(-1, false)
-      },
-      apply: function apply(tr, prev) {
-        return prev.apply(tr)
-      }
-    },
-    props: {
-      attributes: function attributes(state) {
-        var pluginState = key$1.getState(state);
-        return pluginState.activeHandle > -1 ? {class: "resize-cursor"} : null
-      },
-
-      handleDOMEvents: {
-        mousemove: function mousemove(view, event) { handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable); },
-        mouseleave: function mouseleave(view) { handleMouseLeave(view); },
-        mousedown: function mousedown(view, event) { handleMouseDown$1(view, event, cellMinWidth); }
-      },
-
-      decorations: function decorations(state) {
-        var pluginState = key$1.getState(state);
-        if (pluginState.activeHandle > -1) { return handleDecorations(state, pluginState.activeHandle) }
-      },
-
-      nodeViews: {}
-    }
-  });
-  return plugin
-}
-
-var ResizeState = function ResizeState(activeHandle, dragging) {
-  this.activeHandle = activeHandle;
-  this.dragging = dragging;
-};
-
-ResizeState.prototype.apply = function apply (tr) {
-  var state = this, action = tr.getMeta(key$1);
-  if (action && action.setHandle != null)
-    { return new ResizeState(action.setHandle, null) }
-  if (action && action.setDragging !== undefined)
-    { return new ResizeState(state.activeHandle, action.setDragging) }
-  if (state.activeHandle > -1 && tr.docChanged) {
-    var handle = tr.mapping.map(state.activeHandle, -1);
-    if (!pointsAtCell(tr.doc.resolve(handle))) { handle = null; }
-    state = new ResizeState(handle, state.dragging);
-  }
-  return state
-};
-
-function handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {
-  var pluginState = key$1.getState(view.state);
-
-  if (!pluginState.dragging) {
-    var target = domCellAround(event.target), cell = -1;
-    if (target) {
-      var ref = target.getBoundingClientRect();
-      var left = ref.left;
-      var right = ref.right;
-      if (event.clientX - left <= handleWidth)
-        { cell = edgeCell(view, event, "left"); }
-      else if (right - event.clientX <= handleWidth)
-        { cell = edgeCell(view, event, "right"); }
-    }
-
-    if (cell != pluginState.activeHandle) {
-      if (!lastColumnResizable && cell !== -1) {
-        var $cell = view.state.doc.resolve(cell);
-        var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-        var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-
-        if (col == map.width - 1) {
-          return
-        }
-      }
-
-      updateHandle(view, cell);
-    }
-  }
-}
-
-function handleMouseLeave(view) {
-  var pluginState = key$1.getState(view.state);
-  if (pluginState.activeHandle > -1 && !pluginState.dragging) { updateHandle(view, -1); }
-}
-
-function handleMouseDown$1(view, event, cellMinWidth) {
-  var pluginState = key$1.getState(view.state);
-  if (pluginState.activeHandle == -1 || pluginState.dragging) { return false }
-
-  var cell = view.state.doc.nodeAt(pluginState.activeHandle);
-  var width = currentColWidth(view, pluginState.activeHandle, cell.attrs);
-  view.dispatch(view.state.tr.setMeta(key$1, {setDragging: {startX: event.clientX, startWidth: width}}));
-
-  function finish(event) {
-    window.removeEventListener("mouseup", finish);
-    window.removeEventListener("mousemove", move);
-    var pluginState = key$1.getState(view.state);
-    if (pluginState.dragging) {
-      updateColumnWidth(view, pluginState.activeHandle, draggedWidth(pluginState.dragging, event, cellMinWidth));
-      view.dispatch(view.state.tr.setMeta(key$1, {setDragging: null}));
-    }
-  }
-  function move(event) {
-    if (!event.which) { return finish(event) }
-    var pluginState = key$1.getState(view.state);
-    var dragged = draggedWidth(pluginState.dragging, event, cellMinWidth);
-    displayColumnWidth(view, pluginState.activeHandle, dragged, cellMinWidth);
-  }
-
-  window.addEventListener("mouseup", finish);
-  window.addEventListener("mousemove", move);
-  event.preventDefault();
-  return true
-}
-
-function currentColWidth(view, cellPos, ref) {
-  var colspan = ref.colspan;
-  var colwidth = ref.colwidth;
-
-  var width = colwidth && colwidth[colwidth.length - 1];
-  if (width) { return width }
-  // Not fixed, read current width from DOM
-  var domWidth = view.domAtPos(cellPos + 1).node.offsetWidth, parts = colspan;
-  if (colwidth) { for (var i = 0; i < colspan; i++) { if (colwidth[i]) {
-    domWidth -= colwidth[i];
-    parts--;
-  } } }
-  return domWidth / parts
-}
-
-function domCellAround(target) {
-  while (target && target.nodeName != "TD" && target.nodeName != "TH")
-    { target = target.classList.contains("ProseMirror") ? null : target.parentNode; }
-  return target
-}
-
-function edgeCell(view, event, side) {
-  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
-  var pos = ref.pos;
-  var $cell = cellAround(view.state.doc.resolve(pos));
-  if (!$cell) { return -1 }
-  if (side == "right") { return $cell.pos }
-  var map = TableMap.get($cell.node(-1)), start = $cell.start(-1);
-  var index = map.map.indexOf($cell.pos - start);
-  return index % map.width == 0 ? -1 : start + map.map[index - 1]
-}
-
-function draggedWidth(dragging, event, cellMinWidth) {
-  var offset = event.clientX - dragging.startX;
-  return Math.max(cellMinWidth, dragging.startWidth + offset)
-}
-
-function updateHandle(view, value) {
-  view.dispatch(view.state.tr.setMeta(key$1, {setHandle: value}));
-}
-
-function updateColumnWidth(view, cell, width) {
-  var $cell = view.state.doc.resolve(cell);
-  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-  var tr = view.state.tr;
-  for (var row = 0; row < map.height; row++) {
-    var mapIndex = row * map.width + col;
-    // Rowspanning cell that has already been handled
-    if (row && map.map[mapIndex] == map.map[mapIndex - map.width]) { continue }
-    var pos = map.map[mapIndex];
-    var ref = table.nodeAt(pos);
-    var attrs = ref.attrs;
-    var index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);
-    if (attrs.colwidth && attrs.colwidth[index] == width) { continue }
-    var colwidth = attrs.colwidth ? attrs.colwidth.slice() : zeroes(attrs.colspan);
-    colwidth[index] = width;
-    tr.setNodeMarkup(start + pos, null, setAttr(attrs, "colwidth", colwidth));
-  }
-  if (tr.docChanged) { view.dispatch(tr); }
-}
-
-function displayColumnWidth(view, cell, width, cellMinWidth) {
-  var $cell = view.state.doc.resolve(cell);
-  var table = $cell.node(-1), start = $cell.start(-1);
-  var col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-  var dom = view.domAtPos($cell.start(-1)).node;
-  while (dom.nodeName != "TABLE") { dom = dom.parentNode; }
-  updateColumns(table, dom.firstChild, dom, cellMinWidth, col, width);
-}
-
-function zeroes(n) {
-  var result = [];
-  for (var i = 0; i < n; i++) { result.push(0); }
-  return result
-}
-
-function handleDecorations(state, cell) {
-  var decorations = [];
-  var $cell = state.doc.resolve(cell);
-  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;
-  for (var row = 0; row < map.height; row++) {
-    var index = col + row * map.width - 1;
-    // For positions that are have either a different cell or the end
-    // of the table to their right, and either the top of the table or
-    // a different cell above them, add a decoration
-    if ((col == map.width || map.map[index] != map.map[index + 1]) &&
-        (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])) {
-      var cellPos = map.map[index];
-      var pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;
-      var dom = document.createElement("div");
-      dom.className = "column-resize-handle";
-      decorations.push(dist$3.Decoration.widget(pos, dom));
-    }
-  }
-  return dist$3.DecorationSet.create(state.doc, decorations)
-}
-
-// This file defines a plugin that handles the drawing of cell
-
-// :: () → Plugin
-//
-// Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)
-// that, when added to an editor, enables cell-selection, handles
-// cell-based copy/paste, and makes sure tables stay well-formed (each
-// row has the same width, and cells don't overlap).
-//
-// You should probably put this plugin near the end of your array of
-// plugins, since it handles mouse and arrow key events in tables
-// rather broadly, and other plugins, like the gap cursor or the
-// column-width dragging plugin, might want to get a turn first to
-// perform more specific behavior.
-function tableEditing() {
-  return new dist$2.Plugin({
-    key: key,
-
-    // This piece of state is used to remember when a mouse-drag
-    // cell-selection is happening, so that it can continue even as
-    // transactions (which might move its anchor cell) come in.
-    state: {
-      init: function init() { return null },
-      apply: function apply(tr, cur) {
-        var set = tr.getMeta(key);
-        if (set != null) { return set == -1 ? null : set }
-        if (cur == null || !tr.docChanged) { return cur }
-        var ref = tr.mapping.mapResult(cur);
-        var deleted = ref.deleted;
-        var pos = ref.pos;
-        return deleted ? null : pos
-      }
-    },
-
-    props: {
-      decorations: drawCellSelection,
-
-      handleDOMEvents: {
-        mousedown: handleMouseDown
-      },
-
-      createSelectionBetween: function createSelectionBetween(view) {
-        if (key.getState(view.state) != null) { return view.state.selection }
-      },
-
-      handleTripleClick: handleTripleClick,
-
-      handleKeyDown: handleKeyDown,
-
-      handlePaste: handlePaste
-    },
-
-    appendTransaction: function appendTransaction(_, oldState, state) {
-      return normalizeSelection(state, fixTables(state, oldState))
-    }
-  })
-}
-
-exports.tableEditing = tableEditing;
-exports.fixTables = fixTables;
-exports.handlePaste = handlePaste;
-exports.cellAround = cellAround;
-exports.isInTable = isInTable;
-exports.selectionCell = selectionCell;
-exports.moveCellForward = moveCellForward;
-exports.inSameTable = inSameTable;
-exports.findCell = findCell;
-exports.colCount = colCount;
-exports.nextCell = nextCell;
-exports.tableNodes = tableNodes;
-exports.CellSelection = CellSelection;
-exports.TableMap = TableMap;
-exports.columnResizing = columnResizing;
-exports.columnResizingPluginKey = key$1;
-exports.updateColumnsOnResize = updateColumns;
-exports.__pastedCells = pastedCells;
-exports.__insertCells = insertCells;
-exports.__clipCells = clipCells;
-exports.addColumn = addColumn;
-exports.addColumnBefore = addColumnBefore;
-exports.addColumnAfter = addColumnAfter;
-exports.removeColumn = removeColumn;
-exports.deleteColumn = deleteColumn;
-exports.addRow = addRow;
-exports.addRowBefore = addRowBefore;
-exports.addRowAfter = addRowAfter;
-exports.removeRow = removeRow;
-exports.deleteRow = deleteRow;
-exports.mergeCells = mergeCells;
-exports.splitCell = splitCell;
-exports.setCellAttr = setCellAttr;
-exports.toggleHeaderRow = toggleHeaderRow;
-exports.toggleHeaderColumn = toggleHeaderColumn;
-exports.toggleHeaderCell = toggleHeaderCell;
-exports.goToNextCell = goToNextCell;
-exports.deleteTable = deleteTable;
-
-});
-
-unwrapExports(dist$7);
-var dist_1$6 = dist$7.tableEditing;
-var dist_2$6 = dist$7.fixTables;
-var dist_3$5 = dist$7.handlePaste;
-var dist_4$5 = dist$7.cellAround;
-var dist_5$5 = dist$7.isInTable;
-var dist_6$4 = dist$7.selectionCell;
-var dist_7$4 = dist$7.moveCellForward;
-var dist_8$4 = dist$7.inSameTable;
-var dist_9$4 = dist$7.findCell;
-var dist_10$3 = dist$7.colCount;
-var dist_11$3 = dist$7.nextCell;
-var dist_12$3 = dist$7.tableNodes;
-var dist_13$2 = dist$7.CellSelection;
-var dist_14$1 = dist$7.TableMap;
-var dist_15$1 = dist$7.columnResizing;
-var dist_16$1 = dist$7.columnResizingPluginKey;
-var dist_17$1 = dist$7.updateColumnsOnResize;
-var dist_18$1 = dist$7.__pastedCells;
-var dist_19$1 = dist$7.__insertCells;
-var dist_20 = dist$7.__clipCells;
-var dist_21 = dist$7.addColumn;
-var dist_22 = dist$7.addColumnBefore;
-var dist_23 = dist$7.addColumnAfter;
-var dist_24 = dist$7.removeColumn;
-var dist_25 = dist$7.deleteColumn;
-var dist_26 = dist$7.addRow;
-var dist_27 = dist$7.addRowBefore;
-var dist_28 = dist$7.addRowAfter;
-var dist_29 = dist$7.removeRow;
-var dist_30 = dist$7.deleteRow;
-var dist_31 = dist$7.mergeCells;
-var dist_32 = dist$7.splitCell;
-var dist_33 = dist$7.setCellAttr;
-var dist_34 = dist$7.toggleHeaderRow;
-var dist_35 = dist$7.toggleHeaderColumn;
-var dist_36 = dist$7.toggleHeaderCell;
-var dist_37 = dist$7.goToNextCell;
-var dist_38 = dist$7.deleteTable;
-
-var dist$8 = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a node of a given `nodeType`. It will return an original transaction if parent node hasn't been found.
-//
-// ```javascript
-// dispatch(
-//   removeParentNodeOfType(schema.nodes.table)(tr)
-// );
-// ```
-var removeParentNodeOfType = function removeParentNodeOfType(nodeType) {
-  return function (tr) {
-    var parent = findParentNodeOfType(nodeType)(tr.selection);
-    if (parent) {
-      return removeNodeAtPos(parent.pos)(tr);
-    }
-    return tr;
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction
-// Returns a new transaction that replaces parent node of a given `nodeType` with the given `content`. It will return an original transaction if either parent node hasn't been found or replacing is not possible.
-//
-// ```javascript
-// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
-//
-// dispatch(
-//  replaceParentNodeOfType(schema.nodes.table, node)(tr)
-// );
-// ```
-var replaceParentNodeOfType = function replaceParentNodeOfType(nodeType, content) {
-  return function (tr) {
-    if (!Array.isArray(nodeType)) {
-      nodeType = [nodeType];
-    }
-    for (var i = 0, count = nodeType.length; i < count; i++) {
-      var parent = findParentNodeOfType(nodeType[i])(tr.selection);
-      if (parent) {
-        var newTr = replaceNodeAtPos(parent.pos, content)(tr);
-        if (newTr !== tr) {
-          return newTr;
-        }
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes selected node. It will return an original transaction if current selection is not a `NodeSelection`.
-//
-// ```javascript
-// dispatch(
-//   removeSelectedNode(tr)
-// );
-// ```
-var removeSelectedNode = function removeSelectedNode(tr) {
-  if (isNodeSelection(tr.selection)) {
-    var from = tr.selection.$from.pos;
-    var to = tr.selection.$to.pos;
-    return cloneTr(tr.delete(from, to));
-  }
-  return tr;
-};
-
-// :: (node: ProseMirrorNode) → (tr: Transaction) → Transaction
-// Returns a new transaction that replaces selected node with a given `node`.
-// It will return the original transaction if either current selection is not a NodeSelection or replacing is not possible.
-//
-// ```javascript
-// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
-// dispatch(
-//   replaceSelectedNode(node)(tr)
-// );
-// ```
-var replaceSelectedNode = function replaceSelectedNode(node) {
-  return function (tr) {
-    if (isNodeSelection(tr.selection)) {
-      var _tr$selection = tr.selection,
-          $from = _tr$selection.$from,
-          $to = _tr$selection.$to;
-
-      if ($from.parent.canReplaceWith($from.index(), $from.indexAfter(), node.type)) {
-        return cloneTr(tr.replaceWith($from.pos, $to.pos, node));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (position: number, dir: ?number) → (tr: Transaction) → Transaction
-// Returns a new transaction that tries to find a valid cursor selection starting at the given `position`
-// and searching back if `dir` is negative, and forward if positive.
-// If a valid cursor position hasn't been found, it will return the original transaction.
-//
-// ```javascript
-// dispatch(
-//   setTextSelection(5)(tr)
-// );
-// ```
-var setTextSelection = function setTextSelection(position) {
-  var dir = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
-  return function (tr) {
-    var nextSelection = dist$2.Selection.findFrom(tr.doc.resolve(position), dir, true);
-    if (nextSelection) {
-      return tr.setSelection(nextSelection);
-    }
-    return tr;
-  };
-};
-
-// :: (content: union<ProseMirrorNode, Fragment>, position: ?number) → (tr: Transaction) → Transaction
-// Returns a new transaction that inserts a given `content` at the current cursor position, or at a given `position`, if it is allowed by schema. If schema restricts such nesting, it will try to find an appropriate place for a given node in the document, looping through parent nodes up until the root document node.
-// If cursor is inside of an empty paragraph, it will try to replace that paragraph with the given content. If insertion is successful and inserted node has content, it will set cursor inside of that content.
-// It will return an original transaction if the place for insertion hasn't been found.
-//
-// ```javascript
-// const node = schema.nodes.extension.createChecked({});
-// dispatch(
-//   safeInsert(node)(tr)
-// );
-// ```
-var safeInsert = function safeInsert(content, position) {
-  return function (tr) {
-    var hasPosition = typeof position === 'number';
-    var $from = tr.selection.$from;
-
-    var $insertPos = hasPosition ? tr.doc.resolve(position) : isNodeSelection(tr.selection) ? tr.doc.resolve($from.pos + 1) : $from;
-    var parent = $insertPos.parent,
-        depth = $insertPos.depth;
-
-    // try to replace an empty paragraph
-
-    if (isEmptyParagraph(parent)) {
-      var oldTr = tr;
-      tr = replaceParentNodeOfType(parent.type, content)(tr);
-      if (oldTr !== tr) {
-        return setTextSelection($insertPos.pos)(tr);
-      }
-    }
-
-    // given node is allowed at the current cursor position
-    if (canInsert($insertPos, content)) {
-      tr.insert($insertPos.pos, content);
-      return cloneTr(setTextSelection(hasPosition ? $insertPos.pos : tr.selection.$anchor.pos)(tr));
-    }
-
-    // looking for a place in the doc where the node is allowed
-    for (var i = $insertPos.depth; i > 0; i--) {
-      var pos = $insertPos.after(i);
-      var $pos = tr.doc.resolve(pos);
-      if (canInsert($pos, content)) {
-        tr.insert(pos, content);
-        return cloneTr(setTextSelection(pos)(tr));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>, type: ?union<NodeType, null>, attrs: ?union<Object, null>, marks?: [Mark]) → (tr: Transaction) → Transaction
-// Returns a transaction that changes the type, attributes, and/or marks of the parent node of a given `nodeType`.
-//
-// ```javascript
-// const node = schema.nodes.extension.createChecked({});
-// dispatch(
-//   setParentNodeMarkup(schema.nodes.panel, null, { panelType })(tr);
-// );
-// ```
-var setParentNodeMarkup = function setParentNodeMarkup(nodeType, type, attrs, marks) {
-  return function (tr) {
-    var parent = findParentNodeOfType(nodeType)(tr.selection);
-    if (parent) {
-      return cloneTr(tr.setNodeMarkup(parent.pos, type, Object.assign({}, parent.node.attrs, attrs), marks));
-    }
-    return tr;
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction
-// Returns a new transaction that sets a `NodeSelection` on a parent node of a `given nodeType`.
-//
-// ```javascript
-// dispatch(
-//   selectParentNodeOfType([tableCell, tableHeader])(state.tr)
-// );
-// ```
-var selectParentNodeOfType = function selectParentNodeOfType(nodeType) {
-  return function (tr) {
-    if (!isNodeSelection(tr.selection)) {
-      var parent = findParentNodeOfType(nodeType)(tr.selection);
-      if (parent) {
-        return cloneTr(tr.setSelection(dist$2.NodeSelection.create(tr.doc, parent.pos)));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that deletes previous node.
-//
-// ```javascript
-// dispatch(
-//   removeNodeBefore(state.tr)
-// );
-// ```
-var removeNodeBefore = function removeNodeBefore(tr) {
-  var position = findPositionOfNodeBefore(tr.selection);
-  if (typeof position === 'number') {
-    return removeNodeAtPos(position)(tr);
-  }
-  return tr;
-};
-
-// :: (selection: Selection) → boolean
-// Checks if current selection is a `NodeSelection`.
-//
-// ```javascript
-// if (isNodeSelection(tr.selection)) {
-//   // ...
-// }
-// ```
-var isNodeSelection = function isNodeSelection(selection) {
-  return selection instanceof dist$2.NodeSelection;
-};
-
-// (nodeType: union<NodeType, [NodeType]>) → boolean
-// Checks if the type a given `node` equals to a given `nodeType`.
-var equalNodeType = function equalNodeType(nodeType, node) {
-  return Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1 || node.type === nodeType;
-};
-
-// (tr: Transaction) → Transaction
-// Creates a new transaction object from a given transaction
-var cloneTr = function cloneTr(tr) {
-  return Object.assign(Object.create(tr), tr).setTime(Date.now());
-};
-
-// (position: number, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction
-// Returns a `replace` transaction that replaces a node at a given position with the given `content`.
-// It will return the original transaction if replacing is not possible.
-// `position` should point at the position immediately before the node.
-var replaceNodeAtPos = function replaceNodeAtPos(position, content) {
-  return function (tr) {
-    var node = tr.doc.nodeAt(position);
-    var $pos = tr.doc.resolve(position);
-    if (canReplace($pos, content)) {
-      tr = tr.replaceWith(position, position + node.nodeSize, content);
-      var start = tr.selection.$from.pos - 1;
-      // put cursor inside of the inserted node
-      tr = setTextSelection(Math.max(start, 0), -1)(tr);
-      // move cursor to the start of the node
-      tr = setTextSelection(tr.selection.$from.start())(tr);
-      return cloneTr(tr);
-    }
-    return tr;
-  };
-};
-
-// ($pos: ResolvedPos, doc: ProseMirrorNode, content: union<ProseMirrorNode, Fragment>, ) → boolean
-// Checks if replacing a node at a given `$pos` inside of the `doc` node with the given `content` is possible.
-var canReplace = function canReplace($pos, content) {
-  var node = $pos.node($pos.depth);
-  return node && node.type.validContent(content instanceof dist.Fragment ? content : dist.Fragment.from(content));
-};
-
-// (position: number) → (tr: Transaction) → Transaction
-// Returns a `delete` transaction that removes a node at a given position with the given `node`.
-// `position` should point at the position immediately before the node.
-var removeNodeAtPos = function removeNodeAtPos(position) {
-  return function (tr) {
-    var node = tr.doc.nodeAt(position);
-    return cloneTr(tr.delete(position, position + node.nodeSize));
-  };
-};
-
-// (schema: Schema) → {[key: string]: NodeType}
-// Returns a map where keys are tableRoles and values are NodeTypes.
-var tableNodeTypes = function tableNodeTypes(schema) {
-  if (schema.cached.tableNodeTypes) {
-    return schema.cached.tableNodeTypes;
-  }
-  var roles = {};
-  Object.keys(schema.nodes).forEach(function (type) {
-    var nodeType = schema.nodes[type];
-    if (nodeType.spec.tableRole) {
-      roles[nodeType.spec.tableRole] = nodeType;
-    }
-  });
-  schema.cached.tableNodeTypes = roles;
-  return roles;
-};
-
-// :: ($pos: ResolvedPos, content: union<ProseMirrorNode, Fragment>) → boolean
-// Checks if a given `content` can be inserted at the given `$pos`
-//
-// ```javascript
-// const { selection: { $from } } = state;
-// const node = state.schema.nodes.atom.createChecked();
-// if (canInsert($from, node)) {
-//   // ...
-// }
-// ```
-var canInsert = function canInsert($pos, content) {
-  var index = $pos.index();
-
-  if (content instanceof dist.Fragment) {
-    return $pos.parent.canReplace(index, index, content);
-  } else if (content instanceof dist.Node) {
-    return $pos.parent.canReplaceWith(index, index, content.type);
-  }
-  return false;
-};
-
-// (node: ProseMirrorNode) → boolean
-// Checks if a given `node` is an empty paragraph
-var isEmptyParagraph = function isEmptyParagraph(node) {
-  return !node || node.type.name === 'paragraph' && node.nodeSize === 2;
-};
-
-// ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning a table node closest to a given `$pos`.
-//
-// ```javascript
-// const table = findTableClosestToPos(state.doc.resolve(10));
-// ```
-var findTableClosestToPos = function findTableClosestToPos($pos) {
-  var predicate = function predicate(node) {
-    return node.type.spec.tableRole && /table/i.test(node.type.spec.tableRole);
-  };
-  return findParentNodeClosestToPos($pos, predicate);
-};
-
-// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const predicate = node => node.type === schema.nodes.blockquote;
-// const parent = findParentNode(predicate)(selection);
-// ```
-var findParentNode = function findParentNode(predicate) {
-  return function (selection) {
-    var $from = selection.$from;
-
-    for (var i = $from.depth; i > 0; i--) {
-      var node = $from.node(i);
-      if (predicate(node)) {
-        return {
-          pos: i > 0 ? $from.before(i) : 0,
-          start: $from.start(i),
-          node: node
-        };
-      }
-    }
-  };
-};
-
-// :: ($pos: ResolvedPos, predicate: (node: ProseMirrorNode) → boolean) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes starting from the given `$pos`, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const predicate = node => node.type === schema.nodes.blockquote;
-// const parent = findParentNodeClosestToPos(state.doc.resolve(5), predicate);
-// ```
-var findParentNodeClosestToPos = function findParentNodeClosestToPos($pos, predicate) {
-  for (var i = $pos.depth; i > 0; i--) {
-    var node = $pos.node(i);
-    if (predicate(node)) {
-      return {
-        pos: i > 0 ? $pos.before(i) : 0,
-        start: $pos.start(i),
-        node: node
-      };
-    }
-  }
-};
-
-// :: (predicate: (node: ProseMirrorNode) → boolean, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
-// Iterates over parent nodes, returning DOM reference of the closest node `predicate` returns truthy for.
-//
-// ```javascript
-// const domAtPos = view.domAtPos.bind(view);
-// const predicate = node => node.type === schema.nodes.table;
-// const parent = findParentDomRef(predicate, domAtPos)(selection); // <table>
-// ```
-var findParentDomRef = function findParentDomRef(predicate, domAtPos) {
-  return function (selection) {
-    var parent = findParentNode(predicate)(selection);
-    if (parent) {
-      return findDomRefAtPos(parent.pos, domAtPos);
-    }
-  };
-};
-
-// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → boolean
-// Checks if there's a parent node `predicate` returns truthy for.
-//
-// ```javascript
-// if (hasParentNode(node => node.type === schema.nodes.table)(selection)) {
-//   // ....
-// }
-// ```
-var hasParentNode = function hasParentNode(predicate) {
-  return function (selection) {
-    return !!findParentNode(predicate)(selection);
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const parent = findParentNodeOfType(schema.nodes.paragraph)(selection);
-// ```
-var findParentNodeOfType = function findParentNodeOfType(nodeType) {
-  return function (selection) {
-    return findParentNode(function (node) {
-      return equalNodeType(nodeType, node);
-    })(selection);
-  };
-};
-
-// :: ($pos: ResolvedPos, nodeType: union<NodeType, [NodeType]>) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes starting from the given `$pos`, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const parent = findParentNodeOfTypeClosestToPos(state.doc.resolve(10), schema.nodes.paragraph);
-// ```
-var findParentNodeOfTypeClosestToPos = function findParentNodeOfTypeClosestToPos($pos, nodeType) {
-  return findParentNodeClosestToPos($pos, function (node) {
-    return equalNodeType(nodeType, node);
-  });
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → boolean
-// Checks if there's a parent node of a given `nodeType`.
-//
-// ```javascript
-// if (hasParentNodeOfType(schema.nodes.table)(selection)) {
-//   // ....
-// }
-// ```
-var hasParentNodeOfType = function hasParentNodeOfType(nodeType) {
-  return function (selection) {
-    return hasParentNode(function (node) {
-      return equalNodeType(nodeType, node);
-    })(selection);
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
-// Iterates over parent nodes, returning DOM reference of the closest node of a given `nodeType`.
-//
-// ```javascript
-// const domAtPos = view.domAtPos.bind(view);
-// const parent = findParentDomRefOfType(schema.nodes.codeBlock, domAtPos)(selection); // <pre>
-// ```
-var findParentDomRefOfType = function findParentDomRefOfType(nodeType, domAtPos) {
-  return function (selection) {
-    return findParentDomRef(function (node) {
-      return equalNodeType(nodeType, node);
-    }, domAtPos)(selection);
-  };
-};
-
-// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Returns a node of a given `nodeType` if it is selected. `start` points to the start position of the node, `pos` points directly before the node.
-//
-// ```javascript
-// const { extension, inlineExtension, bodiedExtension } = schema.nodes;
-// const selectedNode = findSelectedNodeOfType([
-//   extension,
-//   inlineExtension,
-//   bodiedExtension,
-// ])(selection);
-// ```
-var findSelectedNodeOfType = function findSelectedNodeOfType(nodeType) {
-  return function (selection) {
-    if (isNodeSelection(selection)) {
-      var node = selection.node,
-          $from = selection.$from;
-
-      if (equalNodeType(nodeType, node)) {
-        return { node: node, pos: $from.pos };
-      }
-    }
-  };
-};
-
-// :: (selection: Selection) → ?number
-// Returns position of the previous node.
-//
-// ```javascript
-// const pos = findPositionOfNodeBefore(tr.selection);
-// ```
-var findPositionOfNodeBefore = function findPositionOfNodeBefore(selection) {
-  var nodeBefore = selection.$from.nodeBefore;
-
-  var maybeSelection = dist$2.Selection.findFrom(selection.$from, -1);
-  if (maybeSelection && nodeBefore) {
-    // leaf node
-    var parent = findParentNodeOfType(nodeBefore.type)(maybeSelection);
-    if (parent) {
-      return parent.pos;
-    }
-    return maybeSelection.$from.pos;
-  }
-};
-
-// :: (position: number, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → dom.Node
-// Returns DOM reference of a node at a given `position`.
-//
-// ```javascript
-// const domAtPos = view.domAtPos.bind(view);
-// const ref = findDomRefAtPos($from.pos, domAtPos);
-// ```
-var findDomRefAtPos = function findDomRefAtPos(position, domAtPos) {
-  var dom = domAtPos(position);
-  var node = dom.node.childNodes[dom.offset];
-  return node ? node : dom.node;
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Flattens descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const children = flatten(node);
-// ```
-var flatten = function flatten(node) {
-  var descend = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
-
-  if (!node) {
-    throw new Error('Invalid "node" parameter');
-  }
-  var result = [];
-  node.descendants(function (child, pos) {
-    result.push({ node: child, pos: pos });
-    if (!descend) {
-      return false;
-    }
-  });
-  return result;
-};
-
-// :: (node: ProseMirrorNode, predicate: (node: ProseMirrorNode) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const textNodes = findChildren(node, child => child.isText, false);
-// ```
-var findChildren = function findChildren(node, predicate, descend) {
-  if (!node) {
-    throw new Error('Invalid "node" parameter');
-  } else if (!predicate) {
-    throw new Error('Invalid "predicate" parameter');
-  }
-  return flatten(node, descend).filter(function (child) {
-    return predicate(child.node);
-  });
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Returns text nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const textNodes = findTextNodes(node);
-// ```
-var findTextNodes = function findTextNodes(node, descend) {
-  return findChildren(node, function (child) {
-    return child.isText;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Returns inline nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const inlineNodes = findInlineNodes(node);
-// ```
-var findInlineNodes = function findInlineNodes(node, descend) {
-  return findChildren(node, function (child) {
-    return child.isInline;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Returns block descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const blockNodes = findBlockNodes(node);
-// ```
-var findBlockNodes = function findBlockNodes(node, descend) {
-  return findChildren(node, function (child) {
-    return child.isBlock;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, predicate: (attrs: ?Object) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const mergedCells = findChildrenByAttr(table, attrs => attrs.colspan === 2);
-// ```
-var findChildrenByAttr = function findChildrenByAttr(node, predicate, descend) {
-  return findChildren(node, function (child) {
-    return !!predicate(child.attrs);
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, nodeType: NodeType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes of a given nodeType. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const cells = findChildrenByType(table, schema.nodes.tableCell);
-// ```
-var findChildrenByType = function findChildrenByType(node, nodeType, descend) {
-  return findChildren(node, function (child) {
-    return child.type === nodeType;
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, markType: markType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-// Iterates over descendants of a given `node`, returning child nodes that have a mark of a given markType. It doesn't descend into a `node` when descend argument is `false` (defaults to `true`).
-//
-// ```javascript
-// const nodes = findChildrenByMark(state.doc, schema.marks.strong);
-// ```
-var findChildrenByMark = function findChildrenByMark(node, markType, descend) {
-  return findChildren(node, function (child) {
-    return markType.isInSet(child.marks);
-  }, descend);
-};
-
-// :: (node: ProseMirrorNode, nodeType: NodeType) → boolean
-// Returns `true` if a given node contains nodes of a given `nodeType`
-//
-// ```javascript
-// if (contains(panel, schema.nodes.listItem)) {
-//   // ...
-// }
-// ```
-var contains = function contains(node, nodeType) {
-  return !!findChildrenByType(node, nodeType).length;
-};
-
-function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
-
-// :: (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning the closest table node.
-//
-// ```javascript
-// const table = findTable(selection);
-// ```
-var findTable = function findTable(selection) {
-  return findParentNode(function (node) {
-    return node.type.spec.tableRole && node.type.spec.tableRole === 'table';
-  })(selection);
-};
-
-// :: (selection: Selection) → boolean
-// Checks if current selection is a `CellSelection`.
-//
-// ```javascript
-// if (isCellSelection(selection)) {
-//   // ...
-// }
-// ```
-var isCellSelection = function isCellSelection(selection) {
-  return selection instanceof dist$7.CellSelection;
-};
-
-// :: (columnIndex: number) → (selection: Selection) → boolean
-// Checks if entire column at index `columnIndex` is selected.
-//
-// ```javascript
-// const className = isColumnSelected(i)(selection) ? 'selected' : '';
-// ```
-var isColumnSelected = function isColumnSelected(columnIndex) {
-  return function (selection) {
-    if (isCellSelection(selection)) {
-      var $anchorCell = selection.$anchorCell,
-          $headCell = selection.$headCell;
-
-      var start = $anchorCell.start(-1);
-      var map = dist$7.TableMap.get($anchorCell.node(-1));
-      var anchor = map.colCount($anchorCell.pos - start);
-      var head = map.colCount($headCell.pos - start);
-
-      return selection.isColSelection() && columnIndex <= Math.max(anchor, head) && columnIndex >= Math.min(anchor, head);
-    }
-
-    return false;
-  };
-};
-
-// :: (rowIndex: number) → (selection: Selection) → boolean
-// Checks if entire row at index `rowIndex` is selected.
-//
-// ```javascript
-// const className = isRowSelected(i)(selection) ? 'selected' : '';
-// ```
-var isRowSelected = function isRowSelected(rowIndex) {
-  return function (selection) {
-    if (isCellSelection(selection)) {
-      var $anchorCell = selection.$anchorCell,
-          $headCell = selection.$headCell;
-
-      var anchor = $anchorCell.index(-1);
-      var head = $headCell.index(-1);
-
-      return selection.isRowSelection() && rowIndex <= Math.max(anchor, head) && rowIndex >= Math.min(anchor, head);
-    }
-
-    return false;
-  };
-};
-
-// :: (selection: Selection) → boolean
-// Checks if entire table is selected
-//
-// ```javascript
-// const className = isTableSelected(selection) ? 'selected' : '';
-// ```
-var isTableSelected = function isTableSelected(selection) {
-  if (isCellSelection(selection)) {
-    return selection.isColSelection() && selection.isRowSelection();
-  }
-
-  return false;
-};
-
-// :: (columnIndex: number) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-// Returns an array of cells in a column at index `columnIndex`.
-//
-// ```javascript
-// const cells = getCellsInColumn(i)(selection); // [{node, pos}, {node, pos}]
-// ```
-var getCellsInColumn = function getCellsInColumn(columnIndex) {
-  return function (selection) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (columnIndex >= 0 && columnIndex <= map.width - 1) {
-        var cells = map.cellsInRect({
-          left: columnIndex,
-          right: columnIndex + 1,
-          top: 0,
-          bottom: map.height
-        });
-        return cells.map(function (nodePos) {
-          var node = table.node.nodeAt(nodePos);
-          var pos = nodePos + table.start;
-          return { pos: pos, start: pos + 1, node: node };
-        });
-      }
-    }
-  };
-};
-
-// :: (rowIndex: number) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-// Returns an array of cells in a row at index `rowIndex`.
-//
-// ```javascript
-// const cells = getCellsInRow(i)(selection); // [{node, pos}, {node, pos}]
-// ```
-var getCellsInRow = function getCellsInRow(rowIndex) {
-  return function (selection) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (rowIndex >= 0 && rowIndex <= map.height - 1) {
-        var cells = map.cellsInRect({
-          left: 0,
-          right: map.width,
-          top: rowIndex,
-          bottom: rowIndex + 1
-        });
-        return cells.map(function (nodePos) {
-          var node = table.node.nodeAt(nodePos);
-          var pos = nodePos + table.start;
-          return { pos: pos, start: pos + 1, node: node };
-        });
-      }
-    }
-  };
-};
-
-// :: (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-// Returns an array of all cells in a table.
-//
-// ```javascript
-// const cells = getCellsInTable(selection); // [{node, pos}, {node, pos}]
-// ```
-var getCellsInTable = function getCellsInTable(selection) {
-  var table = findTable(selection);
-  if (table) {
-    var map = dist$7.TableMap.get(table.node);
-    var cells = map.cellsInRect({
-      left: 0,
-      right: map.width,
-      top: 0,
-      bottom: map.height
-    });
-    return cells.map(function (nodePos) {
-      var node = table.node.nodeAt(nodePos);
-      var pos = nodePos + table.start;
-      return { pos: pos, start: pos + 1, node: node };
-    });
-  }
-};
-
-// :: (columnIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that creates a `CellSelection` on a column at index `columnIndex`.
-//
-// ```javascript
-// dispatch(
-//   selectColumn(i)(state.tr)
-// );
-// ```
-var selectColumn = function selectColumn(columnIndex) {
-  return function (tr) {
-    var cells = getCellsInColumn(columnIndex)(tr.selection);
-    if (cells) {
-      var $anchor = tr.doc.resolve(cells[0].pos);
-      var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-      return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that creates a `CellSelection` on a column at index `rowIndex`.
-//
-// ```javascript
-// dispatch(
-//   selectRow(i)(state.tr)
-// );
-// ```
-var selectRow = function selectRow(rowIndex) {
-  return function (tr) {
-    var cells = getCellsInRow(rowIndex)(tr.selection);
-    if (cells) {
-      var $anchor = tr.doc.resolve(cells[0].pos);
-      var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-      return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-    }
-    return tr;
-  };
-};
-
-// :: (selection: Selection) → (tr: Transaction) → Transaction
-// Returns a new transaction that creates a `CellSelection` on the entire table.
-//
-// ```javascript
-// dispatch(
-//   selectTable(i)(state.tr)
-// );
-// ```
-var selectTable = function selectTable(tr) {
-  var cells = getCellsInTable(tr.selection);
-  if (cells) {
-    var $anchor = tr.doc.resolve(cells[0].pos);
-    var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-    return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-  }
-  return tr;
-};
-
-// :: (cell: {pos: number, node: ProseMirrorNode}, schema: Schema) → (tr: Transaction) → Transaction
-// Returns a new transaction that clears the content of a given `cell`.
-//
-// ```javascript
-// const $pos = state.doc.resolve(13);
-// dispatch(
-//   emptyCell(findCellClosestToPos($pos), state.schema)(state.tr)
-// );
-// ```
-var emptyCell = function emptyCell(cell, schema) {
-  return function (tr) {
-    if (cell) {
-      var content = tableNodeTypes(schema).cell.createAndFill().content;
-      if (!cell.node.content.eq(content)) {
-        tr.replaceWith(cell.pos, cell.pos + cell.node.nodeSize - 1, new dist.Slice(content, 0, 0));
-        return cloneTr(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (columnIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that adds a new column at index `columnIndex`.
-//
-// ```javascript
-// dispatch(
-//   addColumnAt(i)(state.tr)
-// );
-// ```
-var addColumnAt = function addColumnAt(columnIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (columnIndex >= 0 && columnIndex <= map.width) {
-        return cloneTr(dist$7.addColumn(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, columnIndex));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number, clonePreviousRow?: boolean) → (tr: Transaction) → Transaction
-// Returns a new transaction that adds a new row at index `rowIndex`. Optionally clone the previous row.
-//
-// ```javascript
-// dispatch(
-//   addRowAt(i)(state.tr)
-// );
-// ```
-//
-// ```javascript
-// dispatch(
-//   addRowAt(i, true)(state.tr)
-// );
-// ```
-var addRowAt = function addRowAt(rowIndex, clonePreviousRow) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      var cloneRowIndex = rowIndex - 1;
-
-      if (clonePreviousRow && cloneRowIndex >= 0) {
-        return cloneTr(cloneRowAt(cloneRowIndex)(tr));
-      }
-
-      if (rowIndex >= 0 && rowIndex <= map.height) {
-        return cloneTr(dist$7.addRow(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, rowIndex));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (cloneRowIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that adds a new row after `cloneRowIndex`, cloning the row attributes at `cloneRowIndex`.
-//
-// ```javascript
-// dispatch(
-//   cloneRowAt(i)(state.tr)
-// );
-// ```
-var cloneRowAt = function cloneRowAt(rowIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-
-      if (rowIndex >= 0 && rowIndex <= map.height) {
-        var tableNode = table.node;
-        var tableNodes = tableNodeTypes(tableNode.type.schema);
-
-        var rowPos = table.start;
-        for (var i = 0; i < rowIndex + 1; i++) {
-          rowPos += tableNode.child(i).nodeSize;
-        }
-
-        var cloneRow = tableNode.child(rowIndex);
-        // Re-create the same nodes with same attrs, dropping the node content.
-        var cells = [];
-        var rowWidth = 0;
-        cloneRow.forEach(function (cell) {
-          // If we're copying a row with rowspan somewhere, we dont want to copy that cell
-          // We'll increment its span below.
-          if (cell.attrs.rowspan === 1) {
-            rowWidth += cell.attrs.colspan;
-            cells.push(tableNodes[cell.type.spec.tableRole].createAndFill(cell.attrs, cell.marks));
-          }
-        });
-
-        // If a higher row spans past our clone row, bump the higher row to cover this new row too.
-        if (rowWidth < map.width) {
-          var rowSpanCells = [];
-
-          var _loop = function _loop(_i) {
-            var foundCells = filterCellsInRow(_i, function (cell, tr) {
-              var rowspan = cell.node.attrs.rowspan;
-              var spanRange = _i + rowspan;
-              return rowspan > 1 && spanRange > rowIndex;
-            })(tr);
-            rowSpanCells.push.apply(rowSpanCells, _toConsumableArray(foundCells));
-          };
-
-          for (var _i = rowIndex; _i >= 0; _i--) {
-            _loop(_i);
-          }
-
-          if (rowSpanCells.length) {
-            rowSpanCells.forEach(function (cell) {
-              tr = setCellAttrs(cell, {
-                rowspan: cell.node.attrs.rowspan + 1
-              })(tr);
-            });
-          }
-        }
-
-        return safeInsert(tableNodes.row.create(cloneRow.attrs, cells), rowPos)(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (columnIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a column at index `columnIndex`. If there is only one column left, it will remove the entire table.
-//
-// ```javascript
-// dispatch(
-//   removeColumnAt(i)(state.tr)
-// );
-// ```
-var removeColumnAt = function removeColumnAt(columnIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (columnIndex === 0 && map.width === 1) {
-        return removeTable(tr);
-      } else if (columnIndex >= 0 && columnIndex <= map.width) {
-        dist$7.removeColumn(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, columnIndex);
-        return cloneTr(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a row at index `rowIndex`. If there is only one row left, it will remove the entire table.
-//
-// ```javascript
-// dispatch(
-//   removeRowAt(i)(state.tr)
-// );
-// ```
-var removeRowAt = function removeRowAt(rowIndex) {
-  return function (tr) {
-    var table = findTable(tr.selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      if (rowIndex === 0 && map.height === 1) {
-        return removeTable(tr);
-      } else if (rowIndex >= 0 && rowIndex <= map.height) {
-        dist$7.removeRow(tr, {
-          map: map,
-          tableStart: table.start,
-          table: table.node
-        }, rowIndex);
-        return cloneTr(tr);
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes a table node if the cursor is inside of it.
-//
-// ```javascript
-// dispatch(
-//   removeTable(state.tr)
-// );
-// ```
-var removeTable = function removeTable(tr) {
-  var $from = tr.selection.$from;
-
-  for (var depth = $from.depth; depth > 0; depth--) {
-    var node = $from.node(depth);
-    if (node.type.spec.tableRole === 'table') {
-      return cloneTr(tr.delete($from.before(depth), $from.after(depth)));
-    }
-  }
-  return tr;
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes selected columns.
-//
-// ```javascript
-// dispatch(
-//   removeSelectedColumns(state.tr)
-// );
-// ```
-var removeSelectedColumns = function removeSelectedColumns(tr) {
-  var _tr = tr,
-      selection = _tr.selection;
-
-  if (isTableSelected(selection)) {
-    return removeTable(tr);
-  }
-  if (isCellSelection(selection)) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);
-      for (var i = rect.right - 1; i >= rect.left; i--) {
-        tr = removeColumnAt(i)(tr);
-      }
-      return tr;
-    }
-  }
-  return tr;
-};
-
-// :: (tr: Transaction) → Transaction
-// Returns a new transaction that removes selected rows.
-//
-// ```javascript
-// dispatch(
-//   removeSelectedRows(state.tr)
-// );
-// ```
-var removeSelectedRows = function removeSelectedRows(tr) {
-  var _tr2 = tr,
-      selection = _tr2.selection;
-
-  if (isTableSelected(selection)) {
-    return removeTable(tr);
-  }
-  if (isCellSelection(selection)) {
-    var table = findTable(selection);
-    if (table) {
-      var map = dist$7.TableMap.get(table.node);
-      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);
-      for (var i = rect.bottom - 1; i >= rect.top; i--) {
-        tr = removeRowAt(i)(tr);
-      }
-      return tr;
-    }
-  }
-  return tr;
-};
-
-// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a column closest to a given `$pos`.
-//
-// ```javascript
-// dispatch(
-//   removeColumnClosestToPos(state.doc.resolve(3))(state.tr)
-// );
-// ```
-var removeColumnClosestToPos = function removeColumnClosestToPos($pos) {
-  return function (tr) {
-    var rect = findCellRectClosestToPos($pos);
-    if (rect) {
-      return removeColumnAt(rect.left)(setTextSelection($pos.pos)(tr));
-    }
-    return tr;
-  };
-};
-
-// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction
-// Returns a new transaction that removes a row closest to a given `$pos`.
-//
-// ```javascript
-// dispatch(
-//   removeRowClosestToPos(state.doc.resolve(3))(state.tr)
-// );
-// ```
-var removeRowClosestToPos = function removeRowClosestToPos($pos) {
-  return function (tr) {
-    var rect = findCellRectClosestToPos($pos);
-    if (rect) {
-      return removeRowAt(rect.top)(setTextSelection($pos.pos)(tr));
-    }
-    return tr;
-  };
-};
-
-// :: (columnIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction
-// Returns a new transaction that maps a given `cellTransform` function to each cell in a column at a given `columnIndex`.
-// It will set the selection into the last cell of the column if `setCursorToLastCell` param is set to `true`.
-//
-// ```javascript
-// dispatch(
-//   forEachCellInColumn(0, (cell, tr) => emptyCell(cell, state.schema)(tr))(state.tr)
-// );
-// ```
-var forEachCellInColumn = function forEachCellInColumn(columnIndex, cellTransform, setCursorToLastCell) {
-  return function (tr) {
-    var cells = getCellsInColumn(columnIndex)(tr.selection);
-    if (cells) {
-      for (var i = cells.length - 1; i >= 0; i--) {
-        tr = cellTransform(cells[i], tr);
-      }
-      if (setCursorToLastCell) {
-        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));
-        tr.setSelection(dist$2.Selection.near($pos));
-      }
-      return cloneTr(tr);
-    }
-    return tr;
-  };
-};
-
-// :: (rowIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction
-// Returns a new transaction that maps a given `cellTransform` function to each cell in a row at a given `rowIndex`.
-// It will set the selection into the last cell of the row if `setCursorToLastCell` param is set to `true`.
-//
-// ```javascript
-// dispatch(
-//   forEachCellInRow(0, (cell, tr) => setCellAttrs(cell, { background: 'red' })(tr))(state.tr)
-// );
-// ```
-var forEachCellInRow = function forEachCellInRow(rowIndex, cellTransform, setCursorToLastCell) {
-  return function (tr) {
-    var cells = getCellsInRow(rowIndex)(tr.selection);
-    if (cells) {
-      for (var i = cells.length - 1; i >= 0; i--) {
-        tr = cellTransform(cells[i], tr);
-      }
-      if (setCursorToLastCell) {
-        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));
-        tr.setSelection(dist$2.Selection.near($pos));
-      }
-    }
-    return tr;
-  };
-};
-
-// :: (cell: {pos: number, start: number, node: ProseMirrorNode}, attrs: Object) → (tr: Transaction) → Transaction
-// Returns a new transaction that sets given `attrs` to a given `cell`.
-//
-// ```javascript
-// dispatch(
-//   setCellAttrs(findCellClosestToPos($pos), { background: 'blue' })(tr);
-// );
-// ```
-var setCellAttrs = function setCellAttrs(cell, attrs) {
-  return function (tr) {
-    if (cell) {
-      tr.setNodeMarkup(cell.pos, null, Object.assign({}, cell.node.attrs, attrs));
-      return cloneTr(tr);
-    }
-    return tr;
-  };
-};
-
-// :: (schema: Schema, rowsCount: ?number, colsCount: ?number, withHeaderRow: ?boolean) → Node
-// Returns a table node of a given size.
-// `withHeaderRow` defines whether the first row of the table will be a header row.
-//
-// ```javascript
-// const table = createTable(state.schema); // 3x3 table node
-// dispatch(
-//   tr.replaceSelectionWith(table).scrollIntoView()
-// );
-// ```
-var createTable = function createTable(schema) {
-  var rowsCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 3;
-  var colsCount = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 3;
-  var withHeaderRow = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
-
-  var _tableNodeTypes = tableNodeTypes(schema),
-      tableCell = _tableNodeTypes.cell,
-      tableHeader = _tableNodeTypes.header_cell,
-      tableRow = _tableNodeTypes.row,
-      table = _tableNodeTypes.table;
-
-  var cells = [];
-  for (var i = 0; i < colsCount; i++) {
-    cells.push(tableCell.createAndFill(null));
-  }
-
-  var headerCells = [];
-  if (withHeaderRow) {
-    for (var _i2 = 0; _i2 < colsCount; _i2++) {
-      headerCells.push(tableHeader.createAndFill(null));
-    }
-  }
-
-  var rows = [];
-  for (var _i3 = 0; _i3 < rowsCount; _i3++) {
-    rows.push(tableRow.createChecked(null, withHeaderRow && _i3 === 0 ? headerCells : cells));
-  }
-
-  return table.createChecked(null, rows);
-};
-
-// :: ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
-// Iterates over parent nodes, returning a table cell or a table header node closest to a given `$pos`.
-//
-// ```javascript
-// const cell = findCellClosestToPos(state.selection.$from);
-// ```
-var findCellClosestToPos = function findCellClosestToPos($pos) {
-  var predicate = function predicate(node) {
-    return node.type.spec.tableRole && /cell/i.test(node.type.spec.tableRole);
-  };
-  return findParentNodeClosestToPos($pos, predicate);
-};
-
-// :: ($pos: ResolvedPos) → ?{left: number, top: number, right: number, bottom: number}
-// Returns the rectangle spanning a cell closest to a given `$pos`.
-//
-// ```javascript
-// dispatch(
-//   findCellRectClosestToPos(state.selection.$from)
-// );
-// ```
-var findCellRectClosestToPos = function findCellRectClosestToPos($pos) {
-  var cell = findCellClosestToPos($pos);
-  if (cell) {
-    var table = findTableClosestToPos($pos);
-    var map = dist$7.TableMap.get(table.node);
-    var cellPos = cell.pos - table.start;
-    return map.rectBetween(cellPos, cellPos);
-  }
-};
-
-var filterCellsInRow = function filterCellsInRow(rowIndex, predicate) {
-  return function (tr) {
-    var foundCells = [];
-    var cells = getCellsInRow(rowIndex)(tr.selection);
-    if (cells) {
-      for (var j = cells.length - 1; j >= 0; j--) {
-        if (predicate(cells[j], tr)) {
-          foundCells.push(cells[j]);
-        }
-      }
-    }
-
-    return foundCells;
-  };
-};
-
-exports.isNodeSelection = isNodeSelection;
-exports.canInsert = canInsert;
-exports.findParentNode = findParentNode;
-exports.findParentNodeClosestToPos = findParentNodeClosestToPos;
-exports.findParentDomRef = findParentDomRef;
-exports.hasParentNode = hasParentNode;
-exports.findParentNodeOfType = findParentNodeOfType;
-exports.findParentNodeOfTypeClosestToPos = findParentNodeOfTypeClosestToPos;
-exports.hasParentNodeOfType = hasParentNodeOfType;
-exports.findParentDomRefOfType = findParentDomRefOfType;
-exports.findSelectedNodeOfType = findSelectedNodeOfType;
-exports.findPositionOfNodeBefore = findPositionOfNodeBefore;
-exports.findDomRefAtPos = findDomRefAtPos;
-exports.flatten = flatten;
-exports.findChildren = findChildren;
-exports.findTextNodes = findTextNodes;
-exports.findInlineNodes = findInlineNodes;
-exports.findBlockNodes = findBlockNodes;
-exports.findChildrenByAttr = findChildrenByAttr;
-exports.findChildrenByType = findChildrenByType;
-exports.findChildrenByMark = findChildrenByMark;
-exports.contains = contains;
-exports.findTable = findTable;
-exports.isCellSelection = isCellSelection;
-exports.isColumnSelected = isColumnSelected;
-exports.isRowSelected = isRowSelected;
-exports.isTableSelected = isTableSelected;
-exports.getCellsInColumn = getCellsInColumn;
-exports.getCellsInRow = getCellsInRow;
-exports.getCellsInTable = getCellsInTable;
-exports.selectColumn = selectColumn;
-exports.selectRow = selectRow;
-exports.selectTable = selectTable;
-exports.emptyCell = emptyCell;
-exports.addColumnAt = addColumnAt;
-exports.addRowAt = addRowAt;
-exports.cloneRowAt = cloneRowAt;
-exports.removeColumnAt = removeColumnAt;
-exports.removeRowAt = removeRowAt;
-exports.removeTable = removeTable;
-exports.removeSelectedColumns = removeSelectedColumns;
-exports.removeSelectedRows = removeSelectedRows;
-exports.removeColumnClosestToPos = removeColumnClosestToPos;
-exports.removeRowClosestToPos = removeRowClosestToPos;
-exports.forEachCellInColumn = forEachCellInColumn;
-exports.forEachCellInRow = forEachCellInRow;
-exports.setCellAttrs = setCellAttrs;
-exports.createTable = createTable;
-exports.findCellClosestToPos = findCellClosestToPos;
-exports.findCellRectClosestToPos = findCellRectClosestToPos;
-exports.removeParentNodeOfType = removeParentNodeOfType;
-exports.replaceParentNodeOfType = replaceParentNodeOfType;
-exports.removeSelectedNode = removeSelectedNode;
-exports.replaceSelectedNode = replaceSelectedNode;
-exports.setTextSelection = setTextSelection;
-exports.safeInsert = safeInsert;
-exports.setParentNodeMarkup = setParentNodeMarkup;
-exports.selectParentNodeOfType = selectParentNodeOfType;
-exports.removeNodeBefore = removeNodeBefore;
-
-});
-
-unwrapExports(dist$8);
-var dist_1$7 = dist$8.isNodeSelection;
-var dist_2$7 = dist$8.canInsert;
-var dist_3$6 = dist$8.findParentNode;
-var dist_4$6 = dist$8.findParentNodeClosestToPos;
-var dist_5$6 = dist$8.findParentDomRef;
-var dist_6$5 = dist$8.hasParentNode;
-var dist_7$5 = dist$8.findParentNodeOfType;
-var dist_8$5 = dist$8.findParentNodeOfTypeClosestToPos;
-var dist_9$5 = dist$8.hasParentNodeOfType;
-var dist_10$4 = dist$8.findParentDomRefOfType;
-var dist_11$4 = dist$8.findSelectedNodeOfType;
-var dist_12$4 = dist$8.findPositionOfNodeBefore;
-var dist_13$3 = dist$8.findDomRefAtPos;
-var dist_14$2 = dist$8.flatten;
-var dist_15$2 = dist$8.findChildren;
-var dist_16$2 = dist$8.findTextNodes;
-var dist_17$2 = dist$8.findInlineNodes;
-var dist_18$2 = dist$8.findBlockNodes;
-var dist_19$2 = dist$8.findChildrenByAttr;
-var dist_20$1 = dist$8.findChildrenByType;
-var dist_21$1 = dist$8.findChildrenByMark;
-var dist_22$1 = dist$8.contains;
-var dist_23$1 = dist$8.findTable;
-var dist_24$1 = dist$8.isCellSelection;
-var dist_25$1 = dist$8.isColumnSelected;
-var dist_26$1 = dist$8.isRowSelected;
-var dist_27$1 = dist$8.isTableSelected;
-var dist_28$1 = dist$8.getCellsInColumn;
-var dist_29$1 = dist$8.getCellsInRow;
-var dist_30$1 = dist$8.getCellsInTable;
-var dist_31$1 = dist$8.selectColumn;
-var dist_32$1 = dist$8.selectRow;
-var dist_33$1 = dist$8.selectTable;
-var dist_34$1 = dist$8.emptyCell;
-var dist_35$1 = dist$8.addColumnAt;
-var dist_36$1 = dist$8.addRowAt;
-var dist_37$1 = dist$8.cloneRowAt;
-var dist_38$1 = dist$8.removeColumnAt;
-var dist_39 = dist$8.removeRowAt;
-var dist_40 = dist$8.removeTable;
-var dist_41 = dist$8.removeSelectedColumns;
-var dist_42 = dist$8.removeSelectedRows;
-var dist_43 = dist$8.removeColumnClosestToPos;
-var dist_44 = dist$8.removeRowClosestToPos;
-var dist_45 = dist$8.forEachCellInColumn;
-var dist_46 = dist$8.forEachCellInRow;
-var dist_47 = dist$8.setCellAttrs;
-var dist_48 = dist$8.createTable;
-var dist_49 = dist$8.findCellClosestToPos;
-var dist_50 = dist$8.findCellRectClosestToPos;
-var dist_51 = dist$8.removeParentNodeOfType;
-var dist_52 = dist$8.replaceParentNodeOfType;
-var dist_53 = dist$8.removeSelectedNode;
-var dist_54 = dist$8.replaceSelectedNode;
-var dist_55 = dist$8.setTextSelection;
-var dist_56 = dist$8.safeInsert;
-var dist_57 = dist$8.setParentNodeMarkup;
-var dist_58 = dist$8.selectParentNodeOfType;
-var dist_59 = dist$8.removeNodeBefore;
-
-function nodeIsActive (state, type, attrs) {
-	var predicate = function (node) { return node.type === type; };
-	var parent = dist_3$6(predicate)(state.selection);
-
-	if (attrs === {} || !parent) {
-		return !!parent
-	}
-
-	return parent.node.hasMarkup(type, attrs)
-}
-
-var Toolbar = function Toolbar(ref) {
-	var node = ref.node;
-	var editorView = ref.editorView;
-
-	this.editorView = editorView;
-	this.node = node;
-	this.element = this.node.elm;
-	this.element.style.visibility = 'hidden';
-	this.element.style.opacity = 0;
-
-	this.editorView.dom.addEventListener('blur', this.hide.bind(this));
-};
-
-Toolbar.prototype.update = function update (view, lastState) {
-	var state = view.state;
-
-	// Don't do anything if the document/selection didn't change
-	if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {
-		return
-	}
-
-	// Hide the tooltip if the selection is empty
-	if (state.selection.empty) {
-		this.hide();
-		return
-	}
-
-
-	// Otherwise, reposition it and update its content
-	this.show();
-	var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-
-	// These are in screen coordinates
-	var start = view.coordsAtPos(from);
-	var end = view.coordsAtPos(to);
-
-	// The box in which the tooltip is positioned, to use as base
-	var box = this.element.offsetParent.getBoundingClientRect();
-
-	// Find a center-ish x position from the selection endpoints (when
-	// crossing lines, end may be more to the left)
-	var left = Math.max((start.left + end.left) / 2, start.left + 3);
-	this.element.style.left = (left - box.left) + "px";
-	this.element.style.bottom = (box.bottom - start.top) + "px";
-};
-
-Toolbar.prototype.show = function show () {
-	this.element.style.visibility = 'visible';
-	this.element.style.opacity = 1;
-};
-
-Toolbar.prototype.hide = function hide (event) {
-	if (event && event.relatedTarget) {
-		return
-	}
-	this.element.style.visibility = 'hidden';
-	this.element.style.opacity = 0;
-};
-
-Toolbar.prototype.destroy = function destroy () {
-	this.editorView.dom.removeEventListener('blur', this.hide);
-};
-
-function menuBubble (node) {
-	return new dist_8$2({
-		view: function view(editorView) {
-			return new Toolbar({ editorView: editorView, node: node })
-		},
-	})
-}
-
-var Node = function Node(options) {
-	if ( options === void 0 ) options = {};
-
-	this.options = Object.assign({}, this.defaultOptions,
-		options);
-};
-
-var prototypeAccessors$1 = { name: { configurable: true },defaultOptions: { configurable: true },type: { configurable: true },view: { configurable: true },schema: { configurable: true },plugins: { configurable: true } };
-
-prototypeAccessors$1.name.get = function () {
-	return null
-};
-
-prototypeAccessors$1.defaultOptions.get = function () {
-	return {}
-};
-
-prototypeAccessors$1.type.get = function () {
-	return 'node'
-};
-
-prototypeAccessors$1.view.get = function () {
-	return null
-};
-
-prototypeAccessors$1.schema.get = function () {
-	return null
-};
-
-prototypeAccessors$1.plugins.get = function () {
-	return []
-};
-
-Node.prototype.command = function command () {
-	return function () {}
-};
-
-Node.prototype.keys = function keys () {
-	return {}
-};
-
-Node.prototype.inputRules = function inputRules () {
-	return []
-};
-
-Object.defineProperties( Node.prototype, prototypeAccessors$1 );
-
-var Mark = function Mark(options) {
-	if ( options === void 0 ) options = {};
-
-	this.options = Object.assign({}, this.defaultOptions,
-		options);
-};
-
-var prototypeAccessors$2 = { name: { configurable: true },defaultOptions: { configurable: true },type: { configurable: true },view: { configurable: true },schema: { configurable: true },plugins: { configurable: true } };
-
-prototypeAccessors$2.name.get = function () {
-	return null
-};
-
-prototypeAccessors$2.defaultOptions.get = function () {
-	return {}
-};
-
-prototypeAccessors$2.type.get = function () {
-	return 'mark'
-};
-
-prototypeAccessors$2.view.get = function () {
-	return null
-};
-
-prototypeAccessors$2.schema.get = function () {
-	return null
-};
-
-prototypeAccessors$2.plugins.get = function () {
-	return []
-};
-
-Mark.prototype.command = function command () {
-	return function () {}
-};
-
-Mark.prototype.keys = function keys () {
-	return {}
-};
-
-Mark.prototype.inputRules = function inputRules () {
-	return []
-};
-
-Object.defineProperties( Mark.prototype, prototypeAccessors$2 );
-
-var PluginManager = function PluginManager(plugins) {
-	if ( plugins === void 0 ) plugins = [];
-
-	this.plugins = plugins;
-};
-
-var prototypeAccessors$3 = { nodes: { configurable: true },marks: { configurable: true },pluginplugins: { configurable: true },views: { configurable: true } };
-
-prototypeAccessors$3.nodes.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.type === 'node'; })
-		.reduce(function (nodes, ref) {
-				var obj;
-
-				var name = ref.name;
-				var schema = ref.schema;
-				return (Object.assign({}, nodes,
-			( obj = {}, obj[name] = schema, obj )));
-		}, {})
-};
-
-prototypeAccessors$3.marks.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.type === 'mark'; })
-		.reduce(function (marks, ref) {
-				var obj;
-
-				var name = ref.name;
-				var schema = ref.schema;
-				return (Object.assign({}, marks,
-			( obj = {}, obj[name] = schema, obj )));
-		}, {})
-};
-
-prototypeAccessors$3.pluginplugins.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.plugins; })
-		.reduce(function (allPlugins, ref) {
-				var plugins = ref.plugins;
-
-				return (allPlugins.concat( plugins ));
-		}, [])
-};
-
-prototypeAccessors$3.views.get = function () {
-	return this.plugins
-		.filter(function (plugin) { return plugin.view; })
-		.reduce(function (views, ref) {
-				var obj;
-
-				var name = ref.name;
-				var view = ref.view;
-				return (Object.assign({}, views,
-			( obj = {}, obj[name] = view, obj )));
-		}, {})
-};
-
-PluginManager.prototype.keymaps = function keymaps (ref) {
-		var schema = ref.schema;
-
-	return this.plugins
-		.filter(function (plugin) { return plugin.keys; })
-		.map(function (plugin) { return plugin.keys({
-			type: schema[((plugin.type) + "s")][plugin.name],
-			schema: schema,
-		}); })
-		.map(function (keys) { return keymap_2(keys); })
-};
-
-PluginManager.prototype.inputRules = function inputRules (ref) {
-		var schema = ref.schema;
-
-	return this.plugins
-		.filter(function (plugin) { return plugin.inputRules; })
-		.map(function (plugin) { return plugin.inputRules({
-			type: schema[((plugin.type) + "s")][plugin.name],
-			schema: schema,
-		}); })
-		.reduce(function (allInputRules, inputRules) { return (allInputRules.concat( inputRules )); }, [])
-};
-
-PluginManager.prototype.commands = function commands (ref) {
-		var schema = ref.schema;
-		var view = ref.view;
-
-	return this.plugins
-		.filter(function (plugin) { return plugin.command; })
-		.reduce(function (commands, ref) {
-				var obj;
-
-				var name = ref.name;
-				var type = ref.type;
-				var command = ref.command;
-				return (Object.assign({}, commands,
-			( obj = {}, obj[name] = function (attrs) {
-				view.focus();
-				command({
-					type: schema[(type + "s")][name],
-					attrs: attrs,
-					schema: schema,
-				})(view.state, view.dispatch, view);
-			}, obj )));
-		}, {})
-};
-
-Object.defineProperties( PluginManager.prototype, prototypeAccessors$3 );
-
-var schemaList = createCommonjsModule(function (module, exports) {
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-var olDOM = ["ol", 0];
-var ulDOM = ["ul", 0];
-var liDOM = ["li", 0];
-
-// :: NodeSpec
-// An ordered list [node spec](#model.NodeSpec). Has a single
-// attribute, `order`, which determines the number at which the list
-// starts counting, and defaults to 1. Represented as an `<ol>`
-// element.
-var orderedList = {
-  attrs: {order: {default: 1}},
-  parseDOM: [{tag: "ol", getAttrs: function getAttrs(dom) {
-    return {order: dom.hasAttribute("start") ? +dom.getAttribute("start") : 1}
-  }}],
-  toDOM: function toDOM(node) {
-    return node.attrs.order == 1 ? olDOM : ["ol", {start: node.attrs.order}, 0]
-  }
-};
-
-// :: NodeSpec
-// A bullet list node spec, represented in the DOM as `<ul>`.
-var bulletList = {
-  parseDOM: [{tag: "ul"}],
-  toDOM: function toDOM() { return ulDOM }
-};
-
-// :: NodeSpec
-// A list item (`<li>`) spec.
-var listItem = {
-  parseDOM: [{tag: "li"}],
-  toDOM: function toDOM() { return liDOM },
-  defining: true
-};
-
-function add(obj, props) {
-  var copy = {};
-  for (var prop in obj) { copy[prop] = obj[prop]; }
-  for (var prop$1 in props) { copy[prop$1] = props[prop$1]; }
-  return copy
-}
-
-// :: (OrderedMap<NodeSpec>, string, ?string) → OrderedMap<NodeSpec>
-// Convenience function for adding list-related node types to a map
-// specifying the nodes for a schema. Adds
-// [`orderedList`](#schema-list.orderedList) as `"ordered_list"`,
-// [`bulletList`](#schema-list.bulletList) as `"bullet_list"`, and
-// [`listItem`](#schema-list.listItem) as `"list_item"`.
-//
-// `itemContent` determines the content expression for the list items.
-// If you want the commands defined in this module to apply to your
-// list structure, it should have a shape like `"paragraph block*"` or
-// `"paragraph (ordered_list | bullet_list)*"`. `listGroup` can be
-// given to assign a group name to the list node types, for example
-// `"block"`.
-function addListNodes(nodes, itemContent, listGroup) {
-  return nodes.append({
-    ordered_list: add(orderedList, {content: "list_item+", group: listGroup}),
-    bullet_list: add(bulletList, {content: "list_item+", group: listGroup}),
-    list_item: add(listItem, {content: itemContent})
-  })
-}
-
-// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Returns a command function that wraps the selection in a list with
-// the given type an attributes. If `dispatch` is null, only return a
-// value to indicate whether this is possible, but don't actually
-// perform the change.
-function wrapInList(listType, attrs) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to), doJoin = false, outerRange = range;
-    if (!range) { return false }
-    // This is at the top of an existing list item
-    if (range.depth >= 2 && $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {
-      // Don't do anything if this is the top of the list
-      if ($from.index(range.depth - 1) == 0) { return false }
-      var $insert = state.doc.resolve(range.start - 2);
-      outerRange = new dist.NodeRange($insert, $insert, range.depth);
-      if (range.endIndex < range.parent.childCount)
-        { range = new dist.NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth); }
-      doJoin = true;
-    }
-    var wrap = dist$1.findWrapping(outerRange, listType, attrs, range);
-    if (!wrap) { return false }
-    if (dispatch) { dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView()); }
-    return true
-  }
-}
-
-function doWrapInList(tr, range, wrappers, joinBefore, listType) {
-  var content = dist.Fragment.empty;
-  for (var i = wrappers.length - 1; i >= 0; i--)
-    { content = dist.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }
-
-  tr.step(new dist$1.ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end,
-                                new dist.Slice(content, 0, 0), wrappers.length, true));
-
-  var found = 0;
-  for (var i$1 = 0; i$1 < wrappers.length; i$1++) { if (wrappers[i$1].type == listType) { found = i$1 + 1; } }
-  var splitDepth = wrappers.length - found;
-
-  var splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;
-  for (var i$2 = range.startIndex, e = range.endIndex, first = true; i$2 < e; i$2++, first = false) {
-    if (!first && dist$1.canSplit(tr.doc, splitPos, splitDepth)) {
-      tr.split(splitPos, splitDepth);
-      splitPos += 2 * splitDepth;
-    }
-    splitPos += parent.child(i$2).nodeSize;
-  }
-  return tr
-}
-
-// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Build a command that splits a non-empty textblock at the top level
-// of a list item by also splitting that list item.
-function splitListItem(itemType) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var node = ref.node;
-    if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to)) { return false }
-    var grandParent = $from.node(-1);
-    if (grandParent.type != itemType) { return false }
-    if ($from.parent.content.size == 0) {
-      // In an empty block. If this is a nested list, the wrapping
-      // list item should be split. Otherwise, bail out and let next
-      // command handle lifting.
-      if ($from.depth == 2 || $from.node(-3).type != itemType ||
-          $from.index(-2) != $from.node(-2).childCount - 1) { return false }
-      if (dispatch) {
-        var wrap = dist.Fragment.empty, keepItem = $from.index(-1) > 0;
-        // Build a fragment containing empty versions of the structure
-        // from the outer list item to the parent node of the cursor
-        for (var d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--)
-          { wrap = dist.Fragment.from($from.node(d).copy(wrap)); }
-        // Add a second list item with an empty default start node
-        wrap = wrap.append(dist.Fragment.from(itemType.createAndFill()));
-        var tr$1 = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new dist.Slice(wrap, keepItem ? 3 : 2, 2));
-        tr$1.setSelection(state.selection.constructor.near(tr$1.doc.resolve($from.pos + (keepItem ? 3 : 2))));
-        dispatch(tr$1.scrollIntoView());
-      }
-      return true
-    }
-    var nextType = $to.pos == $from.end() ? grandParent.defaultContentType(0) : null;
-    var tr = state.tr.delete($from.pos, $to.pos);
-    var types = nextType && [null, {type: nextType}];
-    if (!dist$1.canSplit(tr.doc, $from.pos, 2, types)) { return false }
-    if (dispatch) { dispatch(tr.split($from.pos, 2, types).scrollIntoView()); }
-    return true
-  }
-}
-
-// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Create a command to lift the list item around the selection up into
-// a wrapping list.
-function liftListItem(itemType) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });
-    if (!range) { return false }
-    if (!dispatch) { return true }
-    if ($from.node(range.depth - 1).type == itemType) // Inside a parent list
-      { return liftToOuterList(state, dispatch, itemType, range) }
-    else // Outer list node
-      { return liftOutOfList(state, dispatch, range) }
-  }
-}
-
-function liftToOuterList(state, dispatch, itemType, range) {
-  var tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);
-  if (end < endOfList) {
-    // There are siblings after the lifted items, which must become
-    // children of the last item
-    tr.step(new dist$1.ReplaceAroundStep(end - 1, endOfList, end, endOfList,
-                                  new dist.Slice(dist.Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
-    range = new dist.NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
-  }
-  dispatch(tr.lift(range, dist$1.liftTarget(range)).scrollIntoView());
-  return true
-}
-
-function liftOutOfList(state, dispatch, range) {
-  var tr = state.tr, list = range.parent;
-  // Merge the list items into a single big item
-  for (var pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {
-    pos -= list.child(i).nodeSize;
-    tr.delete(pos - 1, pos + 1);
-  }
-  var $start = tr.doc.resolve(range.start), item = $start.nodeAfter;
-  var atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;
-  var parent = $start.node(-1), indexBefore = $start.index(-1);
-  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1,
-                         item.content.append(atEnd ? dist.Fragment.empty : dist.Fragment.from(list))))
-    { return false }
-  var start = $start.pos, end = start + item.nodeSize;
-  // Strip off the surrounding list. At the sides where we're not at
-  // the end of the list, the existing list is closed. At sides where
-  // this is the end, it is overwritten to its end.
-  tr.step(new dist$1.ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1,
-                                new dist.Slice((atStart ? dist.Fragment.empty : dist.Fragment.from(list.copy(dist.Fragment.empty)))
-                                          .append(atEnd ? dist.Fragment.empty : dist.Fragment.from(list.copy(dist.Fragment.empty))),
-                                          atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));
-  dispatch(tr.scrollIntoView());
-  return true
-}
-
-// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-// Create a command to sink the list item around the selection down
-// into an inner list.
-function sinkListItem(itemType) {
-  return function(state, dispatch) {
-    var ref = state.selection;
-    var $from = ref.$from;
-    var $to = ref.$to;
-    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });
-    if (!range) { return false }
-    var startIndex = range.startIndex;
-    if (startIndex == 0) { return false }
-    var parent = range.parent, nodeBefore = parent.child(startIndex - 1);
-    if (nodeBefore.type != itemType) { return false }
-
-    if (dispatch) {
-      var nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;
-      var inner = dist.Fragment.from(nestedBefore ? itemType.create() : null);
-      var slice = new dist.Slice(dist.Fragment.from(itemType.create(null, dist.Fragment.from(parent.copy(inner)))),
-                            nestedBefore ? 3 : 1, 0);
-      var before = range.start, after = range.end;
-      dispatch(state.tr.step(new dist$1.ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after,
-                                                   before, after, slice, 1, true))
-               .scrollIntoView());
-    }
-    return true
-  }
-}
-
-exports.orderedList = orderedList;
-exports.bulletList = bulletList;
-exports.listItem = listItem;
-exports.addListNodes = addListNodes;
-exports.wrapInList = wrapInList;
-exports.splitListItem = splitListItem;
-exports.liftListItem = liftListItem;
-exports.sinkListItem = sinkListItem;
-
-});
-
-unwrapExports(schemaList);
-var schemaList_1 = schemaList.orderedList;
-var schemaList_2 = schemaList.bulletList;
-var schemaList_3 = schemaList.listItem;
-var schemaList_4 = schemaList.addListNodes;
-var schemaList_5 = schemaList.wrapInList;
-var schemaList_6 = schemaList.splitListItem;
-var schemaList_7 = schemaList.liftListItem;
-var schemaList_8 = schemaList.sinkListItem;
-
-function removeMark (type) {
-  return function (state, dispatch) {
-		var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-		return dispatch(state.tr.removeMark(from, to, type))
-	}
-}
-
-function toggleBlockType (type, toggletype, attrs) {
-	if ( attrs === void 0 ) attrs = {};
-
-	return function (state, dispatch, view) {
-		var isActive = nodeIsActive(state, type, attrs);
-
-		if (isActive) {
-			return commands_18(toggletype)(state, dispatch, view)
-		}
-
-		return commands_18(type, attrs)(state, dispatch, view)
-	}
-}
-
-function toggleList$$1(type, itemType) {
-  return function (state, dispatch, view) {
-    var isActive = nodeIsActive(state, type);
-
-    if (isActive) {
-      return schemaList_7(itemType)(state, dispatch, view)
-    }
-
-    return schemaList_5(type)(state, dispatch, view)
-  }
-}
-
-// https://discuss.prosemirror.net/t/list-type-toggle/948
-
-// import { wrapInList, liftListItem } from 'prosemirror-schema-list'
-
-// function isList(node, schema) {
-//   return (node.type === schema.nodes.bullet_list || node.type === schema.nodes.ordered_list)
-// }
-
-// export default function toggleList(listType, schema) {
-//   const lift = liftListItem(schema.nodes.list_item)
-// 	const wrap = wrapInList(listType)
-
-//   return (state, dispatch) => {
-//     const { $from, $to } = state.selection
-//     const range = $from.blockRange($to)
-//     if (!range) {
-//       return false
-// 		}
-
-//     if (range.depth >= 2 && $from.node(range.depth - 1).type === listType) {
-//       return lift(state, dispatch)
-//     } else if (range.depth >= 2 && isList($from.node(range.depth - 1), schema)) {
-//       const tr = state.tr
-// 			const node = $from.before(range.depth - 1)
-// 			console.log({node})
-//       // TODO: how do I pass the node above to `setNodeType`?
-//       // tr.setNodeType(range.start, listType);
-//       if (dispatch) dispatch(tr)
-//       return false
-//     } else {
-//       return wrap(state, dispatch)
-//     }
-//   }
-// }
-
-function updateMark (type, attrs) {
-  return function (state, dispatch) {
-		var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-		return dispatch(state.tr.addMark(from, to, type.create(attrs)))
-	}
-}
-
-var BlockquoteNode = (function (Node$$1) {
-	function BlockquoteNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) BlockquoteNode.__proto__ = Node$$1;
-	BlockquoteNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	BlockquoteNode.prototype.constructor = BlockquoteNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'blockquote'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'block+',
-			group: 'block',
-			defining: true,
-			draggable: false,
-			parseDOM: [
-				{ tag: 'blockquote' } ],
-			toDOM: function () { return ['blockquote', 0]; },
-		}
-	};
-
-	BlockquoteNode.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_18(type)
-	};
-
-	BlockquoteNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Ctrl->': commands_17(type),
-		}
-	};
-
-	BlockquoteNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(/^\s*>\s$/, type) ]
-	};
-
-	Object.defineProperties( BlockquoteNode.prototype, prototypeAccessors );
-
-	return BlockquoteNode;
-}(Node));
-
-var BulletNode = (function (Node$$1) {
-	function BulletNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) BulletNode.__proto__ = Node$$1;
-	BulletNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	BulletNode.prototype.constructor = BulletNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'bullet_list'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'list_item+',
-			group: 'block',
-			parseDOM: [
-				{ tag: 'ul' } ],
-			toDOM: function () { return ['ul', 0]; },
-		}
-	};
-
-	BulletNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-
-		return toggleList$$1(type, schema.nodes.list_item)
-	};
-
-	BulletNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-8': schemaList_5(type),
-		}
-	};
-
-	BulletNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(/^\s*([-+*])\s$/, type) ]
-	};
-
-	Object.defineProperties( BulletNode.prototype, prototypeAccessors );
-
-	return BulletNode;
-}(Node));
-
-var CodeBlockNode = (function (Node$$1) {
-	function CodeBlockNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) CodeBlockNode.__proto__ = Node$$1;
-	CodeBlockNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	CodeBlockNode.prototype.constructor = CodeBlockNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'code_block'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'text*',
-			marks: '',
-			group: 'block',
-			code: true,
-			defining: true,
-			draggable: false,
-			parseDOM: [
-				{ tag: 'pre', preserveWhitespace: 'full' } ],
-			toDOM: function () { return ['pre', ['code', 0]]; },
-		}
-	};
-
-	CodeBlockNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-
-		return toggleBlockType(type, schema.nodes.paragraph)
-	};
-
-	CodeBlockNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-\\': commands_18(type),
-		}
-	};
-
-	CodeBlockNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_12$2(/^```$/, type) ]
-	};
-
-	Object.defineProperties( CodeBlockNode.prototype, prototypeAccessors );
-
-	return CodeBlockNode;
-}(Node));
-
-var DocNode = (function (Node$$1) {
-	function DocNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) DocNode.__proto__ = Node$$1;
-	DocNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	DocNode.prototype.constructor = DocNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'doc'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'block+',
-		}
-	};
-
-	Object.defineProperties( DocNode.prototype, prototypeAccessors );
-
-	return DocNode;
-}(Node));
-
-var HardBreakNode = (function (Node$$1) {
-	function HardBreakNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) HardBreakNode.__proto__ = Node$$1;
-	HardBreakNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	HardBreakNode.prototype.constructor = HardBreakNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'hard_break'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			inline: true,
-			group: 'inline',
-			selectable: false,
-			parseDOM: [
-				{ tag: 'br' } ],
-			toDOM: function () { return ['br']; },
-		}
-	};
-
-	HardBreakNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		var command = commands_21(commands_10, function (state, dispatch) {
-			dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());
-			return true
-		});
-		return {
-			'Mod-Enter': command,
-			'Shift-Enter': command,
-		}
-	};
-
-	Object.defineProperties( HardBreakNode.prototype, prototypeAccessors );
-
-	return HardBreakNode;
-}(Node));
-
-var HeadingNode = (function (Node$$1) {
-	function HeadingNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) HeadingNode.__proto__ = Node$$1;
-	HeadingNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	HeadingNode.prototype.constructor = HeadingNode;
-
-	var prototypeAccessors = { name: { configurable: true },defaultOptions: { configurable: true },levels: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'heading'
-	};
-
-	prototypeAccessors.defaultOptions.get = function () {
-		return {
-			maxLevel: 6,
-		}
-	};
-
-	prototypeAccessors.levels.get = function () {
-		return Array.from(new Array(this.options.maxLevel), function (value, index) { return index + 1; })
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				level: {
-					default: 1,
-				},
-			},
-			content: 'inline*',
-			group: 'block',
-			defining: true,
-			draggable: false,
-			parseDOM: this.levels.map(function (level) { return ({ tag: ("h" + level), attrs: { level: level } }); }),
-			toDOM: function (node) { return [("h" + (node.attrs.level)), 0]; },
-		}
-	};
-
-	HeadingNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-		var attrs = ref.attrs;
-
-		return toggleBlockType(type, schema.nodes.paragraph, attrs)
-	};
-
-	HeadingNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return this.levels.reduce(function (items, level) {
-			var obj;
-
-			return (Object.assign({}, items,
-			( obj = {}, obj[("Shift-Ctrl-" + level)] = commands_18(type, { level: level }), obj )));
-		}, {})
-	};
-
-	HeadingNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_12$2(
-				new RegExp(("^(#{1," + (this.options.maxLevel) + "})\\s$")),
-				type,
-				function (match) { return ({ level: match[1].length }); }
-			) ]
-	};
-
-	Object.defineProperties( HeadingNode.prototype, prototypeAccessors );
-
-	return HeadingNode;
-}(Node));
-
-var OrderedListNode = (function (Node$$1) {
-	function OrderedListNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) OrderedListNode.__proto__ = Node$$1;
-	OrderedListNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	OrderedListNode.prototype.constructor = OrderedListNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'list_item'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'paragraph block*',
-			group: 'block',
-			defining: true,
-			draggable: false,
-			parseDOM: [
-				{ tag: 'li' } ],
-			toDOM: function () { return ['li', 0]; },
-		}
-	};
-
-	OrderedListNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			Enter: schemaList_6(type),
-			Tab: schemaList_8(type),
-			'Shift-Tab': schemaList_7(type),
-		}
-	};
-
-	Object.defineProperties( OrderedListNode.prototype, prototypeAccessors );
-
-	return OrderedListNode;
-}(Node));
-
-var OrderedListNode$1 = (function (Node$$1) {
-	function OrderedListNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) OrderedListNode.__proto__ = Node$$1;
-	OrderedListNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	OrderedListNode.prototype.constructor = OrderedListNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'ordered_list'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				order: {
-					default: 1,
-				},
-			},
-			content: 'list_item+',
-			group: 'block',
-			parseDOM: [
-				{
-					tag: 'ol',
-					getAttrs: function (dom) { return ({
-						order: dom.hasAttribute('start') ? +dom.getAttribute('start') : 1,
-					}); },
-				} ],
-			toDOM: function (node) { return (node.attrs.order === 1 ? ['ol', 0] : ['ol', { start: node.attrs.order }, 0]); },
-		}
-	};
-
-	OrderedListNode.prototype.command = function command (ref) {
-		var type = ref.type;
-		var schema = ref.schema;
-
-		return toggleList$$1(type, schema.nodes.list_item)
-	};
-
-	OrderedListNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-9': schemaList_5(type),
-		}
-	};
-
-	OrderedListNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(
-				/^(\d+)\.\s$/,
-				type,
-				function (match) { return ({ order: +match[1] }); },
-				function (match, node) { return node.childCount + node.attrs.order === +match[1]; }
-			) ]
-	};
-
-	Object.defineProperties( OrderedListNode.prototype, prototypeAccessors );
-
-	return OrderedListNode;
-}(Node));
-
-var ParagraphNode = (function (Node$$1) {
-	function ParagraphNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) ParagraphNode.__proto__ = Node$$1;
-	ParagraphNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	ParagraphNode.prototype.constructor = ParagraphNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'paragraph'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			content: 'inline*',
-			group: 'block',
-			draggable: false,
-			parseDOM: [{
-				tag: 'p',
-			}],
-			toDOM: function () { return ['p', 0]; },
-		}
-	};
-
-	ParagraphNode.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_18(type)
-	};
-
-	ParagraphNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Shift-Ctrl-0': commands_18(type),
-		}
-	};
-
-	Object.defineProperties( ParagraphNode.prototype, prototypeAccessors );
-
-	return ParagraphNode;
-}(Node));
-
-var TextNode = (function (Node$$1) {
-	function TextNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) TextNode.__proto__ = Node$$1;
-	TextNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	TextNode.prototype.constructor = TextNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'text'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			group: 'inline',
-		}
-	};
-
-	Object.defineProperties( TextNode.prototype, prototypeAccessors );
-
-	return TextNode;
-}(Node));
-
-var BulletNode$1 = (function (Node$$1) {
-	function BulletNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) BulletNode.__proto__ = Node$$1;
-	BulletNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	BulletNode.prototype.constructor = BulletNode;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'todo_list'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			group: 'block',
-			content: 'todo_item+',
-			toDOM: function () { return ['ul', { 'data-type': 'todo_list' }, 0]; },
-			parseDOM: [{
-				priority: 51,
-				tag: '[data-type="todo_list"]',
-			}],
-		}
-	};
-
-	BulletNode.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return schemaList_5(type)
-	};
-
-	BulletNode.prototype.inputRules = function inputRules (ref) {
-		var type = ref.type;
-
-		return [
-			dist_11$2(/^\s*(\[ \])\s$/, type) ]
-	};
-
-	Object.defineProperties( BulletNode.prototype, prototypeAccessors );
-
-	return BulletNode;
-}(Node));
-
-var TodoItemNode = (function (Node$$1) {
-	function TodoItemNode () {
-		Node$$1.apply(this, arguments);
-	}
-
-	if ( Node$$1 ) TodoItemNode.__proto__ = Node$$1;
-	TodoItemNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-	TodoItemNode.prototype.constructor = TodoItemNode;
-
-	var prototypeAccessors = { name: { configurable: true },view: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'todo_item'
-	};
-
-	prototypeAccessors.view.get = function () {
-		return {
-			props: ['node', 'updateAttrs', 'editable'],
-			methods: {
-				onChange: function onChange() {
-					if (!this.editable) {
-						return
-					}
-					this.updateAttrs({
-						done: !this.node.attrs.done,
-					});
-				},
-			},
-			template: "\n\t\t\t\t<li data-type=\"todo_item\" :data-done=\"node.attrs.done.toString()\">\n\t\t\t\t\t<span class=\"todo-checkbox\" contenteditable=\"false\" @click=\"onChange\"></span>\n\t\t\t\t\t<div class=\"todo-content\" ref=\"content\" :contenteditable=\"editable.toString()\"></div>\n\t\t\t\t</li>\n\t\t\t",
-		}
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				done: {
-					default: false,
-				},
-			},
-			draggable: false,
-			content: 'paragraph',
-			toDOM: function toDOM(node) {
-				var ref = node.attrs;
-				var done = ref.done;
-
-				return ['li', {
-						'data-type': 'todo_item',
-						'data-done': done.toString(),
-					},
-					['span', { class: 'todo-checkbox', contenteditable: 'false' }],
-					['div', { class: 'todo-content' }, 0] ]
-			},
-			parseDOM: [{
-				priority: 51,
-				tag: '[data-type="todo_item"]',
-				getAttrs: function (dom) { return ({
-					done: dom.getAttribute('data-done') === 'true',
-				}); },
-			}],
-		}
-	};
-
-	TodoItemNode.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			Enter: schemaList_6(type),
-			'Shift-Tab': schemaList_7(type),
-		}
-	};
-
-	Object.defineProperties( TodoItemNode.prototype, prototypeAccessors );
-
-	return TodoItemNode;
-}(Node));
-
-var builtInNodes = [
-	// essentials
-	new DocNode(),
-	new ParagraphNode(),
-	new TextNode(),
-
-	new BlockquoteNode(),
-	new CodeBlockNode(),
-	new HeadingNode({ maxLevel: 3 }),
-	new HardBreakNode(),
-	new OrderedListNode$1(),
-	new BulletNode(),
-	new OrderedListNode(),
-	new BulletNode$1(),
-	new TodoItemNode() ];
-
-var CodeMark = (function (Mark$$1) {
-	function CodeMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) CodeMark.__proto__ = Mark$$1;
-	CodeMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	CodeMark.prototype.constructor = CodeMark;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'code'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			parseDOM: [
-				{ tag: 'code' } ],
-			toDOM: function () { return ['code', 0]; },
-		}
-	};
-
-	CodeMark.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Mod-`': commands_19(type),
-		}
-	};
-
-	CodeMark.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_19(type)
-	};
-
-	Object.defineProperties( CodeMark.prototype, prototypeAccessors );
-
-	return CodeMark;
-}(Mark));
-
-var ItalicMark = (function (Mark$$1) {
-	function ItalicMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) ItalicMark.__proto__ = Mark$$1;
-	ItalicMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	ItalicMark.prototype.constructor = ItalicMark;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'italic'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			parseDOM: [
-				{ tag: 'i' },
-				{ tag: 'em' },
-				{ style: 'font-style=italic' } ],
-			toDOM: function () { return ['em', 0]; },
-		}
-	};
-
-	ItalicMark.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Mod-i': commands_19(type),
-		}
-	};
-
-	ItalicMark.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_19(type)
-	};
-
-	Object.defineProperties( ItalicMark.prototype, prototypeAccessors );
-
-	return ItalicMark;
-}(Mark));
-
-var LinkMark = (function (Mark$$1) {
-	function LinkMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) LinkMark.__proto__ = Mark$$1;
-	LinkMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	LinkMark.prototype.constructor = LinkMark;
-
-	var prototypeAccessors = { name: { configurable: true },view: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'link'
-	};
-
-	prototypeAccessors.view.get = function () {
-		return {
-			props: ['node'],
-			methods: {
-				onClick: function onClick() {
-					console.log('click on link');
-				},
-			},
-			template: "\n\t\t\t\t<a :href=\"node.attrs.href\" rel=\"noopener noreferrer nofollow\" ref=\"content\" @click=\"onClick\"></a>\n\t\t\t",
-		}
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			attrs: {
-				href: {
-					default: null,
-				},
-			},
-			inclusive: false,
-			parseDOM: [
-				{
-					tag: 'a[href]',
-					getAttrs: function (dom) { return ({
-						href: dom.getAttribute('href'),
-					}); },
-				} ],
-			toDOM: function (node) { return ['a', Object.assign({}, node.attrs,
-				{rel: 'noopener noreferrer nofollow'}), 0]; },
-		}
-	};
-
-	LinkMark.prototype.command = function command (ref) {
-		var type = ref.type;
-		var attrs = ref.attrs;
-
-		if (attrs.href) {
-			return updateMark(type, attrs)
-		}
-
-		return removeMark(type)
-	};
-
-	Object.defineProperties( LinkMark.prototype, prototypeAccessors );
-
-	return LinkMark;
-}(Mark));
-
-var BoldMark = (function (Mark$$1) {
-	function BoldMark () {
-		Mark$$1.apply(this, arguments);
-	}
-
-	if ( Mark$$1 ) BoldMark.__proto__ = Mark$$1;
-	BoldMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-	BoldMark.prototype.constructor = BoldMark;
-
-	var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return 'bold'
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return {
-			parseDOM: [
-				{
-					tag: 'strong',
-				},
-				{
-					tag: 'b',
-					getAttrs: function (node) { return node.style.fontWeight != 'normal' && null; },
-				},
-				{
-					style: 'font-weight',
-					getAttrs: function (value) { return /^(bold(er)?|[5-9]\d{2,})$/.test(value) && null; },
-				} ],
-			toDOM: function () { return ['strong', 0]; },
-		}
-	};
-
-	BoldMark.prototype.keys = function keys (ref) {
-		var type = ref.type;
-
-		return {
-			'Mod-b': commands_19(type),
-		}
-	};
-
-	BoldMark.prototype.command = function command (ref) {
-		var type = ref.type;
-
-		return commands_19(type)
-	};
-
-	Object.defineProperties( BoldMark.prototype, prototypeAccessors );
-
-	return BoldMark;
-}(Mark));
-
-var builtInMarks = [
-	new CodeMark(),
-	new ItalicMark(),
-	new LinkMark(),
-	new BoldMark() ];
-
-var editor = {
-
-	props: {
-		doc: {
-			type: Object,
-			required: false,
-			default: null,
-		},
-		extensions: {
-			type: Array,
-			required: false,
-			default: function () { return []; },
-		},
-		editable: {
-			type: Boolean,
-			default: true,
-		},
-	},
-
-	data: function data() {
-		var plugins = new PluginManager(builtInNodes.concat( builtInMarks,
-			this.extensions ));
-		var nodes = plugins.nodes;
-		var marks = plugins.marks;
-		var views = plugins.views;
-
-		return {
-			state: null,
-			view: null,
-			pluginplugins: [],
-			plugins: plugins,
-			schema: null,
-			nodes: nodes,
-			marks: marks,
-			views: views,
-			keymaps: [],
-			commands: {},
-			menuActions: null,
-		}
-	},
-
-	render: function render(createElement) {
-		var this$1 = this;
-
-		var slots = [];
-
-		Object
-			.entries(this.$scopedSlots)
-			.forEach(function (ref) {
-				var name = ref[0];
-				var slot = ref[1];
-
-				if (name === 'content') {
-					this$1.contentNode = slot({});
-					slots.push(this$1.contentNode);
-				} else if (name === 'menubar') {
-					this$1.menubarNode = slot({
-						nodes: this$1.menuActions ? this$1.menuActions.nodes : null,
-						marks: this$1.menuActions ? this$1.menuActions.marks : null,
-						focused: this$1.view ? this$1.view.focused : false,
-						focus: function () { return this$1.view.focus(); },
-					});
-					slots.push(this$1.menubarNode);
-				} else if (name === 'menububble') {
-					this$1.menububbleNode = slot({
-						nodes: this$1.menuActions ? this$1.menuActions.nodes : null,
-						marks: this$1.menuActions ? this$1.menuActions.marks : null,
-						focused: this$1.view ? this$1.view.focused : false,
-						focus: function () { return this$1.view.focus(); },
-					});
-					slots.push(this$1.menububbleNode);
-				}
-			});
-
-		return createElement('div', {
-			class: 'vue-editor',
-		}, slots)
-	},
-
-	methods: {
-		initEditor: function initEditor() {
-			this.schema = this.createSchema();
-			this.pluginplugins = this.createPlugins();
-			this.keymaps = this.createKeymaps();
-			this.inputRules = this.createInputRules();
-			this.state = this.createState();
-			this.clearSlot();
-			this.view = this.createView();
-			this.commands = this.createCommands();
-			this.updateMenuActions();
-		},
-
-		createSchema: function createSchema() {
-			return new dist_8({
-				nodes: this.nodes,
-				marks: this.marks,
-			})
-		},
-
-		createPlugins: function createPlugins() {
-			return this.plugins.pluginplugins
-		},
-
-		createKeymaps: function createKeymaps() {
-			return this.plugins.keymaps({
-				schema: this.schema,
-			})
-		},
-
-		createInputRules: function createInputRules() {
-			return this.plugins.inputRules({
-				schema: this.schema,
-			})
-		},
-
-		createCommands: function createCommands() {
-			return this.plugins.commands({
-				schema: this.schema,
-				view: this.view,
-			})
-		},
-
-		createState: function createState() {
-			return dist_7$2.create({
-				schema: this.schema,
-				doc: this.getDocument(),
-				plugins: this.pluginplugins.concat( this.getPlugins() ),
-			})
-		},
-
-		getDocument: function getDocument() {
-			if (this.doc) {
-				return this.schema.nodeFromJSON(this.doc)
-			}
-
-			return dist_12.fromSchema(this.schema).parse(this.contentNode.elm)
-		},
-
-		clearSlot: function clearSlot() {
-			this.contentNode.elm.innerHTML = '';
-		},
-
-		getPlugins: function getPlugins() {
-			var this$1 = this;
-
-			var plugins = [
-				dist_2$5({
-					rules: this.inputRules,
-				}) ].concat( this.keymaps,
-				[keymap_2(keymap$$1)],
-				[keymap_2(commands_24)],
-				[dropcursor_1()],
-				[dist_1$4()],
-				[history_4()],
-				[new dist_8$2({
-					props: {
-						editable: function () { return this$1.editable; },
-					},
-				})] );
-
-			if (this.menububbleNode) {
-				plugins.push(menuBubble(this.menububbleNode));
-			}
-
-			return plugins
-		},
-
-		createView: function createView() {
-			return new dist_1$3(this.contentNode.elm, {
-				state: this.state,
-				dispatchTransaction: this.dispatchTransaction,
-				nodeViews: initNodeViews$$1({
-					nodes: this.views,
-					editable: this.editable,
-				}),
-			})
-		},
-
-		updateMenuActions: function updateMenuActions() {
-			this.menuActions = buildMenuActions({
-				schema: this.schema,
-				state: this.view.state,
-				commands: this.commands,
-			});
-		},
-
-		dispatchTransaction: function dispatchTransaction(transaction) {
-			this.state = this.state.apply(transaction);
-			this.view.updateState(this.state);
-			this.$emit('update', this.state);
-			this.updateMenuActions();
-		},
-	},
-
-	mounted: function mounted() {
-		this.initEditor();
-	},
-
-};
-
-export { editor as Editor };
diff --git a/packages/tiptap/dist/tiptap.js b/packages/tiptap/dist/tiptap.js
deleted file mode 100644
index 2b205b7c..00000000
--- a/packages/tiptap/dist/tiptap.js
+++ /dev/null
@@ -1,18817 +0,0 @@
-
-	/*!
-  * tiptap vundefined
-  * (c) 2018 Scrumpy UG (limited liability)
-  * @license MIT
-  */
-
-(function (global, factory) {
-	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('vue')) :
-	typeof define === 'function' && define.amd ? define(['exports', 'vue'], factory) :
-	(factory((global.tiptap = {}),global.Vue));
-}(this, (function (exports,Vue) { 'use strict';
-
-	Vue = Vue && Vue.hasOwnProperty('default') ? Vue['default'] : Vue;
-
-	function unwrapExports (x) {
-		return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-	}
-
-	function createCommonjsModule(fn, module) {
-		return module = { exports: {} }, fn(module, module.exports), module.exports;
-	}
-
-	// ::- Persistent data structure representing an ordered mapping from
-	// strings to values, with some convenient update methods.
-	function OrderedMap(content) {
-	  this.content = content;
-	}
-
-	OrderedMap.prototype = {
-	  constructor: OrderedMap,
-
-	  find: function(key) {
-	    var this$1 = this;
-
-	    for (var i = 0; i < this.content.length; i += 2)
-	      { if (this$1.content[i] === key) { return i } }
-	    return -1
-	  },
-
-	  // :: (string) → ?any
-	  // Retrieve the value stored under `key`, or return undefined when
-	  // no such key exists.
-	  get: function(key) {
-	    var found = this.find(key);
-	    return found == -1 ? undefined : this.content[found + 1]
-	  },
-
-	  // :: (string, any, ?string) → OrderedMap
-	  // Create a new map by replacing the value of `key` with a new
-	  // value, or adding a binding to the end of the map. If `newKey` is
-	  // given, the key of the binding will be replaced with that key.
-	  update: function(key, value, newKey) {
-	    var self = newKey && newKey != key ? this.remove(newKey) : this;
-	    var found = self.find(key), content = self.content.slice();
-	    if (found == -1) {
-	      content.push(newKey || key, value);
-	    } else {
-	      content[found + 1] = value;
-	      if (newKey) { content[found] = newKey; }
-	    }
-	    return new OrderedMap(content)
-	  },
-
-	  // :: (string) → OrderedMap
-	  // Return a map with the given key removed, if it existed.
-	  remove: function(key) {
-	    var found = this.find(key);
-	    if (found == -1) { return this }
-	    var content = this.content.slice();
-	    content.splice(found, 2);
-	    return new OrderedMap(content)
-	  },
-
-	  // :: (string, any) → OrderedMap
-	  // Add a new key to the start of the map.
-	  addToStart: function(key, value) {
-	    return new OrderedMap([key, value].concat(this.remove(key).content))
-	  },
-
-	  // :: (string, any) → OrderedMap
-	  // Add a new key to the end of the map.
-	  addToEnd: function(key, value) {
-	    var content = this.remove(key).content.slice();
-	    content.push(key, value);
-	    return new OrderedMap(content)
-	  },
-
-	  // :: (string, string, any) → OrderedMap
-	  // Add a key after the given key. If `place` is not found, the new
-	  // key is added to the end.
-	  addBefore: function(place, key, value) {
-	    var without = this.remove(key), content = without.content.slice();
-	    var found = without.find(place);
-	    content.splice(found == -1 ? content.length : found, 0, key, value);
-	    return new OrderedMap(content)
-	  },
-
-	  // :: ((key: string, value: any))
-	  // Call the given function for each key/value pair in the map, in
-	  // order.
-	  forEach: function(f) {
-	    var this$1 = this;
-
-	    for (var i = 0; i < this.content.length; i += 2)
-	      { f(this$1.content[i], this$1.content[i + 1]); }
-	  },
-
-	  // :: (union<Object, OrderedMap>) → OrderedMap
-	  // Create a new map by prepending the keys in this map that don't
-	  // appear in `map` before the keys in `map`.
-	  prepend: function(map) {
-	    map = OrderedMap.from(map);
-	    if (!map.size) { return this }
-	    return new OrderedMap(map.content.concat(this.subtract(map).content))
-	  },
-
-	  // :: (union<Object, OrderedMap>) → OrderedMap
-	  // Create a new map by appending the keys in this map that don't
-	  // appear in `map` after the keys in `map`.
-	  append: function(map) {
-	    map = OrderedMap.from(map);
-	    if (!map.size) { return this }
-	    return new OrderedMap(this.subtract(map).content.concat(map.content))
-	  },
-
-	  // :: (union<Object, OrderedMap>) → OrderedMap
-	  // Create a map containing all the keys in this map that don't
-	  // appear in `map`.
-	  subtract: function(map) {
-	    var result = this;
-	    map = OrderedMap.from(map);
-	    for (var i = 0; i < map.content.length; i += 2)
-	      { result = result.remove(map.content[i]); }
-	    return result
-	  },
-
-	  // :: number
-	  // The amount of keys in this map.
-	  get size() {
-	    return this.content.length >> 1
-	  }
-	};
-
-	// :: (?union<Object, OrderedMap>) → OrderedMap
-	// Return a map with the given content. If null, create an empty
-	// map. If given an ordered map, return that map itself. If given an
-	// object, create a map from the object's properties.
-	OrderedMap.from = function(value) {
-	  if (value instanceof OrderedMap) { return value }
-	  var content = [];
-	  if (value) { for (var prop in value) { content.push(prop, value[prop]); } }
-	  return new OrderedMap(content)
-	};
-
-	var orderedmap = OrderedMap;
-
-	var dist = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-	function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-	var OrderedMap = _interopDefault(orderedmap);
-
-	function findDiffStart(a, b, pos) {
-	  for (var i = 0;; i++) {
-	    if (i == a.childCount || i == b.childCount)
-	      { return a.childCount == b.childCount ? null : pos }
-
-	    var childA = a.child(i), childB = b.child(i);
-	    if (childA == childB) { pos += childA.nodeSize; continue }
-
-	    if (!childA.sameMarkup(childB)) { return pos }
-
-	    if (childA.isText && childA.text != childB.text) {
-	      for (var j = 0; childA.text[j] == childB.text[j]; j++)
-	        { pos++; }
-	      return pos
-	    }
-	    if (childA.content.size || childB.content.size) {
-	      var inner = findDiffStart(childA.content, childB.content, pos + 1);
-	      if (inner != null) { return inner }
-	    }
-	    pos += childA.nodeSize;
-	  }
-	}
-
-	function findDiffEnd(a, b, posA, posB) {
-	  for (var iA = a.childCount, iB = b.childCount;;) {
-	    if (iA == 0 || iB == 0)
-	      { return iA == iB ? null : {a: posA, b: posB} }
-
-	    var childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;
-	    if (childA == childB) {
-	      posA -= size; posB -= size;
-	      continue
-	    }
-
-	    if (!childA.sameMarkup(childB)) { return {a: posA, b: posB} }
-
-	    if (childA.isText && childA.text != childB.text) {
-	      var same = 0, minSize = Math.min(childA.text.length, childB.text.length);
-	      while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {
-	        same++; posA--; posB--;
-	      }
-	      return {a: posA, b: posB}
-	    }
-	    if (childA.content.size || childB.content.size) {
-	      var inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);
-	      if (inner) { return inner }
-	    }
-	    posA -= size; posB -= size;
-	  }
-	}
-
-	// ::- A fragment represents a node's collection of child nodes.
-	//
-	// Like nodes, fragments are persistent data structures, and you
-	// should not mutate them or their content. Rather, you create new
-	// instances whenever needed. The API tries to make this easy.
-	var Fragment = function Fragment(content, size) {
-	  var this$1 = this;
-
-	  this.content = content;
-	  // :: number
-	  // The size of the fragment, which is the total of the size of its
-	  // content nodes.
-	  this.size = size || 0;
-	  if (size == null) { for (var i = 0; i < content.length; i++)
-	    { this$1.size += content[i].nodeSize; } }
-	};
-
-	var prototypeAccessors$1 = { firstChild: {},lastChild: {},childCount: {} };
-
-	// :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)
-	// Invoke a callback for all descendant nodes between the given two
-	// positions (relative to start of this fragment). Doesn't descend
-	// into a node when the callback returns `false`.
-	Fragment.prototype.nodesBetween = function nodesBetween (from, to, f, nodeStart, parent) {
-	    var this$1 = this;
-	    if ( nodeStart === void 0 ) { nodeStart = 0; }
-
-	  for (var i = 0, pos = 0; pos < to; i++) {
-	    var child = this$1.content[i], end = pos + child.nodeSize;
-	    if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {
-	      var start = pos + 1;
-	      child.nodesBetween(Math.max(0, from - start),
-	                         Math.min(child.content.size, to - start),
-	                         f, nodeStart + start);
-	    }
-	    pos = end;
-	  }
-	};
-
-	// :: ((node: Node, pos: number, parent: Node) → ?bool)
-	// Call the given callback for every descendant node. The callback
-	// may return `false` to prevent traversal of a given node's children.
-	Fragment.prototype.descendants = function descendants (f) {
-	  this.nodesBetween(0, this.size, f);
-	};
-
-	// : (number, number, ?string, ?string) → string
-	Fragment.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
-	  var text = "", separated = true;
-	  this.nodesBetween(from, to, function (node, pos) {
-	    if (node.isText) {
-	      text += node.text.slice(Math.max(from, pos) - pos, to - pos);
-	      separated = !blockSeparator;
-	    } else if (node.isLeaf && leafText) {
-	      text += leafText;
-	      separated = !blockSeparator;
-	    } else if (!separated && node.isBlock) {
-	      text += blockSeparator;
-	      separated = true;
-	    }
-	  }, 0);
-	  return text
-	};
-
-	// :: (Fragment) → Fragment
-	// Create a new fragment containing the combined content of this
-	// fragment and the other.
-	Fragment.prototype.append = function append (other) {
-	  if (!other.size) { return this }
-	  if (!this.size) { return other }
-	  var last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;
-	  if (last.isText && last.sameMarkup(first)) {
-	    content[content.length - 1] = last.withText(last.text + first.text);
-	    i = 1;
-	  }
-	  for (; i < other.content.length; i++) { content.push(other.content[i]); }
-	  return new Fragment(content, this.size + other.size)
-	};
-
-	// :: (number, ?number) → Fragment
-	// Cut out the sub-fragment between the two given positions.
-	Fragment.prototype.cut = function cut (from, to) {
-	    var this$1 = this;
-
-	  if (to == null) { to = this.size; }
-	  if (from == 0 && to == this.size) { return this }
-	  var result = [], size = 0;
-	  if (to > from) { for (var i = 0, pos = 0; pos < to; i++) {
-	    var child = this$1.content[i], end = pos + child.nodeSize;
-	    if (end > from) {
-	      if (pos < from || end > to) {
-	        if (child.isText)
-	          { child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos)); }
-	        else
-	          { child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1)); }
-	      }
-	      result.push(child);
-	      size += child.nodeSize;
-	    }
-	    pos = end;
-	  } }
-	  return new Fragment(result, size)
-	};
-
-	Fragment.prototype.cutByIndex = function cutByIndex (from, to) {
-	  if (from == to) { return Fragment.empty }
-	  if (from == 0 && to == this.content.length) { return this }
-	  return new Fragment(this.content.slice(from, to))
-	};
-
-	// :: (number, Node) → Fragment
-	// Create a new fragment in which the node at the given index is
-	// replaced by the given node.
-	Fragment.prototype.replaceChild = function replaceChild (index, node) {
-	  var current = this.content[index];
-	  if (current == node) { return this }
-	  var copy = this.content.slice();
-	  var size = this.size + node.nodeSize - current.nodeSize;
-	  copy[index] = node;
-	  return new Fragment(copy, size)
-	};
-
-	// : (Node) → Fragment
-	// Create a new fragment by prepending the given node to this
-	// fragment.
-	Fragment.prototype.addToStart = function addToStart (node) {
-	  return new Fragment([node].concat(this.content), this.size + node.nodeSize)
-	};
-
-	// : (Node) → Fragment
-	// Create a new fragment by appending the given node to this
-	// fragment.
-	Fragment.prototype.addToEnd = function addToEnd (node) {
-	  return new Fragment(this.content.concat(node), this.size + node.nodeSize)
-	};
-
-	// :: (Fragment) → bool
-	// Compare this fragment to another one.
-	Fragment.prototype.eq = function eq (other) {
-	    var this$1 = this;
-
-	  if (this.content.length != other.content.length) { return false }
-	  for (var i = 0; i < this.content.length; i++)
-	    { if (!this$1.content[i].eq(other.content[i])) { return false } }
-	  return true
-	};
-
-	// :: ?Node
-	// The first child of the fragment, or `null` if it is empty.
-	prototypeAccessors$1.firstChild.get = function () { return this.content.length ? this.content[0] : null };
-
-	// :: ?Node
-	// The last child of the fragment, or `null` if it is empty.
-	prototypeAccessors$1.lastChild.get = function () { return this.content.length ? this.content[this.content.length - 1] : null };
-
-	// :: number
-	// The number of child nodes in this fragment.
-	prototypeAccessors$1.childCount.get = function () { return this.content.length };
-
-	// :: (number) → Node
-	// Get the child node at the given index. Raise an error when the
-	// index is out of range.
-	Fragment.prototype.child = function child (index) {
-	  var found = this.content[index];
-	  if (!found) { throw new RangeError("Index " + index + " out of range for " + this) }
-	  return found
-	};
-
-	// :: (number) → ?Node
-	// Get the child node at the given index, if it exists.
-	Fragment.prototype.maybeChild = function maybeChild (index) {
-	  return this.content[index]
-	};
-
-	// :: ((node: Node, offset: number, index: number))
-	// Call `f` for every child node, passing the node, its offset
-	// into this parent node, and its index.
-	Fragment.prototype.forEach = function forEach (f) {
-	    var this$1 = this;
-
-	  for (var i = 0, p = 0; i < this.content.length; i++) {
-	    var child = this$1.content[i];
-	    f(child, p, i);
-	    p += child.nodeSize;
-	  }
-	};
-
-	// :: (Fragment) → ?number
-	// Find the first position at which this fragment and another
-	// fragment differ, or `null` if they are the same.
-	Fragment.prototype.findDiffStart = function findDiffStart$1 (other, pos) {
-	    if ( pos === void 0 ) { pos = 0; }
-
-	  return findDiffStart(this, other, pos)
-	};
-
-	// :: (Fragment) → ?{a: number, b: number}
-	// Find the first position, searching from the end, at which this
-	// fragment and the given fragment differ, or `null` if they are the
-	// same. Since this position will not be the same in both nodes, an
-	// object with two separate positions is returned.
-	Fragment.prototype.findDiffEnd = function findDiffEnd$1 (other, pos, otherPos) {
-	    if ( pos === void 0 ) { pos = this.size; }
-	    if ( otherPos === void 0 ) { otherPos = other.size; }
-
-	  return findDiffEnd(this, other, pos, otherPos)
-	};
-
-	// : (number, ?number) → {index: number, offset: number}
-	// Find the index and inner offset corresponding to a given relative
-	// position in this fragment. The result object will be reused
-	// (overwritten) the next time the function is called. (Not public.)
-	Fragment.prototype.findIndex = function findIndex (pos, round) {
-	    var this$1 = this;
-	    if ( round === void 0 ) { round = -1; }
-
-	  if (pos == 0) { return retIndex(0, pos) }
-	  if (pos == this.size) { return retIndex(this.content.length, pos) }
-	  if (pos > this.size || pos < 0) { throw new RangeError(("Position " + pos + " outside of fragment (" + (this) + ")")) }
-	  for (var i = 0, curPos = 0;; i++) {
-	    var cur = this$1.child(i), end = curPos + cur.nodeSize;
-	    if (end >= pos) {
-	      if (end == pos || round > 0) { return retIndex(i + 1, end) }
-	      return retIndex(i, curPos)
-	    }
-	    curPos = end;
-	  }
-	};
-
-	// :: () → string
-	// Return a debugging string that describes this fragment.
-	Fragment.prototype.toString = function toString () { return "<" + this.toStringInner() + ">" };
-
-	Fragment.prototype.toStringInner = function toStringInner () { return this.content.join(", ") };
-
-	// :: () → ?Object
-	// Create a JSON-serializeable representation of this fragment.
-	Fragment.prototype.toJSON = function toJSON () {
-	  return this.content.length ? this.content.map(function (n) { return n.toJSON(); }) : null
-	};
-
-	// :: (Schema, ?Object) → Fragment
-	// Deserialize a fragment from its JSON representation.
-	Fragment.fromJSON = function fromJSON (schema, value) {
-	  if (!value) { return Fragment.empty }
-	  if (!Array.isArray(value)) { throw new RangeError("Invalid input for Fragment.fromJSON") }
-	  return new Fragment(value.map(schema.nodeFromJSON))
-	};
-
-	// :: ([Node]) → Fragment
-	// Build a fragment from an array of nodes. Ensures that adjacent
-	// text nodes with the same marks are joined together.
-	Fragment.fromArray = function fromArray (array) {
-	  if (!array.length) { return Fragment.empty }
-	  var joined, size = 0;
-	  for (var i = 0; i < array.length; i++) {
-	    var node = array[i];
-	    size += node.nodeSize;
-	    if (i && node.isText && array[i - 1].sameMarkup(node)) {
-	      if (!joined) { joined = array.slice(0, i); }
-	      joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text);
-	    } else if (joined) {
-	      joined.push(node);
-	    }
-	  }
-	  return new Fragment(joined || array, size)
-	};
-
-	// :: (?union<Fragment, Node, [Node]>) → Fragment
-	// Create a fragment from something that can be interpreted as a set
-	// of nodes. For `null`, it returns the empty fragment. For a
-	// fragment, the fragment itself. For a node or array of nodes, a
-	// fragment containing those nodes.
-	Fragment.from = function from (nodes) {
-	  if (!nodes) { return Fragment.empty }
-	  if (nodes instanceof Fragment) { return nodes }
-	  if (Array.isArray(nodes)) { return this.fromArray(nodes) }
-	  return new Fragment([nodes], nodes.nodeSize)
-	};
-
-	Object.defineProperties( Fragment.prototype, prototypeAccessors$1 );
-
-	var found = {index: 0, offset: 0};
-	function retIndex(index, offset) {
-	  found.index = index;
-	  found.offset = offset;
-	  return found
-	}
-
-	// :: Fragment
-	// An empty fragment. Intended to be reused whenever a node doesn't
-	// contain anything (rather than allocating a new empty fragment for
-	// each leaf node).
-	Fragment.empty = new Fragment([], 0);
-
-	function compareDeep(a, b) {
-	  if (a === b) { return true }
-	  if (!(a && typeof a == "object") ||
-	      !(b && typeof b == "object")) { return false }
-	  var array = Array.isArray(a);
-	  if (Array.isArray(b) != array) { return false }
-	  if (array) {
-	    if (a.length != b.length) { return false }
-	    for (var i = 0; i < a.length; i++) { if (!compareDeep(a[i], b[i])) { return false } }
-	  } else {
-	    for (var p in a) { if (!(p in b) || !compareDeep(a[p], b[p])) { return false } }
-	    for (var p$1 in b) { if (!(p$1 in a)) { return false } }
-	  }
-	  return true
-	}
-
-	// ::- A mark is a piece of information that can be attached to a node,
-	// such as it being emphasized, in code font, or a link. It has a type
-	// and optionally a set of attributes that provide further information
-	// (such as the target of the link). Marks are created through a
-	// `Schema`, which controls which types exist and which
-	// attributes they have.
-	var Mark = function Mark(type, attrs) {
-	  // :: MarkType
-	  // The type of this mark.
-	  this.type = type;
-	  // :: Object
-	  // The attributes associated with this mark.
-	  this.attrs = attrs;
-	};
-
-	// :: ([Mark]) → [Mark]
-	// Given a set of marks, create a new set which contains this one as
-	// well, in the right position. If this mark is already in the set,
-	// the set itself is returned. If any marks that are set to be
-	// [exclusive](#model.MarkSpec.excludes) with this mark are present,
-	// those are replaced by this one.
-	Mark.prototype.addToSet = function addToSet (set) {
-	    var this$1 = this;
-
-	  var copy, placed = false;
-	  for (var i = 0; i < set.length; i++) {
-	    var other = set[i];
-	    if (this$1.eq(other)) { return set }
-	    if (this$1.type.excludes(other.type)) {
-	      if (!copy) { copy = set.slice(0, i); }
-	    } else if (other.type.excludes(this$1.type)) {
-	      return set
-	    } else {
-	      if (!placed && other.type.rank > this$1.type.rank) {
-	        if (!copy) { copy = set.slice(0, i); }
-	        copy.push(this$1);
-	        placed = true;
-	      }
-	      if (copy) { copy.push(other); }
-	    }
-	  }
-	  if (!copy) { copy = set.slice(); }
-	  if (!placed) { copy.push(this); }
-	  return copy
-	};
-
-	// :: ([Mark]) → [Mark]
-	// Remove this mark from the given set, returning a new set. If this
-	// mark is not in the set, the set itself is returned.
-	Mark.prototype.removeFromSet = function removeFromSet (set) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < set.length; i++)
-	    { if (this$1.eq(set[i]))
-	      { return set.slice(0, i).concat(set.slice(i + 1)) } }
-	  return set
-	};
-
-	// :: ([Mark]) → bool
-	// Test whether this mark is in the given set of marks.
-	Mark.prototype.isInSet = function isInSet (set) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < set.length; i++)
-	    { if (this$1.eq(set[i])) { return true } }
-	  return false
-	};
-
-	// :: (Mark) → bool
-	// Test whether this mark has the same type and attributes as
-	// another mark.
-	Mark.prototype.eq = function eq (other) {
-	  return this == other ||
-	    (this.type == other.type && compareDeep(this.attrs, other.attrs))
-	};
-
-	// :: () → Object
-	// Convert this mark to a JSON-serializeable representation.
-	Mark.prototype.toJSON = function toJSON () {
-	    var this$1 = this;
-
-	  var obj = {type: this.type.name};
-	  for (var _ in this$1.attrs) {
-	    obj.attrs = this$1.attrs;
-	    break
-	  }
-	  return obj
-	};
-
-	// :: (Schema, Object) → Mark
-	Mark.fromJSON = function fromJSON (schema, json) {
-	  if (!json) { throw new RangeError("Invalid input for Mark.fromJSON") }
-	  var type = schema.marks[json.type];
-	  if (!type) { throw new RangeError(("There is no mark type " + (json.type) + " in this schema")) }
-	  return type.create(json.attrs)
-	};
-
-	// :: ([Mark], [Mark]) → bool
-	// Test whether two sets of marks are identical.
-	Mark.sameSet = function sameSet (a, b) {
-	  if (a == b) { return true }
-	  if (a.length != b.length) { return false }
-	  for (var i = 0; i < a.length; i++)
-	    { if (!a[i].eq(b[i])) { return false } }
-	  return true
-	};
-
-	// :: (?union<Mark, [Mark]>) → [Mark]
-	// Create a properly sorted mark set from null, a single mark, or an
-	// unsorted array of marks.
-	Mark.setFrom = function setFrom (marks) {
-	  if (!marks || marks.length == 0) { return Mark.none }
-	  if (marks instanceof Mark) { return [marks] }
-	  var copy = marks.slice();
-	  copy.sort(function (a, b) { return a.type.rank - b.type.rank; });
-	  return copy
-	};
-
-	// :: [Mark] The empty set of marks.
-	Mark.none = [];
-
-	// ReplaceError:: class extends Error
-	// Error type raised by [`Node.replace`](#model.Node.replace) when
-	// given an invalid replacement.
-
-	function ReplaceError(message) {
-	  var err = Error.call(this, message);
-	  err.__proto__ = ReplaceError.prototype;
-	  return err
-	}
-
-	ReplaceError.prototype = Object.create(Error.prototype);
-	ReplaceError.prototype.constructor = ReplaceError;
-	ReplaceError.prototype.name = "ReplaceError";
-
-	// ::- A slice represents a piece cut out of a larger document. It
-	// stores not only a fragment, but also the depth up to which nodes on
-	// both side are ‘open’ (cut through).
-	var Slice = function Slice(content, openStart, openEnd) {
-	  // :: Fragment The slice's content.
-	  this.content = content;
-	  // :: number The open depth at the start.
-	  this.openStart = openStart;
-	  // :: number The open depth at the end.
-	  this.openEnd = openEnd;
-	};
-
-	var prototypeAccessors$2 = { size: {} };
-
-	// :: number
-	// The size this slice would add when inserted into a document.
-	prototypeAccessors$2.size.get = function () {
-	  return this.content.size - this.openStart - this.openEnd
-	};
-
-	Slice.prototype.insertAt = function insertAt (pos, fragment) {
-	  var content = insertInto(this.content, pos + this.openStart, fragment, null);
-	  return content && new Slice(content, this.openStart, this.openEnd)
-	};
-
-	Slice.prototype.removeBetween = function removeBetween (from, to) {
-	  return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)
-	};
-
-	// :: (Slice) → bool
-	// Tests whether this slice is equal to another slice.
-	Slice.prototype.eq = function eq (other) {
-	  return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd
-	};
-
-	Slice.prototype.toString = function toString () {
-	  return this.content + "(" + this.openStart + "," + this.openEnd + ")"
-	};
-
-	// :: () → ?Object
-	// Convert a slice to a JSON-serializable representation.
-	Slice.prototype.toJSON = function toJSON () {
-	  if (!this.content.size) { return null }
-	  var json = {content: this.content.toJSON()};
-	  if (this.openStart > 0) { json.openStart = this.openStart; }
-	  if (this.openEnd > 0) { json.openEnd = this.openEnd; }
-	  return json
-	};
-
-	// :: (Schema, ?Object) → Slice
-	// Deserialize a slice from its JSON representation.
-	Slice.fromJSON = function fromJSON (schema, json) {
-	  if (!json) { return Slice.empty }
-	  var openStart = json.openStart || 0, openEnd = json.openEnd || 0;
-	  if (typeof openStart != "number" || typeof openEnd != "number")
-	    { throw new RangeError("Invalid input for Slice.fromJSON") }
-	  return new Slice(Fragment.fromJSON(schema, json.content), json.openStart || 0, json.openEnd || 0)
-	};
-
-	// :: (Fragment, ?bool) → Slice
-	// Create a slice from a fragment by taking the maximum possible
-	// open value on both side of the fragment.
-	Slice.maxOpen = function maxOpen (fragment, openIsolating) {
-	    if ( openIsolating === void 0 ) { openIsolating=true; }
-
-	  var openStart = 0, openEnd = 0;
-	  for (var n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) { openStart++; }
-	  for (var n$1 = fragment.lastChild; n$1 && !n$1.isLeaf && (openIsolating || !n$1.type.spec.isolating); n$1 = n$1.lastChild) { openEnd++; }
-	  return new Slice(fragment, openStart, openEnd)
-	};
-
-	Object.defineProperties( Slice.prototype, prototypeAccessors$2 );
-
-	function removeRange(content, from, to) {
-	  var ref = content.findIndex(from);
-	  var index = ref.index;
-	  var offset = ref.offset;
-	  var child = content.maybeChild(index);
-	  var ref$1 = content.findIndex(to);
-	  var indexTo = ref$1.index;
-	  var offsetTo = ref$1.offset;
-	  if (offset == from || child.isText) {
-	    if (offsetTo != to && !content.child(indexTo).isText) { throw new RangeError("Removing non-flat range") }
-	    return content.cut(0, from).append(content.cut(to))
-	  }
-	  if (index != indexTo) { throw new RangeError("Removing non-flat range") }
-	  return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))
-	}
-
-	function insertInto(content, dist, insert, parent) {
-	  var ref = content.findIndex(dist);
-	  var index = ref.index;
-	  var offset = ref.offset;
-	  var child = content.maybeChild(index);
-	  if (offset == dist || child.isText) {
-	    if (parent && !parent.canReplace(index, index, insert)) { return null }
-	    return content.cut(0, dist).append(insert).append(content.cut(dist))
-	  }
-	  var inner = insertInto(child.content, dist - offset - 1, insert);
-	  return inner && content.replaceChild(index, child.copy(inner))
-	}
-
-	// :: Slice
-	// The empty slice.
-	Slice.empty = new Slice(Fragment.empty, 0, 0);
-
-	function replace($from, $to, slice) {
-	  if (slice.openStart > $from.depth)
-	    { throw new ReplaceError("Inserted content deeper than insertion position") }
-	  if ($from.depth - slice.openStart != $to.depth - slice.openEnd)
-	    { throw new ReplaceError("Inconsistent open depths") }
-	  return replaceOuter($from, $to, slice, 0)
-	}
-
-	function replaceOuter($from, $to, slice, depth) {
-	  var index = $from.index(depth), node = $from.node(depth);
-	  if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {
-	    var inner = replaceOuter($from, $to, slice, depth + 1);
-	    return node.copy(node.content.replaceChild(index, inner))
-	  } else if (!slice.content.size) {
-	    return close(node, replaceTwoWay($from, $to, depth))
-	  } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case
-	    var parent = $from.parent, content = parent.content;
-	    return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))
-	  } else {
-	    var ref = prepareSliceForReplace(slice, $from);
-	    var start = ref.start;
-	    var end = ref.end;
-	    return close(node, replaceThreeWay($from, start, end, $to, depth))
-	  }
-	}
-
-	function checkJoin(main, sub) {
-	  if (!sub.type.compatibleContent(main.type))
-	    { throw new ReplaceError("Cannot join " + sub.type.name + " onto " + main.type.name) }
-	}
-
-	function joinable($before, $after, depth) {
-	  var node = $before.node(depth);
-	  checkJoin(node, $after.node(depth));
-	  return node
-	}
-
-	function addNode(child, target) {
-	  var last = target.length - 1;
-	  if (last >= 0 && child.isText && child.sameMarkup(target[last]))
-	    { target[last] = child.withText(target[last].text + child.text); }
-	  else
-	    { target.push(child); }
-	}
-
-	function addRange($start, $end, depth, target) {
-	  var node = ($end || $start).node(depth);
-	  var startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;
-	  if ($start) {
-	    startIndex = $start.index(depth);
-	    if ($start.depth > depth) {
-	      startIndex++;
-	    } else if ($start.textOffset) {
-	      addNode($start.nodeAfter, target);
-	      startIndex++;
-	    }
-	  }
-	  for (var i = startIndex; i < endIndex; i++) { addNode(node.child(i), target); }
-	  if ($end && $end.depth == depth && $end.textOffset)
-	    { addNode($end.nodeBefore, target); }
-	}
-
-	function close(node, content) {
-	  if (!node.type.validContent(content))
-	    { throw new ReplaceError("Invalid content for node " + node.type.name) }
-	  return node.copy(content)
-	}
-
-	function replaceThreeWay($from, $start, $end, $to, depth) {
-	  var openStart = $from.depth > depth && joinable($from, $start, depth + 1);
-	  var openEnd = $to.depth > depth && joinable($end, $to, depth + 1);
-
-	  var content = [];
-	  addRange(null, $from, depth, content);
-	  if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {
-	    checkJoin(openStart, openEnd);
-	    addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);
-	  } else {
-	    if (openStart)
-	      { addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content); }
-	    addRange($start, $end, depth, content);
-	    if (openEnd)
-	      { addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content); }
-	  }
-	  addRange($to, null, depth, content);
-	  return new Fragment(content)
-	}
-
-	function replaceTwoWay($from, $to, depth) {
-	  var content = [];
-	  addRange(null, $from, depth, content);
-	  if ($from.depth > depth) {
-	    var type = joinable($from, $to, depth + 1);
-	    addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);
-	  }
-	  addRange($to, null, depth, content);
-	  return new Fragment(content)
-	}
-
-	function prepareSliceForReplace(slice, $along) {
-	  var extra = $along.depth - slice.openStart, parent = $along.node(extra);
-	  var node = parent.copy(slice.content);
-	  for (var i = extra - 1; i >= 0; i--)
-	    { node = $along.node(i).copy(Fragment.from(node)); }
-	  return {start: node.resolveNoCache(slice.openStart + extra),
-	          end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}
-	}
-
-	// ::- You can [_resolve_](#model.Node.resolve) a position to get more
-	// information about it. Objects of this class represent such a
-	// resolved position, providing various pieces of context information,
-	// and some helper methods.
-	//
-	// Throughout this interface, methods that take an optional `depth`
-	// parameter will interpret undefined as `this.depth` and negative
-	// numbers as `this.depth + value`.
-	var ResolvedPos = function ResolvedPos(pos, path, parentOffset) {
-	  // :: number The position that was resolved.
-	  this.pos = pos;
-	  this.path = path;
-	  // :: number
-	  // The number of levels the parent node is from the root. If this
-	  // position points directly into the root node, it is 0. If it
-	  // points into a top-level paragraph, 1, and so on.
-	  this.depth = path.length / 3 - 1;
-	  // :: number The offset this position has into its parent node.
-	  this.parentOffset = parentOffset;
-	};
-
-	var prototypeAccessors$3 = { parent: {},doc: {},textOffset: {},nodeAfter: {},nodeBefore: {} };
-
-	ResolvedPos.prototype.resolveDepth = function resolveDepth (val) {
-	  if (val == null) { return this.depth }
-	  if (val < 0) { return this.depth + val }
-	  return val
-	};
-
-	// :: Node
-	// The parent node that the position points into. Note that even if
-	// a position points into a text node, that node is not considered
-	// the parent—text nodes are ‘flat’ in this model, and have no content.
-	prototypeAccessors$3.parent.get = function () { return this.node(this.depth) };
-
-	// :: Node
-	// The root node in which the position was resolved.
-	prototypeAccessors$3.doc.get = function () { return this.node(0) };
-
-	// :: (?number) → Node
-	// The ancestor node at the given level. `p.node(p.depth)` is the
-	// same as `p.parent`.
-	ResolvedPos.prototype.node = function node (depth) { return this.path[this.resolveDepth(depth) * 3] };
-
-	// :: (?number) → number
-	// The index into the ancestor at the given level. If this points at
-	// the 3rd node in the 2nd paragraph on the top level, for example,
-	// `p.index(0)` is 2 and `p.index(1)` is 3.
-	ResolvedPos.prototype.index = function index (depth) { return this.path[this.resolveDepth(depth) * 3 + 1] };
-
-	// :: (?number) → number
-	// The index pointing after this position into the ancestor at the
-	// given level.
-	ResolvedPos.prototype.indexAfter = function indexAfter (depth) {
-	  depth = this.resolveDepth(depth);
-	  return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)
-	};
-
-	// :: (?number) → number
-	// The (absolute) position at the start of the node at the given
-	// level.
-	ResolvedPos.prototype.start = function start (depth) {
-	  depth = this.resolveDepth(depth);
-	  return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1
-	};
-
-	// :: (?number) → number
-	// The (absolute) position at the end of the node at the given
-	// level.
-	ResolvedPos.prototype.end = function end (depth) {
-	  depth = this.resolveDepth(depth);
-	  return this.start(depth) + this.node(depth).content.size
-	};
-
-	// :: (?number) → number
-	// The (absolute) position directly before the wrapping node at the
-	// given level, or, when `level` is `this.depth + 1`, the original
-	// position.
-	ResolvedPos.prototype.before = function before (depth) {
-	  depth = this.resolveDepth(depth);
-	  if (!depth) { throw new RangeError("There is no position before the top-level node") }
-	  return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]
-	};
-
-	// :: (?number) → number
-	// The (absolute) position directly after the wrapping node at the
-	// given level, or the original position when `level` is `this.depth + 1`.
-	ResolvedPos.prototype.after = function after (depth) {
-	  depth = this.resolveDepth(depth);
-	  if (!depth) { throw new RangeError("There is no position after the top-level node") }
-	  return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize
-	};
-
-	// :: number
-	// When this position points into a text node, this returns the
-	// distance between the position and the start of the text node.
-	// Will be zero for positions that point between nodes.
-	prototypeAccessors$3.textOffset.get = function () { return this.pos - this.path[this.path.length - 1] };
-
-	// :: ?Node
-	// Get the node directly after the position, if any. If the position
-	// points into a text node, only the part of that node after the
-	// position is returned.
-	prototypeAccessors$3.nodeAfter.get = function () {
-	  var parent = this.parent, index = this.index(this.depth);
-	  if (index == parent.childCount) { return null }
-	  var dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);
-	  return dOff ? parent.child(index).cut(dOff) : child
-	};
-
-	// :: ?Node
-	// Get the node directly before the position, if any. If the
-	// position points into a text node, only the part of that node
-	// before the position is returned.
-	prototypeAccessors$3.nodeBefore.get = function () {
-	  var index = this.index(this.depth);
-	  var dOff = this.pos - this.path[this.path.length - 1];
-	  if (dOff) { return this.parent.child(index).cut(0, dOff) }
-	  return index == 0 ? null : this.parent.child(index - 1)
-	};
-
-	// :: () → [Mark]
-	// Get the marks at this position, factoring in the surrounding
-	// marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the
-	// position is at the start of a non-empty node, the marks of the
-	// node after it (if any) are returned.
-	ResolvedPos.prototype.marks = function marks () {
-	  var parent = this.parent, index = this.index();
-
-	  // In an empty parent, return the empty array
-	  if (parent.content.size == 0) { return Mark.none }
-
-	  // When inside a text node, just return the text node's marks
-	  if (this.textOffset) { return parent.child(index).marks }
-
-	  var main = parent.maybeChild(index - 1), other = parent.maybeChild(index);
-	  // If the `after` flag is true of there is no node before, make
-	  // the node after this position the main reference.
-	  if (!main) { var tmp = main; main = other; other = tmp; }
-
-	  // Use all marks in the main node, except those that have
-	  // `inclusive` set to false and are not present in the other node.
-	  var marks = main.marks;
-	  for (var i = 0; i < marks.length; i++)
-	    { if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))
-	      { marks = marks[i--].removeFromSet(marks); } }
-
-	  return marks
-	};
-
-	// :: (ResolvedPos) → ?[Mark]
-	// Get the marks after the current position, if any, except those
-	// that are non-inclusive and not present at position `$end`. This
-	// is mostly useful for getting the set of marks to preserve after a
-	// deletion. Will return `null` if this position is at the end of
-	// its parent node or its parent node isn't a textblock (in which
-	// case no marks should be preserved).
-	ResolvedPos.prototype.marksAcross = function marksAcross ($end) {
-	  var after = this.parent.maybeChild(this.index());
-	  if (!after || !after.isInline) { return null }
-
-	  var marks = after.marks, next = $end.parent.maybeChild($end.index());
-	  for (var i = 0; i < marks.length; i++)
-	    { if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))
-	      { marks = marks[i--].removeFromSet(marks); } }
-	  return marks
-	};
-
-	// :: (number) → number
-	// The depth up to which this position and the given (non-resolved)
-	// position share the same parent nodes.
-	ResolvedPos.prototype.sharedDepth = function sharedDepth (pos) {
-	    var this$1 = this;
-
-	  for (var depth = this.depth; depth > 0; depth--)
-	    { if (this$1.start(depth) <= pos && this$1.end(depth) >= pos) { return depth } }
-	  return 0
-	};
-
-	// :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange
-	// Returns a range based on the place where this position and the
-	// given position diverge around block content. If both point into
-	// the same textblock, for example, a range around that textblock
-	// will be returned. If they point into different blocks, the range
-	// around those blocks in their shared ancestor is returned. You can
-	// pass in an optional predicate that will be called with a parent
-	// node to see if a range into that parent is acceptable.
-	ResolvedPos.prototype.blockRange = function blockRange (other, pred) {
-	    var this$1 = this;
-	    if ( other === void 0 ) { other = this; }
-
-	  if (other.pos < this.pos) { return other.blockRange(this) }
-	  for (var d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)
-	    { if (other.pos <= this$1.end(d) && (!pred || pred(this$1.node(d))))
-	      { return new NodeRange(this$1, other, d) } }
-	};
-
-	// :: (ResolvedPos) → bool
-	// Query whether the given position shares the same parent node.
-	ResolvedPos.prototype.sameParent = function sameParent (other) {
-	  return this.pos - this.parentOffset == other.pos - other.parentOffset
-	};
-
-	// :: (ResolvedPos) → ResolvedPos
-	// Return the greater of this and the given position.
-	ResolvedPos.prototype.max = function max (other) {
-	  return other.pos > this.pos ? other : this
-	};
-
-	// :: (ResolvedPos) → ResolvedPos
-	// Return the smaller of this and the given position.
-	ResolvedPos.prototype.min = function min (other) {
-	  return other.pos < this.pos ? other : this
-	};
-
-	ResolvedPos.prototype.toString = function toString () {
-	    var this$1 = this;
-
-	  var str = "";
-	  for (var i = 1; i <= this.depth; i++)
-	    { str += (str ? "/" : "") + this$1.node(i).type.name + "_" + this$1.index(i - 1); }
-	  return str + ":" + this.parentOffset
-	};
-
-	ResolvedPos.resolve = function resolve (doc, pos) {
-	  if (!(pos >= 0 && pos <= doc.content.size)) { throw new RangeError("Position " + pos + " out of range") }
-	  var path = [];
-	  var start = 0, parentOffset = pos;
-	  for (var node = doc;;) {
-	    var ref = node.content.findIndex(parentOffset);
-	      var index = ref.index;
-	      var offset = ref.offset;
-	    var rem = parentOffset - offset;
-	    path.push(node, index, start + offset);
-	    if (!rem) { break }
-	    node = node.child(index);
-	    if (node.isText) { break }
-	    parentOffset = rem - 1;
-	    start += offset + 1;
-	  }
-	  return new ResolvedPos(pos, path, parentOffset)
-	};
-
-	ResolvedPos.resolveCached = function resolveCached (doc, pos) {
-	  for (var i = 0; i < resolveCache.length; i++) {
-	    var cached = resolveCache[i];
-	    if (cached.pos == pos && cached.doc == doc) { return cached }
-	  }
-	  var result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);
-	  resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;
-	  return result
-	};
-
-	Object.defineProperties( ResolvedPos.prototype, prototypeAccessors$3 );
-
-	var resolveCache = [];
-	var resolveCachePos = 0;
-	var resolveCacheSize = 12;
-
-	// ::- Represents a flat range of content, i.e. one that starts and
-	// ends in the same node.
-	var NodeRange = function NodeRange($from, $to, depth) {
-	  // :: ResolvedPos A resolved position along the start of the
-	  // content. May have a `depth` greater than this object's `depth`
-	  // property, since these are the positions that were used to
-	  // compute the range, not re-resolved positions directly at its
-	  // boundaries.
-	  this.$from = $from;
-	  // :: ResolvedPos A position along the end of the content. See
-	  // caveat for [`$from`](#model.NodeRange.$from).
-	  this.$to = $to;
-	  // :: number The depth of the node that this range points into.
-	  this.depth = depth;
-	};
-
-	var prototypeAccessors$1$1 = { start: {},end: {},parent: {},startIndex: {},endIndex: {} };
-
-	// :: number The position at the start of the range.
-	prototypeAccessors$1$1.start.get = function () { return this.$from.before(this.depth + 1) };
-	// :: number The position at the end of the range.
-	prototypeAccessors$1$1.end.get = function () { return this.$to.after(this.depth + 1) };
-
-	// :: Node The parent node that the range points into.
-	prototypeAccessors$1$1.parent.get = function () { return this.$from.node(this.depth) };
-	// :: number The start index of the range in the parent node.
-	prototypeAccessors$1$1.startIndex.get = function () { return this.$from.index(this.depth) };
-	// :: number The end index of the range in the parent node.
-	prototypeAccessors$1$1.endIndex.get = function () { return this.$to.indexAfter(this.depth) };
-
-	Object.defineProperties( NodeRange.prototype, prototypeAccessors$1$1 );
-
-	var emptyAttrs = Object.create(null);
-
-	// ::- This class represents a node in the tree that makes up a
-	// ProseMirror document. So a document is an instance of `Node`, with
-	// children that are also instances of `Node`.
-	//
-	// Nodes are persistent data structures. Instead of changing them, you
-	// create new ones with the content you want. Old ones keep pointing
-	// at the old document shape. This is made cheaper by sharing
-	// structure between the old and new data as much as possible, which a
-	// tree shape like this (without back pointers) makes easy.
-	//
-	// **Do not** directly mutate the properties of a `Node` object. See
-	// [the guide](/docs/guide/#doc) for more information.
-	var Node = function Node(type, attrs, content, marks) {
-	  // :: NodeType
-	  // The type of node that this is.
-	  this.type = type;
-
-	  // :: Object
-	  // An object mapping attribute names to values. The kind of
-	  // attributes allowed and required are
-	  // [determined](#model.NodeSpec.attrs) by the node type.
-	  this.attrs = attrs;
-
-	  // :: Fragment
-	  // A container holding the node's children.
-	  this.content = content || Fragment.empty;
-
-	  // :: [Mark]
-	  // The marks (things like whether it is emphasized or part of a
-	  // link) applied to this node.
-	  this.marks = marks || Mark.none;
-	};
-
-	var prototypeAccessors = { nodeSize: {},childCount: {},textContent: {},firstChild: {},lastChild: {},isBlock: {},isTextblock: {},inlineContent: {},isInline: {},isText: {},isLeaf: {},isAtom: {} };
-
-	// text:: ?string
-	// For text nodes, this contains the node's text content.
-
-	// :: number
-	// The size of this node, as defined by the integer-based [indexing
-	// scheme](/docs/guide/#doc.indexing). For text nodes, this is the
-	// amount of characters. For other leaf nodes, it is one. For
-	// non-leaf nodes, it is the size of the content plus two (the start
-	// and end token).
-	prototypeAccessors.nodeSize.get = function () { return this.isLeaf ? 1 : 2 + this.content.size };
-
-	// :: number
-	// The number of children that the node has.
-	prototypeAccessors.childCount.get = function () { return this.content.childCount };
-
-	// :: (number) → Node
-	// Get the child node at the given index. Raises an error when the
-	// index is out of range.
-	Node.prototype.child = function child (index) { return this.content.child(index) };
-
-	// :: (number) → ?Node
-	// Get the child node at the given index, if it exists.
-	Node.prototype.maybeChild = function maybeChild (index) { return this.content.maybeChild(index) };
-
-	// :: ((node: Node, offset: number, index: number))
-	// Call `f` for every child node, passing the node, its offset
-	// into this parent node, and its index.
-	Node.prototype.forEach = function forEach (f) { this.content.forEach(f); };
-
-	// :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)
-	// Invoke a callback for all descendant nodes recursively between
-	// the given two positions that are relative to start of this node's
-	// content. The callback is invoked with the node, its
-	// parent-relative position, its parent node, and its child index.
-	// When the callback returns false for a given node, that node's
-	// children will not be recursed over. The last parameter can be
-	// used to specify a starting position to count from.
-	Node.prototype.nodesBetween = function nodesBetween (from, to, f, startPos) {
-	    if ( startPos === void 0 ) { startPos = 0; }
-
-	  this.content.nodesBetween(from, to, f, startPos, this);
-	};
-
-	// :: ((node: Node, pos: number, parent: Node) → ?bool)
-	// Call the given callback for every descendant node. Doesn't
-	// descend into a node when the callback returns `false`.
-	Node.prototype.descendants = function descendants (f) {
-	  this.nodesBetween(0, this.content.size, f);
-	};
-
-	// :: string
-	// Concatenates all the text nodes found in this fragment and its
-	// children.
-	prototypeAccessors.textContent.get = function () { return this.textBetween(0, this.content.size, "") };
-
-	// :: (number, number, ?string, ?string) → string
-	// Get all text between positions `from` and `to`. When
-	// `blockSeparator` is given, it will be inserted whenever a new
-	// block node is started. When `leafText` is given, it'll be
-	// inserted for every non-text leaf node encountered.
-	Node.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {
-	  return this.content.textBetween(from, to, blockSeparator, leafText)
-	};
-
-	// :: ?Node
-	// Returns this node's first child, or `null` if there are no
-	// children.
-	prototypeAccessors.firstChild.get = function () { return this.content.firstChild };
-
-	// :: ?Node
-	// Returns this node's last child, or `null` if there are no
-	// children.
-	prototypeAccessors.lastChild.get = function () { return this.content.lastChild };
-
-	// :: (Node) → bool
-	// Test whether two nodes represent the same piece of document.
-	Node.prototype.eq = function eq (other) {
-	  return this == other || (this.sameMarkup(other) && this.content.eq(other.content))
-	};
-
-	// :: (Node) → bool
-	// Compare the markup (type, attributes, and marks) of this node to
-	// those of another. Returns `true` if both have the same markup.
-	Node.prototype.sameMarkup = function sameMarkup (other) {
-	  return this.hasMarkup(other.type, other.attrs, other.marks)
-	};
-
-	// :: (NodeType, ?Object, ?[Mark]) → bool
-	// Check whether this node's markup correspond to the given type,
-	// attributes, and marks.
-	Node.prototype.hasMarkup = function hasMarkup (type, attrs, marks) {
-	  return this.type == type &&
-	    compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&
-	    Mark.sameSet(this.marks, marks || Mark.none)
-	};
-
-	// :: (?Fragment) → Node
-	// Create a new node with the same markup as this node, containing
-	// the given content (or empty, if no content is given).
-	Node.prototype.copy = function copy (content) {
-	    if ( content === void 0 ) { content = null; }
-
-	  if (content == this.content) { return this }
-	  return new this.constructor(this.type, this.attrs, content, this.marks)
-	};
-
-	// :: ([Mark]) → Node
-	// Create a copy of this node, with the given set of marks instead
-	// of the node's own marks.
-	Node.prototype.mark = function mark (marks) {
-	  return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)
-	};
-
-	// :: (number, ?number) → Node
-	// Create a copy of this node with only the content between the
-	// given positions. If `to` is not given, it defaults to the end of
-	// the node.
-	Node.prototype.cut = function cut (from, to) {
-	  if (from == 0 && to == this.content.size) { return this }
-	  return this.copy(this.content.cut(from, to))
-	};
-
-	// :: (number, ?number) → Slice
-	// Cut out the part of the document between the given positions, and
-	// return it as a `Slice` object.
-	Node.prototype.slice = function slice (from, to, includeParents) {
-	    if ( to === void 0 ) { to = this.content.size; }
-	    if ( includeParents === void 0 ) { includeParents = false; }
-
-	  if (from == to) { return Slice.empty }
-
-	  var $from = this.resolve(from), $to = this.resolve(to);
-	  var depth = includeParents ? 0 : $from.sharedDepth(to);
-	  var start = $from.start(depth), node = $from.node(depth);
-	  var content = node.content.cut($from.pos - start, $to.pos - start);
-	  return new Slice(content, $from.depth - depth, $to.depth - depth)
-	};
-
-	// :: (number, number, Slice) → Node
-	// Replace the part of the document between the given positions with
-	// the given slice. The slice must 'fit', meaning its open sides
-	// must be able to connect to the surrounding content, and its
-	// content nodes must be valid children for the node they are placed
-	// into. If any of this is violated, an error of type
-	// [`ReplaceError`](#model.ReplaceError) is thrown.
-	Node.prototype.replace = function replace$1 (from, to, slice) {
-	  return replace(this.resolve(from), this.resolve(to), slice)
-	};
-
-	// :: (number) → ?Node
-	// Find the node directly after the given position.
-	Node.prototype.nodeAt = function nodeAt (pos) {
-	  for (var node = this;;) {
-	    var ref = node.content.findIndex(pos);
-	      var index = ref.index;
-	      var offset = ref.offset;
-	    node = node.maybeChild(index);
-	    if (!node) { return null }
-	    if (offset == pos || node.isText) { return node }
-	    pos -= offset + 1;
-	  }
-	};
-
-	// :: (number) → {node: ?Node, index: number, offset: number}
-	// Find the (direct) child node after the given offset, if any,
-	// and return it along with its index and offset relative to this
-	// node.
-	Node.prototype.childAfter = function childAfter (pos) {
-	  var ref = this.content.findIndex(pos);
-	    var index = ref.index;
-	    var offset = ref.offset;
-	  return {node: this.content.maybeChild(index), index: index, offset: offset}
-	};
-
-	// :: (number) → {node: ?Node, index: number, offset: number}
-	// Find the (direct) child node before the given offset, if any,
-	// and return it along with its index and offset relative to this
-	// node.
-	Node.prototype.childBefore = function childBefore (pos) {
-	  if (pos == 0) { return {node: null, index: 0, offset: 0} }
-	  var ref = this.content.findIndex(pos);
-	    var index = ref.index;
-	    var offset = ref.offset;
-	  if (offset < pos) { return {node: this.content.child(index), index: index, offset: offset} }
-	  var node = this.content.child(index - 1);
-	  return {node: node, index: index - 1, offset: offset - node.nodeSize}
-	};
-
-	// :: (number) → ResolvedPos
-	// Resolve the given position in the document, returning an
-	// [object](#model.ResolvedPos) with information about its context.
-	Node.prototype.resolve = function resolve (pos) { return ResolvedPos.resolveCached(this, pos) };
-
-	Node.prototype.resolveNoCache = function resolveNoCache (pos) { return ResolvedPos.resolve(this, pos) };
-
-	// :: (number, number, MarkType) → bool
-	// Test whether a mark of the given type occurs in this document
-	// between the two given positions.
-	Node.prototype.rangeHasMark = function rangeHasMark (from, to, type) {
-	  var found = false;
-	  if (to > from) { this.nodesBetween(from, to, function (node) {
-	    if (type.isInSet(node.marks)) { found = true; }
-	    return !found
-	  }); }
-	  return found
-	};
-
-	// :: bool
-	// True when this is a block (non-inline node)
-	prototypeAccessors.isBlock.get = function () { return this.type.isBlock };
-
-	// :: bool
-	// True when this is a textblock node, a block node with inline
-	// content.
-	prototypeAccessors.isTextblock.get = function () { return this.type.isTextblock };
-
-	// :: bool
-	// True when this node has inline content.
-	prototypeAccessors.inlineContent.get = function () { return this.type.inlineContent };
-
-	// :: bool
-	// True when this is an inline node (a text node or a node that can
-	// appear among text).
-	prototypeAccessors.isInline.get = function () { return this.type.isInline };
-
-	// :: bool
-	// True when this is a text node.
-	prototypeAccessors.isText.get = function () { return this.type.isText };
-
-	// :: bool
-	// True when this is a leaf node.
-	prototypeAccessors.isLeaf.get = function () { return this.type.isLeaf };
-
-	// :: bool
-	// True when this is an atom, i.e. when it does not have directly
-	// editable content. This is usually the same as `isLeaf`, but can
-	// be configured with the [`atom` property](#model.NodeSpec.atom) on
-	// a node's spec (typically used when the node is displayed as an
-	// uneditable [node view](#view.NodeView)).
-	prototypeAccessors.isAtom.get = function () { return this.type.isAtom };
-
-	// :: () → string
-	// Return a string representation of this node for debugging
-	// purposes.
-	Node.prototype.toString = function toString () {
-	  if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
-	  var name = this.type.name;
-	  if (this.content.size)
-	    { name += "(" + this.content.toStringInner() + ")"; }
-	  return wrapMarks(this.marks, name)
-	};
-
-	// :: (number) → ContentMatch
-	// Get the content match in this node at the given index.
-	Node.prototype.contentMatchAt = function contentMatchAt (index) {
-	  return this.type.contentMatch.matchFragment(this.content, 0, index)
-	};
-
-	// :: (number, number, ?Fragment, ?number, ?number) → bool
-	// Test whether replacing the range between `from` and `to` (by
-	// child index) with the given replacement fragment (which defaults
-	// to the empty fragment) would leave the node's content valid. You
-	// can optionally pass `start` and `end` indices into the
-	// replacement fragment.
-	Node.prototype.canReplace = function canReplace (from, to, replacement, start, end) {
-	    var this$1 = this;
-	    if ( replacement === void 0 ) { replacement = Fragment.empty; }
-	    if ( start === void 0 ) { start = 0; }
-	    if ( end === void 0 ) { end = replacement.childCount; }
-
-	  var one = this.contentMatchAt(from).matchFragment(replacement, start, end);
-	  var two = one && one.matchFragment(this.content, to);
-	  if (!two || !two.validEnd) { return false }
-	  for (var i = start; i < end; i++) { if (!this$1.type.allowsMarks(replacement.child(i).marks)) { return false } }
-	  return true
-	};
-
-	// :: (number, number, NodeType, ?[Mark]) → bool
-	// Test whether replacing the range `from` to `to` (by index) with a
-	// node of the given type would leave the node's content valid.
-	Node.prototype.canReplaceWith = function canReplaceWith (from, to, type, marks) {
-	  if (marks && !this.type.allowsMarks(marks)) { return false }
-	  var start = this.contentMatchAt(from).matchType(type);
-	  var end = start && start.matchFragment(this.content, to);
-	  return end ? end.validEnd : false
-	};
-
-	// :: (Node) → bool
-	// Test whether the given node's content could be appended to this
-	// node. If that node is empty, this will only return true if there
-	// is at least one node type that can appear in both nodes (to avoid
-	// merging completely incompatible nodes).
-	Node.prototype.canAppend = function canAppend (other) {
-	  if (other.content.size) { return this.canReplace(this.childCount, this.childCount, other.content) }
-	  else { return this.type.compatibleContent(other.type) }
-	};
-
-	// Unused. Left for backwards compatibility.
-	Node.prototype.defaultContentType = function defaultContentType (at) {
-	  return this.contentMatchAt(at).defaultType
-	};
-
-	// :: ()
-	// Check whether this node and its descendants conform to the
-	// schema, and raise error when they do not.
-	Node.prototype.check = function check () {
-	  if (!this.type.validContent(this.content))
-	    { throw new RangeError(("Invalid content for node " + (this.type.name) + ": " + (this.content.toString().slice(0, 50)))) }
-	  this.content.forEach(function (node) { return node.check(); });
-	};
-
-	// :: () → Object
-	// Return a JSON-serializeable representation of this node.
-	Node.prototype.toJSON = function toJSON () {
-	    var this$1 = this;
-
-	  var obj = {type: this.type.name};
-	  for (var _ in this$1.attrs) {
-	    obj.attrs = this$1.attrs;
-	    break
-	  }
-	  if (this.content.size)
-	    { obj.content = this.content.toJSON(); }
-	  if (this.marks.length)
-	    { obj.marks = this.marks.map(function (n) { return n.toJSON(); }); }
-	  return obj
-	};
-
-	// :: (Schema, Object) → Node
-	// Deserialize a node from its JSON representation.
-	Node.fromJSON = function fromJSON (schema, json) {
-	  if (!json) { throw new RangeError("Invalid input for Node.fromJSON") }
-	  var marks = null;
-	  if (json.marks) {
-	    if (!Array.isArray(json.marks)) { throw new RangeError("Invalid mark data for Node.fromJSON") }
-	    marks = json.marks.map(schema.markFromJSON);
-	  }
-	  if (json.type == "text") {
-	    if (typeof json.text != "string") { throw new RangeError("Invalid text node in JSON") }
-	    return schema.text(json.text, marks)
-	  }
-	  var content = Fragment.fromJSON(schema, json.content);
-	  return schema.nodeType(json.type).create(json.attrs, content, marks)
-	};
-
-	Object.defineProperties( Node.prototype, prototypeAccessors );
-
-	var TextNode = (function (Node) {
-	  function TextNode(type, attrs, content, marks) {
-	    Node.call(this, type, attrs, null, marks);
-
-	    if (!content) { throw new RangeError("Empty text nodes are not allowed") }
-
-	    this.text = content;
-	  }
-
-	  if ( Node ) { TextNode.__proto__ = Node; }
-	  TextNode.prototype = Object.create( Node && Node.prototype );
-	  TextNode.prototype.constructor = TextNode;
-
-	  var prototypeAccessors$1 = { textContent: {},nodeSize: {} };
-
-	  TextNode.prototype.toString = function toString () {
-	    if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }
-	    return wrapMarks(this.marks, JSON.stringify(this.text))
-	  };
-
-	  prototypeAccessors$1.textContent.get = function () { return this.text };
-
-	  TextNode.prototype.textBetween = function textBetween (from, to) { return this.text.slice(from, to) };
-
-	  prototypeAccessors$1.nodeSize.get = function () { return this.text.length };
-
-	  TextNode.prototype.mark = function mark (marks) {
-	    return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)
-	  };
-
-	  TextNode.prototype.withText = function withText (text) {
-	    if (text == this.text) { return this }
-	    return new TextNode(this.type, this.attrs, text, this.marks)
-	  };
-
-	  TextNode.prototype.cut = function cut (from, to) {
-	    if ( from === void 0 ) { from = 0; }
-	    if ( to === void 0 ) { to = this.text.length; }
-
-	    if (from == 0 && to == this.text.length) { return this }
-	    return this.withText(this.text.slice(from, to))
-	  };
-
-	  TextNode.prototype.eq = function eq (other) {
-	    return this.sameMarkup(other) && this.text == other.text
-	  };
-
-	  TextNode.prototype.toJSON = function toJSON () {
-	    var base = Node.prototype.toJSON.call(this);
-	    base.text = this.text;
-	    return base
-	  };
-
-	  Object.defineProperties( TextNode.prototype, prototypeAccessors$1 );
-
-	  return TextNode;
-	}(Node));
-
-	function wrapMarks(marks, str) {
-	  for (var i = marks.length - 1; i >= 0; i--)
-	    { str = marks[i].type.name + "(" + str + ")"; }
-	  return str
-	}
-
-	// ::- Instances of this class represent a match state of a node
-	// type's [content expression](#model.NodeSpec.content), and can be
-	// used to find out whether further content matches here, and whether
-	// a given position is a valid end of the node.
-	var ContentMatch = function ContentMatch(validEnd) {
-	  // :: bool
-	  // True when this match state represents a valid end of the node.
-	  this.validEnd = validEnd;
-	  this.next = [];
-	  this.wrapCache = [];
-	};
-
-	var prototypeAccessors$5 = { inlineContent: {},defaultType: {},edgeCount: {} };
-
-	ContentMatch.parse = function parse (string, nodeTypes) {
-	  var stream = new TokenStream(string, nodeTypes);
-	  if (stream.next == null) { return ContentMatch.empty }
-	  var expr = parseExpr(stream);
-	  if (stream.next) { stream.err("Unexpected trailing text"); }
-	  var match = dfa(nfa(expr));
-	  checkForDeadEnds(match, stream);
-	  return match
-	};
-
-	// :: (NodeType) → ?ContentMatch
-	// Match a node type, returning a match after that node if
-	// successful.
-	ContentMatch.prototype.matchType = function matchType (type) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.next.length; i += 2)
-	    { if (this$1.next[i] == type) { return this$1.next[i + 1] } }
-	  return null
-	};
-
-	// :: (Fragment, ?number, ?number) → ?ContentMatch
-	// Try to match a fragment. Returns the resulting match when
-	// successful.
-	ContentMatch.prototype.matchFragment = function matchFragment (frag, start, end) {
-	    if ( start === void 0 ) { start = 0; }
-	    if ( end === void 0 ) { end = frag.childCount; }
-
-	  var cur = this;
-	  for (var i = start; cur && i < end; i++)
-	    { cur = cur.matchType(frag.child(i).type); }
-	  return cur
-	};
-
-	prototypeAccessors$5.inlineContent.get = function () {
-	  var first = this.next[0];
-	  return first ? first.isInline : false
-	};
-
-	// :: ?NodeType
-	// Get the first matching node type at this match position that can
-	// be generated.
-	prototypeAccessors$5.defaultType.get = function () {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.next.length; i += 2) {
-	    var type = this$1.next[i];
-	    if (!(type.isText || type.hasRequiredAttrs())) { return type }
-	  }
-	};
-
-	ContentMatch.prototype.compatible = function compatible (other) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.next.length; i += 2)
-	    { for (var j = 0; j < other.next.length; j += 2)
-	      { if (this$1.next[i] == other.next[j]) { return true } } }
-	  return false
-	};
-
-	// :: (Fragment, bool, ?number) → ?Fragment
-	// Try to match the given fragment, and if that fails, see if it can
-	// be made to match by inserting nodes in front of it. When
-	// successful, return a fragment of inserted nodes (which may be
-	// empty if nothing had to be inserted). When `toEnd` is true, only
-	// return a fragment if the resulting match goes to the end of the
-	// content expression.
-	ContentMatch.prototype.fillBefore = function fillBefore (after, toEnd, startIndex) {
-	    if ( toEnd === void 0 ) { toEnd = false; }
-	    if ( startIndex === void 0 ) { startIndex = 0; }
-
-	  var seen = [this];
-	  function search(match, types) {
-	    var finished = match.matchFragment(after, startIndex);
-	    if (finished && (!toEnd || finished.validEnd))
-	      { return Fragment.from(types.map(function (tp) { return tp.createAndFill(); })) }
-
-	    for (var i = 0; i < match.next.length; i += 2) {
-	      var type = match.next[i], next = match.next[i + 1];
-	      if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {
-	        seen.push(next);
-	        var found = search(next, types.concat(type));
-	        if (found) { return found }
-	      }
-	    }
-	  }
-
-	  return search(this, [])
-	};
-
-	// :: (NodeType) → ?[NodeType]
-	// Find a set of wrapping node types that would allow a node of the
-	// given type to appear at this position. The result may be empty
-	// (when it fits directly) and will be null when no such wrapping
-	// exists.
-	ContentMatch.prototype.findWrapping = function findWrapping (target) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.wrapCache.length; i += 2)
-	    { if (this$1.wrapCache[i] == target) { return this$1.wrapCache[i + 1] } }
-	  var computed = this.computeWrapping(target);
-	  this.wrapCache.push(target, computed);
-	  return computed
-	};
-
-	ContentMatch.prototype.computeWrapping = function computeWrapping (target) {
-	  var seen = Object.create(null), active = [{match: this, type: null, via: null}];
-	  while (active.length) {
-	    var current = active.shift(), match = current.match;
-	    if (match.matchType(target)) {
-	      var result = [];
-	      for (var obj = current; obj.type; obj = obj.via)
-	        { result.push(obj.type); }
-	      return result.reverse()
-	    }
-	    for (var i = 0; i < match.next.length; i += 2) {
-	      var type = match.next[i];
-	      if (!type.isLeaf && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {
-	        active.push({match: type.contentMatch, type: type, via: current});
-	        seen[type.name] = true;
-	      }
-	    }
-	  }
-	};
-
-	// :: number
-	// The number of outgoing edges this node has in the finite
-	// automaton that describes the content expression.
-	prototypeAccessors$5.edgeCount.get = function () {
-	  return this.next.length >> 1
-	};
-
-	// :: (number) → {type: NodeType, next: ContentMatch}
-	// Get the _n_th outgoing edge from this node in the finite
-	// automaton that describes the content expression.
-	ContentMatch.prototype.edge = function edge (n) {
-	  var i = n << 1;
-	  if (i > this.next.length) { throw new RangeError(("There's no " + n + "th edge in this content match")) }
-	  return {type: this.next[i], next: this.next[i + 1]}
-	};
-
-	ContentMatch.prototype.toString = function toString () {
-	  var seen = [];
-	  function scan(m) {
-	    seen.push(m);
-	    for (var i = 1; i < m.next.length; i += 2)
-	      { if (seen.indexOf(m.next[i]) == -1) { scan(m.next[i]); } }
-	  }
-	  scan(this);
-	  return seen.map(function (m, i) {
-	    var out = i + (m.validEnd ? "*" : " ") + " ";
-	    for (var i$1 = 0; i$1 < m.next.length; i$1 += 2)
-	      { out += (i$1 ? ", " : "") + m.next[i$1].name + "->" + seen.indexOf(m.next[i$1 + 1]); }
-	    return out
-	  }).join("\n")
-	};
-
-	Object.defineProperties( ContentMatch.prototype, prototypeAccessors$5 );
-
-	ContentMatch.empty = new ContentMatch(true);
-
-	var TokenStream = function TokenStream(string, nodeTypes) {
-	  this.string = string;
-	  this.nodeTypes = nodeTypes;
-	  this.inline = null;
-	  this.pos = 0;
-	  this.tokens = string.split(/\s*(?=\b|\W|$)/);
-	  if (this.tokens[this.tokens.length - 1] == "") { this.tokens.pop(); }
-	  if (this.tokens[0] == "") { this.tokens.unshift(); }
-	};
-
-	var prototypeAccessors$1$3 = { next: {} };
-
-	prototypeAccessors$1$3.next.get = function () { return this.tokens[this.pos] };
-
-	TokenStream.prototype.eat = function eat (tok) { return this.next == tok && (this.pos++ || true) };
-
-	TokenStream.prototype.err = function err (str) { throw new SyntaxError(str + " (in content expression '" + this.string + "')") };
-
-	Object.defineProperties( TokenStream.prototype, prototypeAccessors$1$3 );
-
-	function parseExpr(stream) {
-	  var exprs = [];
-	  do { exprs.push(parseExprSeq(stream)); }
-	  while (stream.eat("|"))
-	  return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
-	}
-
-	function parseExprSeq(stream) {
-	  var exprs = [];
-	  do { exprs.push(parseExprSubscript(stream)); }
-	  while (stream.next && stream.next != ")" && stream.next != "|")
-	  return exprs.length == 1 ? exprs[0] : {type: "seq", exprs: exprs}
-	}
-
-	function parseExprSubscript(stream) {
-	  var expr = parseExprAtom(stream);
-	  for (;;) {
-	    if (stream.eat("+"))
-	      { expr = {type: "plus", expr: expr}; }
-	    else if (stream.eat("*"))
-	      { expr = {type: "star", expr: expr}; }
-	    else if (stream.eat("?"))
-	      { expr = {type: "opt", expr: expr}; }
-	    else if (stream.eat("{"))
-	      { expr = parseExprRange(stream, expr); }
-	    else { break }
-	  }
-	  return expr
-	}
-
-	function parseNum(stream) {
-	  if (/\D/.test(stream.next)) { stream.err("Expected number, got '" + stream.next + "'"); }
-	  var result = Number(stream.next);
-	  stream.pos++;
-	  return result
-	}
-
-	function parseExprRange(stream, expr) {
-	  var min = parseNum(stream), max = min;
-	  if (stream.eat(",")) {
-	    if (stream.next != "}") { max = parseNum(stream); }
-	    else { max = -1; }
-	  }
-	  if (!stream.eat("}")) { stream.err("Unclosed braced range"); }
-	  return {type: "range", min: min, max: max, expr: expr}
-	}
-
-	function resolveName(stream, name) {
-	  var types = stream.nodeTypes, type = types[name];
-	  if (type) { return [type] }
-	  var result = [];
-	  for (var typeName in types) {
-	    var type$1 = types[typeName];
-	    if (type$1.groups.indexOf(name) > -1) { result.push(type$1); }
-	  }
-	  if (result.length == 0) { stream.err("No node type or group '" + name + "' found"); }
-	  return result
-	}
-
-	function parseExprAtom(stream) {
-	  if (stream.eat("(")) {
-	    var expr = parseExpr(stream);
-	    if (!stream.eat(")")) { stream.err("Missing closing paren"); }
-	    return expr
-	  } else if (!/\W/.test(stream.next)) {
-	    var exprs = resolveName(stream, stream.next).map(function (type) {
-	      if (stream.inline == null) { stream.inline = type.isInline; }
-	      else if (stream.inline != type.isInline) { stream.err("Mixing inline and block content"); }
-	      return {type: "name", value: type}
-	    });
-	    stream.pos++;
-	    return exprs.length == 1 ? exprs[0] : {type: "choice", exprs: exprs}
-	  } else {
-	    stream.err("Unexpected token '" + stream.next + "'");
-	  }
-	}
-
-	// The code below helps compile a regular-expression-like language
-	// into a deterministic finite automaton. For a good introduction to
-	// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html
-
-	// : (Object) → [[{term: ?any, to: number}]]
-	// Construct an NFA from an expression as returned by the parser. The
-	// NFA is represented as an array of states, which are themselves
-	// arrays of edges, which are `{term, to}` objects. The first state is
-	// the entry state and the last node is the success state.
-	//
-	// Note that unlike typical NFAs, the edge ordering in this one is
-	// significant, in that it is used to contruct filler content when
-	// necessary.
-	function nfa(expr) {
-	  var nfa = [[]];
-	  connect(compile(expr, 0), node());
-	  return nfa
-
-	  function node() { return nfa.push([]) - 1 }
-	  function edge(from, to, term) {
-	    var edge = {term: term, to: to};
-	    nfa[from].push(edge);
-	    return edge
-	  }
-	  function connect(edges, to) { edges.forEach(function (edge) { return edge.to = to; }); }
-
-	  function compile(expr, from) {
-	    if (expr.type == "choice") {
-	      return expr.exprs.reduce(function (out, expr) { return out.concat(compile(expr, from)); }, [])
-	    } else if (expr.type == "seq") {
-	      for (var i = 0;; i++) {
-	        var next = compile(expr.exprs[i], from);
-	        if (i == expr.exprs.length - 1) { return next }
-	        connect(next, from = node());
-	      }
-	    } else if (expr.type == "star") {
-	      var loop = node();
-	      edge(from, loop);
-	      connect(compile(expr.expr, loop), loop);
-	      return [edge(loop)]
-	    } else if (expr.type == "plus") {
-	      var loop$1 = node();
-	      connect(compile(expr.expr, from), loop$1);
-	      connect(compile(expr.expr, loop$1), loop$1);
-	      return [edge(loop$1)]
-	    } else if (expr.type == "opt") {
-	      return [edge(from)].concat(compile(expr.expr, from))
-	    } else if (expr.type == "range") {
-	      var cur = from;
-	      for (var i$1 = 0; i$1 < expr.min; i$1++) {
-	        var next$1 = node();
-	        connect(compile(expr.expr, cur), next$1);
-	        cur = next$1;
-	      }
-	      if (expr.max == -1) {
-	        connect(compile(expr.expr, cur), cur);
-	      } else {
-	        for (var i$2 = expr.min; i$2 < expr.max; i$2++) {
-	          var next$2 = node();
-	          edge(cur, next$2);
-	          connect(compile(expr.expr, cur), next$2);
-	          cur = next$2;
-	        }
-	      }
-	      return [edge(cur)]
-	    } else if (expr.type == "name") {
-	      return [edge(from, null, expr.value)]
-	    }
-	  }
-	}
-
-	function cmp(a, b) { return a - b }
-
-	// Get the set of nodes reachable by null edges from `node`. Omit
-	// nodes with only a single null-out-edge, since they may lead to
-	// needless duplicated nodes.
-	function nullFrom(nfa, node) {
-	  var result = [];
-	  scan(node);
-	  return result.sort(cmp)
-
-	  function scan(node) {
-	    var edges = nfa[node];
-	    if (edges.length == 1 && !edges[0].term) { return scan(edges[0].to) }
-	    result.push(node);
-	    for (var i = 0; i < edges.length; i++) {
-	      var ref = edges[i];
-	      var term = ref.term;
-	      var to = ref.to;
-	      if (!term && result.indexOf(to) == -1) { scan(to); }
-	    }
-	  }
-	}
-
-	// : ([[{term: ?any, to: number}]]) → ContentMatch
-	// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set
-	// of state objects (`ContentMatch` instances) with transitions
-	// between them.
-	function dfa(nfa) {
-	  var labeled = Object.create(null);
-	  return explore(nullFrom(nfa, 0))
-
-	  function explore(states) {
-	    var out = [];
-	    states.forEach(function (node) {
-	      nfa[node].forEach(function (ref) {
-	        var term = ref.term;
-	        var to = ref.to;
-
-	        if (!term) { return }
-	        var known = out.indexOf(term), set = known > -1 && out[known + 1];
-	        nullFrom(nfa, to).forEach(function (node) {
-	          if (!set) { out.push(term, set = []); }
-	          if (set.indexOf(node) == -1) { set.push(node); }
-	        });
-	      });
-	    });
-	    var state = labeled[states.join(",")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);
-	    for (var i = 0; i < out.length; i += 2) {
-	      var states$1 = out[i + 1].sort(cmp);
-	      state.next.push(out[i], labeled[states$1.join(",")] || explore(states$1));
-	    }
-	    return state
-	  }
-	}
-
-	function checkForDeadEnds(match, stream) {
-	  for (var i = 0, work = [match]; i < work.length; i++) {
-	    var state = work[i], dead = !state.validEnd, nodes = [];
-	    for (var j = 0; j < state.next.length; j += 2) {
-	      var node = state.next[j], next = state.next[j + 1];
-	      nodes.push(node.name);
-	      if (dead && !(node.isText || node.hasRequiredAttrs())) { dead = false; }
-	      if (work.indexOf(next) == -1) { work.push(next); }
-	    }
-	    if (dead) { stream.err("Only non-generatable nodes (" + nodes.join(", ") + ") in a required position"); }
-	  }
-	}
-
-	// For node types where all attrs have a default value (or which don't
-	// have any attributes), build up a single reusable default attribute
-	// object, and use it for all nodes that don't specify specific
-	// attributes.
-	function defaultAttrs(attrs) {
-	  var defaults = Object.create(null);
-	  for (var attrName in attrs) {
-	    var attr = attrs[attrName];
-	    if (!attr.hasDefault) { return null }
-	    defaults[attrName] = attr.default;
-	  }
-	  return defaults
-	}
-
-	function computeAttrs(attrs, value) {
-	  var built = Object.create(null);
-	  for (var name in attrs) {
-	    var given = value && value[name];
-	    if (given === undefined) {
-	      var attr = attrs[name];
-	      if (attr.hasDefault) { given = attr.default; }
-	      else { throw new RangeError("No value supplied for attribute " + name) }
-	    }
-	    built[name] = given;
-	  }
-	  return built
-	}
-
-	function initAttrs(attrs) {
-	  var result = Object.create(null);
-	  if (attrs) { for (var name in attrs) { result[name] = new Attribute(attrs[name]); } }
-	  return result
-	}
-
-	// ::- Node types are objects allocated once per `Schema` and used to
-	// [tag](#model.Node.type) `Node` instances. They contain information
-	// about the node type, such as its name and what kind of node it
-	// represents.
-	var NodeType = function NodeType(name, schema, spec) {
-	  // :: string
-	  // The name the node type has in this schema.
-	  this.name = name;
-
-	  // :: Schema
-	  // A link back to the `Schema` the node type belongs to.
-	  this.schema = schema;
-
-	  // :: NodeSpec
-	  // The spec that this type is based on
-	  this.spec = spec;
-
-	  this.groups = spec.group ? spec.group.split(" ") : [];
-	  this.attrs = initAttrs(spec.attrs);
-
-	  this.defaultAttrs = defaultAttrs(this.attrs);
-
-	  // :: ContentMatch
-	  // The starting match of the node type's content expression.
-	  this.contentMatch = null;
-
-	  // : ?[MarkType]
-	  // The set of marks allowed in this node. `null` means all marks
-	  // are allowed.
-	  this.markSet = null;
-
-	  // :: bool
-	  // True if this node type has inline content.
-	  this.inlineContent = null;
-
-	  // :: bool
-	  // True if this is a block type
-	  this.isBlock = !(spec.inline || name == "text");
-
-	  // :: bool
-	  // True if this is the text node type.
-	  this.isText = name == "text";
-	};
-
-	var prototypeAccessors$4 = { isInline: {},isTextblock: {},isLeaf: {},isAtom: {} };
-
-	// :: bool
-	// True if this is an inline type.
-	prototypeAccessors$4.isInline.get = function () { return !this.isBlock };
-
-	// :: bool
-	// True if this is a textblock type, a block that contains inline
-	// content.
-	prototypeAccessors$4.isTextblock.get = function () { return this.isBlock && this.inlineContent };
-
-	// :: bool
-	// True for node types that allow no content.
-	prototypeAccessors$4.isLeaf.get = function () { return this.contentMatch == ContentMatch.empty };
-
-	// :: bool
-	// True when this node is an atom, i.e. when it does not have
-	// directly editable content.
-	prototypeAccessors$4.isAtom.get = function () { return this.isLeaf || this.spec.atom };
-
-	NodeType.prototype.hasRequiredAttrs = function hasRequiredAttrs (ignore) {
-	    var this$1 = this;
-
-	  for (var n in this$1.attrs)
-	    { if (this$1.attrs[n].isRequired && (!ignore || !(n in ignore))) { return true } }
-	  return false
-	};
-
-	NodeType.prototype.compatibleContent = function compatibleContent (other) {
-	  return this == other || this.contentMatch.compatible(other.contentMatch)
-	};
-
-	NodeType.prototype.computeAttrs = function computeAttrs$1 (attrs) {
-	  if (!attrs && this.defaultAttrs) { return this.defaultAttrs }
-	  else { return computeAttrs(this.attrs, attrs) }
-	};
-
-	// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-	// Create a `Node` of this type. The given attributes are
-	// checked and defaulted (you can pass `null` to use the type's
-	// defaults entirely, if no required attributes exist). `content`
-	// may be a `Fragment`, a node, an array of nodes, or
-	// `null`. Similarly `marks` may be `null` to default to the empty
-	// set of marks.
-	NodeType.prototype.create = function create (attrs, content, marks) {
-	  if (this.isText) { throw new Error("NodeType.create can't construct text nodes") }
-	  return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))
-	};
-
-	// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-	// Like [`create`](#model.NodeType.create), but check the given content
-	// against the node type's content restrictions, and throw an error
-	// if it doesn't match.
-	NodeType.prototype.createChecked = function createChecked (attrs, content, marks) {
-	  content = Fragment.from(content);
-	  if (!this.validContent(content))
-	    { throw new RangeError("Invalid content for node " + this.name) }
-	  return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))
-	};
-
-	// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → ?Node
-	// Like [`create`](#model.NodeType.create), but see if it is necessary to
-	// add nodes to the start or end of the given fragment to make it
-	// fit the node. If no fitting wrapping can be found, return null.
-	// Note that, due to the fact that required nodes can always be
-	// created, this will always succeed if you pass null or
-	// `Fragment.empty` as content.
-	NodeType.prototype.createAndFill = function createAndFill (attrs, content, marks) {
-	  attrs = this.computeAttrs(attrs);
-	  content = Fragment.from(content);
-	  if (content.size) {
-	    var before = this.contentMatch.fillBefore(content);
-	    if (!before) { return null }
-	    content = before.append(content);
-	  }
-	  var after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true);
-	  if (!after) { return null }
-	  return new Node(this, attrs, content.append(after), Mark.setFrom(marks))
-	};
-
-	// :: (Fragment) → bool
-	// Returns true if the given fragment is valid content for this node
-	// type with the given attributes.
-	NodeType.prototype.validContent = function validContent (content) {
-	    var this$1 = this;
-
-	  var result = this.contentMatch.matchFragment(content);
-	  if (!result || !result.validEnd) { return false }
-	  for (var i = 0; i < content.childCount; i++)
-	    { if (!this$1.allowsMarks(content.child(i).marks)) { return false } }
-	  return true
-	};
-
-	// :: (MarkType) → bool
-	// Check whether the given mark type is allowed in this node.
-	NodeType.prototype.allowsMarkType = function allowsMarkType (markType) {
-	  return this.markSet == null || this.markSet.indexOf(markType) > -1
-	};
-
-	// :: ([Mark]) → bool
-	// Test whether the given set of marks are allowed in this node.
-	NodeType.prototype.allowsMarks = function allowsMarks (marks) {
-	    var this$1 = this;
-
-	  if (this.markSet == null) { return true }
-	  for (var i = 0; i < marks.length; i++) { if (!this$1.allowsMarkType(marks[i].type)) { return false } }
-	  return true
-	};
-
-	// :: ([Mark]) → [Mark]
-	// Removes the marks that are not allowed in this node from the given set.
-	NodeType.prototype.allowedMarks = function allowedMarks (marks) {
-	    var this$1 = this;
-
-	  if (this.markSet == null) { return marks }
-	  var copy;
-	  for (var i = 0; i < marks.length; i++) {
-	    if (!this$1.allowsMarkType(marks[i].type)) {
-	      if (!copy) { copy = marks.slice(0, i); }
-	    } else if (copy) {
-	      copy.push(marks[i]);
-	    }
-	  }
-	  return !copy ? marks : copy.length ? copy : Mark.empty
-	};
-
-	NodeType.compile = function compile (nodes, schema) {
-	  var result = Object.create(null);
-	  nodes.forEach(function (name, spec) { return result[name] = new NodeType(name, schema, spec); });
-
-	  var topType = schema.spec.topNode || "doc";
-	  if (!result[topType]) { throw new RangeError("Schema is missing its top node type ('" + topType + "')") }
-	  if (!result.text) { throw new RangeError("Every schema needs a 'text' type") }
-	  for (var _ in result.text.attrs) { throw new RangeError("The text node type should not have attributes") }
-
-	  return result
-	};
-
-	Object.defineProperties( NodeType.prototype, prototypeAccessors$4 );
-
-	// Attribute descriptors
-
-	var Attribute = function Attribute(options) {
-	  this.hasDefault = Object.prototype.hasOwnProperty.call(options, "default");
-	  this.default = options.default;
-	};
-
-	var prototypeAccessors$1$2 = { isRequired: {} };
-
-	prototypeAccessors$1$2.isRequired.get = function () {
-	  return !this.hasDefault
-	};
-
-	Object.defineProperties( Attribute.prototype, prototypeAccessors$1$2 );
-
-	// Marks
-
-	// ::- Like nodes, marks (which are associated with nodes to signify
-	// things like emphasis or being part of a link) are
-	// [tagged](#model.Mark.type) with type objects, which are
-	// instantiated once per `Schema`.
-	var MarkType = function MarkType(name, rank, schema, spec) {
-	  // :: string
-	  // The name of the mark type.
-	  this.name = name;
-
-	  // :: Schema
-	  // The schema that this mark type instance is part of.
-	  this.schema = schema;
-
-	  // :: MarkSpec
-	  // The spec on which the type is based.
-	  this.spec = spec;
-
-	  this.attrs = initAttrs(spec.attrs);
-
-	  this.rank = rank;
-	  this.excluded = null;
-	  var defaults = defaultAttrs(this.attrs);
-	  this.instance = defaults && new Mark(this, defaults);
-	};
-
-	// :: (?Object) → Mark
-	// Create a mark of this type. `attrs` may be `null` or an object
-	// containing only some of the mark's attributes. The others, if
-	// they have defaults, will be added.
-	MarkType.prototype.create = function create (attrs) {
-	  if (!attrs && this.instance) { return this.instance }
-	  return new Mark(this, computeAttrs(this.attrs, attrs))
-	};
-
-	MarkType.compile = function compile (marks, schema) {
-	  var result = Object.create(null), rank = 0;
-	  marks.forEach(function (name, spec) { return result[name] = new MarkType(name, rank++, schema, spec); });
-	  return result
-	};
-
-	// :: ([Mark]) → [Mark]
-	// When there is a mark of this type in the given set, a new set
-	// without it is returned. Otherwise, the input set is returned.
-	MarkType.prototype.removeFromSet = function removeFromSet (set) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < set.length; i++)
-	    { if (set[i].type == this$1)
-	      { return set.slice(0, i).concat(set.slice(i + 1)) } }
-	  return set
-	};
-
-	// :: ([Mark]) → ?Mark
-	// Tests whether there is a mark of this type in the given set.
-	MarkType.prototype.isInSet = function isInSet (set) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < set.length; i++)
-	    { if (set[i].type == this$1) { return set[i] } }
-	};
-
-	// :: (MarkType) → bool
-	// Queries whether a given mark type is
-	// [excluded](#model.MarkSpec.excludes) by this one.
-	MarkType.prototype.excludes = function excludes (other) {
-	  return this.excluded.indexOf(other) > -1
-	};
-
-	// SchemaSpec:: interface
-	// An object describing a schema, as passed to the [`Schema`](#model.Schema)
-	// constructor.
-	//
-	//   nodes:: union<Object<NodeSpec>, OrderedMap<NodeSpec>>
-	//   The node types in this schema. Maps names to
-	//   [`NodeSpec`](#model.NodeSpec) objects that describe the node type
-	//   associated with that name. Their order is significant—it
-	//   determines which [parse rules](#model.NodeSpec.parseDOM) take
-	//   precedence by default, and which nodes come first in a given
-	//   [group](#model.NodeSpec.group).
-	//
-	//   marks:: ?union<Object<MarkSpec>, OrderedMap<MarkSpec>>
-	//   The mark types that exist in this schema. The order in which they
-	//   are provided determines the order in which [mark
-	//   sets](#model.Mark.addToSet) are sorted and in which [parse
-	//   rules](#model.MarkSpec.parseDOM) are tried.
-	//
-	//   topNode:: ?string
-	//   The name of the default top-level node for the schema. Defaults
-	//   to `"doc"`.
-
-	// NodeSpec:: interface
-	//
-	//   content:: ?string
-	//   The content expression for this node, as described in the [schema
-	//   guide](/docs/guide/#schema.content_expressions). When not given,
-	//   the node does not allow any content.
-	//
-	//   marks:: ?string
-	//   The marks that are allowed inside of this node. May be a
-	//   space-separated string referring to mark names or groups, `"_"`
-	//   to explicitly allow all marks, or `""` to disallow marks. When
-	//   not given, nodes with inline content default to allowing all
-	//   marks, other nodes default to not allowing marks.
-	//
-	//   group:: ?string
-	//   The group or space-separated groups to which this node belongs,
-	//   which can be referred to in the content expressions for the
-	//   schema.
-	//
-	//   inline:: ?bool
-	//   Should be set to true for inline nodes. (Implied for text nodes.)
-	//
-	//   atom:: ?bool
-	//   Can be set to true to indicate that, though this isn't a [leaf
-	//   node](#model.NodeType.isLeaf), it doesn't have directly editable
-	//   content and should be treated as a single unit in the view.
-	//
-	//   attrs:: ?Object<AttributeSpec>
-	//   The attributes that nodes of this type get.
-	//
-	//   selectable:: ?bool
-	//   Controls whether nodes of this type can be selected as a [node
-	//   selection](#state.NodeSelection). Defaults to true for non-text
-	//   nodes.
-	//
-	//   draggable:: ?bool
-	//   Determines whether nodes of this type can be dragged without
-	//   being selected. Defaults to false.
-	//
-	//   code:: ?bool
-	//   Can be used to indicate that this node contains code, which
-	//   causes some commands to behave differently.
-	//
-	//   defining:: ?bool
-	//   Determines whether this node is considered an important parent
-	//   node during replace operations (such as paste). Non-defining (the
-	//   default) nodes get dropped when their entire content is replaced,
-	//   whereas defining nodes persist and wrap the inserted content.
-	//   Likewise, in _inserted_ content the defining parents of the
-	//   content are preserved when possible. Typically,
-	//   non-default-paragraph textblock types, and possibly list items,
-	//   are marked as defining.
-	//
-	//   isolating:: ?bool
-	//   When enabled (default is false), the sides of nodes of this type
-	//   count as boundaries that regular editing operations, like
-	//   backspacing or lifting, won't cross. An example of a node that
-	//   should probably have this enabled is a table cell.
-	//
-	//   toDOM:: ?(node: Node) → DOMOutputSpec
-	//   Defines the default way a node of this type should be serialized
-	//   to DOM/HTML (as used by
-	//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).
-	//   Should return a DOM node or an [array
-	//   structure](#model.DOMOutputSpec) that describes one, with an
-	//   optional number zero (“hole”) in it to indicate where the node's
-	//   content should be inserted.
-	//
-	//   For text nodes, the default is to create a text DOM node. Though
-	//   it is possible to create a serializer where text is rendered
-	//   differently, this is not supported inside the editor, so you
-	//   shouldn't override that in your text node spec.
-	//
-	//   parseDOM:: ?[ParseRule]
-	//   Associates DOM parser information with this node, which can be
-	//   used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to
-	//   automatically derive a parser. The `node` field in the rules is
-	//   implied (the name of this node will be filled in automatically).
-	//   If you supply your own parser, you do not need to also specify
-	//   parsing rules in your schema.
-	//
-	//   toDebugString:: ?(node: Node) -> string
-	//   Defines the default way a node of this type should be serialized
-	//   to a string representation for debugging (e.g. in error messages).
-
-	// MarkSpec:: interface
-	//
-	//   attrs:: ?Object<AttributeSpec>
-	//   The attributes that marks of this type get.
-	//
-	//   inclusive:: ?bool
-	//   Whether this mark should be active when the cursor is positioned
-	//   at its end (or at its start when that is also the start of the
-	//   parent node). Defaults to true.
-	//
-	//   excludes:: ?string
-	//   Determines which other marks this mark can coexist with. Should
-	//   be a space-separated strings naming other marks or groups of marks.
-	//   When a mark is [added](#model.Mark.addToSet) to a set, all marks
-	//   that it excludes are removed in the process. If the set contains
-	//   any mark that excludes the new mark but is not, itself, excluded
-	//   by the new mark, the mark can not be added an the set. You can
-	//   use the value `"_"` to indicate that the mark excludes all
-	//   marks in the schema.
-	//
-	//   Defaults to only being exclusive with marks of the same type. You
-	//   can set it to an empty string (or any string not containing the
-	//   mark's own name) to allow multiple marks of a given type to
-	//   coexist (as long as they have different attributes).
-	//
-	//   group:: ?string
-	//   The group or space-separated groups to which this mark belongs.
-	//
-	//   toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec
-	//   Defines the default way marks of this type should be serialized
-	//   to DOM/HTML. When the resulting spec contains a hole, that is
-	//   where the marked content is placed. Otherwise, it is appended to
-	//   the top node.
-	//
-	//   parseDOM:: ?[ParseRule]
-	//   Associates DOM parser information with this mark (see the
-	//   corresponding [node spec field](#model.NodeSpec.parseDOM)). The
-	//   `mark` field in the rules is implied.
-
-	// AttributeSpec:: interface
-	//
-	// Used to [define](#model.NodeSpec.attrs) attributes on nodes or
-	// marks.
-	//
-	//   default:: ?any
-	//   The default value for this attribute, to use when no explicit
-	//   value is provided. Attributes that have no default must be
-	//   provided whenever a node or mark of a type that has them is
-	//   created.
-
-	// ::- A document schema. Holds [node](#model.NodeType) and [mark
-	// type](#model.MarkType) objects for the nodes and marks that may
-	// occur in conforming documents, and provides functionality for
-	// creating and deserializing such documents.
-	var Schema = function Schema(spec) {
-	  var this$1 = this;
-
-	  // :: SchemaSpec
-	  // The [spec](#model.SchemaSpec) on which the schema is based,
-	  // with the added guarantee that its `nodes` and `marks`
-	  // properties are
-	  // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances
-	  // (not raw objects).
-	  this.spec = {};
-	  for (var prop in spec) { this$1.spec[prop] = spec[prop]; }
-	  this.spec.nodes = OrderedMap.from(spec.nodes);
-	  this.spec.marks = OrderedMap.from(spec.marks);
-
-	  // :: Object<NodeType>
-	  // An object mapping the schema's node names to node type objects.
-	  this.nodes = NodeType.compile(this.spec.nodes, this);
-
-	  // :: Object<MarkType>
-	  // A map from mark names to mark type objects.
-	  this.marks = MarkType.compile(this.spec.marks, this);
-
-	  var contentExprCache = Object.create(null);
-	  for (var prop$1 in this$1.nodes) {
-	    if (prop$1 in this$1.marks)
-	      { throw new RangeError(prop$1 + " can not be both a node and a mark") }
-	    var type = this$1.nodes[prop$1], contentExpr = type.spec.content || "", markExpr = type.spec.marks;
-	    type.contentMatch = contentExprCache[contentExpr] ||
-	      (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this$1.nodes));
-	    type.inlineContent = type.contentMatch.inlineContent;
-	    type.markSet = markExpr == "_" ? null :
-	      markExpr ? gatherMarks(this$1, markExpr.split(" ")) :
-	      markExpr == "" || !type.inlineContent ? [] : null;
-	  }
-	  for (var prop$2 in this$1.marks) {
-	    var type$1 = this$1.marks[prop$2], excl = type$1.spec.excludes;
-	    type$1.excluded = excl == null ? [type$1] : excl == "" ? [] : gatherMarks(this$1, excl.split(" "));
-	  }
-
-	  this.nodeFromJSON = this.nodeFromJSON.bind(this);
-	  this.markFromJSON = this.markFromJSON.bind(this);
-
-	  // :: NodeType
-	  // The type of the [default top node](#model.SchemaSpec.topNode)
-	  // for this schema.
-	  this.topNodeType = this.nodes[this.spec.topNode || "doc"];
-
-	  // :: Object
-	  // An object for storing whatever values modules may want to
-	  // compute and cache per schema. (If you want to store something
-	  // in it, try to use property names unlikely to clash.)
-	  this.cached = Object.create(null);
-	  this.cached.wrappings = Object.create(null);
-	};
-
-	// :: (union<string, NodeType>, ?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node
-	// Create a node in this schema. The `type` may be a string or a
-	// `NodeType` instance. Attributes will be extended
-	// with defaults, `content` may be a `Fragment`,
-	// `null`, a `Node`, or an array of nodes.
-	Schema.prototype.node = function node (type, attrs, content, marks) {
-	  if (typeof type == "string")
-	    { type = this.nodeType(type); }
-	  else if (!(type instanceof NodeType))
-	    { throw new RangeError("Invalid node type: " + type) }
-	  else if (type.schema != this)
-	    { throw new RangeError("Node type from different schema used (" + type.name + ")") }
-
-	  return type.createChecked(attrs, content, marks)
-	};
-
-	// :: (string, ?[Mark]) → Node
-	// Create a text node in the schema. Empty text nodes are not
-	// allowed.
-	Schema.prototype.text = function text (text$1, marks) {
-	  var type = this.nodes.text;
-	  return new TextNode(type, type.defaultAttrs, text$1, Mark.setFrom(marks))
-	};
-
-	// :: (union<string, MarkType>, ?Object) → Mark
-	// Create a mark with the given type and attributes.
-	Schema.prototype.mark = function mark (type, attrs) {
-	  if (typeof type == "string") { type = this.marks[type]; }
-	  return type.create(attrs)
-	};
-
-	// :: (Object) → Node
-	// Deserialize a node from its JSON representation. This method is
-	// bound.
-	Schema.prototype.nodeFromJSON = function nodeFromJSON (json) {
-	  return Node.fromJSON(this, json)
-	};
-
-	// :: (Object) → Mark
-	// Deserialize a mark from its JSON representation. This method is
-	// bound.
-	Schema.prototype.markFromJSON = function markFromJSON (json) {
-	  return Mark.fromJSON(this, json)
-	};
-
-	Schema.prototype.nodeType = function nodeType (name) {
-	  var found = this.nodes[name];
-	  if (!found) { throw new RangeError("Unknown node type: " + name) }
-	  return found
-	};
-
-	function gatherMarks(schema, marks) {
-	  var found = [];
-	  for (var i = 0; i < marks.length; i++) {
-	    var name = marks[i], mark = schema.marks[name], ok = mark;
-	    if (mark) {
-	      found.push(mark);
-	    } else {
-	      for (var prop in schema.marks) {
-	        var mark$1 = schema.marks[prop];
-	        if (name == "_" || (mark$1.spec.group && mark$1.spec.group.split(" ").indexOf(name) > -1))
-	          { found.push(ok = mark$1); }
-	      }
-	    }
-	    if (!ok) { throw new SyntaxError("Unknown mark type: '" + marks[i] + "'") }
-	  }
-	  return found
-	}
-
-	// ParseOptions:: interface
-	// These are the options recognized by the
-	// [`parse`](#model.DOMParser.parse) and
-	// [`parseSlice`](#model.DOMParser.parseSlice) methods.
-	//
-	//   preserveWhitespace:: ?union<bool, "full">
-	//   By default, whitespace is collapsed as per HTML's rules. Pass
-	//   `true` to preserve whitespace, but normalize newlines to
-	//   spaces, and `"full"` to preserve whitespace entirely.
-	//
-	//   findPositions:: ?[{node: dom.Node, offset: number}]
-	//   When given, the parser will, beside parsing the content,
-	//   record the document positions of the given DOM positions. It
-	//   will do so by writing to the objects, adding a `pos` property
-	//   that holds the document position. DOM positions that are not
-	//   in the parsed content will not be written to.
-	//
-	//   from:: ?number
-	//   The child node index to start parsing from.
-	//
-	//   to:: ?number
-	//   The child node index to stop parsing at.
-	//
-	//   topNode:: ?Node
-	//   By default, the content is parsed into the schema's default
-	//   [top node type](#model.Schema.topNodeType). You can pass this
-	//   option to use the type and attributes from a different node
-	//   as the top container.
-	//
-	//   topMatch:: ?ContentMatch
-	//   Provide the starting content match that content parsed into the
-	//   top node is matched against.
-	//
-	//   context:: ?ResolvedPos
-	//   A set of additional nodes to count as
-	//   [context](#model.ParseRule.context) when parsing, above the
-	//   given [top node](#model.ParseOptions.topNode).
-
-	// ParseRule:: interface
-	// A value that describes how to parse a given DOM node or inline
-	// style as a ProseMirror node or mark.
-	//
-	//   tag:: ?string
-	//   A CSS selector describing the kind of DOM elements to match. A
-	//   single rule should have _either_ a `tag` or a `style` property.
-	//
-	//   namespace:: ?string
-	//   The namespace to match. This should be used with `tag`.
-	//   Nodes are only matched when the namespace matches or this property
-	//   is null.
-	//
-	//   style:: ?string
-	//   A CSS property name to match. When given, this rule matches
-	//   inline styles that list that property. May also have the form
-	//   `"property=value"`, in which case the rule only matches if the
-	//   propery's value exactly matches the given value. (For more
-	//   complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)
-	//   and return undefined to indicate that the match failed.)
-	//
-	//   priority:: ?number
-	//   Can be used to change the order in which the parse rules in a
-	//   schema are tried. Those with higher priority come first. Rules
-	//   without a priority are counted as having priority 50. This
-	//   property is only meaningful in a schema—when directly
-	//   constructing a parser, the order of the rule array is used.
-	//
-	//   context:: ?string
-	//   When given, restricts this rule to only match when the current
-	//   context—the parent nodes into which the content is being
-	//   parsed—matches this expression. Should contain one or more node
-	//   names or node group names followed by single or double slashes.
-	//   For example `"paragraph/"` means the rule only matches when the
-	//   parent node is a paragraph, `"blockquote/paragraph/"` restricts
-	//   it to be in a paragraph that is inside a blockquote, and
-	//   `"section//"` matches any position inside a section—a double
-	//   slash matches any sequence of ancestor nodes. To allow multiple
-	//   different contexts, they can be separated by a pipe (`|`)
-	//   character, as in `"blockquote/|list_item/"`.
-	//
-	//   node:: ?string
-	//   The name of the node type to create when this rule matches. Only
-	//   valid for rules with a `tag` property, not for style rules. Each
-	//   rule should have one of a `node`, `mark`, or `ignore` property
-	//   (except when it appears in a [node](#model.NodeSpec.parseDOM) or
-	//   [mark spec](#model.MarkSpec.parseDOM), in which case the `node`
-	//   or `mark` property will be derived from its position).
-	//
-	//   mark:: ?string
-	//   The name of the mark type to wrap the matched content in.
-	//
-	//   ignore:: ?bool
-	//   When true, ignore content that matches this rule.
-	//
-	//   skip:: ?bool
-	//   When true, ignore the node that matches this rule, but do parse
-	//   its content.
-	//
-	//   attrs:: ?Object
-	//   Attributes for the node or mark created by this rule. When
-	//   `getAttrs` is provided, it takes precedence.
-	//
-	//   getAttrs:: ?(union<dom.Node, string>) → ?union<Object, false>
-	//   A function used to compute the attributes for the node or mark
-	//   created by this rule. Can also be used to describe further
-	//   conditions the DOM element or style must match. When it returns
-	//   `false`, the rule won't match. When it returns null or undefined,
-	//   that is interpreted as an empty/default set of attributes.
-	//
-	//   Called with a DOM Element for `tag` rules, and with a string (the
-	//   style's value) for `style` rules.
-	//
-	//   contentElement:: ?union<string, (dom.Node) → dom.Node>
-	//   For `tag` rules that produce non-leaf nodes or marks, by default
-	//   the content of the DOM element is parsed as content of the mark
-	//   or node. If the child nodes are in a descendent node, this may be
-	//   a CSS selector string that the parser must use to find the actual
-	//   content element, or a function that returns the actual content
-	//   element to the parser.
-	//
-	//   getContent:: ?(dom.Node, schema: Schema) → Fragment
-	//   Can be used to override the content of a matched node. When
-	//   present, instead of parsing the node's child nodes, the result of
-	//   this function is used.
-	//
-	//   preserveWhitespace:: ?union<bool, "full">
-	//   Controls whether whitespace should be preserved when parsing the
-	//   content inside the matched element. `false` means whitespace may
-	//   be collapsed, `true` means that whitespace should be preserved
-	//   but newlines normalized to spaces, and `"full"` means that
-	//   newlines should also be preserved.
-
-	// ::- A DOM parser represents a strategy for parsing DOM content into
-	// a ProseMirror document conforming to a given schema. Its behavior
-	// is defined by an array of [rules](#model.ParseRule).
-	var DOMParser = function DOMParser(schema, rules) {
-	  var this$1 = this;
-
-	  // :: Schema
-	  // The schema into which the parser parses.
-	  this.schema = schema;
-	  // :: [ParseRule]
-	  // The set of [parse rules](#model.ParseRule) that the parser
-	  // uses, in order of precedence.
-	  this.rules = rules;
-	  this.tags = [];
-	  this.styles = [];
-
-	  rules.forEach(function (rule) {
-	    if (rule.tag) { this$1.tags.push(rule); }
-	    else if (rule.style) { this$1.styles.push(rule); }
-	  });
-	};
-
-	// :: (dom.Node, ?ParseOptions) → Node
-	// Parse a document from the content of a DOM node.
-	DOMParser.prototype.parse = function parse (dom, options) {
-	    if ( options === void 0 ) { options = {}; }
-
-	  var context = new ParseContext(this, options, false);
-	  context.addAll(dom, null, options.from, options.to);
-	  return context.finish()
-	};
-
-	// :: (dom.Node, ?ParseOptions) → Slice
-	// Parses the content of the given DOM node, like
-	// [`parse`](#model.DOMParser.parse), and takes the same set of
-	// options. But unlike that method, which produces a whole node,
-	// this one returns a slice that is open at the sides, meaning that
-	// the schema constraints aren't applied to the start of nodes to
-	// the left of the input and the end of nodes at the end.
-	DOMParser.prototype.parseSlice = function parseSlice (dom, options) {
-	    if ( options === void 0 ) { options = {}; }
-
-	  var context = new ParseContext(this, options, true);
-	  context.addAll(dom, null, options.from, options.to);
-	  return Slice.maxOpen(context.finish())
-	};
-
-	DOMParser.prototype.matchTag = function matchTag (dom, context) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.tags.length; i++) {
-	    var rule = this$1.tags[i];
-	    if (matches(dom, rule.tag) &&
-	        (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&
-	        (!rule.context || context.matchesContext(rule.context))) {
-	      if (rule.getAttrs) {
-	        var result = rule.getAttrs(dom);
-	        if (result === false) { continue }
-	        rule.attrs = result;
-	      }
-	      return rule
-	    }
-	  }
-	};
-
-	DOMParser.prototype.matchStyle = function matchStyle (prop, value, context) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.styles.length; i++) {
-	    var rule = this$1.styles[i];
-	    if (rule.style.indexOf(prop) != 0 ||
-	        rule.context && !context.matchesContext(rule.context) ||
-	        // Test that the style string either precisely matches the prop,
-	        // or has an '=' sign after the prop, followed by the given
-	        // value.
-	        rule.style.length > prop.length &&
-	        (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))
-	      { continue }
-	    if (rule.getAttrs) {
-	      var result = rule.getAttrs(value);
-	      if (result === false) { continue }
-	      rule.attrs = result;
-	    }
-	    return rule
-	  }
-	};
-
-	// : (Schema) → [ParseRule]
-	DOMParser.schemaRules = function schemaRules (schema) {
-	  var result = [];
-	  function insert(rule) {
-	    var priority = rule.priority == null ? 50 : rule.priority, i = 0;
-	    for (; i < result.length; i++) {
-	      var next = result[i], nextPriority = next.priority == null ? 50 : next.priority;
-	      if (nextPriority < priority) { break }
-	    }
-	    result.splice(i, 0, rule);
-	  }
-
-	  var loop = function ( name ) {
-	    var rules = schema.marks[name].spec.parseDOM;
-	    if (rules) { rules.forEach(function (rule) {
-	      insert(rule = copy(rule));
-	      rule.mark = name;
-	    }); }
-	  };
-
-	    for (var name in schema.marks) { loop( name ); }
-	  var loop$1 = function ( name ) {
-	    var rules$1 = schema.nodes[name$1].spec.parseDOM;
-	    if (rules$1) { rules$1.forEach(function (rule) {
-	      insert(rule = copy(rule));
-	      rule.node = name$1;
-	    }); }
-	  };
-
-	    for (var name$1 in schema.nodes) { loop$1( name ); }
-	  return result
-	};
-
-	// :: (Schema) → DOMParser
-	// Construct a DOM parser using the parsing rules listed in a
-	// schema's [node specs](#model.NodeSpec.parseDOM), reordered by
-	// [priority](#model.ParseRule.priority).
-	DOMParser.fromSchema = function fromSchema (schema) {
-	  return schema.cached.domParser ||
-	    (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))
-	};
-
-	// : Object<bool> The block-level tags in HTML5
-	var blockTags = {
-	  address: true, article: true, aside: true, blockquote: true, canvas: true,
-	  dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,
-	  footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,
-	  h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,
-	  output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true
-	};
-
-	// : Object<bool> The tags that we normally ignore.
-	var ignoreTags = {
-	  head: true, noscript: true, object: true, script: true, style: true, title: true
-	};
-
-	// : Object<bool> List tags.
-	var listTags = {ol: true, ul: true};
-
-	// Using a bitfield for node context options
-	var OPT_PRESERVE_WS = 1;
-	var OPT_PRESERVE_WS_FULL = 2;
-	var OPT_OPEN_LEFT = 4;
-
-	function wsOptionsFor(preserveWhitespace) {
-	  return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === "full" ? OPT_PRESERVE_WS_FULL : 0)
-	}
-
-	var NodeContext = function NodeContext(type, attrs, marks, solid, match, options) {
-	  this.type = type;
-	  this.attrs = attrs;
-	  this.solid = solid;
-	  this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);
-	  this.options = options;
-	  this.content = [];
-	  this.marks = marks;
-	  this.activeMarks = Mark.none;
-	};
-
-	NodeContext.prototype.findWrapping = function findWrapping (node) {
-	  if (!this.match) {
-	    if (!this.type) { return [] }
-	    var fill = this.type.contentMatch.fillBefore(Fragment.from(node));
-	    if (fill) {
-	      this.match = this.type.contentMatch.matchFragment(fill);
-	    } else {
-	      var start = this.type.contentMatch, wrap;
-	      if (wrap = start.findWrapping(node.type)) {
-	        this.match = start;
-	        return wrap
-	      } else {
-	        return null
-	      }
-	    }
-	  }
-	  return this.match.findWrapping(node.type)
-	};
-
-	NodeContext.prototype.finish = function finish (openEnd) {
-	  if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace
-	    var last = this.content[this.content.length - 1], m;
-	    if (last && last.isText && (m = /\s+$/.exec(last.text))) {
-	      if (last.text.length == m[0].length) { this.content.pop(); }
-	      else { this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length)); }
-	    }
-	  }
-	  var content = Fragment.from(this.content);
-	  if (!openEnd && this.match)
-	    { content = content.append(this.match.fillBefore(Fragment.empty, true)); }
-	  return this.type ? this.type.create(this.attrs, content, this.marks) : content
-	};
-
-	var ParseContext = function ParseContext(parser, options, open) {
-	  // : DOMParser The parser we are using.
-	  this.parser = parser;
-	  // : Object The options passed to this parse.
-	  this.options = options;
-	  this.isOpen = open;
-	  this.pendingMarks = [];
-	  var topNode = options.topNode, topContext;
-	  var topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0);
-	  if (topNode)
-	    { topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, true,
-	                                 options.topMatch || topNode.type.contentMatch, topOptions); }
-	  else if (open)
-	    { topContext = new NodeContext(null, null, Mark.none, true, null, topOptions); }
-	  else
-	    { topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, true, null, topOptions); }
-	  this.nodes = [topContext];
-	  // : [Mark] The current set of marks
-	  this.open = 0;
-	  this.find = options.findPositions;
-	  this.needsBlock = false;
-	};
-
-	var prototypeAccessors$6 = { top: {},currentPos: {} };
-
-	prototypeAccessors$6.top.get = function () {
-	  return this.nodes[this.open]
-	};
-
-	// : (dom.Node)
-	// Add a DOM node to the content. Text is inserted as text node,
-	// otherwise, the node is passed to `addElement` or, if it has a
-	// `style` attribute, `addElementWithStyles`.
-	ParseContext.prototype.addDOM = function addDOM (dom) {
-	    var this$1 = this;
-
-	  if (dom.nodeType == 3) {
-	    this.addTextNode(dom);
-	  } else if (dom.nodeType == 1) {
-	    var style = dom.getAttribute("style");
-	    var marks = style ? this.readStyles(parseStyles(style)) : null;
-	    if (marks != null) { for (var i = 0; i < marks.length; i++) { this$1.addPendingMark(marks[i]); } }
-	    this.addElement(dom);
-	    if (marks != null) { for (var i$1 = 0; i$1 < marks.length; i$1++) { this$1.removePendingMark(marks[i$1]); } }
-	  }
-	};
-
-	ParseContext.prototype.addTextNode = function addTextNode (dom) {
-	  var value = dom.nodeValue;
-	  var top = this.top;
-	  if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /\S/.test(value)) {
-	    if (!(top.options & OPT_PRESERVE_WS)) {
-	      value = value.replace(/\s+/g, " ");
-	      // If this starts with whitespace, and there is either no node
-	      // before it or a node that ends with whitespace, strip the
-	      // leading space.
-	      if (/^\s/.test(value) && this.open == this.nodes.length - 1) {
-	        var nodeBefore = top.content[top.content.length - 1];
-	        if (!nodeBefore || nodeBefore.isText && /\s$/.test(nodeBefore.text))
-	          { value = value.slice(1); }
-	      }
-	    } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {
-	      value = value.replace(/\r?\n|\r/g, " ");
-	    }
-	    if (value) { this.insertNode(this.parser.schema.text(value)); }
-	    this.findInText(dom);
-	  } else {
-	    this.findInside(dom);
-	  }
-	};
-
-	// : (dom.Element)
-	// Try to find a handler for the given tag and use that to parse. If
-	// none is found, the element's content nodes are added directly.
-	ParseContext.prototype.addElement = function addElement (dom) {
-	  var name = dom.nodeName.toLowerCase();
-	  if (listTags.hasOwnProperty(name)) { normalizeList(dom); }
-	  var rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) || this.parser.matchTag(dom, this);
-	  if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
-	    this.findInside(dom);
-	  } else if (!rule || rule.skip) {
-	    if (rule && rule.skip.nodeType) { dom = rule.skip; }
-	    var sync, top = this.top, oldNeedsBlock = this.needsBlock;
-	    if (blockTags.hasOwnProperty(name)) {
-	      sync = true;
-	      if (!top.type) { this.needsBlock = true; }
-	    }
-	    this.addAll(dom);
-	    if (sync) { this.sync(top); }
-	    this.needsBlock = oldNeedsBlock;
-	  } else {
-	    this.addElementByRule(dom, rule);
-	  }
-	};
-
-	// Run any style parser associated with the node's styles. Either
-	// return an array of marks, or null to indicate some of the styles
-	// had a rule with `ignore` set.
-	ParseContext.prototype.readStyles = function readStyles (styles) {
-	    var this$1 = this;
-
-	  var marks = Mark.none;
-	  for (var i = 0; i < styles.length; i += 2) {
-	    var rule = this$1.parser.matchStyle(styles[i], styles[i + 1], this$1);
-	    if (!rule) { continue }
-	    if (rule.ignore) { return null }
-	    marks = this$1.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks);
-	  }
-	  return marks
-	};
-
-	// : (dom.Element, ParseRule) → bool
-	// Look up a handler for the given node. If none are found, return
-	// false. Otherwise, apply it, use its return value to drive the way
-	// the node's content is wrapped, and return true.
-	ParseContext.prototype.addElementByRule = function addElementByRule (dom, rule) {
-	    var this$1 = this;
-
-	  var sync, nodeType, markType, mark;
-	  if (rule.node) {
-	    nodeType = this.parser.schema.nodes[rule.node];
-	    if (nodeType.isLeaf) { this.insertNode(nodeType.create(rule.attrs)); }
-	    else { sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace); }
-	  } else {
-	    markType = this.parser.schema.marks[rule.mark];
-	    mark = markType.create(rule.attrs);
-	    this.addPendingMark(mark);
-	  }
-	  var startIn = this.top;
-
-	  if (nodeType && nodeType.isLeaf) {
-	    this.findInside(dom);
-	  } else if (rule.getContent) {
-	    this.findInside(dom);
-	    rule.getContent(dom, this.parser.schema).forEach(function (node) { return this$1.insertNode(node); });
-	  } else {
-	    var contentDOM = rule.contentElement;
-	    if (typeof contentDOM == "string") { contentDOM = dom.querySelector(contentDOM); }
-	    else if (typeof contentDOM == "function") { contentDOM = contentDOM(dom); }
-	    if (!contentDOM) { contentDOM = dom; }
-	    this.findAround(dom, contentDOM, true);
-	    this.addAll(contentDOM, sync);
-	  }
-	  if (sync) { this.sync(startIn); this.open--; }
-	  if (mark) { this.removePendingMark(mark); }
-	  return true
-	};
-
-	// : (dom.Node, ?NodeBuilder, ?number, ?number)
-	// Add all child nodes between `startIndex` and `endIndex` (or the
-	// whole node, if not given). If `sync` is passed, use it to
-	// synchronize after every block element.
-	ParseContext.prototype.addAll = function addAll (parent, sync, startIndex, endIndex) {
-	    var this$1 = this;
-
-	  var index = startIndex || 0;
-	  for (var dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,
-	           end = endIndex == null ? null : parent.childNodes[endIndex];
-	       dom != end; dom = dom.nextSibling, ++index) {
-	    this$1.findAtPoint(parent, index);
-	    this$1.addDOM(dom);
-	    if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))
-	      { this$1.sync(sync); }
-	  }
-	  this.findAtPoint(parent, index);
-	};
-
-	// Try to find a way to fit the given node type into the current
-	// context. May add intermediate wrappers and/or leave non-solid
-	// nodes that we're in.
-	ParseContext.prototype.findPlace = function findPlace (node) {
-	    var this$1 = this;
-
-	  var route, sync;
-	  for (var depth = this.open; depth >= 0; depth--) {
-	    var cx = this$1.nodes[depth];
-	    var found = cx.findWrapping(node);
-	    if (found && (!route || route.length > found.length)) {
-	      route = found;
-	      sync = cx;
-	      if (!found.length) { break }
-	    }
-	    if (cx.solid) { break }
-	  }
-	  if (!route) { return false }
-	  this.sync(sync);
-	  for (var i = 0; i < route.length; i++)
-	    { this$1.enterInner(route[i], null, false); }
-	  return true
-	};
-
-	// : (Node) → ?Node
-	// Try to insert the given node, adjusting the context when needed.
-	ParseContext.prototype.insertNode = function insertNode (node) {
-	  if (node.isInline && this.needsBlock && !this.top.type) {
-	    var block = this.textblockFromContext();
-	    if (block) { this.enterInner(block); }
-	  }
-	  if (this.findPlace(node)) {
-	    this.closeExtra();
-	    var top = this.top;
-	    this.applyPendingMarks(top);
-	    if (top.match) { top.match = top.match.matchType(node.type); }
-	    var marks = top.activeMarks;
-	    for (var i = 0; i < node.marks.length; i++)
-	      { if (!top.type || top.type.allowsMarkType(node.marks[i].type))
-	        { marks = node.marks[i].addToSet(marks); } }
-	    top.content.push(node.mark(marks));
-	  }
-	};
-
-	ParseContext.prototype.applyPendingMarks = function applyPendingMarks (top) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.pendingMarks.length; i++) {
-	    var mark = this$1.pendingMarks[i];
-	    if ((!top.type || top.type.allowsMarkType(mark.type)) && !mark.type.isInSet(top.activeMarks)) {
-	      top.activeMarks = mark.addToSet(top.activeMarks);
-	      this$1.pendingMarks.splice(i--, 1);
-	    }
-	  }
-	};
-
-	// : (NodeType, ?Object) → bool
-	// Try to start a node of the given type, adjusting the context when
-	// necessary.
-	ParseContext.prototype.enter = function enter (type, attrs, preserveWS) {
-	  var ok = this.findPlace(type.create(attrs));
-	  if (ok) {
-	    this.applyPendingMarks(this.top);
-	    this.enterInner(type, attrs, true, preserveWS);
-	  }
-	  return ok
-	};
-
-	// Open a node of the given type
-	ParseContext.prototype.enterInner = function enterInner (type, attrs, solid, preserveWS) {
-	  this.closeExtra();
-	  var top = this.top;
-	  top.match = top.match && top.match.matchType(type, attrs);
-	  var options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS);
-	  if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) { options |= OPT_OPEN_LEFT; }
-	  this.nodes.push(new NodeContext(type, attrs, top.activeMarks, solid, null, options));
-	  this.open++;
-	};
-
-	// Make sure all nodes above this.open are finished and added to
-	// their parents
-	ParseContext.prototype.closeExtra = function closeExtra (openEnd) {
-	    var this$1 = this;
-
-	  var i = this.nodes.length - 1;
-	  if (i > this.open) {
-	    for (; i > this.open; i--) { this$1.nodes[i - 1].content.push(this$1.nodes[i].finish(openEnd)); }
-	    this.nodes.length = this.open + 1;
-	  }
-	};
-
-	ParseContext.prototype.finish = function finish () {
-	  this.open = 0;
-	  this.closeExtra(this.isOpen);
-	  return this.nodes[0].finish(this.isOpen || this.options.topOpen)
-	};
-
-	ParseContext.prototype.sync = function sync (to) {
-	    var this$1 = this;
-
-	  for (var i = this.open; i >= 0; i--) { if (this$1.nodes[i] == to) {
-	    this$1.open = i;
-	    return
-	  } }
-	};
-
-	ParseContext.prototype.addPendingMark = function addPendingMark (mark) {
-	  this.pendingMarks.push(mark);
-	};
-
-	ParseContext.prototype.removePendingMark = function removePendingMark (mark) {
-	  var found = this.pendingMarks.lastIndexOf(mark);
-	  if (found > -1) {
-	    this.pendingMarks.splice(found, 1);
-	  } else {
-	    var top = this.top;
-	    top.activeMarks = mark.removeFromSet(top.activeMarks);
-	  }
-	};
-
-	prototypeAccessors$6.currentPos.get = function () {
-	    var this$1 = this;
-
-	  this.closeExtra();
-	  var pos = 0;
-	  for (var i = this.open; i >= 0; i--) {
-	    var content = this$1.nodes[i].content;
-	    for (var j = content.length - 1; j >= 0; j--)
-	      { pos += content[j].nodeSize; }
-	    if (i) { pos++; }
-	  }
-	  return pos
-	};
-
-	ParseContext.prototype.findAtPoint = function findAtPoint (parent, offset) {
-	    var this$1 = this;
-
-	  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-	    if (this$1.find[i].node == parent && this$1.find[i].offset == offset)
-	      { this$1.find[i].pos = this$1.currentPos; }
-	  } }
-	};
-
-	ParseContext.prototype.findInside = function findInside (parent) {
-	    var this$1 = this;
-
-	  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-	    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node))
-	      { this$1.find[i].pos = this$1.currentPos; }
-	  } }
-	};
-
-	ParseContext.prototype.findAround = function findAround (parent, content, before) {
-	    var this$1 = this;
-
-	  if (parent != content && this.find) { for (var i = 0; i < this.find.length; i++) {
-	    if (this$1.find[i].pos == null && parent.nodeType == 1 && parent.contains(this$1.find[i].node)) {
-	      var pos = content.compareDocumentPosition(this$1.find[i].node);
-	      if (pos & (before ? 2 : 4))
-	        { this$1.find[i].pos = this$1.currentPos; }
-	    }
-	  } }
-	};
-
-	ParseContext.prototype.findInText = function findInText (textNode) {
-	    var this$1 = this;
-
-	  if (this.find) { for (var i = 0; i < this.find.length; i++) {
-	    if (this$1.find[i].node == textNode)
-	      { this$1.find[i].pos = this$1.currentPos - (textNode.nodeValue.length - this$1.find[i].offset); }
-	  } }
-	};
-
-	// : (string) → bool
-	// Determines whether the given [context
-	// string](#ParseRule.context) matches this context.
-	ParseContext.prototype.matchesContext = function matchesContext (context) {
-	    var this$1 = this;
-
-	  if (context.indexOf("|") > -1)
-	    { return context.split(/\s*\|\s*/).some(this.matchesContext, this) }
-
-	  var parts = context.split("/");
-	  var option = this.options.context;
-	  var useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);
-	  var minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);
-	  var match = function (i, depth) {
-	    for (; i >= 0; i--) {
-	      var part = parts[i];
-	      if (part == "") {
-	        if (i == parts.length - 1 || i == 0) { continue }
-	        for (; depth >= minDepth; depth--)
-	          { if (match(i - 1, depth)) { return true } }
-	        return false
-	      } else {
-	        var next = depth > 0 || (depth == 0 && useRoot) ? this$1.nodes[depth].type
-	            : option && depth >= minDepth ? option.node(depth - minDepth).type
-	            : null;
-	        if (!next || (next.name != part && next.groups.indexOf(part) == -1))
-	          { return false }
-	        depth--;
-	      }
-	    }
-	    return true
-	  };
-	  return match(parts.length - 1, this.open)
-	};
-
-	ParseContext.prototype.textblockFromContext = function textblockFromContext () {
-	    var this$1 = this;
-
-	  var $context = this.options.context;
-	  if ($context) { for (var d = $context.depth; d >= 0; d--) {
-	    var deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;
-	    if (deflt && deflt.isTextblock && deflt.defaultAttrs) { return deflt }
-	  } }
-	  for (var name in this$1.parser.schema.nodes) {
-	    var type = this$1.parser.schema.nodes[name];
-	    if (type.isTextblock && type.defaultAttrs) { return type }
-	  }
-	};
-
-	Object.defineProperties( ParseContext.prototype, prototypeAccessors$6 );
-
-	// Kludge to work around directly nested list nodes produced by some
-	// tools and allowed by browsers to mean that the nested list is
-	// actually part of the list item above it.
-	function normalizeList(dom) {
-	  for (var child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {
-	    var name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;
-	    if (name && listTags.hasOwnProperty(name) && prevItem) {
-	      prevItem.appendChild(child);
-	      child = prevItem;
-	    } else if (name == "li") {
-	      prevItem = child;
-	    } else if (name) {
-	      prevItem = null;
-	    }
-	  }
-	}
-
-	// Apply a CSS selector.
-	function matches(dom, selector) {
-	  return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)
-	}
-
-	// : (string) → [string]
-	// Tokenize a style attribute into property/value pairs.
-	function parseStyles(style) {
-	  var re = /\s*([\w-]+)\s*:\s*([^;]+)/g, m, result = [];
-	  while (m = re.exec(style)) { result.push(m[1], m[2].trim()); }
-	  return result
-	}
-
-	function copy(obj) {
-	  var copy = {};
-	  for (var prop in obj) { copy[prop] = obj[prop]; }
-	  return copy
-	}
-
-	// DOMOutputSpec:: interface
-	// A description of a DOM structure. Can be either a string, which is
-	// interpreted as a text node, a DOM node, which is interpreted as
-	// itself, or an array.
-	//
-	// An array describes a DOM element. The first value in the array
-	// should be a string—the name of the DOM element. If the second
-	// element is plain object, it is interpreted as a set of attributes
-	// for the element. Any elements after that (including the 2nd if it's
-	// not an attribute object) are interpreted as children of the DOM
-	// elements, and must either be valid `DOMOutputSpec` values, or the
-	// number zero.
-	//
-	// The number zero (pronounced “hole”) is used to indicate the place
-	// where a node's child nodes should be inserted. It it occurs in an
-	// output spec, it should be the only child element in its parent
-	// node.
-
-	// ::- A DOM serializer knows how to convert ProseMirror nodes and
-	// marks of various types to DOM nodes.
-	var DOMSerializer = function DOMSerializer(nodes, marks) {
-	  // :: Object<(node: Node) → DOMOutputSpec>
-	  // The node serialization functions.
-	  this.nodes = nodes || {};
-	  // :: Object<?(mark: Mark, inline: bool) → DOMOutputSpec>
-	  // The mark serialization functions.
-	  this.marks = marks || {};
-	};
-
-	// :: (Fragment, ?Object) → dom.DocumentFragment
-	// Serialize the content of this fragment to a DOM fragment. When
-	// not in the browser, the `document` option, containing a DOM
-	// document, should be passed so that the serializer can create
-	// nodes.
-	DOMSerializer.prototype.serializeFragment = function serializeFragment (fragment, options, target) {
-	    var this$1 = this;
-	    if ( options === void 0 ) { options = {}; }
-
-	  if (!target) { target = doc(options).createDocumentFragment(); }
-
-	  var top = target, active = null;
-	  fragment.forEach(function (node) {
-	    if (active || node.marks.length) {
-	      if (!active) { active = []; }
-	      var keep = 0, rendered = 0;
-	      while (keep < active.length && rendered < node.marks.length) {
-	        var next = node.marks[rendered];
-	        if (!this$1.marks[next.type.name]) { rendered++; continue }
-	        if (!next.eq(active[keep])) { break }
-	        keep += 2; rendered++;
-	      }
-	      while (keep < active.length) {
-	        top = active.pop();
-	        active.pop();
-	      }
-	      while (rendered < node.marks.length) {
-	        var add = node.marks[rendered++];
-	        var markDOM = this$1.serializeMark(add, node.isInline, options);
-	        if (markDOM) {
-	          active.push(add, top);
-	          top.appendChild(markDOM.dom);
-	          top = markDOM.contentDOM || markDOM.dom;
-	        }
-	      }
-	    }
-	    top.appendChild(this$1.serializeNode(node, options));
-	  });
-
-	  return target
-	};
-
-	// :: (Node, ?Object) → dom.Node
-	// Serialize this node to a DOM node. This can be useful when you
-	// need to serialize a part of a document, as opposed to the whole
-	// document. To serialize a whole document, use
-	// [`serializeFragment`](#model.DOMSerializer.serializeFragment) on
-	// its [content](#model.Node.content).
-	DOMSerializer.prototype.serializeNode = function serializeNode (node, options) {
-	    if ( options === void 0 ) { options = {}; }
-
-	  var ref =
-	      DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));
-	    var dom = ref.dom;
-	    var contentDOM = ref.contentDOM;
-	  if (contentDOM) {
-	    if (node.isLeaf)
-	      { throw new RangeError("Content hole not allowed in a leaf node spec") }
-	    if (options.onContent)
-	      { options.onContent(node, contentDOM, options); }
-	    else
-	      { this.serializeFragment(node.content, options, contentDOM); }
-	  }
-	  return dom
-	};
-
-	DOMSerializer.prototype.serializeNodeAndMarks = function serializeNodeAndMarks (node, options) {
-	    var this$1 = this;
-	    if ( options === void 0 ) { options = {}; }
-
-	  var dom = this.serializeNode(node, options);
-	  for (var i = node.marks.length - 1; i >= 0; i--) {
-	    var wrap = this$1.serializeMark(node.marks[i], node.isInline, options);
-	    if (wrap) {
-	      (wrap.contentDOM || wrap.dom).appendChild(dom);
-	      dom = wrap.dom;
-	    }
-	  }
-	  return dom
-	};
-
-	DOMSerializer.prototype.serializeMark = function serializeMark (mark, inline, options) {
-	    if ( options === void 0 ) { options = {}; }
-
-	  var toDOM = this.marks[mark.type.name];
-	  return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))
-	};
-
-	// :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}
-	// Render an [output spec](#model.DOMOutputSpec) to a DOM node. If
-	// the spec has a hole (zero) in it, `contentDOM` will point at the
-	// node with the hole.
-	DOMSerializer.renderSpec = function renderSpec (doc, structure) {
-	  if (typeof structure == "string")
-	    { return {dom: doc.createTextNode(structure)} }
-	  if (structure.nodeType != null)
-	    { return {dom: structure} }
-	  var dom = doc.createElement(structure[0]), contentDOM = null;
-	  var attrs = structure[1], start = 1;
-	  if (attrs && typeof attrs == "object" && attrs.nodeType == null && !Array.isArray(attrs)) {
-	    start = 2;
-	    for (var name in attrs) {
-	      if (name == "style") { dom.style.cssText = attrs[name]; }
-	      else if (attrs[name] != null) { dom.setAttribute(name, attrs[name]); }
-	    }
-	  }
-	  for (var i = start; i < structure.length; i++) {
-	    var child = structure[i];
-	    if (child === 0) {
-	      if (i < structure.length - 1 || i > start)
-	        { throw new RangeError("Content hole must be the only child of its parent node") }
-	      return {dom: dom, contentDOM: dom}
-	    } else {
-	      var ref = DOMSerializer.renderSpec(doc, child);
-	        var inner = ref.dom;
-	        var innerContent = ref.contentDOM;
-	      dom.appendChild(inner);
-	      if (innerContent) {
-	        if (contentDOM) { throw new RangeError("Multiple content holes") }
-	        contentDOM = innerContent;
-	      }
-	    }
-	  }
-	  return {dom: dom, contentDOM: contentDOM}
-	};
-
-	// :: (Schema) → DOMSerializer
-	// Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)
-	// properties in a schema's node and mark specs.
-	DOMSerializer.fromSchema = function fromSchema (schema) {
-	  return schema.cached.domSerializer ||
-	    (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))
-	};
-
-	// : (Schema) → Object<(node: Node) → DOMOutputSpec>
-	// Gather the serializers in a schema's node specs into an object.
-	// This can be useful as a base to build a custom serializer from.
-	DOMSerializer.nodesFromSchema = function nodesFromSchema (schema) {
-	  var result = gatherToDOM(schema.nodes);
-	  if (!result.text) { result.text = function (node) { return node.text; }; }
-	  return result
-	};
-
-	// : (Schema) → Object<(mark: Mark) → DOMOutputSpec>
-	// Gather the serializers in a schema's mark specs into an object.
-	DOMSerializer.marksFromSchema = function marksFromSchema (schema) {
-	  return gatherToDOM(schema.marks)
-	};
-
-	function gatherToDOM(obj) {
-	  var result = {};
-	  for (var name in obj) {
-	    var toDOM = obj[name].spec.toDOM;
-	    if (toDOM) { result[name] = toDOM; }
-	  }
-	  return result
-	}
-
-	function doc(options) {
-	  // declare global: window
-	  return options.document || window.document
-	}
-
-	exports.Node = Node;
-	exports.ResolvedPos = ResolvedPos;
-	exports.NodeRange = NodeRange;
-	exports.Fragment = Fragment;
-	exports.Slice = Slice;
-	exports.ReplaceError = ReplaceError;
-	exports.Mark = Mark;
-	exports.Schema = Schema;
-	exports.NodeType = NodeType;
-	exports.MarkType = MarkType;
-	exports.ContentMatch = ContentMatch;
-	exports.DOMParser = DOMParser;
-	exports.DOMSerializer = DOMSerializer;
-
-	});
-
-	unwrapExports(dist);
-	var dist_1 = dist.Node;
-	var dist_2 = dist.ResolvedPos;
-	var dist_3 = dist.NodeRange;
-	var dist_4 = dist.Fragment;
-	var dist_5 = dist.Slice;
-	var dist_6 = dist.ReplaceError;
-	var dist_7 = dist.Mark;
-	var dist_8 = dist.Schema;
-	var dist_9 = dist.NodeType;
-	var dist_10 = dist.MarkType;
-	var dist_11 = dist.ContentMatch;
-	var dist_12 = dist.DOMParser;
-	var dist_13 = dist.DOMSerializer;
-
-	var dist$1 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-	// Mappable:: interface
-	// There are several things that positions can be mapped through.
-	// Such objects conform to this interface.
-	//
-	//   map:: (pos: number, assoc: ?number) → number
-	//   Map a position through this object. When given, `assoc` (should
-	//   be -1 or 1, defaults to 1) determines with which side the
-	//   position is associated, which determines in which direction to
-	//   move when a chunk of content is inserted at the mapped position.
-	//
-	//   mapResult:: (pos: number, assoc: ?number) → MapResult
-	//   Map a position, and return an object containing additional
-	//   information about the mapping. The result's `deleted` field tells
-	//   you whether the position was deleted (completely enclosed in a
-	//   replaced range) during the mapping. When content on only one side
-	//   is deleted, the position itself is only considered deleted when
-	//   `assoc` points in the direction of the deleted content.
-
-	// Recovery values encode a range index and an offset. They are
-	// represented as numbers, because tons of them will be created when
-	// mapping, for example, a large number of decorations. The number's
-	// lower 16 bits provide the index, the remaining bits the offset.
-	//
-	// Note: We intentionally don't use bit shift operators to en- and
-	// decode these, since those clip to 32 bits, which we might in rare
-	// cases want to overflow. A 64-bit float can represent 48-bit
-	// integers precisely.
-
-	var lower16 = 0xffff;
-	var factor16 = Math.pow(2, 16);
-
-	function makeRecover(index, offset) { return index + offset * factor16 }
-	function recoverIndex(value) { return value & lower16 }
-	function recoverOffset(value) { return (value - (value & lower16)) / factor16 }
-
-	// ::- An object representing a mapped position with extra
-	// information.
-	var MapResult = function MapResult(pos, deleted, recover) {
-	  if ( deleted === void 0 ) { deleted = false; }
-	  if ( recover === void 0 ) { recover = null; }
-
-	  // :: number The mapped version of the position.
-	  this.pos = pos;
-	  // :: bool Tells you whether the position was deleted, that is,
-	  // whether the step removed its surroundings from the document.
-	  this.deleted = deleted;
-	  this.recover = recover;
-	};
-
-	// :: class extends Mappable
-	// A map describing the deletions and insertions made by a step, which
-	// can be used to find the correspondence between positions in the
-	// pre-step version of a document and the same position in the
-	// post-step version.
-	var StepMap = function StepMap(ranges, inverted) {
-	  if ( inverted === void 0 ) { inverted = false; }
-
-	  this.ranges = ranges;
-	  this.inverted = inverted;
-	};
-
-	StepMap.prototype.recover = function recover (value) {
-	    var this$1 = this;
-
-	  var diff = 0, index = recoverIndex(value);
-	  if (!this.inverted) { for (var i = 0; i < index; i++)
-	    { diff += this$1.ranges[i * 3 + 2] - this$1.ranges[i * 3 + 1]; } }
-	  return this.ranges[index * 3] + diff + recoverOffset(value)
-	};
-
-	// : (number, ?number) → MapResult
-	StepMap.prototype.mapResult = function mapResult (pos, assoc) {
-	  if ( assoc === void 0 ) { assoc = 1; }
-	 return this._map(pos, assoc, false) };
-
-	// : (number, ?number) → number
-	StepMap.prototype.map = function map (pos, assoc) {
-	  if ( assoc === void 0 ) { assoc = 1; }
-	 return this._map(pos, assoc, true) };
-
-	StepMap.prototype._map = function _map (pos, assoc, simple) {
-	    var this$1 = this;
-
-	  var diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-	  for (var i = 0; i < this.ranges.length; i += 3) {
-	    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);
-	    if (start > pos) { break }
-	    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex], end = start + oldSize;
-	    if (pos <= end) {
-	      var side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;
-	      var result = start + diff + (side < 0 ? 0 : newSize);
-	      if (simple) { return result }
-	      var recover = makeRecover(i / 3, pos - start);
-	      return new MapResult(result, assoc < 0 ? pos != start : pos != end, recover)
-	    }
-	    diff += newSize - oldSize;
-	  }
-	  return simple ? pos + diff : new MapResult(pos + diff)
-	};
-
-	StepMap.prototype.touches = function touches (pos, recover) {
-	    var this$1 = this;
-
-	  var diff = 0, index = recoverIndex(recover);
-	  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-	  for (var i = 0; i < this.ranges.length; i += 3) {
-	    var start = this$1.ranges[i] - (this$1.inverted ? diff : 0);
-	    if (start > pos) { break }
-	    var oldSize = this$1.ranges[i + oldIndex], end = start + oldSize;
-	    if (pos <= end && i == index * 3) { return true }
-	    diff += this$1.ranges[i + newIndex] - oldSize;
-	  }
-	  return false
-	};
-
-	// :: ((oldStart: number, oldEnd: number, newStart: number, newEnd: number))
-	// Calls the given function on each of the changed ranges included in
-	// this map.
-	StepMap.prototype.forEach = function forEach (f) {
-	    var this$1 = this;
-
-	  var oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;
-	  for (var i = 0, diff = 0; i < this.ranges.length; i += 3) {
-	    var start = this$1.ranges[i], oldStart = start - (this$1.inverted ? diff : 0), newStart = start + (this$1.inverted ? 0 : diff);
-	    var oldSize = this$1.ranges[i + oldIndex], newSize = this$1.ranges[i + newIndex];
-	    f(oldStart, oldStart + oldSize, newStart, newStart + newSize);
-	    diff += newSize - oldSize;
-	  }
-	};
-
-	// :: () → StepMap
-	// Create an inverted version of this map. The result can be used to
-	// map positions in the post-step document to the pre-step document.
-	StepMap.prototype.invert = function invert () {
-	  return new StepMap(this.ranges, !this.inverted)
-	};
-
-	StepMap.prototype.toString = function toString () {
-	  return (this.inverted ? "-" : "") + JSON.stringify(this.ranges)
-	};
-
-	// :: (n: number) → StepMap
-	// Create a map that moves all positions by offset `n` (which may be
-	// negative). This can be useful when applying steps meant for a
-	// sub-document to a larger document, or vice-versa.
-	StepMap.offset = function offset (n) {
-	  return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n])
-	};
-
-	StepMap.empty = new StepMap([]);
-
-	// :: class extends Mappable
-	// A mapping represents a pipeline of zero or more [step
-	// maps](#transform.StepMap). It has special provisions for losslessly
-	// handling mapping positions through a series of steps in which some
-	// steps are inverted versions of earlier steps. (This comes up when
-	// ‘[rebasing](/docs/guide/#transform.rebasing)’ steps for
-	// collaboration or history management.)
-	var Mapping = function Mapping(maps, mirror, from, to) {
-	  // :: [StepMap]
-	  // The step maps in this mapping.
-	  this.maps = maps || [];
-	  // :: number
-	  // The starting position in the `maps` array, used when `map` or
-	  // `mapResult` is called.
-	  this.from = from || 0;
-	  // :: number
-	  // The end position in the `maps` array.
-	  this.to = to == null ? this.maps.length : to;
-	  this.mirror = mirror;
-	};
-
-	// :: (?number, ?number) → Mapping
-	// Create a mapping that maps only through a part of this one.
-	Mapping.prototype.slice = function slice (from, to) {
-	    if ( from === void 0 ) { from = 0; }
-	    if ( to === void 0 ) { to = this.maps.length; }
-
-	  return new Mapping(this.maps, this.mirror, from, to)
-	};
-
-	Mapping.prototype.copy = function copy () {
-	  return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to)
-	};
-
-	// :: (StepMap, ?number)
-	// Add a step map to the end of this mapping. If `mirrors` is
-	// given, it should be the index of the step map that is the mirror
-	// image of this one.
-	Mapping.prototype.appendMap = function appendMap (map, mirrors) {
-	  this.to = this.maps.push(map);
-	  if (mirrors != null) { this.setMirror(this.maps.length - 1, mirrors); }
-	};
-
-	// :: (Mapping)
-	// Add all the step maps in a given mapping to this one (preserving
-	// mirroring information).
-	Mapping.prototype.appendMapping = function appendMapping (mapping) {
-	    var this$1 = this;
-
-	  for (var i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {
-	    var mirr = mapping.getMirror(i);
-	    this$1.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : null);
-	  }
-	};
-
-	// :: (number) → ?number
-	// Finds the offset of the step map that mirrors the map at the
-	// given offset, in this mapping (as per the second argument to
-	// `appendMap`).
-	Mapping.prototype.getMirror = function getMirror (n) {
-	    var this$1 = this;
-
-	  if (this.mirror) { for (var i = 0; i < this.mirror.length; i++)
-	    { if (this$1.mirror[i] == n) { return this$1.mirror[i + (i % 2 ? -1 : 1)] } } }
-	};
-
-	Mapping.prototype.setMirror = function setMirror (n, m) {
-	  if (!this.mirror) { this.mirror = []; }
-	  this.mirror.push(n, m);
-	};
-
-	// :: (Mapping)
-	// Append the inverse of the given mapping to this one.
-	Mapping.prototype.appendMappingInverted = function appendMappingInverted (mapping) {
-	    var this$1 = this;
-
-	  for (var i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {
-	    var mirr = mapping.getMirror(i);
-	    this$1.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : null);
-	  }
-	};
-
-	// () → Mapping
-	// Create an inverted version of this mapping.
-	Mapping.prototype.invert = function invert () {
-	  var inverse = new Mapping;
-	  inverse.appendMappingInverted(this);
-	  return inverse
-	};
-
-	// : (number, ?number) → number
-	// Map a position through this mapping.
-	Mapping.prototype.map = function map (pos, assoc) {
-	    var this$1 = this;
-	    if ( assoc === void 0 ) { assoc = 1; }
-
-	  if (this.mirror) { return this._map(pos, assoc, true) }
-	  for (var i = this.from; i < this.to; i++)
-	    { pos = this$1.maps[i].map(pos, assoc); }
-	  return pos
-	};
-
-	// : (number, ?number) → MapResult
-	// Map a position through this mapping, returning a mapping
-	// result.
-	Mapping.prototype.mapResult = function mapResult (pos, assoc) {
-	  if ( assoc === void 0 ) { assoc = 1; }
-	 return this._map(pos, assoc, false) };
-
-	Mapping.prototype._map = function _map (pos, assoc, simple) {
-	    var this$1 = this;
-
-	  var deleted = false, recoverables = null;
-
-	  for (var i = this.from; i < this.to; i++) {
-	    var map = this$1.maps[i], rec = recoverables && recoverables[i];
-	    if (rec != null && map.touches(pos, rec)) {
-	      pos = map.recover(rec);
-	      continue
-	    }
-
-	    var result = map.mapResult(pos, assoc);
-	    if (result.recover != null) {
-	      var corr = this$1.getMirror(i);
-	      if (corr != null && corr > i && corr < this$1.to) {
-	        if (result.deleted) {
-	          i = corr;
-	          pos = this$1.maps[corr].recover(result.recover);
-	          continue
-	        } else {
-	          (recoverables || (recoverables = Object.create(null)))[corr] = result.recover;
-	        }
-	      }
-	    }
-
-	    if (result.deleted) { deleted = true; }
-	    pos = result.pos;
-	  }
-
-	  return simple ? pos : new MapResult(pos, deleted)
-	};
-
-	function TransformError(message) {
-	  var err = Error.call(this, message);
-	  err.__proto__ = TransformError.prototype;
-	  return err
-	}
-
-	TransformError.prototype = Object.create(Error.prototype);
-	TransformError.prototype.constructor = TransformError;
-	TransformError.prototype.name = "TransformError";
-
-	// ::- Abstraction to build up and track an array of
-	// [steps](#transform.Step) representing a document transformation.
-	//
-	// Most transforming methods return the `Transform` object itself, so
-	// that they can be chained.
-	var Transform = function Transform(doc) {
-	  // :: Node
-	  // The current document (the result of applying the steps in the
-	  // transform).
-	  this.doc = doc;
-	  // :: [Step]
-	  // The steps in this transform.
-	  this.steps = [];
-	  // :: [Node]
-	  // The documents before each of the steps.
-	  this.docs = [];
-	  // :: Mapping
-	  // A mapping with the maps for each of the steps in this transform.
-	  this.mapping = new Mapping;
-	};
-
-	var prototypeAccessors = { before: {},docChanged: {} };
-
-	// :: Node The starting document.
-	prototypeAccessors.before.get = function () { return this.docs.length ? this.docs[0] : this.doc };
-
-	// :: (step: Step) → this
-	// Apply a new step in this transform, saving the result. Throws an
-	// error when the step fails.
-	Transform.prototype.step = function step (object) {
-	  var result = this.maybeStep(object);
-	  if (result.failed) { throw new TransformError(result.failed) }
-	  return this
-	};
-
-	// :: (Step) → StepResult
-	// Try to apply a step in this transformation, ignoring it if it
-	// fails. Returns the step result.
-	Transform.prototype.maybeStep = function maybeStep (step) {
-	  var result = step.apply(this.doc);
-	  if (!result.failed) { this.addStep(step, result.doc); }
-	  return result
-	};
-
-	// :: bool
-	// True when the document has been changed (when there are any
-	// steps).
-	prototypeAccessors.docChanged.get = function () {
-	  return this.steps.length > 0
-	};
-
-	Transform.prototype.addStep = function addStep (step, doc) {
-	  this.docs.push(this.doc);
-	  this.steps.push(step);
-	  this.mapping.appendMap(step.getMap());
-	  this.doc = doc;
-	};
-
-	Object.defineProperties( Transform.prototype, prototypeAccessors );
-
-	function mustOverride() { throw new Error("Override me") }
-
-	var stepsByID = Object.create(null);
-
-	// ::- A step object represents an atomic change. It generally applies
-	// only to the document it was created for, since the positions
-	// stored in it will only make sense for that document.
-	//
-	// New steps are defined by creating classes that extend `Step`,
-	// overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`
-	// methods, and registering your class with a unique
-	// JSON-serialization identifier using
-	// [`Step.jsonID`](#transform.Step^jsonID).
-	var Step = function Step () {};
-
-	Step.prototype.apply = function apply (_doc) { return mustOverride() };
-
-	// :: () → StepMap
-	// Get the step map that represents the changes made by this step,
-	// and which can be used to transform between positions in the old
-	// and the new document.
-	Step.prototype.getMap = function getMap () { return StepMap.empty };
-
-	// :: (doc: Node) → Step
-	// Create an inverted version of this step. Needs the document as it
-	// was before the step as argument.
-	Step.prototype.invert = function invert (_doc) { return mustOverride() };
-
-	// :: (mapping: Mappable) → ?Step
-	// Map this step through a mappable thing, returning either a
-	// version of that step with its positions adjusted, or `null` if
-	// the step was entirely deleted by the mapping.
-	Step.prototype.map = function map (_mapping) { return mustOverride() };
-
-	// :: (other: Step) → ?Step
-	// Try to merge this step with another one, to be applied directly
-	// after it. Returns the merged step when possible, null if the
-	// steps can't be merged.
-	Step.prototype.merge = function merge (_other) { return null };
-
-	// :: () → Object
-	// Create a JSON-serializeable representation of this step. When
-	// defining this for a custom subclass, make sure the result object
-	// includes the step type's [JSON id](#transform.Step^jsonID) under
-	// the `stepType` property.
-	Step.prototype.toJSON = function toJSON () { return mustOverride() };
-
-	// :: (Schema, Object) → Step
-	// Deserialize a step from its JSON representation. Will call
-	// through to the step class' own implementation of this method.
-	Step.fromJSON = function fromJSON (schema, json) {
-	  if (!json || !json.stepType) { throw new RangeError("Invalid input for Step.fromJSON") }
-	  var type = stepsByID[json.stepType];
-	  if (!type) { throw new RangeError(("No step type " + (json.stepType) + " defined")) }
-	  return type.fromJSON(schema, json)
-	};
-
-	// :: (string, constructor<Step>)
-	// To be able to serialize steps to JSON, each step needs a string
-	// ID to attach to its JSON representation. Use this method to
-	// register an ID for your step classes. Try to pick something
-	// that's unlikely to clash with steps from other modules.
-	Step.jsonID = function jsonID (id, stepClass) {
-	  if (id in stepsByID) { throw new RangeError("Duplicate use of step JSON ID " + id) }
-	  stepsByID[id] = stepClass;
-	  stepClass.prototype.jsonID = id;
-	  return stepClass
-	};
-
-	// ::- The result of [applying](#transform.Step.apply) a step. Contains either a
-	// new document or a failure value.
-	var StepResult = function StepResult(doc, failed) {
-	  // :: ?Node The transformed document.
-	  this.doc = doc;
-	  // :: ?string Text providing information about a failed step.
-	  this.failed = failed;
-	};
-
-	// :: (Node) → StepResult
-	// Create a successful step result.
-	StepResult.ok = function ok (doc) { return new StepResult(doc, null) };
-
-	// :: (string) → StepResult
-	// Create a failed step result.
-	StepResult.fail = function fail (message) { return new StepResult(null, message) };
-
-	// :: (Node, number, number, Slice) → StepResult
-	// Call [`Node.replace`](#model.Node.replace) with the given
-	// arguments. Create a successful result if it succeeds, and a
-	// failed one if it throws a `ReplaceError`.
-	StepResult.fromReplace = function fromReplace (doc, from, to, slice) {
-	  try {
-	    return StepResult.ok(doc.replace(from, to, slice))
-	  } catch (e) {
-	    if (e instanceof dist.ReplaceError) { return StepResult.fail(e.message) }
-	    throw e
-	  }
-	};
-
-	// ::- Replace a part of the document with a slice of new content.
-	var ReplaceStep = (function (Step$$1) {
-	  function ReplaceStep(from, to, slice, structure) {
-	    Step$$1.call(this);
-	    this.from = from;
-	    this.to = to;
-	    this.slice = slice;
-	    this.structure = !!structure;
-	  }
-
-	  if ( Step$$1 ) { ReplaceStep.__proto__ = Step$$1; }
-	  ReplaceStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-	  ReplaceStep.prototype.constructor = ReplaceStep;
-
-	  ReplaceStep.prototype.apply = function apply (doc) {
-	    if (this.structure && contentBetween(doc, this.from, this.to))
-	      { return StepResult.fail("Structure replace would overwrite content") }
-	    return StepResult.fromReplace(doc, this.from, this.to, this.slice)
-	  };
-
-	  ReplaceStep.prototype.getMap = function getMap () {
-	    return new StepMap([this.from, this.to - this.from, this.slice.size])
-	  };
-
-	  ReplaceStep.prototype.invert = function invert (doc) {
-	    return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to))
-	  };
-
-	  ReplaceStep.prototype.map = function map (mapping) {
-	    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-	    if (from.deleted && to.deleted) { return null }
-	    return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice)
-	  };
-
-	  ReplaceStep.prototype.merge = function merge (other) {
-	    if (!(other instanceof ReplaceStep) || other.structure != this.structure) { return null }
-
-	    if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {
-	      var slice = this.slice.size + other.slice.size == 0 ? dist.Slice.empty
-	          : new dist.Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);
-	      return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure)
-	    } else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {
-	      var slice$1 = this.slice.size + other.slice.size == 0 ? dist.Slice.empty
-	          : new dist.Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);
-	      return new ReplaceStep(other.from, this.to, slice$1, this.structure)
-	    } else {
-	      return null
-	    }
-	  };
-
-	  ReplaceStep.prototype.toJSON = function toJSON () {
-	    var json = {stepType: "replace", from: this.from, to: this.to};
-	    if (this.slice.size) { json.slice = this.slice.toJSON(); }
-	    if (this.structure) { json.structure = true; }
-	    return json
-	  };
-
-	  ReplaceStep.fromJSON = function fromJSON (schema, json) {
-	    if (typeof json.from != "number" || typeof json.to != "number")
-	      { throw new RangeError("Invalid input for ReplaceStep.fromJSON") }
-	    return new ReplaceStep(json.from, json.to, dist.Slice.fromJSON(schema, json.slice), !!json.structure)
-	  };
-
-	  return ReplaceStep;
-	}(Step));
-
-	Step.jsonID("replace", ReplaceStep);
-
-	// ::- Replace a part of the document with a slice of content, but
-	// preserve a range of the replaced content by moving it into the
-	// slice.
-	var ReplaceAroundStep = (function (Step$$1) {
-	  function ReplaceAroundStep(from, to, gapFrom, gapTo, slice, insert, structure) {
-	    Step$$1.call(this);
-	    this.from = from;
-	    this.to = to;
-	    this.gapFrom = gapFrom;
-	    this.gapTo = gapTo;
-	    this.slice = slice;
-	    this.insert = insert;
-	    this.structure = !!structure;
-	  }
-
-	  if ( Step$$1 ) { ReplaceAroundStep.__proto__ = Step$$1; }
-	  ReplaceAroundStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-	  ReplaceAroundStep.prototype.constructor = ReplaceAroundStep;
-
-	  ReplaceAroundStep.prototype.apply = function apply (doc) {
-	    if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||
-	                           contentBetween(doc, this.gapTo, this.to)))
-	      { return StepResult.fail("Structure gap-replace would overwrite content") }
-
-	    var gap = doc.slice(this.gapFrom, this.gapTo);
-	    if (gap.openStart || gap.openEnd)
-	      { return StepResult.fail("Gap is not a flat range") }
-	    var inserted = this.slice.insertAt(this.insert, gap.content);
-	    if (!inserted) { return StepResult.fail("Content does not fit in gap") }
-	    return StepResult.fromReplace(doc, this.from, this.to, inserted)
-	  };
-
-	  ReplaceAroundStep.prototype.getMap = function getMap () {
-	    return new StepMap([this.from, this.gapFrom - this.from, this.insert,
-	                        this.gapTo, this.to - this.gapTo, this.slice.size - this.insert])
-	  };
-
-	  ReplaceAroundStep.prototype.invert = function invert (doc) {
-	    var gap = this.gapTo - this.gapFrom;
-	    return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap,
-	                                 this.from + this.insert, this.from + this.insert + gap,
-	                                 doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),
-	                                 this.gapFrom - this.from, this.structure)
-	  };
-
-	  ReplaceAroundStep.prototype.map = function map (mapping) {
-	    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-	    var gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);
-	    if ((from.deleted && to.deleted) || gapFrom < from.pos || gapTo > to.pos) { return null }
-	    return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure)
-	  };
-
-	  ReplaceAroundStep.prototype.toJSON = function toJSON () {
-	    var json = {stepType: "replaceAround", from: this.from, to: this.to,
-	                gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert};
-	    if (this.slice.size) { json.slice = this.slice.toJSON(); }
-	    if (this.structure) { json.structure = true; }
-	    return json
-	  };
-
-	  ReplaceAroundStep.fromJSON = function fromJSON (schema, json) {
-	    if (typeof json.from != "number" || typeof json.to != "number" ||
-	        typeof json.gapFrom != "number" || typeof json.gapTo != "number" || typeof json.insert != "number")
-	      { throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON") }
-	    return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo,
-	                                 dist.Slice.fromJSON(schema, json.slice), json.insert, !!json.structure)
-	  };
-
-	  return ReplaceAroundStep;
-	}(Step));
-
-	Step.jsonID("replaceAround", ReplaceAroundStep);
-
-	function contentBetween(doc, from, to) {
-	  var $from = doc.resolve(from), dist$$1 = to - from, depth = $from.depth;
-	  while (dist$$1 > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {
-	    depth--;
-	    dist$$1--;
-	  }
-	  if (dist$$1 > 0) {
-	    var next = $from.node(depth).maybeChild($from.indexAfter(depth));
-	    while (dist$$1 > 0) {
-	      if (!next || next.isLeaf) { return true }
-	      next = next.firstChild;
-	      dist$$1--;
-	    }
-	  }
-	  return false
-	}
-
-	function canCut(node, start, end) {
-	  return (start == 0 || node.canReplace(start, node.childCount)) &&
-	    (end == node.childCount || node.canReplace(0, end))
-	}
-
-	// :: (NodeRange) → ?number
-	// Try to find a target depth to which the content in the given range
-	// can be lifted. Will not go across
-	// [isolating](#model.NodeSpec.isolating) parent nodes.
-	function liftTarget(range) {
-	  var parent = range.parent;
-	  var content = parent.content.cutByIndex(range.startIndex, range.endIndex);
-	  for (var depth = range.depth;; --depth) {
-	    var node = range.$from.node(depth);
-	    var index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);
-	    if (depth < range.depth && node.canReplace(index, endIndex, content))
-	      { return depth }
-	    if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex)) { break }
-	  }
-	}
-
-	// :: (NodeRange, number) → this
-	// Split the content in the given range off from its parent, if there
-	// is sibling content before or after it, and move it up the tree to
-	// the depth specified by `target`. You'll probably want to use
-	// [`liftTarget`](#transform.liftTarget) to compute `target`, to make
-	// sure the lift is valid.
-	Transform.prototype.lift = function(range, target) {
-	  var $from = range.$from;
-	  var $to = range.$to;
-	  var depth = range.depth;
-
-	  var gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);
-	  var start = gapStart, end = gapEnd;
-
-	  var before = dist.Fragment.empty, openStart = 0;
-	  for (var d = depth, splitting = false; d > target; d--)
-	    { if (splitting || $from.index(d) > 0) {
-	      splitting = true;
-	      before = dist.Fragment.from($from.node(d).copy(before));
-	      openStart++;
-	    } else {
-	      start--;
-	    } }
-	  var after = dist.Fragment.empty, openEnd = 0;
-	  for (var d$1 = depth, splitting$1 = false; d$1 > target; d$1--)
-	    { if (splitting$1 || $to.after(d$1 + 1) < $to.end(d$1)) {
-	      splitting$1 = true;
-	      after = dist.Fragment.from($to.node(d$1).copy(after));
-	      openEnd++;
-	    } else {
-	      end++;
-	    } }
-
-	  return this.step(new ReplaceAroundStep(start, end, gapStart, gapEnd,
-	                                         new dist.Slice(before.append(after), openStart, openEnd),
-	                                         before.size - openStart, true))
-	};
-
-	// :: (NodeRange, NodeType, ?Object, ?NodeRange) → ?[{type: NodeType, attrs: ?Object}]
-	// Try to find a valid way to wrap the content in the given range in a
-	// node of the given type. May introduce extra nodes around and inside
-	// the wrapper node, if necessary. Returns null if no valid wrapping
-	// could be found. When `innerRange` is given, that range's content is
-	// used as the content to fit into the wrapping, instead of the
-	// content of `range`.
-	function findWrapping(range, nodeType, attrs, innerRange) {
-	  if ( innerRange === void 0 ) { innerRange = range; }
-
-	  var around = findWrappingOutside(range, nodeType);
-	  var inner = around && findWrappingInside(innerRange, nodeType);
-	  if (!inner) { return null }
-	  return around.map(withAttrs).concat({type: nodeType, attrs: attrs}).concat(inner.map(withAttrs))
-	}
-
-	function withAttrs(type) { return {type: type, attrs: null} }
-
-	function findWrappingOutside(range, type) {
-	  var parent = range.parent;
-	  var startIndex = range.startIndex;
-	  var endIndex = range.endIndex;
-	  var around = parent.contentMatchAt(startIndex).findWrapping(type);
-	  if (!around) { return null }
-	  var outer = around.length ? around[0] : type;
-	  return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null
-	}
-
-	function findWrappingInside(range, type) {
-	  var parent = range.parent;
-	  var startIndex = range.startIndex;
-	  var endIndex = range.endIndex;
-	  var inner = parent.child(startIndex);
-	  var inside = type.contentMatch.findWrapping(inner.type);
-	  if (!inside) { return null }
-	  var lastType = inside.length ? inside[inside.length - 1] : type;
-	  var innerMatch = lastType.contentMatch;
-	  for (var i = startIndex; innerMatch && i < endIndex; i++)
-	    { innerMatch = innerMatch.matchType(parent.child(i).type); }
-	  if (!innerMatch || !innerMatch.validEnd) { return null }
-	  return inside
-	}
-
-	// :: (NodeRange, [{type: NodeType, attrs: ?Object}]) → this
-	// Wrap the given [range](#model.NodeRange) in the given set of wrappers.
-	// The wrappers are assumed to be valid in this position, and should
-	// probably be computed with [`findWrapping`](#transform.findWrapping).
-	Transform.prototype.wrap = function(range, wrappers) {
-	  var content = dist.Fragment.empty;
-	  for (var i = wrappers.length - 1; i >= 0; i--)
-	    { content = dist.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }
-
-	  var start = range.start, end = range.end;
-	  return this.step(new ReplaceAroundStep(start, end, start, end, new dist.Slice(content, 0, 0), wrappers.length, true))
-	};
-
-	// :: (number, ?number, NodeType, ?Object) → this
-	// Set the type of all textblocks (partly) between `from` and `to` to
-	// the given node type with the given attributes.
-	Transform.prototype.setBlockType = function(from, to, type, attrs) {
-	  var this$1 = this;
-	  if ( to === void 0 ) { to = from; }
-
-	  if (!type.isTextblock) { throw new RangeError("Type given to setBlockType should be a textblock") }
-	  var mapFrom = this.steps.length;
-	  this.doc.nodesBetween(from, to, function (node, pos) {
-	    if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(this$1.doc, this$1.mapping.slice(mapFrom).map(pos), type)) {
-	      // Ensure all markup that isn't allowed in the new node type is cleared
-	      this$1.clearIncompatible(this$1.mapping.slice(mapFrom).map(pos, 1), type);
-	      var mapping = this$1.mapping.slice(mapFrom);
-	      var startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);
-	      this$1.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1,
-	                                      new dist.Slice(dist.Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));
-	      return false
-	    }
-	  });
-	  return this
-	};
-
-	function canChangeType(doc, pos, type) {
-	  var $pos = doc.resolve(pos), index = $pos.index();
-	  return $pos.parent.canReplaceWith(index, index + 1, type)
-	}
-
-	// :: (number, ?NodeType, ?Object, ?[Mark]) → this
-	// Change the type, attributes, and/or marks of the node at `pos`.
-	// When `type` isn't given, the existing node type is preserved,
-	Transform.prototype.setNodeMarkup = function(pos, type, attrs, marks) {
-	  var node = this.doc.nodeAt(pos);
-	  if (!node) { throw new RangeError("No node at given position") }
-	  if (!type) { type = node.type; }
-	  var newNode = type.create(attrs, null, marks || node.marks);
-	  if (node.isLeaf)
-	    { return this.replaceWith(pos, pos + node.nodeSize, newNode) }
-
-	  if (!type.validContent(node.content))
-	    { throw new RangeError("Invalid content for node type " + type.name) }
-
-	  return this.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1,
-	                                         new dist.Slice(dist.Fragment.from(newNode), 0, 0), 1, true))
-	};
-
-	// :: (Node, number, number, ?[?{type: NodeType, attrs: ?Object}]) → bool
-	// Check whether splitting at the given position is allowed.
-	function canSplit(doc, pos, depth, typesAfter) {
-	  if ( depth === void 0 ) { depth = 1; }
-
-	  var $pos = doc.resolve(pos), base = $pos.depth - depth;
-	  var innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;
-	  if (base < 0 || $pos.parent.type.spec.isolating ||
-	      !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||
-	      !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))
-	    { return false }
-	  for (var d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {
-	    var node = $pos.node(d), index$1 = $pos.index(d);
-	    if (node.type.spec.isolating) { return false }
-	    var rest = node.content.cutByIndex(index$1, node.childCount);
-	    var after = (typesAfter && typesAfter[i]) || node;
-	    if (after != node) { rest = rest.replaceChild(0, after.type.create(after.attrs)); }
-	    if (!node.canReplace(index$1 + 1, node.childCount) || !after.type.validContent(rest))
-	      { return false }
-	  }
-	  var index = $pos.indexAfter(base);
-	  var baseType = typesAfter && typesAfter[0];
-	  return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type)
-	}
-
-	// :: (number, ?number, ?[?{type: NodeType, attrs: ?Object}]) → this
-	// Split the node at the given position, and optionally, if `depth` is
-	// greater than one, any number of nodes above that. By default, the
-	// parts split off will inherit the node type of the original node.
-	// This can be changed by passing an array of types and attributes to
-	// use after the split.
-	Transform.prototype.split = function(pos, depth, typesAfter) {
-	  if ( depth === void 0 ) { depth = 1; }
-
-	  var $pos = this.doc.resolve(pos), before = dist.Fragment.empty, after = dist.Fragment.empty;
-	  for (var d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {
-	    before = dist.Fragment.from($pos.node(d).copy(before));
-	    var typeAfter = typesAfter && typesAfter[i];
-	    after = dist.Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));
-	  }
-	  return this.step(new ReplaceStep(pos, pos, new dist.Slice(before.append(after), depth, depth, true)))
-	};
-
-	// :: (Node, number) → bool
-	// Test whether the blocks before and after a given position can be
-	// joined.
-	function canJoin(doc, pos) {
-	  var $pos = doc.resolve(pos), index = $pos.index();
-	  return joinable($pos.nodeBefore, $pos.nodeAfter) &&
-	    $pos.parent.canReplace(index, index + 1)
-	}
-
-	function joinable(a, b) {
-	  return a && b && !a.isLeaf && a.canAppend(b)
-	}
-
-	// :: (Node, number, ?number) → ?number
-	// Find an ancestor of the given position that can be joined to the
-	// block before (or after if `dir` is positive). Returns the joinable
-	// point, if any.
-	function joinPoint(doc, pos, dir) {
-	  if ( dir === void 0 ) { dir = -1; }
-
-	  var $pos = doc.resolve(pos);
-	  for (var d = $pos.depth;; d--) {
-	    var before = (void 0), after = (void 0);
-	    if (d == $pos.depth) {
-	      before = $pos.nodeBefore;
-	      after = $pos.nodeAfter;
-	    } else if (dir > 0) {
-	      before = $pos.node(d + 1);
-	      after = $pos.node(d).maybeChild($pos.index(d) + 1);
-	    } else {
-	      before = $pos.node(d).maybeChild($pos.index(d) - 1);
-	      after = $pos.node(d + 1);
-	    }
-	    if (before && !before.isTextblock && joinable(before, after)) { return pos }
-	    if (d == 0) { break }
-	    pos = dir < 0 ? $pos.before(d) : $pos.after(d);
-	  }
-	}
-
-	// :: (number, ?number) → this
-	// Join the blocks around the given position. If depth is 2, their
-	// last and first siblings are also joined, and so on.
-	Transform.prototype.join = function(pos, depth) {
-	  if ( depth === void 0 ) { depth = 1; }
-
-	  var step = new ReplaceStep(pos - depth, pos + depth, dist.Slice.empty, true);
-	  return this.step(step)
-	};
-
-	// :: (Node, number, NodeType) → ?number
-	// Try to find a point where a node of the given type can be inserted
-	// near `pos`, by searching up the node hierarchy when `pos` itself
-	// isn't a valid place but is at the start or end of a node. Return
-	// null if no position was found.
-	function insertPoint(doc, pos, nodeType) {
-	  var $pos = doc.resolve(pos);
-	  if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) { return pos }
-
-	  if ($pos.parentOffset == 0)
-	    { for (var d = $pos.depth - 1; d >= 0; d--) {
-	      var index = $pos.index(d);
-	      if ($pos.node(d).canReplaceWith(index, index, nodeType)) { return $pos.before(d + 1) }
-	      if (index > 0) { return null }
-	    } }
-	  if ($pos.parentOffset == $pos.parent.content.size)
-	    { for (var d$1 = $pos.depth - 1; d$1 >= 0; d$1--) {
-	      var index$1 = $pos.indexAfter(d$1);
-	      if ($pos.node(d$1).canReplaceWith(index$1, index$1, nodeType)) { return $pos.after(d$1 + 1) }
-	      if (index$1 < $pos.node(d$1).childCount) { return null }
-	    } }
-	}
-
-	// :: (Node, number, Slice) → ?number
-	// Finds a position at or around the given position where the given
-	// slice can be inserted. Will look at parent nodes' nearest boundary
-	// and try there, even if the original position wasn't directly at the
-	// start or end of that node. Returns null when no position was found.
-	function dropPoint(doc, pos, slice) {
-	  var $pos = doc.resolve(pos);
-	  if (!slice.content.size) { return pos }
-	  var content = slice.content;
-	  for (var i = 0; i < slice.openStart; i++) { content = content.firstChild.content; }
-	  for (var pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {
-	    for (var d = $pos.depth; d >= 0; d--) {
-	      var bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;
-	      var insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);
-	      if (pass == 1
-	          ? $pos.node(d).canReplace(insertPos, insertPos, content)
-	          : $pos.node(d).contentMatchAt(insertPos).findWrapping(content.firstChild.type))
-	        { return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1) }
-	    }
-	  }
-	  return null
-	}
-
-	function mapFragment(fragment, f, parent) {
-	  var mapped = [];
-	  for (var i = 0; i < fragment.childCount; i++) {
-	    var child = fragment.child(i);
-	    if (child.content.size) { child = child.copy(mapFragment(child.content, f, child)); }
-	    if (child.isInline) { child = f(child, parent, i); }
-	    mapped.push(child);
-	  }
-	  return dist.Fragment.fromArray(mapped)
-	}
-
-	// ::- Add a mark to all inline content between two positions.
-	var AddMarkStep = (function (Step$$1) {
-	  function AddMarkStep(from, to, mark) {
-	    Step$$1.call(this);
-	    this.from = from;
-	    this.to = to;
-	    this.mark = mark;
-	  }
-
-	  if ( Step$$1 ) { AddMarkStep.__proto__ = Step$$1; }
-	  AddMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-	  AddMarkStep.prototype.constructor = AddMarkStep;
-
-	  AddMarkStep.prototype.apply = function apply (doc) {
-	    var this$1 = this;
-
-	    var oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);
-	    var parent = $from.node($from.sharedDepth(this.to));
-	    var slice = new dist.Slice(mapFragment(oldSlice.content, function (node, parent) {
-	      if (!parent.type.allowsMarkType(this$1.mark.type)) { return node }
-	      return node.mark(this$1.mark.addToSet(node.marks))
-	    }, parent), oldSlice.openStart, oldSlice.openEnd);
-	    return StepResult.fromReplace(doc, this.from, this.to, slice)
-	  };
-
-	  AddMarkStep.prototype.invert = function invert () {
-	    return new RemoveMarkStep(this.from, this.to, this.mark)
-	  };
-
-	  AddMarkStep.prototype.map = function map (mapping) {
-	    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-	    if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
-	    return new AddMarkStep(from.pos, to.pos, this.mark)
-	  };
-
-	  AddMarkStep.prototype.merge = function merge (other) {
-	    if (other instanceof AddMarkStep &&
-	        other.mark.eq(this.mark) &&
-	        this.from <= other.to && this.to >= other.from)
-	      { return new AddMarkStep(Math.min(this.from, other.from),
-	                             Math.max(this.to, other.to), this.mark) }
-	  };
-
-	  AddMarkStep.prototype.toJSON = function toJSON () {
-	    return {stepType: "addMark", mark: this.mark.toJSON(),
-	            from: this.from, to: this.to}
-	  };
-
-	  AddMarkStep.fromJSON = function fromJSON (schema, json) {
-	    if (typeof json.from != "number" || typeof json.to != "number")
-	      { throw new RangeError("Invalid input for AddMarkStep.fromJSON") }
-	    return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
-	  };
-
-	  return AddMarkStep;
-	}(Step));
-
-	Step.jsonID("addMark", AddMarkStep);
-
-	// ::- Remove a mark from all inline content between two positions.
-	var RemoveMarkStep = (function (Step$$1) {
-	  function RemoveMarkStep(from, to, mark) {
-	    Step$$1.call(this);
-	    this.from = from;
-	    this.to = to;
-	    this.mark = mark;
-	  }
-
-	  if ( Step$$1 ) { RemoveMarkStep.__proto__ = Step$$1; }
-	  RemoveMarkStep.prototype = Object.create( Step$$1 && Step$$1.prototype );
-	  RemoveMarkStep.prototype.constructor = RemoveMarkStep;
-
-	  RemoveMarkStep.prototype.apply = function apply (doc) {
-	    var this$1 = this;
-
-	    var oldSlice = doc.slice(this.from, this.to);
-	    var slice = new dist.Slice(mapFragment(oldSlice.content, function (node) {
-	      return node.mark(this$1.mark.removeFromSet(node.marks))
-	    }), oldSlice.openStart, oldSlice.openEnd);
-	    return StepResult.fromReplace(doc, this.from, this.to, slice)
-	  };
-
-	  RemoveMarkStep.prototype.invert = function invert () {
-	    return new AddMarkStep(this.from, this.to, this.mark)
-	  };
-
-	  RemoveMarkStep.prototype.map = function map (mapping) {
-	    var from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
-	    if (from.deleted && to.deleted || from.pos >= to.pos) { return null }
-	    return new RemoveMarkStep(from.pos, to.pos, this.mark)
-	  };
-
-	  RemoveMarkStep.prototype.merge = function merge (other) {
-	    if (other instanceof RemoveMarkStep &&
-	        other.mark.eq(this.mark) &&
-	        this.from <= other.to && this.to >= other.from)
-	      { return new RemoveMarkStep(Math.min(this.from, other.from),
-	                                Math.max(this.to, other.to), this.mark) }
-	  };
-
-	  RemoveMarkStep.prototype.toJSON = function toJSON () {
-	    return {stepType: "removeMark", mark: this.mark.toJSON(),
-	            from: this.from, to: this.to}
-	  };
-
-	  RemoveMarkStep.fromJSON = function fromJSON (schema, json) {
-	    if (typeof json.from != "number" || typeof json.to != "number")
-	      { throw new RangeError("Invalid input for RemoveMarkStep.fromJSON") }
-	    return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark))
-	  };
-
-	  return RemoveMarkStep;
-	}(Step));
-
-	Step.jsonID("removeMark", RemoveMarkStep);
-
-	// :: (number, number, Mark) → this
-	// Add the given mark to the inline content between `from` and `to`.
-	Transform.prototype.addMark = function(from, to, mark) {
-	  var this$1 = this;
-
-	  var removed = [], added = [], removing = null, adding = null;
-	  this.doc.nodesBetween(from, to, function (node, pos, parent) {
-	    if (!node.isInline) { return }
-	    var marks = node.marks;
-	    if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {
-	      var start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);
-	      var newSet = mark.addToSet(marks);
-
-	      for (var i = 0; i < marks.length; i++) {
-	        if (!marks[i].isInSet(newSet)) {
-	          if (removing && removing.to == start && removing.mark.eq(marks[i]))
-	            { removing.to = end; }
-	          else
-	            { removed.push(removing = new RemoveMarkStep(start, end, marks[i])); }
-	        }
-	      }
-
-	      if (adding && adding.to == start)
-	        { adding.to = end; }
-	      else
-	        { added.push(adding = new AddMarkStep(start, end, mark)); }
-	    }
-	  });
-
-	  removed.forEach(function (s) { return this$1.step(s); });
-	  added.forEach(function (s) { return this$1.step(s); });
-	  return this
-	};
-
-	// :: (number, number, ?union<Mark, MarkType>) → this
-	// Remove marks from inline nodes between `from` and `to`. When `mark`
-	// is a single mark, remove precisely that mark. When it is a mark type,
-	// remove all marks of that type. When it is null, remove all marks of
-	// any type.
-	Transform.prototype.removeMark = function(from, to, mark) {
-	  var this$1 = this;
-	  if ( mark === void 0 ) { mark = null; }
-
-	  var matched = [], step = 0;
-	  this.doc.nodesBetween(from, to, function (node, pos) {
-	    if (!node.isInline) { return }
-	    step++;
-	    var toRemove = null;
-	    if (mark instanceof dist.MarkType) {
-	      var found = mark.isInSet(node.marks);
-	      if (found) { toRemove = [found]; }
-	    } else if (mark) {
-	      if (mark.isInSet(node.marks)) { toRemove = [mark]; }
-	    } else {
-	      toRemove = node.marks;
-	    }
-	    if (toRemove && toRemove.length) {
-	      var end = Math.min(pos + node.nodeSize, to);
-	      for (var i = 0; i < toRemove.length; i++) {
-	        var style = toRemove[i], found$1 = (void 0);
-	        for (var j = 0; j < matched.length; j++) {
-	          var m = matched[j];
-	          if (m.step == step - 1 && style.eq(matched[j].style)) { found$1 = m; }
-	        }
-	        if (found$1) {
-	          found$1.to = end;
-	          found$1.step = step;
-	        } else {
-	          matched.push({style: style, from: Math.max(pos, from), to: end, step: step});
-	        }
-	      }
-	    }
-	  });
-	  matched.forEach(function (m) { return this$1.step(new RemoveMarkStep(m.from, m.to, m.style)); });
-	  return this
-	};
-
-	// :: (number, NodeType, ?ContentMatch) → this
-	// Removes all marks and nodes from the content of the node at `pos`
-	// that don't match the given new parent node type. Accepts an
-	// optional starting [content match](#model.ContentMatch) as third
-	// argument.
-	Transform.prototype.clearIncompatible = function(pos, parentType, match) {
-	  var this$1 = this;
-	  if ( match === void 0 ) { match = parentType.contentMatch; }
-
-	  var node = this.doc.nodeAt(pos);
-	  var delSteps = [], cur = pos + 1;
-	  for (var i = 0; i < node.childCount; i++) {
-	    var child = node.child(i), end = cur + child.nodeSize;
-	    var allowed = match.matchType(child.type, child.attrs);
-	    if (!allowed) {
-	      delSteps.push(new ReplaceStep(cur, end, dist.Slice.empty));
-	    } else {
-	      match = allowed;
-	      for (var j = 0; j < child.marks.length; j++) { if (!parentType.allowsMarkType(child.marks[j].type))
-	        { this$1.step(new RemoveMarkStep(cur, end, child.marks[j])); } }
-	    }
-	    cur = end;
-	  }
-	  if (!match.validEnd) {
-	    var fill = match.fillBefore(dist.Fragment.empty, true);
-	    this.replace(cur, cur, new dist.Slice(fill, 0, 0));
-	  }
-	  for (var i$1 = delSteps.length - 1; i$1 >= 0; i$1--) { this$1.step(delSteps[i$1]); }
-	  return this
-	};
-
-	// :: (Node, number, ?number, ?Slice) → ?Step
-	// ‘Fit’ a slice into a given position in the document, producing a
-	// [step](#transform.Step) that inserts it. Will return null if
-	// there's no meaningful way to insert the slice here, or inserting it
-	// would be a no-op (an empty slice over an empty range).
-	function replaceStep(doc, from, to, slice) {
-	  if ( to === void 0 ) { to = from; }
-	  if ( slice === void 0 ) { slice = dist.Slice.empty; }
-
-	  if (from == to && !slice.size) { return null }
-
-	  var $from = doc.resolve(from), $to = doc.resolve(to);
-	  // Optimization -- avoid work if it's obvious that it's not needed.
-	  if (fitsTrivially($from, $to, slice)) { return new ReplaceStep(from, to, slice) }
-	  var placed = placeSlice($from, slice);
-
-	  var fittedLeft = fitLeft($from, placed);
-	  var fitted = fitRight($from, $to, fittedLeft);
-	  if (!fitted) { return null }
-	  if (fittedLeft.size != fitted.size && canMoveText($from, $to, fittedLeft)) {
-	    var d = $to.depth, after = $to.after(d);
-	    while (d > 1 && after == $to.end(--d)) { ++after; }
-	    var fittedAfter = fitRight($from, doc.resolve(after), fittedLeft);
-	    if (fittedAfter)
-	      { return new ReplaceAroundStep(from, after, to, $to.end(), fittedAfter, fittedLeft.size) }
-	  }
-	  return fitted.size || from != to ? new ReplaceStep(from, to, fitted) : null
-	}
-
-	// :: (number, ?number, ?Slice) → this
-	// Replace the part of the document between `from` and `to` with the
-	// given `slice`.
-	Transform.prototype.replace = function(from, to, slice) {
-	  if ( to === void 0 ) { to = from; }
-	  if ( slice === void 0 ) { slice = dist.Slice.empty; }
-
-	  var step = replaceStep(this.doc, from, to, slice);
-	  if (step) { this.step(step); }
-	  return this
-	};
-
-	// :: (number, number, union<Fragment, Node, [Node]>) → this
-	// Replace the given range with the given content, which may be a
-	// fragment, node, or array of nodes.
-	Transform.prototype.replaceWith = function(from, to, content) {
-	  return this.replace(from, to, new dist.Slice(dist.Fragment.from(content), 0, 0))
-	};
-
-	// :: (number, number) → this
-	// Delete the content between the given positions.
-	Transform.prototype.delete = function(from, to) {
-	  return this.replace(from, to, dist.Slice.empty)
-	};
-
-	// :: (number, union<Fragment, Node, [Node]>) → this
-	// Insert the given content at the given position.
-	Transform.prototype.insert = function(pos, content) {
-	  return this.replaceWith(pos, pos, content)
-	};
-
-
-
-	function fitLeftInner($from, depth, placed, placedBelow) {
-	  var content = dist.Fragment.empty, openEnd = 0, placedHere = placed[depth];
-	  if ($from.depth > depth) {
-	    var inner = fitLeftInner($from, depth + 1, placed, placedBelow || placedHere);
-	    openEnd = inner.openEnd + 1;
-	    content = dist.Fragment.from($from.node(depth + 1).copy(inner.content));
-	  }
-
-	  if (placedHere) {
-	    content = content.append(placedHere.content);
-	    openEnd = placedHere.openEnd;
-	  }
-	  if (placedBelow) {
-	    content = content.append($from.node(depth).contentMatchAt($from.indexAfter(depth)).fillBefore(dist.Fragment.empty, true));
-	    openEnd = 0;
-	  }
-
-	  return {content: content, openEnd: openEnd}
-	}
-
-	function fitLeft($from, placed) {
-	  var ref = fitLeftInner($from, 0, placed, false);
-	  var content = ref.content;
-	  var openEnd = ref.openEnd;
-	  return new dist.Slice(content, $from.depth, openEnd || 0)
-	}
-
-	function fitRightJoin(content, parent, $from, $to, depth, openStart, openEnd) {
-	  var match, count = content.childCount, matchCount = count - (openEnd > 0 ? 1 : 0);
-	  var parentNode = openStart < 0 ? parent : $from.node(depth);
-	  if (openStart < 0)
-	    { match = parentNode.contentMatchAt(matchCount); }
-	  else if (count == 1 && openEnd > 0)
-	    { match = parentNode.contentMatchAt(openStart ? $from.index(depth) : $from.indexAfter(depth)); }
-	  else
-	    { match = parentNode.contentMatchAt($from.indexAfter(depth))
-	      .matchFragment(content, count > 0 && openStart ? 1 : 0, matchCount); }
-
-	  var toNode = $to.node(depth);
-	  if (openEnd > 0 && depth < $to.depth) {
-	    var after = toNode.content.cutByIndex($to.indexAfter(depth)).addToStart(content.lastChild);
-	    var joinable$1 = match.fillBefore(after, true);
-	    // Can't insert content if there's a single node stretched across this gap
-	    if (joinable$1 && joinable$1.size && openStart > 0 && count == 1) { joinable$1 = null; }
-
-	    if (joinable$1) {
-	      var inner = fitRightJoin(content.lastChild.content, content.lastChild, $from, $to,
-	                               depth + 1, count == 1 ? openStart - 1 : -1, openEnd - 1);
-	      if (inner) {
-	        var last = content.lastChild.copy(inner);
-	        if (joinable$1.size)
-	          { return content.cutByIndex(0, count - 1).append(joinable$1).addToEnd(last) }
-	        else
-	          { return content.replaceChild(count - 1, last) }
-	      }
-	    }
-	  }
-	  if (openEnd > 0)
-	    { match = match.matchType((count == 1 && openStart > 0 ? $from.node(depth + 1) : content.lastChild).type); }
-
-	  // If we're here, the next level can't be joined, so we see what
-	  // happens if we leave it open.
-	  var toIndex = $to.index(depth);
-	  if (toIndex == toNode.childCount && !toNode.type.compatibleContent(parent.type)) { return null }
-	  var joinable = match.fillBefore(toNode.content, true, toIndex);
-	  for (var i = toIndex; joinable && i < toNode.content.childCount; i++)
-	    { if (!parentNode.type.allowsMarks(toNode.content.child(i).marks)) { joinable = null; } }
-	  if (!joinable) { return null }
-
-	  if (openEnd > 0) {
-	    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
-	                                count == 1 ? openStart - 1 : -1);
-	    content = content.replaceChild(count - 1, closed);
-	  }
-	  content = content.append(joinable);
-	  if ($to.depth > depth)
-	    { content = content.addToEnd(fitRightSeparate($to, depth + 1)); }
-	  return content
-	}
-
-	function fitRightClosed(node, openEnd, $from, depth, openStart) {
-	  var match, content = node.content, count = content.childCount;
-	  if (openStart >= 0)
-	    { match = $from.node(depth).contentMatchAt($from.indexAfter(depth))
-	      .matchFragment(content, openStart > 0 ? 1 : 0, count); }
-	  else
-	    { match = node.contentMatchAt(count); }
-
-	  if (openEnd > 0) {
-	    var closed = fitRightClosed(content.lastChild, openEnd - 1, $from, depth + 1,
-	                                count == 1 ? openStart - 1 : -1);
-	    content = content.replaceChild(count - 1, closed);
-	  }
-
-	  return node.copy(content.append(match.fillBefore(dist.Fragment.empty, true)))
-	}
-
-	function fitRightSeparate($to, depth) {
-	  var node = $to.node(depth);
-	  var fill = node.contentMatchAt(0).fillBefore(node.content, true, $to.index(depth));
-	  if ($to.depth > depth) { fill = fill.addToEnd(fitRightSeparate($to, depth + 1)); }
-	  return node.copy(fill)
-	}
-
-	function normalizeSlice(content, openStart, openEnd) {
-	  while (openStart > 0 && openEnd > 0 && content.childCount == 1) {
-	    content = content.firstChild.content;
-	    openStart--;
-	    openEnd--;
-	  }
-	  return new dist.Slice(content, openStart, openEnd)
-	}
-
-	// : (ResolvedPos, ResolvedPos, number, Slice) → Slice
-	function fitRight($from, $to, slice) {
-	  var fitted = fitRightJoin(slice.content, $from.node(0), $from, $to, 0, slice.openStart, slice.openEnd);
-	  if (!fitted) { return null }
-	  return normalizeSlice(fitted, slice.openStart, $to.depth)
-	}
-
-	function fitsTrivially($from, $to, slice) {
-	  return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&
-	    $from.parent.canReplace($from.index(), $to.index(), slice.content)
-	}
-
-	function canMoveText($from, $to, slice) {
-	  if (!$to.parent.isTextblock) { return false }
-
-	  var parent = slice.openEnd ? nodeRight(slice.content, slice.openEnd)
-	      : $from.node($from.depth - (slice.openStart - slice.openEnd));
-	  if (!parent.isTextblock) { return false }
-	  for (var i = $to.index(); i < $to.parent.childCount; i++)
-	    { if (!parent.type.allowsMarks($to.parent.child(i).marks)) { return false } }
-	  var match;
-	  if (slice.openEnd) {
-	    match = parent.contentMatchAt(parent.childCount);
-	  } else {
-	    match = parent.contentMatchAt(parent.childCount);
-	    if (slice.size) { match = match.matchFragment(slice.content, slice.openStart ? 1 : 0); }
-	  }
-	  match = match.matchFragment($to.parent.content, $to.index());
-	  return match && match.validEnd
-	}
-
-	function nodeRight(content, depth) {
-	  for (var i = 1; i < depth; i++) { content = content.lastChild.content; }
-	  return content.lastChild
-	}
-
-	// Algorithm for 'placing' the elements of a slice into a gap:
-	//
-	// We consider the content of each node that is open to the left to be
-	// independently placeable. I.e. in <p("foo"), p("bar")>, when the
-	// paragraph on the left is open, "foo" can be placed (somewhere on
-	// the left side of the replacement gap) independently from p("bar").
-	//
-	// So placeSlice splits up a slice into a number of sub-slices,
-	// along with information on where they can be placed on the given
-	// left-side edge. It works by walking the open side of the slice,
-	// from the inside out, and trying to find a landing spot for each
-	// element, by simultaneously scanning over the gap side. When no
-	// place is found for an open node's content, it is left in that node.
-
-	// : (ResolvedPos, Slice) → [{content: Fragment, openEnd: number, depth: number}]
-	function placeSlice($from, slice) {
-	  var frontier = new Frontier($from);
-	  for (var pass = 1; slice.size && pass <= 3; pass++)
-	    { slice = frontier.placeSlice(slice.content, slice.openStart, slice.openEnd, pass); }
-	  while (frontier.open.length) { frontier.closeNode(); }
-	  return frontier.placed
-	}
-
-	// Helper class that models the open side of the insert position,
-	// keeping track of the content match and already inserted content
-	// at each depth.
-	var Frontier = function Frontier($pos) {
-	  var this$1 = this;
-
-	  // : [{parent: Node, match: ContentMatch, content: Fragment, wrapper: bool, openEnd: number, depth: number}]
-	  this.open = [];
-	  for (var d = 0; d <= $pos.depth; d++) {
-	    var parent = $pos.node(d), match = parent.contentMatchAt($pos.indexAfter(d));
-	    this$1.open.push({parent: parent, match: match, content: dist.Fragment.empty, wrapper: false, openEnd: 0, depth: d});
-	  }
-	  this.placed = [];
-	};
-
-	// : (Fragment, number, number, number, ?Node) → Slice
-	// Tries to place the content of the given slice, and returns a
-	// slice containing unplaced content.
-	//
-	// pass 1: try to fit directly
-	// pass 2: allow wrapper nodes to be introduced
-	// pass 3: allow unwrapping of nodes that aren't open
-	Frontier.prototype.placeSlice = function placeSlice (fragment, openStart, openEnd, pass, parent) {
-	    var this$1 = this;
-
-	  if (openStart > 0) {
-	    var first = fragment.firstChild;
-	    var inner = this.placeSlice(first.content, Math.max(0, openStart - 1),
-	                                openEnd && fragment.childCount == 1 ? openEnd - 1 : 0,
-	                                pass, first);
-	    if (inner.content != first.content) {
-	      if (inner.content.size) {
-	        fragment = fragment.replaceChild(0, first.copy(inner.content));
-	        openStart = inner.openStart + 1;
-	      } else {
-	        if (fragment.childCount == 1) { openEnd = 0; }
-	        fragment = fragment.cutByIndex(1);
-	        openStart = 0;
-	      }
-	    }
-	  }
-	  var result = this.placeContent(fragment, openStart, openEnd, pass, parent);
-	  if (pass > 2 && result.size && openStart == 0) {
-	    for (var i = 0; i < result.content.childCount; i++) {
-	      var child = result.content.child(i);
-	      this$1.placeContent(child.content, 0,
-	                        openEnd && i == result.content.childCount.length - 1 ? openEnd - 1 : 0,
-	                        pass, child);
-	    }
-	    result = dist.Fragment.empty;
-	  }
-	  return result
-	};
-
-	Frontier.prototype.placeContent = function placeContent (fragment, openStart, openEnd, pass, parent) {
-	    var this$1 = this;
-
-	  var i = 0;
-	  // Go over the fragment's children
-	  for (; i < fragment.childCount; i++) {
-	    var child = fragment.child(i), placed = false, last = i == fragment.childCount - 1;
-	    // Try each open node in turn, starting from the innermost
-	    for (var d = this.open.length - 1; d >= 0; d--) {
-	      var open = this$1.open[d], wrap = (void 0);
-
-	      // If pass > 1, it is allowed to wrap the node to help find a
-	      // fit, so if findWrappeing returns something, we add open
-	      // nodes to the frontier for that wrapping.
-	      if (pass > 1 && (wrap = open.match.findWrapping(child.type)) &&
-	          !(parent && wrap.length && wrap[wrap.length - 1] == parent.type)) {
-	        while (this.open.length - 1 > d) { this$1.closeNode(); }
-	        for (var w = 0; w < wrap.length; w++) {
-	          open.match = open.match.matchType(wrap[w]);
-	          d++;
-	          open = {parent: wrap[w].create(),
-	                  match: wrap[w].contentMatch,
-	                  content: dist.Fragment.empty, wrapper: true, openEnd: 0, depth: d + w};
-	          this$1.open.push(open);
-	        }
-	      }
-
-	      // See if the child fits here
-	      var match = open.match.matchType(child.type);
-	      if (!match) {
-	        var fill = open.match.fillBefore(dist.Fragment.from(child));
-	        if (fill) {
-	          for (var j = 0; j < fill.childCount; j++) {
-	            var ch = fill.child(j);
-	            this$1.addNode(open, ch, 0);
-	            match = open.match.matchFragment(ch);
-	          }
-	        } else if (parent && open.match.matchType(parent.type)) {
-	          // Don't continue looking further up if the parent node
-	          // would fit here.
-	          break
-	        } else {
-	          continue
-	        }
-	      }
-
-	      // Close open nodes above this one, since we're starting to
-	      // add to this.
-	      while (this.open.length - 1 > d) { this$1.closeNode(); }
-	      // Strip marks from the child or close its start when necessary
-	      child = child.mark(open.parent.type.allowedMarks(child.marks));
-	      if (openStart) {
-	        child = closeNodeStart(child, openStart, last ? openEnd : 0);
-	        openStart = 0;
-	      }
-	      // Add the child to this open node and adjust its metadata
-	      this$1.addNode(open, child, last ? openEnd : 0);
-	      open.match = match;
-	      if (last) { openEnd = 0; }
-	      placed = true;
-	      break
-	    }
-	    // As soon as we've failed to place a node we stop looking at
-	    // later nodes
-	    if (!placed) { break }
-	  }
-	  // Close the current open node if it's not the the root and we
-	  // either placed up to the end of the node or the the current
-	  // slice depth's node type matches the open node's type
-	  if (this.open.length > 1 &&
-	      (i > 0 && i == fragment.childCount ||
-	       parent && this.open[this.open.length - 1].parent.type == parent.type))
-	    { this.closeNode(); }
-
-	  return new dist.Slice(fragment.cutByIndex(i), openStart, openEnd)
-	};
-
-	Frontier.prototype.addNode = function addNode (open, node, openEnd) {
-	  open.content = closeFragmentEnd(open.content, open.openEnd).addToEnd(node);
-	  open.openEnd = openEnd;
-	};
-
-	Frontier.prototype.closeNode = function closeNode () {
-	  var open = this.open.pop();
-	  if (open.content.size == 0) ; else if (open.wrapper) {
-	    this.addNode(this.open[this.open.length - 1], open.parent.copy(open.content), open.openEnd + 1);
-	  } else {
-	    this.placed[open.depth] = {depth: open.depth, content: open.content, openEnd: open.openEnd};
-	  }
-	};
-
-	function closeNodeStart(node, openStart, openEnd) {
-	  var content = node.content;
-	  if (openStart > 1) {
-	    var first = closeNodeStart(node.firstChild, openStart - 1, node.childCount == 1 ? openEnd - 1 : 0);
-	    content = node.content.replaceChild(0, first);
-	  }
-	  var fill = node.type.contentMatch.fillBefore(content, openEnd == 0);
-	  return node.copy(fill.append(content))
-	}
-
-	function closeNodeEnd(node, depth) {
-	  var content = node.content;
-	  if (depth > 1) {
-	    var last = closeNodeEnd(node.lastChild, depth - 1);
-	    content = node.content.replaceChild(node.childCount - 1, last);
-	  }
-	  var fill = node.contentMatchAt(node.childCount).fillBefore(dist.Fragment.empty, true);
-	  return node.copy(content.append(fill))
-	}
-
-	function closeFragmentEnd(fragment, depth) {
-	  return depth ? fragment.replaceChild(fragment.childCount - 1, closeNodeEnd(fragment.lastChild, depth)) : fragment
-	}
-
-	// :: (number, number, Slice) → this
-	// Replace a range of the document with a given slice, using `from`,
-	// `to`, and the slice's [`openStart`](#model.Slice.openStart) property
-	// as hints, rather than fixed start and end points. This method may
-	// grow the replaced area or close open nodes in the slice in order to
-	// get a fit that is more in line with WYSIWYG expectations, by
-	// dropping fully covered parent nodes of the replaced region when
-	// they are marked [non-defining](#model.NodeSpec.defining), or
-	// including an open parent node from the slice that _is_ marked as
-	// [defining](#model.NodeSpec.defining).
-	//
-	// This is the method, for example, to handle paste. The similar
-	// [`replace`](#transform.Transform.replace) method is a more
-	// primitive tool which will _not_ move the start and end of its given
-	// range, and is useful in situations where you need more precise
-	// control over what happens.
-	Transform.prototype.replaceRange = function(from, to, slice) {
-	  var this$1 = this;
-
-	  if (!slice.size) { return this.deleteRange(from, to) }
-
-	  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
-	  if (fitsTrivially($from, $to, slice))
-	    { return this.step(new ReplaceStep(from, to, slice)) }
-
-	  var targetDepths = coveredDepths($from, this.doc.resolve(to));
-	  // Can't replace the whole document, so remove 0 if it's present
-	  if (targetDepths[targetDepths.length - 1] == 0) { targetDepths.pop(); }
-	  // Negative numbers represent not expansion over the whole node at
-	  // that depth, but replacing from $from.before(-D) to $to.pos.
-	  var preferredTarget = -($from.depth + 1);
-	  targetDepths.unshift(preferredTarget);
-	  // This loop picks a preferred target depth, if one of the covering
-	  // depths is not outside of a defining node, and adds negative
-	  // depths for any depth that has $from at its start and does not
-	  // cross a defining node.
-	  for (var d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {
-	    var spec = $from.node(d).type.spec;
-	    if (spec.defining || spec.isolating) { break }
-	    if (targetDepths.indexOf(d) > -1) { preferredTarget = d; }
-	    else if ($from.before(d) == pos) { targetDepths.splice(1, 0, -d); }
-	  }
-	  // Try to fit each possible depth of the slice into each possible
-	  // target depth, starting with the preferred depths.
-	  var preferredTargetIndex = targetDepths.indexOf(preferredTarget);
-
-	  var leftNodes = [], preferredDepth = slice.openStart;
-	  for (var content = slice.content, i = 0;; i++) {
-	    var node = content.firstChild;
-	    leftNodes.push(node);
-	    if (i == slice.openStart) { break }
-	    content = node.content;
-	  }
-	  // Back up if the node directly above openStart, or the node above
-	  // that separated only by a non-defining textblock node, is defining.
-	  if (preferredDepth > 0 && leftNodes[preferredDepth - 1].type.spec.defining &&
-	      $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 1].type)
-	    { preferredDepth -= 1; }
-	  else if (preferredDepth >= 2 && leftNodes[preferredDepth - 1].isTextblock && leftNodes[preferredDepth - 2].type.spec.defining &&
-	           $from.node(preferredTargetIndex).type != leftNodes[preferredDepth - 2].type)
-	    { preferredDepth -= 2; }
-
-	  for (var j = slice.openStart; j >= 0; j--) {
-	    var openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);
-	    var insert = leftNodes[openDepth];
-	    if (!insert) { continue }
-	    for (var i$1 = 0; i$1 < targetDepths.length; i$1++) {
-	      // Loop over possible expansion levels, starting with the
-	      // preferred one
-	      var targetDepth = targetDepths[(i$1 + preferredTargetIndex) % targetDepths.length], expand = true;
-	      if (targetDepth < 0) { expand = false; targetDepth = -targetDepth; }
-	      var parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);
-	      if (parent.canReplaceWith(index, index, insert.type, insert.marks))
-	        { return this$1.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to,
-	                            new dist.Slice(closeFragment(slice.content, 0, slice.openStart, openDepth),
-	                                      openDepth, slice.openEnd)) }
-	    }
-	  }
-
-	  return this.replace(from, to, slice)
-	};
-
-	function closeFragment(fragment, depth, oldOpen, newOpen, parent) {
-	  if (depth < oldOpen) {
-	    var first = fragment.firstChild;
-	    fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));
-	  }
-	  if (depth > newOpen)
-	    { fragment = parent.contentMatchAt(0).fillBefore(fragment, true).append(fragment); }
-	  return fragment
-	}
-
-	// :: (number, number, Node) → this
-	// Replace the given range with a node, but use `from` and `to` as
-	// hints, rather than precise positions. When from and to are the same
-	// and are at the start or end of a parent node in which the given
-	// node doesn't fit, this method may _move_ them out towards a parent
-	// that does allow the given node to be placed. When the given range
-	// completely covers a parent node, this method may completely replace
-	// that parent node.
-	Transform.prototype.replaceRangeWith = function(from, to, node) {
-	  if (!node.isInline && from == to && this.doc.resolve(from).parent.content.size) {
-	    var point = insertPoint(this.doc, from, node.type);
-	    if (point != null) { from = to = point; }
-	  }
-	  return this.replaceRange(from, to, new dist.Slice(dist.Fragment.from(node), 0, 0))
-	};
-
-	// :: (number, number) → this
-	// Delete the given range, expanding it to cover fully covered
-	// parent nodes until a valid replace is found.
-	Transform.prototype.deleteRange = function(from, to) {
-	  var this$1 = this;
-
-	  var $from = this.doc.resolve(from), $to = this.doc.resolve(to);
-	  var covered = coveredDepths($from, $to);
-	  for (var i = 0; i < covered.length; i++) {
-	    var depth = covered[i], last = i == covered.length - 1;
-	    if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)
-	      { return this$1.delete($from.start(depth), $to.end(depth)) }
-	    if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))
-	      { return this$1.delete($from.before(depth), $to.after(depth)) }
-	  }
-	  for (var d = 1; d <= $from.depth; d++) {
-	    if (from - $from.start(d) == $from.depth - d && to > $from.end(d))
-	      { return this$1.delete($from.before(d), to) }
-	  }
-	  return this.delete(from, to)
-	};
-
-	// : (ResolvedPos, ResolvedPos) → [number]
-	// Returns an array of all depths for which $from - $to spans the
-	// whole content of the nodes at that depth.
-	function coveredDepths($from, $to) {
-	  var result = [], minDepth = Math.min($from.depth, $to.depth);
-	  for (var d = minDepth; d >= 0; d--) {
-	    var start = $from.start(d);
-	    if (start < $from.pos - ($from.depth - d) ||
-	        $to.end(d) > $to.pos + ($to.depth - d) ||
-	        $from.node(d).type.spec.isolating ||
-	        $to.node(d).type.spec.isolating) { break }
-	    if (start == $to.start(d)) { result.push(d); }
-	  }
-	  return result
-	}
-
-	exports.Transform = Transform;
-	exports.TransformError = TransformError;
-	exports.Step = Step;
-	exports.StepResult = StepResult;
-	exports.joinPoint = joinPoint;
-	exports.canJoin = canJoin;
-	exports.canSplit = canSplit;
-	exports.insertPoint = insertPoint;
-	exports.dropPoint = dropPoint;
-	exports.liftTarget = liftTarget;
-	exports.findWrapping = findWrapping;
-	exports.StepMap = StepMap;
-	exports.MapResult = MapResult;
-	exports.Mapping = Mapping;
-	exports.AddMarkStep = AddMarkStep;
-	exports.RemoveMarkStep = RemoveMarkStep;
-	exports.ReplaceStep = ReplaceStep;
-	exports.ReplaceAroundStep = ReplaceAroundStep;
-	exports.replaceStep = replaceStep;
-
-	});
-
-	unwrapExports(dist$1);
-	var dist_1$1 = dist$1.Transform;
-	var dist_2$1 = dist$1.TransformError;
-	var dist_3$1 = dist$1.Step;
-	var dist_4$1 = dist$1.StepResult;
-	var dist_5$1 = dist$1.joinPoint;
-	var dist_6$1 = dist$1.canJoin;
-	var dist_7$1 = dist$1.canSplit;
-	var dist_8$1 = dist$1.insertPoint;
-	var dist_9$1 = dist$1.dropPoint;
-	var dist_10$1 = dist$1.liftTarget;
-	var dist_11$1 = dist$1.findWrapping;
-	var dist_12$1 = dist$1.StepMap;
-	var dist_13$1 = dist$1.MapResult;
-	var dist_14 = dist$1.Mapping;
-	var dist_15 = dist$1.AddMarkStep;
-	var dist_16 = dist$1.RemoveMarkStep;
-	var dist_17 = dist$1.ReplaceStep;
-	var dist_18 = dist$1.ReplaceAroundStep;
-	var dist_19 = dist$1.replaceStep;
-
-	var dist$2 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-	var classesById = Object.create(null);
-
-	// ::- Superclass for editor selections. Every selection type should
-	// extend this. Should not be instantiated directly.
-	var Selection = function Selection($anchor, $head, ranges) {
-	  // :: [SelectionRange]
-	  // The ranges covered by the selection.
-	  this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];
-	  // :: ResolvedPos
-	  // The resolved anchor of the selection (the side that stays in
-	  // place when the selection is modified).
-	  this.$anchor = $anchor;
-	  // :: ResolvedPos
-	  // The resolved head of the selection (the side that moves when
-	  // the selection is modified).
-	  this.$head = $head;
-	};
-
-	var prototypeAccessors = { anchor: {},head: {},from: {},to: {},$from: {},$to: {},empty: {} };
-
-	// :: number
-	// The selection's anchor, as an unresolved position.
-	prototypeAccessors.anchor.get = function () { return this.$anchor.pos };
-
-	// :: number
-	// The selection's head.
-	prototypeAccessors.head.get = function () { return this.$head.pos };
-
-	// :: number
-	// The lower bound of the selection's main range.
-	prototypeAccessors.from.get = function () { return this.$from.pos };
-
-	// :: number
-	// The upper bound of the selection's main range.
-	prototypeAccessors.to.get = function () { return this.$to.pos };
-
-	// :: ResolvedPos
-	// The resolved lowerbound of the selection's main range.
-	prototypeAccessors.$from.get = function () {
-	  return this.ranges[0].$from
-	};
-
-	// :: ResolvedPos
-	// The resolved upper bound of the selection's main range.
-	prototypeAccessors.$to.get = function () {
-	  return this.ranges[0].$to
-	};
-
-	// :: bool
-	// Indicates whether the selection contains any content.
-	prototypeAccessors.empty.get = function () {
-	  var ranges = this.ranges;
-	  for (var i = 0; i < ranges.length; i++)
-	    { if (ranges[i].$from.pos != ranges[i].$to.pos) { return false } }
-	  return true
-	};
-
-	// eq:: (Selection) → bool
-	// Test whether the selection is the same as another selection.
-
-	// map:: (doc: Node, mapping: Mappable) → Selection
-	// Map this selection through a [mappable](#transform.Mappable) thing. `doc`
-	// should be the new document to which we are mapping.
-
-	// :: () → Slice
-	// Get the content of this selection as a slice.
-	Selection.prototype.content = function content () {
-	  return this.$from.node(0).slice(this.from, this.to, true)
-	};
-
-	// :: (Transaction, ?Slice)
-	// Replace the selection with a slice or, if no slice is given,
-	// delete the selection. Will append to the given transaction.
-	Selection.prototype.replace = function replace (tr, content) {
-	    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-	  // Put the new selection at the position after the inserted
-	  // content. When that ended in an inline node, search backwards,
-	  // to get the position after that node. If not, search forward.
-	  var lastNode = content.content.lastChild, lastParent = null;
-	  for (var i = 0; i < content.openEnd; i++) {
-	    lastParent = lastNode;
-	    lastNode = lastNode.lastChild;
-	  }
-
-	  var mapFrom = tr.steps.length, ranges = this.ranges;
-	  for (var i$1 = 0; i$1 < ranges.length; i$1++) {
-	    var ref = ranges[i$1];
-	      var $from = ref.$from;
-	      var $to = ref.$to;
-	      var mapping = tr.mapping.slice(mapFrom);
-	    tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i$1 ? dist.Slice.empty : content);
-	    if (i$1 == 0)
-	      { selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1); }
-	  }
-	};
-
-	// :: (Transaction, Node)
-	// Replace the selection with the given node, appending the changes
-	// to the given transaction.
-	Selection.prototype.replaceWith = function replaceWith (tr, node) {
-	  var mapFrom = tr.steps.length, ranges = this.ranges;
-	  for (var i = 0; i < ranges.length; i++) {
-	    var ref = ranges[i];
-	      var $from = ref.$from;
-	      var $to = ref.$to;
-	      var mapping = tr.mapping.slice(mapFrom);
-	    var from = mapping.map($from.pos), to = mapping.map($to.pos);
-	    if (i) {
-	      tr.deleteRange(from, to);
-	    } else {
-	      tr.replaceRangeWith(from, to, node);
-	      selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);
-	    }
-	  }
-	};
-
-	// toJSON:: () → Object
-	// Convert the selection to a JSON representation. When implementing
-	// this for a custom selection class, make sure to give the object a
-	// `type` property whose value matches the ID under which you
-	// [registered](#state.Selection^jsonID) your class.
-
-	// :: (ResolvedPos, number, ?bool) → ?Selection
-	// Find a valid cursor or leaf node selection starting at the given
-	// position and searching back if `dir` is negative, and forward if
-	// positive. When `textOnly` is true, only consider cursor
-	// selections. Will return null when no valid selection position is
-	// found.
-	Selection.findFrom = function findFrom ($pos, dir, textOnly) {
-	  var inner = $pos.parent.inlineContent ? new TextSelection($pos)
-	      : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);
-	  if (inner) { return inner }
-
-	  for (var depth = $pos.depth - 1; depth >= 0; depth--) {
-	    var found = dir < 0
-	        ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)
-	        : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);
-	    if (found) { return found }
-	  }
-	};
-
-	// :: (ResolvedPos, ?number) → Selection
-	// Find a valid cursor or leaf node selection near the given
-	// position. Searches forward first by default, but if `bias` is
-	// negative, it will search backwards first.
-	Selection.near = function near ($pos, bias) {
-	    if ( bias === void 0 ) { bias = 1; }
-
-	  return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0))
-	};
-
-	// :: (Node) → Selection
-	// Find the cursor or leaf node selection closest to the start of
-	// the given document. Will return an
-	// [`AllSelection`](#state.AllSelection) if no valid position
-	// exists.
-	Selection.atStart = function atStart (doc) {
-	  return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc)
-	};
-
-	// :: (Node) → Selection
-	// Find the cursor or leaf node selection closest to the end of the
-	// given document.
-	Selection.atEnd = function atEnd (doc) {
-	  return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc)
-	};
-
-	// :: (Node, Object) → Selection
-	// Deserialize the JSON representation of a selection. Must be
-	// implemented for custom classes (as a static class method).
-	Selection.fromJSON = function fromJSON (doc, json) {
-	  if (!json || !json.type) { throw new RangeError("Invalid input for Selection.fromJSON") }
-	  var cls = classesById[json.type];
-	  if (!cls) { throw new RangeError(("No selection type " + (json.type) + " defined")) }
-	  return cls.fromJSON(doc, json)
-	};
-
-	// :: (string, constructor<Selection>)
-	// To be able to deserialize selections from JSON, custom selection
-	// classes must register themselves with an ID string, so that they
-	// can be disambiguated. Try to pick something that's unlikely to
-	// clash with classes from other modules.
-	Selection.jsonID = function jsonID (id, selectionClass) {
-	  if (id in classesById) { throw new RangeError("Duplicate use of selection JSON ID " + id) }
-	  classesById[id] = selectionClass;
-	  selectionClass.prototype.jsonID = id;
-	  return selectionClass
-	};
-
-	// :: () → SelectionBookmark
-	// Get a [bookmark](#state.SelectionBookmark) for this selection,
-	// which is a value that can be mapped without having access to a
-	// current document, and later resolved to a real selection for a
-	// given document again. (This is used mostly by the history to
-	// track and restore old selections.) The default implementation of
-	// this method just converts the selection to a text selection and
-	// returns the bookmark for that.
-	Selection.prototype.getBookmark = function getBookmark () {
-	  return TextSelection.between(this.$anchor, this.$head).getBookmark()
-	};
-
-	Object.defineProperties( Selection.prototype, prototypeAccessors );
-
-	// :: bool
-	// Controls whether, when a selection of this type is active in the
-	// browser, the selected range should be visible to the user. Defaults
-	// to `true`.
-	Selection.prototype.visible = true;
-
-	// SelectionBookmark:: interface
-	// A lightweight, document-independent representation of a selection.
-	// You can define a custom bookmark type for a custom selection class
-	// to make the history handle it well.
-	//
-	//   map:: (mapping: Mapping) → SelectionBookmark
-	//   Map the bookmark through a set of changes.
-	//
-	//   resolve:: (doc: Node) → Selection
-	//   Resolve the bookmark to a real selection again. This may need to
-	//   do some error checking and may fall back to a default (usually
-	//   [`TextSelection.between`](#state.TextSelection^between)) if
-	//   mapping made the bookmark invalid.
-
-	// ::- Represents a selected range in a document.
-	var SelectionRange = function SelectionRange($from, $to) {
-	  // :: ResolvedPos
-	  // The lower bound of the range.
-	  this.$from = $from;
-	  // :: ResolvedPos
-	  // The upper bound of the range.
-	  this.$to = $to;
-	};
-
-	// ::- A text selection represents a classical editor selection, with
-	// a head (the moving side) and anchor (immobile side), both of which
-	// point into textblock nodes. It can be empty (a regular cursor
-	// position).
-	var TextSelection = (function (Selection) {
-	  function TextSelection($anchor, $head) {
-	    if ( $head === void 0 ) { $head = $anchor; }
-
-	    Selection.call(this, $anchor, $head);
-	  }
-
-	  if ( Selection ) { TextSelection.__proto__ = Selection; }
-	  TextSelection.prototype = Object.create( Selection && Selection.prototype );
-	  TextSelection.prototype.constructor = TextSelection;
-
-	  var prototypeAccessors$1 = { $cursor: {} };
-
-	  // :: ?ResolvedPos
-	  // Returns a resolved position if this is a cursor selection (an
-	  // empty text selection), and null otherwise.
-	  prototypeAccessors$1.$cursor.get = function () { return this.$anchor.pos == this.$head.pos ? this.$head : null };
-
-	  TextSelection.prototype.map = function map (doc, mapping) {
-	    var $head = doc.resolve(mapping.map(this.head));
-	    if (!$head.parent.inlineContent) { return Selection.near($head) }
-	    var $anchor = doc.resolve(mapping.map(this.anchor));
-	    return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head)
-	  };
-
-	  TextSelection.prototype.replace = function replace (tr, content) {
-	    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-	    Selection.prototype.replace.call(this, tr, content);
-	    if (content == dist.Slice.empty) {
-	      var marks = this.$from.marksAcross(this.$to);
-	      if (marks) { tr.ensureMarks(marks); }
-	    }
-	  };
-
-	  TextSelection.prototype.eq = function eq (other) {
-	    return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head
-	  };
-
-	  TextSelection.prototype.getBookmark = function getBookmark () {
-	    return new TextBookmark(this.anchor, this.head)
-	  };
-
-	  TextSelection.prototype.toJSON = function toJSON () {
-	    return {type: "text", anchor: this.anchor, head: this.head}
-	  };
-
-	  TextSelection.fromJSON = function fromJSON (doc, json) {
-	    if (typeof json.anchor != "number" || typeof json.head != "number")
-	      { throw new RangeError("Invalid input for TextSelection.fromJSON") }
-	    return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head))
-	  };
-
-	  // :: (Node, number, ?number) → TextSelection
-	  // Create a text selection from non-resolved positions.
-	  TextSelection.create = function create (doc, anchor, head) {
-	    if ( head === void 0 ) { head = anchor; }
-
-	    var $anchor = doc.resolve(anchor);
-	    return new this($anchor, head == anchor ? $anchor : doc.resolve(head))
-	  };
-
-	  // :: (ResolvedPos, ResolvedPos, ?number) → Selection
-	  // Return a text selection that spans the given positions or, if
-	  // they aren't text positions, find a text selection near them.
-	  // `bias` determines whether the method searches forward (default)
-	  // or backwards (negative number) first. Will fall back to calling
-	  // [`Selection.near`](#state.Selection^near) when the document
-	  // doesn't contain a valid text position.
-	  TextSelection.between = function between ($anchor, $head, bias) {
-	    var dPos = $anchor.pos - $head.pos;
-	    if (!bias || dPos) { bias = dPos >= 0 ? 1 : -1; }
-	    if (!$head.parent.inlineContent) {
-	      var found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);
-	      if (found) { $head = found.$head; }
-	      else { return Selection.near($head, bias) }
-	    }
-	    if (!$anchor.parent.inlineContent) {
-	      if (dPos == 0) {
-	        $anchor = $head;
-	      } else {
-	        $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;
-	        if (($anchor.pos < $head.pos) != (dPos < 0)) { $anchor = $head; }
-	      }
-	    }
-	    return new TextSelection($anchor, $head)
-	  };
-
-	  Object.defineProperties( TextSelection.prototype, prototypeAccessors$1 );
-
-	  return TextSelection;
-	}(Selection));
-
-	Selection.jsonID("text", TextSelection);
-
-	var TextBookmark = function TextBookmark(anchor, head) {
-	  this.anchor = anchor;
-	  this.head = head;
-	};
-	TextBookmark.prototype.map = function map (mapping) {
-	  return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head))
-	};
-	TextBookmark.prototype.resolve = function resolve (doc) {
-	  return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head))
-	};
-
-	// ::- A node selection is a selection that points at a single node.
-	// All nodes marked [selectable](#model.NodeSpec.selectable) can be
-	// the target of a node selection. In such a selection, `from` and
-	// `to` point directly before and after the selected node, `anchor`
-	// equals `from`, and `head` equals `to`..
-	var NodeSelection = (function (Selection) {
-	  function NodeSelection($pos) {
-	    var node = $pos.nodeAfter;
-	    var $end = $pos.node(0).resolve($pos.pos + node.nodeSize);
-	    Selection.call(this, $pos, $end);
-	    // :: Node The selected node.
-	    this.node = node;
-	  }
-
-	  if ( Selection ) { NodeSelection.__proto__ = Selection; }
-	  NodeSelection.prototype = Object.create( Selection && Selection.prototype );
-	  NodeSelection.prototype.constructor = NodeSelection;
-
-	  NodeSelection.prototype.map = function map (doc, mapping) {
-	    var ref = mapping.mapResult(this.anchor);
-	    var deleted = ref.deleted;
-	    var pos = ref.pos;
-	    var $pos = doc.resolve(pos);
-	    if (deleted) { return Selection.near($pos) }
-	    return new NodeSelection($pos)
-	  };
-
-	  NodeSelection.prototype.content = function content () {
-	    return new dist.Slice(dist.Fragment.from(this.node), 0, 0)
-	  };
-
-	  NodeSelection.prototype.eq = function eq (other) {
-	    return other instanceof NodeSelection && other.anchor == this.anchor
-	  };
-
-	  NodeSelection.prototype.toJSON = function toJSON () {
-	    return {type: "node", anchor: this.anchor}
-	  };
-
-	  NodeSelection.prototype.getBookmark = function getBookmark () { return new NodeBookmark(this.anchor) };
-
-	  NodeSelection.fromJSON = function fromJSON (doc, json) {
-	    if (typeof json.anchor != "number")
-	      { throw new RangeError("Invalid input for NodeSelection.fromJSON") }
-	    return new NodeSelection(doc.resolve(json.anchor))
-	  };
-
-	  // :: (Node, number) → NodeSelection
-	  // Create a node selection from non-resolved positions.
-	  NodeSelection.create = function create (doc, from) {
-	    return new this(doc.resolve(from))
-	  };
-
-	  // :: (Node) → bool
-	  // Determines whether the given node may be selected as a node
-	  // selection.
-	  NodeSelection.isSelectable = function isSelectable (node) {
-	    return !node.isText && node.type.spec.selectable !== false
-	  };
-
-	  return NodeSelection;
-	}(Selection));
-
-	NodeSelection.prototype.visible = false;
-
-	Selection.jsonID("node", NodeSelection);
-
-	var NodeBookmark = function NodeBookmark(anchor) {
-	  this.anchor = anchor;
-	};
-	NodeBookmark.prototype.map = function map (mapping) {
-	  var ref = mapping.mapResult(this.anchor);
-	    var deleted = ref.deleted;
-	    var pos = ref.pos;
-	  return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos)
-	};
-	NodeBookmark.prototype.resolve = function resolve (doc) {
-	  var $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;
-	  if (node && NodeSelection.isSelectable(node)) { return new NodeSelection($pos) }
-	  return Selection.near($pos)
-	};
-
-	// ::- A selection type that represents selecting the whole document
-	// (which can not necessarily be expressed with a text selection, when
-	// there are for example leaf block nodes at the start or end of the
-	// document).
-	var AllSelection = (function (Selection) {
-	  function AllSelection(doc) {
-	    Selection.call(this, doc.resolve(0), doc.resolve(doc.content.size));
-	  }
-
-	  if ( Selection ) { AllSelection.__proto__ = Selection; }
-	  AllSelection.prototype = Object.create( Selection && Selection.prototype );
-	  AllSelection.prototype.constructor = AllSelection;
-
-	  AllSelection.prototype.toJSON = function toJSON () { return {type: "all"} };
-
-	  AllSelection.fromJSON = function fromJSON (doc) { return new AllSelection(doc) };
-
-	  AllSelection.prototype.map = function map (doc) { return new AllSelection(doc) };
-
-	  AllSelection.prototype.eq = function eq (other) { return other instanceof AllSelection };
-
-	  AllSelection.prototype.getBookmark = function getBookmark () { return AllBookmark };
-
-	  return AllSelection;
-	}(Selection));
-
-	Selection.jsonID("all", AllSelection);
-
-	var AllBookmark = {
-	  map: function map() { return this },
-	  resolve: function resolve(doc) { return new AllSelection(doc) }
-	};
-
-	// FIXME we'll need some awareness of text direction when scanning for selections
-
-	// Try to find a selection inside the given node. `pos` points at the
-	// position where the search starts. When `text` is true, only return
-	// text selections.
-	function findSelectionIn(doc, node, pos, index, dir, text) {
-	  if (node.inlineContent) { return TextSelection.create(doc, pos) }
-	  for (var i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {
-	    var child = node.child(i);
-	    if (!child.isAtom) {
-	      var inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);
-	      if (inner) { return inner }
-	    } else if (!text && NodeSelection.isSelectable(child)) {
-	      return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0))
-	    }
-	    pos += child.nodeSize * dir;
-	  }
-	}
-
-	function selectionToInsertionEnd(tr, startLen, bias) {
-	  var last = tr.steps.length - 1;
-	  if (last < startLen) { return }
-	  var step = tr.steps[last];
-	  if (!(step instanceof dist$1.ReplaceStep || step instanceof dist$1.ReplaceAroundStep)) { return }
-	  var map = tr.mapping.maps[last], end;
-	  map.forEach(function (_from, _to, _newFrom, newTo) { if (end == null) { end = newTo; } });
-	  tr.setSelection(Selection.near(tr.doc.resolve(end), bias));
-	}
-
-	var UPDATED_SEL = 1;
-	var UPDATED_MARKS = 2;
-	var UPDATED_SCROLL = 4;
-
-	// ::- An editor state transaction, which can be applied to a state to
-	// create an updated state. Use
-	// [`EditorState.tr`](#state.EditorState.tr) to create an instance.
-	//
-	// Transactions track changes to the document (they are a subclass of
-	// [`Transform`](#transform.Transform)), but also other state changes,
-	// like selection updates and adjustments of the set of [stored
-	// marks](#state.EditorState.storedMarks). In addition, you can store
-	// metadata properties in a transaction, which are extra pieces of
-	// information that client code or plugins can use to describe what a
-	// transacion represents, so that they can update their [own
-	// state](#state.StateField) accordingly.
-	//
-	// The [editor view](#view.EditorView) uses a few metadata properties:
-	// it will attach a property `"pointer"` with the value `true` to
-	// selection transactions directly caused by mouse or touch input, and
-	// a `"uiEvent"` property of that may be `"paste"`, `"cut"`, or `"drop"`.
-	var Transaction = (function (Transform$$1) {
-	  function Transaction(state) {
-	    Transform$$1.call(this, state.doc);
-	    // :: number
-	    // The timestamp associated with this transaction, in the same
-	    // format as `Date.now()`.
-	    this.time = Date.now();
-	    this.curSelection = state.selection;
-	    // The step count for which the current selection is valid.
-	    this.curSelectionFor = 0;
-	    // :: ?[Mark]
-	    // The stored marks set by this transaction, if any.
-	    this.storedMarks = state.storedMarks;
-	    // Bitfield to track which aspects of the state were updated by
-	    // this transaction.
-	    this.updated = 0;
-	    // Object used to store metadata properties for the transaction.
-	    this.meta = Object.create(null);
-	  }
-
-	  if ( Transform$$1 ) { Transaction.__proto__ = Transform$$1; }
-	  Transaction.prototype = Object.create( Transform$$1 && Transform$$1.prototype );
-	  Transaction.prototype.constructor = Transaction;
-
-	  var prototypeAccessors = { selection: {},selectionSet: {},storedMarksSet: {},isGeneric: {},scrolledIntoView: {} };
-
-	  // :: Selection
-	  // The transaction's current selection. This defaults to the editor
-	  // selection [mapped](#state.Selection.map) through the steps in the
-	  // transaction, but can be overwritten with
-	  // [`setSelection`](#state.Transaction.setSelection).
-	  prototypeAccessors.selection.get = function () {
-	    if (this.curSelectionFor < this.steps.length) {
-	      this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));
-	      this.curSelectionFor = this.steps.length;
-	    }
-	    return this.curSelection
-	  };
-
-	  // :: (Selection) → Transaction
-	  // Update the transaction's current selection. Will determine the
-	  // selection that the editor gets when the transaction is applied.
-	  Transaction.prototype.setSelection = function setSelection (selection) {
-	    this.curSelection = selection;
-	    this.curSelectionFor = this.steps.length;
-	    this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;
-	    this.storedMarks = null;
-	    return this
-	  };
-
-	  // :: bool
-	  // Whether the selection was explicitly updated by this transaction.
-	  prototypeAccessors.selectionSet.get = function () {
-	    return (this.updated & UPDATED_SEL) > 0
-	  };
-
-	  // :: (?[Mark]) → Transaction
-	  // Set the current stored marks.
-	  Transaction.prototype.setStoredMarks = function setStoredMarks (marks) {
-	    this.storedMarks = marks;
-	    this.updated |= UPDATED_MARKS;
-	    return this
-	  };
-
-	  // :: ([Mark]) → Transaction
-	  // Make sure the current stored marks or, if that is null, the marks
-	  // at the selection, match the given set of marks. Does nothing if
-	  // this is already the case.
-	  Transaction.prototype.ensureMarks = function ensureMarks (marks) {
-	    if (!dist.Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))
-	      { this.setStoredMarks(marks); }
-	    return this
-	  };
-
-	  // :: (Mark) → Transaction
-	  // Add a mark to the set of stored marks.
-	  Transaction.prototype.addStoredMark = function addStoredMark (mark) {
-	    return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()))
-	  };
-
-	  // :: (union<Mark, MarkType>) → Transaction
-	  // Remove a mark or mark type from the set of stored marks.
-	  Transaction.prototype.removeStoredMark = function removeStoredMark (mark) {
-	    return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()))
-	  };
-
-	  // :: bool
-	  // Whether the stored marks were explicitly set for this transaction.
-	  prototypeAccessors.storedMarksSet.get = function () {
-	    return (this.updated & UPDATED_MARKS) > 0
-	  };
-
-	  Transaction.prototype.addStep = function addStep (step, doc) {
-	    Transform$$1.prototype.addStep.call(this, step, doc);
-	    this.updated = this.updated & ~UPDATED_MARKS;
-	    this.storedMarks = null;
-	  };
-
-	  // :: (number) → Transaction
-	  // Update the timestamp for the transaction.
-	  Transaction.prototype.setTime = function setTime (time) {
-	    this.time = time;
-	    return this
-	  };
-
-	  // :: (Slice) → Transaction
-	  // Replace the current selection with the given slice.
-	  Transaction.prototype.replaceSelection = function replaceSelection (slice) {
-	    this.selection.replace(this, slice);
-	    return this
-	  };
-
-	  // :: (Node, ?bool) → Transaction
-	  // Replace the selection with the given node. When `inheritMarks` is
-	  // true and the content is inline, it inherits the marks from the
-	  // place where it is inserted.
-	  Transaction.prototype.replaceSelectionWith = function replaceSelectionWith (node, inheritMarks) {
-	    var selection = this.selection;
-	    if (inheritMarks !== false)
-	      { node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || dist.Mark.none))); }
-	    selection.replaceWith(this, node);
-	    return this
-	  };
-
-	  // :: () → Transaction
-	  // Delete the selection.
-	  Transaction.prototype.deleteSelection = function deleteSelection () {
-	    this.selection.replace(this);
-	    return this
-	  };
-
-	  // :: (string, from: ?number, to: ?number) → Transaction
-	  // Replace the given range, or the selection if no range is given,
-	  // with a text node containing the given string.
-	  Transaction.prototype.insertText = function insertText (text, from, to) {
-	    if ( to === void 0 ) { to = from; }
-
-	    var schema = this.doc.type.schema;
-	    if (from == null) {
-	      if (!text) { return this.deleteSelection() }
-	      return this.replaceSelectionWith(schema.text(text), true)
-	    } else {
-	      if (!text) { return this.deleteRange(from, to) }
-	      var marks = this.storedMarks;
-	      if (!marks) {
-	        var $from = this.doc.resolve(from);
-	        marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));
-	      }
-	      return this.replaceRangeWith(from, to, schema.text(text, marks))
-	    }
-	  };
-
-	  // :: (union<string, Plugin, PluginKey>, any) → Transaction
-	  // Store a metadata property in this transaction, keyed either by
-	  // name or by plugin.
-	  Transaction.prototype.setMeta = function setMeta (key, value) {
-	    this.meta[typeof key == "string" ? key : key.key] = value;
-	    return this
-	  };
-
-	  // :: (union<string, Plugin, PluginKey>) → any
-	  // Retrieve a metadata property for a given name or plugin.
-	  Transaction.prototype.getMeta = function getMeta (key) {
-	    return this.meta[typeof key == "string" ? key : key.key]
-	  };
-
-	  // :: bool
-	  // Returns true if this transaction doesn't contain any metadata,
-	  // and can thus safely be extended.
-	  prototypeAccessors.isGeneric.get = function () {
-	    var this$1 = this;
-
-	    for (var _ in this$1.meta) { return false }
-	    return true
-	  };
-
-	  // :: () → Transaction
-	  // Indicate that the editor should scroll the selection into view
-	  // when updated to the state produced by this transaction.
-	  Transaction.prototype.scrollIntoView = function scrollIntoView () {
-	    this.updated |= UPDATED_SCROLL;
-	    return this
-	  };
-
-	  prototypeAccessors.scrolledIntoView.get = function () {
-	    return (this.updated & UPDATED_SCROLL) > 0
-	  };
-
-	  Object.defineProperties( Transaction.prototype, prototypeAccessors );
-
-	  return Transaction;
-	}(dist$1.Transform));
-
-	function bind(f, self) {
-	  return !self || !f ? f : f.bind(self)
-	}
-
-	var FieldDesc = function FieldDesc(name, desc, self) {
-	  this.name = name;
-	  this.init = bind(desc.init, self);
-	  this.apply = bind(desc.apply, self);
-	};
-
-	var baseFields = [
-	  new FieldDesc("doc", {
-	    init: function init(config) { return config.doc || config.schema.topNodeType.createAndFill() },
-	    apply: function apply(tr) { return tr.doc }
-	  }),
-
-	  new FieldDesc("selection", {
-	    init: function init(config, instance) { return config.selection || Selection.atStart(instance.doc) },
-	    apply: function apply(tr) { return tr.selection }
-	  }),
-
-	  new FieldDesc("storedMarks", {
-	    init: function init(config) { return config.storedMarks || null },
-	    apply: function apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null }
-	  }),
-
-	  new FieldDesc("scrollToSelection", {
-	    init: function init() { return 0 },
-	    apply: function apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev }
-	  })
-	];
-
-	// Object wrapping the part of a state object that stays the same
-	// across transactions. Stored in the state's `config` property.
-	var Configuration = function Configuration(schema, plugins) {
-	  var this$1 = this;
-
-	  this.schema = schema;
-	  this.fields = baseFields.concat();
-	  this.plugins = [];
-	  this.pluginsByKey = Object.create(null);
-	  if (plugins) { plugins.forEach(function (plugin) {
-	    if (this$1.pluginsByKey[plugin.key])
-	      { throw new RangeError("Adding different instances of a keyed plugin (" + plugin.key + ")") }
-	    this$1.plugins.push(plugin);
-	    this$1.pluginsByKey[plugin.key] = plugin;
-	    if (plugin.spec.state)
-	      { this$1.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin)); }
-	  }); }
-	};
-
-	// ::- The state of a ProseMirror editor is represented by an object
-	// of this type. A state is a persistent data structure—it isn't
-	// updated, but rather a new state value is computed from an old one
-	// using the [`apply`](#state.EditorState.apply) method.
-	//
-	// A state holds a number of built-in fields, and plugins can
-	// [define](#state.PluginSpec.state) additional fields.
-	var EditorState = function EditorState(config) {
-	  this.config = config;
-	};
-
-	var prototypeAccessors$1 = { schema: {},plugins: {},tr: {} };
-
-	// doc:: Node
-	// The current document.
-
-	// selection:: Selection
-	// The selection.
-
-	// storedMarks:: ?[Mark]
-	// A set of marks to apply to the next input. Will be null when
-	// no explicit marks have been set.
-
-	// :: Schema
-	// The schema of the state's document.
-	prototypeAccessors$1.schema.get = function () {
-	  return this.config.schema
-	};
-
-	// :: [Plugin]
-	// The plugins that are active in this state.
-	prototypeAccessors$1.plugins.get = function () {
-	  return this.config.plugins
-	};
-
-	// :: (Transaction) → EditorState
-	// Apply the given transaction to produce a new state.
-	EditorState.prototype.apply = function apply (tr) {
-	  return this.applyTransaction(tr).state
-	};
-
-	// : (Transaction) → ?Transaction
-	EditorState.prototype.filterTransaction = function filterTransaction (tr, ignore) {
-	    var this$1 = this;
-	    if ( ignore === void 0 ) { ignore = -1; }
-
-	  for (var i = 0; i < this.config.plugins.length; i++) { if (i != ignore) {
-	    var plugin = this$1.config.plugins[i];
-	    if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this$1))
-	      { return false }
-	  } }
-	  return true
-	};
-
-	// :: (Transaction) → {state: EditorState, transactions: [Transaction]}
-	// Verbose variant of [`apply`](#state.EditorState.apply) that
-	// returns the precise transactions that were applied (which might
-	// be influenced by the [transaction
-	// hooks](#state.PluginSpec.filterTransaction) of
-	// plugins) along with the new state.
-	EditorState.prototype.applyTransaction = function applyTransaction (rootTr) {
-	    var this$1 = this;
-
-	  if (!this.filterTransaction(rootTr)) { return {state: this, transactions: []} }
-
-	  var trs = [rootTr], newState = this.applyInner(rootTr), seen = null;
-	  // This loop repeatedly gives plugins a chance to respond to
-	  // transactions as new transactions are added, making sure to only
-	  // pass the transactions the plugin did not see before.
-	  outer: for (;;) {
-	    var haveNew = false;
-	    for (var i = 0; i < this.config.plugins.length; i++) {
-	      var plugin = this$1.config.plugins[i];
-	      if (plugin.spec.appendTransaction) {
-	        var n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this$1;
-	        var tr = n < trs.length &&
-	            plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);
-	        if (tr && newState.filterTransaction(tr, i)) {
-	          tr.setMeta("appendedTransaction", rootTr);
-	          if (!seen) {
-	            seen = [];
-	            for (var j = 0; j < this.config.plugins.length; j++)
-	              { seen.push(j < i ? {state: newState, n: trs.length} : {state: this$1, n: 0}); }
-	          }
-	          trs.push(tr);
-	          newState = newState.applyInner(tr);
-	          haveNew = true;
-	        }
-	        if (seen) { seen[i] = {state: newState, n: trs.length}; }
-	      }
-	    }
-	    if (!haveNew) { return {state: newState, transactions: trs} }
-	  }
-	};
-
-	// : (Transaction) → EditorState
-	EditorState.prototype.applyInner = function applyInner (tr) {
-	    var this$1 = this;
-
-	  if (!tr.before.eq(this.doc)) { throw new RangeError("Applying a mismatched transaction") }
-	  var newInstance = new EditorState(this.config), fields = this.config.fields;
-	  for (var i = 0; i < fields.length; i++) {
-	    var field = fields[i];
-	    newInstance[field.name] = field.apply(tr, this$1[field.name], this$1, newInstance);
-	  }
-	  for (var i$1 = 0; i$1 < applyListeners.length; i$1++) { applyListeners[i$1](this$1, tr, newInstance); }
-	  return newInstance
-	};
-
-	// :: Transaction
-	// Start a [transaction](#state.Transaction) from this state.
-	prototypeAccessors$1.tr.get = function () { return new Transaction(this) };
-
-	// :: (Object) → EditorState
-	// Create a new state.
-	//
-	// config::- Configuration options. Must contain `schema` or `doc` (or both).
-	//
-	//    schema:: ?Schema
-	//    The schema to use.
-	//
-	//    doc:: ?Node
-	//    The starting document.
-	//
-	//    selection:: ?Selection
-	//    A valid selection in the document.
-	//
-	//    storedMarks:: ?[Mark]
-	//    The initial set of [stored marks](#state.EditorState.storedMarks).
-	//
-	//    plugins:: ?[Plugin]
-	//    The plugins that should be active in this state.
-	EditorState.create = function create (config) {
-	  var $config = new Configuration(config.schema || config.doc.type.schema, config.plugins);
-	  var instance = new EditorState($config);
-	  for (var i = 0; i < $config.fields.length; i++)
-	    { instance[$config.fields[i].name] = $config.fields[i].init(config, instance); }
-	  return instance
-	};
-
-	// :: (Object) → EditorState
-	// Create a new state based on this one, but with an adjusted set of
-	// active plugins. State fields that exist in both sets of plugins
-	// are kept unchanged. Those that no longer exist are dropped, and
-	// those that are new are initialized using their
-	// [`init`](#state.StateField.init) method, passing in the new
-	// configuration object..
-	//
-	// config::- configuration options
-	//
-	//   schema:: ?Schema
-	//   New schema to use.
-	//
-	//   plugins:: ?[Plugin]
-	//   New set of active plugins.
-	EditorState.prototype.reconfigure = function reconfigure (config) {
-	    var this$1 = this;
-
-	  var $config = new Configuration(config.schema || this.schema, config.plugins);
-	  var fields = $config.fields, instance = new EditorState($config);
-	  for (var i = 0; i < fields.length; i++) {
-	    var name = fields[i].name;
-	    instance[name] = this$1.hasOwnProperty(name) ? this$1[name] : fields[i].init(config, instance);
-	  }
-	  return instance
-	};
-
-	// :: (?union<Object<Plugin>, string, number>) → Object
-	// Serialize this state to JSON. If you want to serialize the state
-	// of plugins, pass an object mapping property names to use in the
-	// resulting JSON object to plugin objects. The argument may also be
-	// a string or number, in which case it is ignored, to support the
-	// way `JSON.stringify` calls `toString` methods.
-	EditorState.prototype.toJSON = function toJSON (pluginFields) {
-	    var this$1 = this;
-
-	  var result = {doc: this.doc.toJSON(), selection: this.selection.toJSON()};
-	  if (this.storedMarks) { result.storedMarks = this.storedMarks.map(function (m) { return m.toJSON(); }); }
-	  if (pluginFields && typeof pluginFields == 'object') { for (var prop in pluginFields) {
-	    if (prop == "doc" || prop == "selection")
-	      { throw new RangeError("The JSON fields `doc` and `selection` are reserved") }
-	    var plugin = pluginFields[prop], state = plugin.spec.state;
-	    if (state && state.toJSON) { result[prop] = state.toJSON.call(plugin, this$1[plugin.key]); }
-	  } }
-	  return result
-	};
-
-	// :: (Object, Object, ?Object<Plugin>) → EditorState
-	// Deserialize a JSON representation of a state. `config` should
-	// have at least a `schema` field, and should contain array of
-	// plugins to initialize the state with. `pluginFields` can be used
-	// to deserialize the state of plugins, by associating plugin
-	// instances with the property names they use in the JSON object.
-	//
-	// config::- configuration options
-	//
-	//   schema:: Schema
-	//   The schema to use.
-	//
-	//   plugins:: ?[Plugin]
-	//   The set of active plugins.
-	EditorState.fromJSON = function fromJSON (config, json, pluginFields) {
-	  if (!json) { throw new RangeError("Invalid input for EditorState.fromJSON") }
-	  if (!config.schema) { throw new RangeError("Required config field 'schema' missing") }
-	  var $config = new Configuration(config.schema, config.plugins);
-	  var instance = new EditorState($config);
-	  $config.fields.forEach(function (field) {
-	    if (field.name == "doc") {
-	      instance.doc = dist.Node.fromJSON(config.schema, json.doc);
-	    } else if (field.name == "selection") {
-	      instance.selection = Selection.fromJSON(instance.doc, json.selection);
-	    } else if (field.name == "storedMarks") {
-	      if (json.storedMarks) { instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON); }
-	    } else {
-	      if (pluginFields) { for (var prop in pluginFields) {
-	        var plugin = pluginFields[prop], state = plugin.spec.state;
-	        if (plugin.key == field.name && state && state.fromJSON &&
-	            Object.prototype.hasOwnProperty.call(json, prop)) {
-	          // This field belongs to a plugin mapped to a JSON field, read it from there.
-	          instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);
-	          return
-	        }
-	      } }
-	      instance[field.name] = field.init(config, instance);
-	    }
-	  });
-	  return instance
-	};
-
-	// Kludge to allow the view to track mappings between different
-	// instances of a state.
-	EditorState.addApplyListener = function addApplyListener (f) {
-	  applyListeners.push(f);
-	};
-	EditorState.removeApplyListener = function removeApplyListener (f) {
-	  var found = applyListeners.indexOf(f);
-	  if (found > -1) { applyListeners.splice(found, 1); }
-	};
-
-	Object.defineProperties( EditorState.prototype, prototypeAccessors$1 );
-
-	var applyListeners = [];
-
-	// PluginSpec:: interface
-	//
-	// This is the type passed to the [`Plugin`](#state.Plugin)
-	// constructor. It provides a definition for a plugin.
-	//
-	//   props:: ?EditorProps
-	//   The [view props](#view.EditorProps) added by this plugin. Props
-	//   that are functions will be bound to have the plugin instance as
-	//   their `this` binding.
-	//
-	//   state:: ?StateField<any>
-	//   Allows a plugin to define a [state field](#state.StateField), an
-	//   extra slot in the state object in which it can keep its own data.
-	//
-	//   key:: ?PluginKey
-	//   Can be used to make this a keyed plugin. You can have only one
-	//   plugin with a given key in a given state, but it is possible to
-	//   access the plugin's configuration and state through the key,
-	//   without having access to the plugin instance object.
-	//
-	//   view:: ?(EditorView) → Object
-	//   When the plugin needs to interact with the editor view, or
-	//   set something up in the DOM, use this field. The function
-	//   will be called when the plugin's state is associated with an
-	//   editor view.
-	//
-	//     return::-
-	//     Should return an object with the following optional
-	//     properties:
-	//
-	//       update:: ?(view: EditorView, prevState: EditorState)
-	//       Called whenever the view's state is updated.
-	//
-	//       destroy:: ?()
-	//       Called when the view is destroyed or receives a state
-	//       with different plugins.
-	//
-	//   filterTransaction:: ?(Transaction, EditorState) → bool
-	//   When present, this will be called before a transaction is
-	//   applied by the state, allowing the plugin to cancel it (by
-	//   returning false).
-	//
-	//   appendTransaction:: ?(transactions: [Transaction], oldState: EditorState, newState: EditorState) → ?Transaction
-	//   Allows the plugin to append another transaction to be applied
-	//   after the given array of transactions. When another plugin
-	//   appends a transaction after this was called, it is called again
-	//   with the new state and new transactions—but only the new
-	//   transactions, i.e. it won't be passed transactions that it
-	//   already saw.
-
-	function bindProps(obj, self, target) {
-	  for (var prop in obj) {
-	    var val = obj[prop];
-	    if (val instanceof Function) { val = val.bind(self); }
-	    else if (prop == "handleDOMEvents") { val = bindProps(val, self, {}); }
-	    target[prop] = val;
-	  }
-	  return target
-	}
-
-	// ::- Plugins bundle functionality that can be added to an editor.
-	// They are part of the [editor state](#state.EditorState) and
-	// may influence that state and the view that contains it.
-	var Plugin = function Plugin(spec) {
-	  // :: EditorProps
-	  // The [props](#view.EditorProps) exported by this plugin.
-	  this.props = {};
-	  if (spec.props) { bindProps(spec.props, this, this.props); }
-	  // :: Object
-	  // The plugin's [spec object](#state.PluginSpec).
-	  this.spec = spec;
-	  this.key = spec.key ? spec.key.key : createKey("plugin");
-	};
-
-	// :: (EditorState) → any
-	// Extract the plugin's state field from an editor state.
-	Plugin.prototype.getState = function getState (state) { return state[this.key] };
-
-	// StateField:: interface<T>
-	// A plugin spec may provide a state field (under its
-	// [`state`](#state.PluginSpec.state) property) of this type, which
-	// describes the state it wants to keep. Functions provided here are
-	// always called with the plugin instance as their `this` binding.
-	//
-	//   init:: (config: Object, instance: EditorState) → T
-	//   Initialize the value of the field. `config` will be the object
-	//   passed to [`EditorState.create`](#state.EditorState^create). Note
-	//   that `instance` is a half-initialized state instance, and will
-	//   not have values for plugin fields initialized after this one.
-	//
-	//   apply:: (tr: Transaction, value: T, oldState: EditorState, newState: EditorState) → T
-	//   Apply the given transaction to this state field, producing a new
-	//   field value. Note that the `newState` argument is again a partially
-	//   constructed state does not yet contain the state from plugins
-	//   coming after this one.
-	//
-	//   toJSON:: ?(value: T) → *
-	//   Convert this field to JSON. Optional, can be left off to disable
-	//   JSON serialization for the field.
-	//
-	//   fromJSON:: ?(config: Object, value: *, state: EditorState) → T
-	//   Deserialize the JSON representation of this field. Note that the
-	//   `state` argument is again a half-initialized state.
-
-	var keys = Object.create(null);
-
-	function createKey(name) {
-	  if (name in keys) { return name + "$" + ++keys[name] }
-	  keys[name] = 0;
-	  return name + "$"
-	}
-
-	// ::- A key is used to [tag](#state.PluginSpec.key)
-	// plugins in a way that makes it possible to find them, given an
-	// editor state. Assigning a key does mean only one plugin of that
-	// type can be active in a state.
-	var PluginKey = function PluginKey(name) {
-	if ( name === void 0 ) { name = "key"; }
-	 this.key = createKey(name); };
-
-	// :: (EditorState) → ?Plugin
-	// Get the active plugin with this key, if any, from an editor
-	// state.
-	PluginKey.prototype.get = function get (state) { return state.config.pluginsByKey[this.key] };
-
-	// :: (EditorState) → ?any
-	// Get the plugin's state from an editor state.
-	PluginKey.prototype.getState = function getState (state) { return state[this.key] };
-
-	exports.Selection = Selection;
-	exports.SelectionRange = SelectionRange;
-	exports.TextSelection = TextSelection;
-	exports.NodeSelection = NodeSelection;
-	exports.AllSelection = AllSelection;
-	exports.Transaction = Transaction;
-	exports.EditorState = EditorState;
-	exports.Plugin = Plugin;
-	exports.PluginKey = PluginKey;
-
-	});
-
-	unwrapExports(dist$2);
-	var dist_1$2 = dist$2.Selection;
-	var dist_2$2 = dist$2.SelectionRange;
-	var dist_3$2 = dist$2.TextSelection;
-	var dist_4$2 = dist$2.NodeSelection;
-	var dist_5$2 = dist$2.AllSelection;
-	var dist_6$2 = dist$2.Transaction;
-	var dist_7$2 = dist$2.EditorState;
-	var dist_8$2 = dist$2.Plugin;
-	var dist_9$2 = dist$2.PluginKey;
-
-	var dist$3 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-	var result = {};
-	if (typeof navigator != "undefined" && typeof document != "undefined") {
-	  var ie_edge = /Edge\/(\d+)/.exec(navigator.userAgent);
-	  var ie_upto10 = /MSIE \d/.test(navigator.userAgent);
-	  var ie_11up = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);
-
-	  result.mac = /Mac/.test(navigator.platform);
-	  var ie = result.ie = !!(ie_upto10 || ie_11up || ie_edge);
-	  result.ie_version = ie_upto10 ? document.documentMode || 6 : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : null;
-	  result.gecko = !ie && /gecko\/(\d+)/i.test(navigator.userAgent);
-	  result.gecko_version = result.gecko && +(/Firefox\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1];
-	  var chrome = !ie && /Chrome\/(\d+)/.exec(navigator.userAgent);
-	  result.chrome = !!chrome;
-	  result.chrome_version = chrome && +chrome[1];
-	  result.ios = !ie && /AppleWebKit/.test(navigator.userAgent) && /Mobile\/\w+/.test(navigator.userAgent);
-	  result.android = /Android \d/.test(navigator.userAgent);
-	  result.webkit = !ie && 'WebkitAppearance' in document.documentElement.style;
-	  result.safari = /Apple Computer/.test(navigator.vendor);
-	  result.webkit_version = result.webkit && +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1];
-	}
-
-	var domIndex = function(node) {
-	  for (var index = 0;; index++) {
-	    node = node.previousSibling;
-	    if (!node) { return index }
-	  }
-	};
-
-	var parentNode = function(node) {
-	  var parent = node.parentNode;
-	  return parent && parent.nodeType == 11 ? parent.host : parent
-	};
-
-	var textRange = function(node, from, to) {
-	  var range = document.createRange();
-	  range.setEnd(node, to == null ? node.nodeValue.length : to);
-	  range.setStart(node, from || 0);
-	  return range
-	};
-
-	// Scans forward and backward through DOM positions equivalent to the
-	// given one to see if the two are in the same place (i.e. after a
-	// text node vs at the end of that text node)
-	var isEquivalentPosition = function(node, off, targetNode, targetOff) {
-	  return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||
-	                        scanFor(node, off, targetNode, targetOff, 1))
-	};
-
-	var atomElements = /^(img|br|input|textarea|hr)$/i;
-
-	function scanFor(node, off, targetNode, targetOff, dir) {
-	  for (;;) {
-	    if (node == targetNode && off == targetOff) { return true }
-	    if (off == (dir < 0 ? 0 : nodeSize(node)) || node.nodeType == 3 && node.nodeValue == "\ufeff") {
-	      var parent = node.parentNode;
-	      if (parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName)) { return false }
-	      off = domIndex(node) + (dir < 0 ? 0 : 1);
-	      node = parent;
-	    } else if (node.nodeType == 1) {
-	      node = node.childNodes[off + (dir < 0 ? -1 : 0)];
-	      off = dir < 0 ? nodeSize(node) : 0;
-	    } else {
-	      return false
-	    }
-	  }
-	}
-
-	function nodeSize(node) {
-	  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length
-	}
-
-	function hasBlockDesc(dom) {
-	  var desc = dom.pmViewDesc;
-	  return desc && desc.node && desc.node.isBlock
-	}
-
-	// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523
-	// (isCollapsed inappropriately returns true in shadow dom)
-	var selectionCollapsed = function(domSel) {
-	  var collapsed = domSel.isCollapsed;
-	  if (collapsed && result.chrome && domSel.rangeCount && !domSel.getRangeAt(0).collapsed)
-	    { collapsed = false; }
-	  return collapsed
-	};
-
-	function windowRect(win) {
-	  return {left: 0, right: win.innerWidth,
-	          top: 0, bottom: win.innerHeight}
-	}
-
-	function scrollRectIntoView(view, rect) {
-	  var scrollThreshold = view.someProp("scrollThreshold") || 0, scrollMargin = view.someProp("scrollMargin");
-	  var doc = view.dom.ownerDocument, win = doc.defaultView;
-	  if (scrollMargin == null) { scrollMargin = 5; }
-	  for (var parent = view.dom;; parent = parentNode(parent)) {
-	    if (!parent) { break }
-	    var atTop = parent == doc.body || parent.nodeType != 1;
-	    var bounding = atTop ? windowRect(win) : parent.getBoundingClientRect();
-	    var moveX = 0, moveY = 0;
-	    if (rect.top < bounding.top + scrollThreshold)
-	      { moveY = -(bounding.top - rect.top + scrollMargin); }
-	    else if (rect.bottom > bounding.bottom - scrollThreshold)
-	      { moveY = rect.bottom - bounding.bottom + scrollMargin; }
-	    if (rect.left < bounding.left + scrollThreshold)
-	      { moveX = -(bounding.left - rect.left + scrollMargin); }
-	    else if (rect.right > bounding.right - scrollThreshold)
-	      { moveX = rect.right - bounding.right + scrollMargin; }
-	    if (moveX || moveY) {
-	      if (atTop) {
-	        win.scrollBy(moveX, moveY);
-	      } else {
-	        if (moveY) { parent.scrollTop += moveY; }
-	        if (moveX) { parent.scrollLeft += moveX; }
-	      }
-	    }
-	    if (atTop) { break }
-	  }
-	}
-
-	// Store the scroll position of the editor's parent nodes, along with
-	// the top position of an element near the top of the editor, which
-	// will be used to make sure the visible viewport remains stable even
-	// when the size of the content above changes.
-	function storeScrollPos(view) {
-	  var rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top);
-	  var doc = view.dom.ownerDocument;
-	  var refDOM, refTop;
-	  for (var x = (rect.left + rect.right) / 2, y = startY + 1;
-	       y < Math.min(innerHeight, rect.bottom); y += 5) {
-	    var dom = view.root.elementFromPoint(x, y);
-	    if (dom == view.dom || !view.dom.contains(dom)) { continue }
-	    var localRect = dom.getBoundingClientRect();
-	    if (localRect.top >= startY - 20) {
-	      refDOM = dom;
-	      refTop = localRect.top;
-	      break
-	    }
-	  }
-	  var stack = [];
-	  for (var dom$1 = view.dom; dom$1; dom$1 = parentNode(dom$1)) {
-	    stack.push({dom: dom$1, top: dom$1.scrollTop, left: dom$1.scrollLeft});
-	    if (dom$1 == doc.body) { break }
-	  }
-	  return {refDOM: refDOM, refTop: refTop, stack: stack}
-	}
-
-	// Reset the scroll position of the editor's parent nodes to that what
-	// it was before, when storeScrollPos was called.
-	function resetScrollPos(ref) {
-	  var refDOM = ref.refDOM;
-	  var refTop = ref.refTop;
-	  var stack = ref.stack;
-
-	  var newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;
-	  var dTop = newRefTop == 0 ? 0 : newRefTop - refTop;
-	  for (var i = 0; i < stack.length; i++) {
-	    var ref$1 = stack[i];
-	    var dom = ref$1.dom;
-	    var top = ref$1.top;
-	    var left = ref$1.left;
-	    if (dom.scrollTop != top + dTop) { dom.scrollTop = top + dTop; }
-	    if (dom.scrollLeft != left) { dom.scrollLeft = left; }
-	  }
-	}
-
-	function findOffsetInNode(node, coords) {
-	  var closest, dxClosest = 2e8, coordsClosest, offset = 0;
-	  var rowBot = coords.top, rowTop = coords.top;
-	  for (var child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {
-	    var rects = (void 0);
-	    if (child.nodeType == 1) { rects = child.getClientRects(); }
-	    else if (child.nodeType == 3) { rects = textRange(child).getClientRects(); }
-	    else { continue }
-
-	    for (var i = 0; i < rects.length; i++) {
-	      var rect = rects[i];
-	      if (rect.top <= rowBot && rect.bottom >= rowTop) {
-	        rowBot = Math.max(rect.bottom, rowBot);
-	        rowTop = Math.min(rect.top, rowTop);
-	        var dx = rect.left > coords.left ? rect.left - coords.left
-	            : rect.right < coords.left ? coords.left - rect.right : 0;
-	        if (dx < dxClosest) {
-	          closest = child;
-	          dxClosest = dx;
-	          coordsClosest = dx && closest.nodeType == 3 ? {left: rect.right < coords.left ? rect.right : rect.left, top: coords.top} : coords;
-	          if (child.nodeType == 1 && dx)
-	            { offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0); }
-	          continue
-	        }
-	      }
-	      if (!closest && (coords.left >= rect.right && coords.top >= rect.top ||
-	                       coords.left >= rect.left && coords.top >= rect.bottom))
-	        { offset = childIndex + 1; }
-	    }
-	  }
-	  if (closest && closest.nodeType == 3) { return findOffsetInText(closest, coordsClosest) }
-	  if (!closest || (dxClosest && closest.nodeType == 1)) { return {node: node, offset: offset} }
-	  return findOffsetInNode(closest, coordsClosest)
-	}
-
-	function findOffsetInText(node, coords) {
-	  var len = node.nodeValue.length;
-	  var range = document.createRange();
-	  for (var i = 0; i < len; i++) {
-	    range.setEnd(node, i + 1);
-	    range.setStart(node, i);
-	    var rect = singleRect(range, 1);
-	    if (rect.top == rect.bottom) { continue }
-	    if (rect.left - 1 <= coords.left && rect.right + 1 >= coords.left &&
-	        rect.top - 1 <= coords.top && rect.bottom + 1 >= coords.top)
-	      { return {node: node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0)} }
-	  }
-	  return {node: node, offset: 0}
-	}
-
-	function targetKludge(dom, coords) {
-	  var parent = dom.parentNode;
-	  if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left)
-	    { return parent }
-	  return dom
-	}
-
-	function posFromElement(view, elt, coords) {
-	  if (!view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) { return null }
-
-	  var ref = findOffsetInNode(elt, coords);
-	  var node = ref.node;
-	  var offset = ref.offset;
-	  var bias = -1;
-	  if (node.nodeType == 1 && !node.firstChild) {
-	    var rect = node.getBoundingClientRect();
-	    bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1;
-	  }
-	  return view.docView.posFromDOM(node, offset, bias)
-	}
-
-	function posFromCaret(view, node, offset, coords) {
-	  // Browser (in caretPosition/RangeFromPoint) will agressively
-	  // normalize towards nearby inline nodes. Since we are interested in
-	  // positions between block nodes too, we first walk up the hierarchy
-	  // of nodes to see if there are block nodes that the coordinates
-	  // fall outside of. If so, we take the position before/after that
-	  // block. If not, we call `posFromDOM` on the raw node/offset.
-	  var outside = -1;
-	  for (var cur = node;;) {
-	    if (cur == view.dom) { break }
-	    var desc = view.docView.nearestDesc(cur, true);
-	    if (!desc) { return null }
-	    if (desc.node.isBlock && desc.parent) {
-	      var rect = desc.dom.getBoundingClientRect();
-	      if (rect.left > coords.left || rect.top > coords.top) { outside = desc.posBefore; }
-	      else if (rect.right < coords.left || rect.bottom < coords.top) { outside = desc.posAfter; }
-	      else { break }
-	    }
-	    cur = desc.dom.parentNode;
-	  }
-	  return outside > -1 ? outside : view.docView.posFromDOM(node, offset)
-	}
-
-	// Given an x,y position on the editor, get the position in the document.
-	function posAtCoords(view, coords) {
-	  var root = view.root, node, offset;
-	  if (root.caretPositionFromPoint) {
-	    var pos$1 = root.caretPositionFromPoint(coords.left, coords.top);
-	    if (pos$1) { var assign;
-	      ((assign = pos$1, node = assign.offsetNode, offset = assign.offset)); }
-	  }
-	  if (!node && root.caretRangeFromPoint) {
-	    var range = root.caretRangeFromPoint(coords.left, coords.top);
-	    if (range) { var assign$1;
-	      ((assign$1 = range, node = assign$1.startContainer, offset = assign$1.startOffset)); }
-	  }
-
-	  var elt = root.elementFromPoint(coords.left, coords.top + 1), pos;
-	  if (!elt) { return null }
-	  elt = targetKludge(elt, coords);
-	  if (node) {
-	    // Suspiciously specific kludge to work around caret*FromPoint
-	    // never returning a position at the end of the document
-	    if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 &&
-	        coords.top > node.lastChild.getBoundingClientRect().bottom)
-	      { pos = view.state.doc.content.size; }
-	    // Ignore positions directly after a BR, since caret*FromPoint
-	    // 'round up' positions that would be more accurately places
-	    // before the BR node.
-	    else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != "BR")
-	      { pos = posFromCaret(view, node, offset, coords); }
-	  }
-	  if (pos == null) {
-	    pos = posFromElement(view, elt, coords);
-	    if (pos == null) { return null }
-	  }
-
-	  var desc = view.docView.nearestDesc(elt, true);
-	  return {pos: pos, inside: desc ? desc.posAtStart - desc.border : -1}
-	}
-
-	function singleRect(object, bias) {
-	  var rects = object.getClientRects();
-	  return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1]
-	}
-
-	// : (EditorView, number) → {left: number, top: number, right: number, bottom: number}
-	// Given a position in the document model, get a bounding box of the
-	// character at that position, relative to the window.
-	function coordsAtPos(view, pos) {
-	  var ref = view.docView.domFromPos(pos);
-	  var node = ref.node;
-	  var offset = ref.offset;
-	  var side, rect;
-	  if (node.nodeType == 3) {
-	    if (offset < node.nodeValue.length) {
-	      rect = singleRect(textRange(node, offset, offset + 1), -1);
-	      side = "left";
-	    }
-	    if ((!rect || rect.left == rect.right) && offset) {
-	      rect = singleRect(textRange(node, offset - 1, offset), 1);
-	      side = "right";
-	    }
-	  } else if (node.firstChild) {
-	    if (offset < node.childNodes.length) {
-	      var child = node.childNodes[offset];
-	      rect = singleRect(child.nodeType == 3 ? textRange(child) : child, -1);
-	      side = "left";
-	    }
-	    if ((!rect || rect.top == rect.bottom) && offset) {
-	      var child$1 = node.childNodes[offset - 1];
-	      rect = singleRect(child$1.nodeType == 3 ? textRange(child$1) : child$1, 1);
-	      side = "right";
-	    }
-	  } else {
-	    rect = node.getBoundingClientRect();
-	    side = "left";
-	  }
-	  var x = rect[side];
-	  return {top: rect.top, bottom: rect.bottom, left: x, right: x}
-	}
-
-	function withFlushedState(view, state, f) {
-	  var viewState = view.state, active = view.root.activeElement;
-	  if (viewState != state || !view.inDOMChange) { view.updateState(state); }
-	  if (active != view.dom) { view.focus(); }
-	  try {
-	    return f()
-	  } finally {
-	    if (viewState != state) { view.updateState(viewState); }
-	    if (active != view.dom) { active.focus(); }
-	  }
-	}
-
-	// : (EditorView, number, number)
-	// Whether vertical position motion in a given direction
-	// from a position would leave a text block.
-	function endOfTextblockVertical(view, state, dir) {
-	  var sel = state.selection;
-	  var $pos = dir == "up" ? sel.$anchor.min(sel.$head) : sel.$anchor.max(sel.$head);
-	  if (!$pos.depth) { return false }
-	  return withFlushedState(view, state, function () {
-	    var dom = view.docView.domAfterPos($pos.before());
-	    var coords = coordsAtPos(view, $pos.pos);
-	    for (var child = dom.firstChild; child; child = child.nextSibling) {
-	      var boxes = (void 0);
-	      if (child.nodeType == 1) { boxes = child.getClientRects(); }
-	      else if (child.nodeType == 3) { boxes = textRange(child, 0, child.nodeValue.length).getClientRects(); }
-	      else { continue }
-	      for (var i = 0; i < boxes.length; i++) {
-	        var box = boxes[i];
-	        if (box.bottom > box.top && (dir == "up" ? box.bottom < coords.top + 1 : box.top > coords.bottom - 1))
-	          { return false }
-	      }
-	    }
-	    return true
-	  })
-	}
-
-	var maybeRTL = /[\u0590-\u08ac]/;
-
-	function endOfTextblockHorizontal(view, state, dir) {
-	  var ref = state.selection;
-	  var $head = ref.$head;
-	  if (!$head.parent.isTextblock || !$head.depth) { return false }
-	  var offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size;
-	  var sel = getSelection();
-	  // If the textblock is all LTR, or the browser doesn't support
-	  // Selection.modify (Edge), fall back to a primitive approach
-	  if (!maybeRTL.test($head.parent.textContent) || !sel.modify)
-	    { return dir == "left" || dir == "backward" ? atStart : atEnd }
-
-	  return withFlushedState(view, state, function () {
-	    // This is a huge hack, but appears to be the best we can
-	    // currently do: use `Selection.modify` to move the selection by
-	    // one character, and see if that moves the cursor out of the
-	    // textblock (or doesn't move it at all, when at the start/end of
-	    // the document).
-	    var oldRange = sel.getRangeAt(0), oldNode = sel.focusNode, oldOff = sel.focusOffset;
-	    sel.modify("move", dir, "character");
-	    var parentDOM = view.docView.domAfterPos($head.before());
-	    var result = !parentDOM.contains(sel.focusNode.nodeType == 1 ? sel.focusNode : sel.focusNode.parentNode) ||
-	        (oldNode == sel.focusNode && oldOff == sel.focusOffset);
-	    // Restore the previous selection
-	    sel.removeAllRanges();
-	    sel.addRange(oldRange);
-	    return result
-	  })
-	}
-
-	var cachedState = null;
-	var cachedDir = null;
-	var cachedResult = false;
-	function endOfTextblock(view, state, dir) {
-	  if (cachedState == state && cachedDir == dir) { return cachedResult }
-	  cachedState = state; cachedDir = dir;
-	  return cachedResult = dir == "up" || dir == "down"
-	    ? endOfTextblockVertical(view, state, dir)
-	    : endOfTextblockHorizontal(view, state, dir)
-	}
-
-	// NodeView:: interface
-	//
-	// By default, document nodes are rendered using the result of the
-	// [`toDOM`](#model.NodeSpec.toDOM) method of their spec, and managed
-	// entirely by the editor. For some use cases, such as embedded
-	// node-specific editing interfaces, you want more control over
-	// the behavior of a node's in-editor representation, and need to
-	// [define](#view.EditorProps.nodeViews) a custom node view.
-	//
-	// Objects returned as node views must conform to this interface.
-	//
-	//   dom:: ?dom.Node
-	//   The outer DOM node that represents the document node. When not
-	//   given, the default strategy is used to create a DOM node.
-	//
-	//   contentDOM:: ?dom.Node
-	//   The DOM node that should hold the node's content. Only meaningful
-	//   if the node view also defines a `dom` property and if its node
-	//   type is not a leaf node type. When this is present, ProseMirror
-	//   will take care of rendering the node's children into it. When it
-	//   is not present, the node view itself is responsible for rendering
-	//   (or deciding not to render) its child nodes.
-	//
-	//   update:: ?(node: Node, decorations: [Decoration]) → bool
-	//   When given, this will be called when the view is updating itself.
-	//   It will be given a node (possibly of a different type), and an
-	//   array of active decorations (which are automatically drawn, and
-	//   the node view may ignore if it isn't interested in them), and
-	//   should return true if it was able to update to that node, and
-	//   false otherwise. If the node view has a `contentDOM` property (or
-	//   no `dom` property), updating its child nodes will be handled by
-	//   ProseMirror.
-	//
-	//   selectNode:: ?()
-	//   Can be used to override the way the node's selected status (as a
-	//   node selection) is displayed.
-	//
-	//   deselectNode:: ?()
-	//   When defining a `selectNode` method, you should also provide a
-	//   `deselectNode` method to remove the effect again.
-	//
-	//   setSelection:: ?(anchor: number, head: number, root: dom.Document)
-	//   This will be called to handle setting the selection inside the
-	//   node. The `anchor` and `head` positions are relative to the start
-	//   of the node. By default, a DOM selection will be created between
-	//   the DOM positions corresponding to those positions, but if you
-	//   override it you can do something else.
-	//
-	//   stopEvent:: ?(event: dom.Event) → bool
-	//   Can be used to prevent the editor view from trying to handle some
-	//   or all DOM events that bubble up from the node view. Events for
-	//   which this returns true are not handled by the editor.
-	//
-	//   ignoreMutation:: ?(dom.MutationRecord) → bool
-	//   Called when a DOM
-	//   [mutation](https://developer.mozilla.org/en-US/docs/Web/API/MutationObserver)
-	//   happens within the view. Return false if the editor should
-	//   re-parse the range around the mutation, true if it can safely be
-	//   ignored.
-	//
-	//   destroy:: ?()
-	//   Called when the node view is removed from the editor or the whole
-	//   editor is destroyed.
-
-	// View descriptions are data structures that describe the DOM that is
-	// used to represent the editor's content. They are used for:
-	//
-	// - Incremental redrawing when the document changes
-	//
-	// - Figuring out what part of the document a given DOM position
-	//   corresponds to
-	//
-	// - Wiring in custom implementations of the editing interface for a
-	//   given node
-	//
-	// They form a doubly-linked mutable tree, starting at `view.docView`.
-
-	var NOT_DIRTY = 0;
-	var CHILD_DIRTY = 1;
-	var CONTENT_DIRTY = 2;
-	var NODE_DIRTY = 3;
-
-	// Superclass for the various kinds of descriptions. Defines their
-	// basic structure and shared methods.
-	var ViewDesc = function ViewDesc(parent, children, dom, contentDOM) {
-	  this.parent = parent;
-	  this.children = children;
-	  this.dom = dom;
-	  // An expando property on the DOM node provides a link back to its
-	  // description.
-	  dom.pmViewDesc = this;
-	  // This is the node that holds the child views. It may be null for
-	  // descs that don't have children.
-	  this.contentDOM = contentDOM;
-	  this.dirty = NOT_DIRTY;
-	};
-
-	var prototypeAccessors$1 = { beforePosition: {},size: {},border: {},posBefore: {},posAtStart: {},posAfter: {},posAtEnd: {},contentLost: {} };
-
-	// Used to check whether a given description corresponds to a
-	// widget/mark/node.
-	ViewDesc.prototype.matchesWidget = function matchesWidget () { return false };
-	ViewDesc.prototype.matchesMark = function matchesMark () { return false };
-	ViewDesc.prototype.matchesNode = function matchesNode () { return false };
-	ViewDesc.prototype.matchesHack = function matchesHack () { return false };
-
-	prototypeAccessors$1.beforePosition.get = function () { return false };
-
-	// : () → ?ParseRule
-	// When parsing in-editor content (in domchange.js), we allow
-	// descriptions to determine the parse rules that should be used to
-	// parse them.
-	ViewDesc.prototype.parseRule = function parseRule () { return null };
-
-	// : (dom.Event) → bool
-	// Used by the editor's event handler to ignore events that come
-	// from certain descs.
-	ViewDesc.prototype.stopEvent = function stopEvent () { return false };
-
-	// The size of the content represented by this desc.
-	prototypeAccessors$1.size.get = function () {
-	    var this$1 = this;
-
-	  var size = 0;
-	  for (var i = 0; i < this.children.length; i++) { size += this$1.children[i].size; }
-	  return size
-	};
-
-	// For block nodes, this represents the space taken up by their
-	// start/end tokens.
-	prototypeAccessors$1.border.get = function () { return 0 };
-
-	ViewDesc.prototype.destroy = function destroy () {
-	    var this$1 = this;
-
-	  this.parent = null;
-	  if (this.dom.pmViewDesc == this) { this.dom.pmViewDesc = null; }
-	  for (var i = 0; i < this.children.length; i++)
-	    { this$1.children[i].destroy(); }
-	};
-
-	ViewDesc.prototype.posBeforeChild = function posBeforeChild (child) {
-	    var this$1 = this;
-
-	  for (var i = 0, pos = this.posAtStart; i < this.children.length; i++) {
-	    var cur = this$1.children[i];
-	    if (cur == child) { return pos }
-	    pos += cur.size;
-	  }
-	};
-
-	prototypeAccessors$1.posBefore.get = function () {
-	  return this.parent.posBeforeChild(this)
-	};
-
-	prototypeAccessors$1.posAtStart.get = function () {
-	  return this.parent ? this.parent.posBeforeChild(this) + this.border : 0
-	};
-
-	prototypeAccessors$1.posAfter.get = function () {
-	  return this.posBefore + this.size
-	};
-
-	prototypeAccessors$1.posAtEnd.get = function () {
-	  return this.posAtStart + this.size - 2 * this.border
-	};
-
-	// : (dom.Node, number, ?number) → number
-	ViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {
-	    var this$1 = this;
-
-	  // If the DOM position is in the content, use the child desc after
-	  // it to figure out a position.
-	  if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {
-	    if (bias < 0) {
-	      var domBefore, desc;
-	      if (dom == this.contentDOM) {
-	        domBefore = dom.childNodes[offset - 1];
-	      } else {
-	        while (dom.parentNode != this.contentDOM) { dom = dom.parentNode; }
-	        domBefore = dom.previousSibling;
-	      }
-	      while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this)) { domBefore = domBefore.previousSibling; }
-	      return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart
-	    } else {
-	      var domAfter, desc$1;
-	      if (dom == this.contentDOM) {
-	        domAfter = dom.childNodes[offset];
-	      } else {
-	        while (dom.parentNode != this.contentDOM) { dom = dom.parentNode; }
-	        domAfter = dom.nextSibling;
-	      }
-	      while (domAfter && !((desc$1 = domAfter.pmViewDesc) && desc$1.parent == this)) { domAfter = domAfter.nextSibling; }
-	      return domAfter ? this.posBeforeChild(desc$1) : this.posAtEnd
-	    }
-	  }
-	  // Otherwise, use various heuristics, falling back on the bias
-	  // parameter, to determine whether to return the position at the
-	  // start or at the end of this view desc.
-	  var atEnd;
-	  if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {
-	    atEnd = dom.compareDocumentPosition(this.contentDOM) & 2;
-	  } else if (this.dom.firstChild) {
-	    if (offset == 0) { for (var search = dom;; search = search.parentNode) {
-	      if (search == this$1.dom) { atEnd = false; break }
-	      if (search.parentNode.firstChild != search) { break }
-	    } }
-	    if (atEnd == null && offset == dom.childNodes.length) { for (var search$1 = dom;; search$1 = search$1.parentNode) {
-	      if (search$1 == this$1.dom) { atEnd = true; break }
-	      if (search$1.parentNode.lastChild != search$1) { break }
-	    } }
-	  }
-	  return (atEnd == null ? bias > 0 : atEnd) ? this.posAtEnd : this.posAtStart
-	};
-
-	// Scan up the dom finding the first desc that is a descendant of
-	// this one.
-	ViewDesc.prototype.nearestDesc = function nearestDesc (dom, onlyNodes) {
-	    var this$1 = this;
-
-	  for (var first = true, cur = dom; cur; cur = cur.parentNode) {
-	    var desc = this$1.getDesc(cur);
-	    if (desc && (!onlyNodes || desc.node)) {
-	      // If dom is outside of this desc's nodeDOM, don't count it.
-	      if (first && desc.nodeDOM && !(desc.nodeDOM.nodeType == 1 ? desc.nodeDOM.contains(dom) : desc.nodeDOM == dom)) { first = false; }
-	      else { return desc }
-	    }
-	  }
-	};
-
-	ViewDesc.prototype.getDesc = function getDesc (dom) {
-	    var this$1 = this;
-
-	  var desc = dom.pmViewDesc;
-	  for (var cur = desc; cur; cur = cur.parent) { if (cur == this$1) { return desc } }
-	};
-
-	ViewDesc.prototype.posFromDOM = function posFromDOM (dom, offset, bias) {
-	    var this$1 = this;
-
-	  for (var scan = dom;; scan = scan.parentNode) {
-	    var desc = this$1.getDesc(scan);
-	    if (desc) { return desc.localPosFromDOM(dom, offset, bias) }
-	  }
-	};
-
-	// : (number) → ?NodeViewDesc
-	// Find the desc for the node after the given pos, if any. (When a
-	// parent node overrode rendering, there might not be one.)
-	ViewDesc.prototype.descAt = function descAt (pos) {
-	    var this$1 = this;
-
-	  for (var i = 0, offset = 0; i < this.children.length; i++) {
-	    var child = this$1.children[i], end = offset + child.size;
-	    if (offset == pos && end != offset) {
-	      while (!child.border && child.children.length) { child = child.children[0]; }
-	      return child
-	    }
-	    if (pos < end) { return child.descAt(pos - offset - child.border) }
-	    offset = end;
-	  }
-	};
-
-	// : (number) → {node: dom.Node, offset: number}
-	ViewDesc.prototype.domFromPos = function domFromPos (pos) {
-	    var this$1 = this;
-
-	  if (!this.contentDOM) { return {node: this.dom, offset: 0} }
-	  for (var offset = 0, i = 0;; i++) {
-	    if (offset == pos) {
-	      while (i < this.children.length && this.children[i].beforePosition) { i++; }
-	      return {node: this$1.contentDOM, offset: i}
-	    }
-	    if (i == this$1.children.length) { throw new Error("Invalid position " + pos) }
-	    var child = this$1.children[i], end = offset + child.size;
-	    if (pos < end) { return child.domFromPos(pos - offset - child.border) }
-	    offset = end;
-	  }
-	};
-
-	// Used to find a DOM range in a single parent for a given changed
-	// range.
-	ViewDesc.prototype.parseRange = function parseRange (from, to, base) {
-	    var this$1 = this;
-	    if ( base === void 0 ) { base = 0; }
-
-	  if (this.children.length == 0)
-	    { return {node: this.contentDOM, from: from, to: to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length} }
-
-	  var fromOffset = -1, toOffset = -1;
-	  for (var offset = 0, i = 0;; i++) {
-	    var child = this$1.children[i], end = offset + child.size;
-	    if (fromOffset == -1 && from <= end) {
-	      var childBase = offset + child.border;
-	      // FIXME maybe descend mark views to parse a narrower range?
-	      if (from >= childBase && to <= end - child.border && child.node &&
-	          child.contentDOM && this$1.contentDOM.contains(child.contentDOM))
-	        { return child.parseRange(from - childBase, to - childBase, base + childBase) }
-
-	      from = base + offset;
-	      for (var j = i; j > 0; j--) {
-	        var prev = this$1.children[j - 1];
-	        if (prev.size && prev.dom.parentNode == this$1.contentDOM && !prev.emptyChildAt(1)) {
-	          fromOffset = domIndex(prev.dom) + 1;
-	          break
-	        }
-	        from -= prev.size;
-	      }
-	      if (fromOffset == -1) { fromOffset = 0; }
-	    }
-	    if (fromOffset > -1 && to <= end) {
-	      to = base + end;
-	      for (var j$1 = i + 1; j$1 < this.children.length; j$1++) {
-	        var next = this$1.children[j$1];
-	        if (next.size && next.dom.parentNode == this$1.contentDOM && !next.emptyChildAt(-1)) {
-	          toOffset = domIndex(next.dom);
-	          break
-	        }
-	        to += next.size;
-	      }
-	      if (toOffset == -1) { toOffset = this$1.contentDOM.childNodes.length; }
-	      break
-	    }
-	    offset = end;
-	  }
-	  return {node: this.contentDOM, from: from, to: to, fromOffset: fromOffset, toOffset: toOffset}
-	};
-
-	ViewDesc.prototype.emptyChildAt = function emptyChildAt (side) {
-	  if (this.border || !this.contentDOM || !this.children.length) { return false }
-	  var child = this.children[side < 0 ? 0 : this.children.length - 1];
-	  return child.size == 0 || child.emptyChildAt(side)
-	};
-
-	// : (number) → dom.Node
-	ViewDesc.prototype.domAfterPos = function domAfterPos (pos) {
-	  var ref = this.domFromPos(pos);
-	    var node = ref.node;
-	    var offset = ref.offset;
-	  if (node.nodeType != 1 || offset == node.childNodes.length)
-	    { throw new RangeError("No node after pos " + pos) }
-	  return node.childNodes[offset]
-	};
-
-	// : (number, number, dom.Document)
-	// View descs are responsible for setting any selection that falls
-	// entirely inside of them, so that custom implementations can do
-	// custom things with the selection. Note that this falls apart when
-	// a selection starts in such a node and ends in another, in which
-	// case we just use whatever domFromPos produces as a best effort.
-	ViewDesc.prototype.setSelection = function setSelection (anchor, head, root) {
-	    var this$1 = this;
-
-	  // If the selection falls entirely in a child, give it to that child
-	  var from = Math.min(anchor, head), to = Math.max(anchor, head);
-	  for (var i = 0, offset = 0; i < this.children.length; i++) {
-	    var child = this$1.children[i], end = offset + child.size;
-	    if (from > offset && to < end)
-	      { return child.setSelection(anchor - offset - child.border, head - offset - child.border, root) }
-	    offset = end;
-	  }
-
-	  var anchorDOM = this.domFromPos(anchor), headDOM = this.domFromPos(head);
-	  var domSel = root.getSelection(), range = document.createRange();
-	  if (isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset) &&
-	      isEquivalentPosition(headDOM.node, headDOM.offset, domSel.focusNode, domSel.focusOffset))
-	    { return }
-
-	  // Selection.extend can be used to create an 'inverted' selection
-	  // (one where the focus is before the anchor), but not all
-	  // browsers support it yet.
-	  if (domSel.extend) {
-	    range.setEnd(anchorDOM.node, anchorDOM.offset);
-	    range.collapse(false);
-	  } else {
-	    if (anchor > head) { var tmp = anchorDOM; anchorDOM = headDOM; headDOM = tmp; }
-	    range.setEnd(headDOM.node, headDOM.offset);
-	    range.setStart(anchorDOM.node, anchorDOM.offset);
-	  }
-	  domSel.removeAllRanges();
-	  domSel.addRange(range);
-	  if (domSel.extend)
-	    { domSel.extend(headDOM.node, headDOM.offset); }
-	};
-
-	// : (dom.MutationRecord) → bool
-	ViewDesc.prototype.ignoreMutation = function ignoreMutation (_mutation) {
-	  return !this.contentDOM
-	};
-
-	prototypeAccessors$1.contentLost.get = function () {
-	  return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM)
-	};
-
-	// Remove a subtree of the element tree that has been touched
-	// by a DOM change, so that the next update will redraw it.
-	ViewDesc.prototype.markDirty = function markDirty (from, to) {
-	    var this$1 = this;
-
-	  for (var offset = 0, i = 0; i < this.children.length; i++) {
-	    var child = this$1.children[i], end = offset + child.size;
-	    if (offset == end ? from <= end && to >= offset : from < end && to > offset) {
-	      var startInside = offset + child.border, endInside = end - child.border;
-	      if (from >= startInside && to <= endInside) {
-	        this$1.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;
-	        if (from == startInside && to == endInside && child.contentLost) { child.dirty = NODE_DIRTY; }
-	        else { child.markDirty(from - startInside, to - startInside); }
-	        return
-	      } else {
-	        child.dirty = NODE_DIRTY;
-	      }
-	    }
-	    offset = end;
-	  }
-	  this.dirty = CONTENT_DIRTY;
-	};
-
-	Object.defineProperties( ViewDesc.prototype, prototypeAccessors$1 );
-
-	// Reused array to avoid allocating fresh arrays for things that will
-	// stay empty anyway.
-	var nothing = [];
-
-	// A widget desc represents a widget decoration, which is a DOM node
-	// drawn between the document nodes.
-	var WidgetViewDesc = (function (ViewDesc) {
-	  function WidgetViewDesc(parent, widget, view, pos) {
-	    var self, dom = widget.type.toDOM;
-	    if (typeof dom == "function") { dom = dom(view, function () {
-	      if (!self) { return pos }
-	      if (self.parent) { return self.parent.posBeforeChild(self) }
-	    }); }
-	    if (!widget.type.spec.raw) {
-	      if (dom.nodeType != 1) {
-	        var wrap = document.createElement("span");
-	        wrap.appendChild(dom);
-	        dom = wrap;
-	      }
-	      dom.contentEditable = false;
-	      dom.classList.add("ProseMirror-widget");
-	    }
-	    ViewDesc.call(this, parent, nothing, dom, null);
-	    this.widget = widget;
-	    self = this;
-	  }
-
-	  if ( ViewDesc ) { WidgetViewDesc.__proto__ = ViewDesc; }
-	  WidgetViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-	  WidgetViewDesc.prototype.constructor = WidgetViewDesc;
-
-	  var prototypeAccessors$1 = { beforePosition: {} };
-
-	  prototypeAccessors$1.beforePosition.get = function () {
-	    return this.widget.type.side < 0
-	  };
-
-	  WidgetViewDesc.prototype.matchesWidget = function matchesWidget (widget) {
-	    return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type)
-	  };
-
-	  WidgetViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };
-
-	  WidgetViewDesc.prototype.stopEvent = function stopEvent (event) {
-	    var stop = this.widget.spec.stopEvent;
-	    return stop ? stop(event) : false
-	  };
-
-	  Object.defineProperties( WidgetViewDesc.prototype, prototypeAccessors$1 );
-
-	  return WidgetViewDesc;
-	}(ViewDesc));
-
-	// A cursor wrapper is used to put the cursor in when newly typed text
-	// needs to be styled differently from its surrounding text (for
-	// example through storedMarks), so that the style of the text doesn't
-	// visually 'pop' between typing it and actually updating the view.
-	var CursorWrapperDesc = (function (WidgetViewDesc) {
-	  function CursorWrapperDesc () {
-	    WidgetViewDesc.apply(this, arguments);
-	  }
-
-	  if ( WidgetViewDesc ) { CursorWrapperDesc.__proto__ = WidgetViewDesc; }
-	  CursorWrapperDesc.prototype = Object.create( WidgetViewDesc && WidgetViewDesc.prototype );
-	  CursorWrapperDesc.prototype.constructor = CursorWrapperDesc;
-
-	  CursorWrapperDesc.prototype.parseRule = function parseRule () {
-	    var content;
-	    for (var child = this.dom.firstChild; child; child = child.nextSibling) {
-	      var add = (void 0);
-	      if (child.nodeType == 3) {
-	        var text = child.nodeValue.replace(/\ufeff/g, "");
-	        if (!text) { continue }
-	        add = document.createTextNode(text);
-	      } else if (child.textContent == "\ufeff") {
-	        continue
-	      } else {
-	        add = child.cloneNode(true);
-	      }
-	      if (!content) { content = document.createDocumentFragment(); }
-	      content.appendChild(add);
-	    }
-	    if (content) { return {skip: content} }
-	    else { return WidgetViewDesc.prototype.parseRule.call(this) }
-	  };
-
-	  CursorWrapperDesc.prototype.ignoreMutation = function ignoreMutation () { return false };
-
-	  return CursorWrapperDesc;
-	}(WidgetViewDesc));
-
-	// A mark desc represents a mark. May have multiple children,
-	// depending on how the mark is split. Note that marks are drawn using
-	// a fixed nesting order, for simplicity and predictability, so in
-	// some cases they will be split more often than would appear
-	// necessary.
-	var MarkViewDesc = (function (ViewDesc) {
-	  function MarkViewDesc(parent, mark, dom, contentDOM) {
-	    ViewDesc.call(this, parent, [], dom, contentDOM);
-	    this.mark = mark;
-	  }
-
-	  if ( ViewDesc ) { MarkViewDesc.__proto__ = ViewDesc; }
-	  MarkViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-	  MarkViewDesc.prototype.constructor = MarkViewDesc;
-
-	  MarkViewDesc.create = function create (parent, mark, inline, view) {
-	    var custom = customNodeViews(view)[mark.type.name];
-	    var spec = custom && custom(mark, view);
-	    if (!spec || !spec.dom)
-	      { spec = dist.DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline)); }
-	    return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom)
-	  };
-
-	  MarkViewDesc.prototype.parseRule = function parseRule () { return {mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM} };
-
-	  MarkViewDesc.prototype.matchesMark = function matchesMark (mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark) };
-
-	  MarkViewDesc.prototype.markDirty = function markDirty (from, to) {
-	    ViewDesc.prototype.markDirty.call(this, from, to);
-	    // Move dirty info to nearest node view
-	    if (this.dirty != NOT_DIRTY) {
-	      var parent = this.parent;
-	      while (!parent.node) { parent = parent.parent; }
-	      if (parent.dirty < this.dirty) { parent.dirty = this.dirty; }
-	      this.dirty = NOT_DIRTY;
-	    }
-	  };
-
-	  return MarkViewDesc;
-	}(ViewDesc));
-
-	// Node view descs are the main, most common type of view desc, and
-	// correspond to an actual node in the document. Unlike mark descs,
-	// they populate their child array themselves.
-	var NodeViewDesc = (function (ViewDesc) {
-	  function NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {
-	    ViewDesc.call(this, parent, node.isLeaf ? nothing : [], dom, contentDOM);
-	    this.nodeDOM = nodeDOM;
-	    this.node = node;
-	    this.outerDeco = outerDeco;
-	    this.innerDeco = innerDeco;
-	    if (contentDOM) { this.updateChildren(view, pos); }
-	  }
-
-	  if ( ViewDesc ) { NodeViewDesc.__proto__ = ViewDesc; }
-	  NodeViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-	  NodeViewDesc.prototype.constructor = NodeViewDesc;
-
-	  var prototypeAccessors$2 = { size: {},border: {} };
-
-	  // By default, a node is rendered using the `toDOM` method from the
-	  // node type spec. But client code can use the `nodeViews` spec to
-	  // supply a custom node view, which can influence various aspects of
-	  // the way the node works.
-	  //
-	  // (Using subclassing for this was intentionally decided against,
-	  // since it'd require exposing a whole slew of finnicky
-	  // implementation details to the user code that they probably will
-	  // never need.)
-	  NodeViewDesc.create = function create (parent, node, outerDeco, innerDeco, view, pos) {
-	    var custom = customNodeViews(view)[node.type.name], descObj;
-	    var spec = custom && custom(node, view, function () {
-	      // (This is a function that allows the custom view to find its
-	      // own position)
-	      if (!descObj) { return pos }
-	      if (descObj.parent) { return descObj.parent.posBeforeChild(descObj) }
-	    }, outerDeco);
-
-	    var dom = spec && spec.dom, contentDOM = spec && spec.contentDOM;
-	    if (node.isText) {
-	      if (!dom) { dom = document.createTextNode(node.text); }
-	      else if (dom.nodeType != 3) { throw new RangeError("Text must be rendered as a DOM text node") }
-	    } else if (!dom) {
-	      var assign;
-	      ((assign = dist.DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)), dom = assign.dom, contentDOM = assign.contentDOM));
-	    }
-	    if (!contentDOM && !node.isText && dom.nodeName != "BR") { // Chrome gets confused by <br contenteditable=false>
-	      dom.contentEditable = false;
-	      if (node.type.spec.draggable) { dom.draggable = true; }
-	    }
-
-	    var nodeDOM = dom;
-	    dom = applyOuterDeco(dom, outerDeco, node);
-
-	    if (spec)
-	      { return descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view) }
-	    else if (node.isText)
-	      { return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) }
-	    else
-	      { return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos + 1) }
-	  };
-
-	  NodeViewDesc.prototype.parseRule = function parseRule () {
-	    var this$1 = this;
-
-	    // Experimental kludge to allow opt-in re-parsing of nodes
-	    if (this.node.type.spec.reparseInView) { return null }
-	    // FIXME the assumption that this can always return the current
-	    // attrs means that if the user somehow manages to change the
-	    // attrs in the dom, that won't be picked up. Not entirely sure
-	    // whether this is a problem
-	    var rule = {node: this.node.type.name, attrs: this.node.attrs};
-	    if (this.node.type.spec.code) { rule.preserveWhitespace = "full"; }
-	    if (this.contentDOM && !this.contentLost) { rule.contentElement = this.contentDOM; }
-	    else { rule.getContent = function () { return this$1.contentDOM ? dist.Fragment.empty : this$1.node.content; }; }
-	    return rule
-	  };
-
-	  NodeViewDesc.prototype.matchesNode = function matchesNode (node, outerDeco, innerDeco) {
-	    return this.dirty == NOT_DIRTY && node.eq(this.node) &&
-	      sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco)
-	  };
-
-	  prototypeAccessors$2.size.get = function () { return this.node.nodeSize };
-
-	  prototypeAccessors$2.border.get = function () { return this.node.isLeaf ? 0 : 1 };
-
-	  // Syncs `this.children` to match `this.node.content` and the local
-	  // decorations, possibly introducing nesting for marks. Then, in a
-	  // separate step, syncs the DOM inside `this.contentDOM` to
-	  // `this.children`.
-	  NodeViewDesc.prototype.updateChildren = function updateChildren (view, pos) {
-	    var this$1 = this;
-
-	    var updater = new ViewTreeUpdater(this), inline = this.node.inlineContent;
-	    iterDeco(this.node, this.innerDeco, function (widget, i) {
-	      if (widget.spec.marks)
-	        { updater.syncToMarks(widget.spec.marks, inline, view); }
-	      else if (widget.type.side >= 0)
-	        { updater.syncToMarks(i == this$1.node.childCount ? dist.Mark.none : this$1.node.child(i).marks, inline, view); }
-	      // If the next node is a desc matching this widget, reuse it,
-	      // otherwise insert the widget as a new view desc.
-	      updater.placeWidget(widget, view, pos);
-	    }, function (child, outerDeco, innerDeco, i) {
-	      // Make sure the wrapping mark descs match the node's marks.
-	      updater.syncToMarks(child.marks, inline, view);
-	      // Either find an existing desc that exactly matches this node,
-	      // and drop the descs before it.
-	      updater.findNodeMatch(child, outerDeco, innerDeco, i) ||
-	        // Or try updating the next desc to reflect this node.
-	        updater.updateNextNode(child, outerDeco, innerDeco, view, i) ||
-	        // Or just add it as a new desc.
-	        updater.addNode(child, outerDeco, innerDeco, view, pos);
-	      pos += child.nodeSize;
-	    });
-	    // Drop all remaining descs after the current position.
-	    updater.syncToMarks(nothing, inline, view);
-	    if (this.node.isTextblock) { updater.addTextblockHacks(); }
-	    updater.destroyRest();
-
-	    // Sync the DOM if anything changed
-	    if (updater.changed || this.dirty == CONTENT_DIRTY) { this.renderChildren(); }
-	  };
-
-	  NodeViewDesc.prototype.renderChildren = function renderChildren () {
-	    renderDescs(this.contentDOM, this.children, NodeViewDesc.is);
-	    if (result.ios) { iosHacks(this.dom); }
-	  };
-
-	  // : (Node, [Decoration], DecorationSet, EditorView) → bool
-	  // If this desc be updated to match the given node decoration,
-	  // do so and return true.
-	  NodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {
-	    if (this.dirty == NODE_DIRTY ||
-	        !node.sameMarkup(this.node)) { return false }
-	    this.updateInner(node, outerDeco, innerDeco, view);
-	    return true
-	  };
-
-	  NodeViewDesc.prototype.updateInner = function updateInner (node, outerDeco, innerDeco, view) {
-	    this.updateOuterDeco(outerDeco);
-	    this.node = node;
-	    this.innerDeco = innerDeco;
-	    if (this.contentDOM) { this.updateChildren(view, this.posAtStart); }
-	    this.dirty = NOT_DIRTY;
-	  };
-
-	  NodeViewDesc.prototype.updateOuterDeco = function updateOuterDeco (outerDeco) {
-	    if (sameOuterDeco(outerDeco, this.outerDeco)) { return }
-	    var needsWrap = this.nodeDOM.nodeType != 1;
-	    var oldDOM = this.dom;
-	    this.dom = patchOuterDeco(this.dom, this.nodeDOM,
-	                              computeOuterDeco(this.outerDeco, this.node, needsWrap),
-	                              computeOuterDeco(outerDeco, this.node, needsWrap));
-	    if (this.dom != oldDOM) {
-	      oldDOM.pmViewDesc = null;
-	      this.dom.pmViewDesc = this;
-	    }
-	    this.outerDeco = outerDeco;
-	  };
-
-	  // Mark this node as being the selected node.
-	  NodeViewDesc.prototype.selectNode = function selectNode () {
-	    this.nodeDOM.classList.add("ProseMirror-selectednode");
-	  };
-
-	  // Remove selected node marking from this node.
-	  NodeViewDesc.prototype.deselectNode = function deselectNode () {
-	    this.nodeDOM.classList.remove("ProseMirror-selectednode");
-	  };
-
-	  Object.defineProperties( NodeViewDesc.prototype, prototypeAccessors$2 );
-
-	  return NodeViewDesc;
-	}(ViewDesc));
-
-	// Create a view desc for the top-level document node, to be exported
-	// and used by the view class.
-	function docViewDesc(doc, outerDeco, innerDeco, dom, view) {
-	  applyOuterDeco(dom, outerDeco, doc, true);
-	  return new NodeViewDesc(null, doc, outerDeco, innerDeco, dom, dom, dom, view, 0)
-	}
-
-	var TextViewDesc = (function (NodeViewDesc) {
-	  function TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {
-	    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view);
-	  }
-
-	  if ( NodeViewDesc ) { TextViewDesc.__proto__ = NodeViewDesc; }
-	  TextViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );
-	  TextViewDesc.prototype.constructor = TextViewDesc;
-
-	  TextViewDesc.prototype.parseRule = function parseRule () {
-	    var parent = this.nodeDOM.parentNode;
-	    return parent ? {skip: parent} : {ignore: true}
-	  };
-
-	  TextViewDesc.prototype.update = function update (node, outerDeco) {
-	    if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) ||
-	        !node.sameMarkup(this.node)) { return false }
-	    this.updateOuterDeco(outerDeco);
-	    if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue)
-	      { this.nodeDOM.nodeValue = node.text; }
-	    this.node = node;
-	    this.dirty = NOT_DIRTY;
-	    return true
-	  };
-
-	  TextViewDesc.prototype.inParent = function inParent () {
-	    var parentDOM = this.parent.contentDOM;
-	    for (var n = this.nodeDOM; n; n = n.parentNode) { if (n == parentDOM) { return true } }
-	    return false
-	  };
-
-	  TextViewDesc.prototype.domFromPos = function domFromPos (pos) {
-	    return {node: this.nodeDOM, offset: pos}
-	  };
-
-	  TextViewDesc.prototype.localPosFromDOM = function localPosFromDOM (dom, offset, bias) {
-	    if (dom == this.nodeDOM) { return this.posAtStart + Math.min(offset, this.node.text.length) }
-	    return NodeViewDesc.prototype.localPosFromDOM.call(this, dom, offset, bias)
-	  };
-
-	  TextViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {
-	    return mutation.type != "characterData"
-	  };
-
-	  return TextViewDesc;
-	}(NodeViewDesc));
-
-	// A dummy desc used to tag trailing BR or span nodes created to work
-	// around contentEditable terribleness.
-	var BRHackViewDesc = (function (ViewDesc) {
-	  function BRHackViewDesc () {
-	    ViewDesc.apply(this, arguments);
-	  }
-
-	  if ( ViewDesc ) { BRHackViewDesc.__proto__ = ViewDesc; }
-	  BRHackViewDesc.prototype = Object.create( ViewDesc && ViewDesc.prototype );
-	  BRHackViewDesc.prototype.constructor = BRHackViewDesc;
-
-	  BRHackViewDesc.prototype.parseRule = function parseRule () { return {ignore: true} };
-	  BRHackViewDesc.prototype.matchesHack = function matchesHack () { return this.dirty == NOT_DIRTY };
-
-	  return BRHackViewDesc;
-	}(ViewDesc));
-
-	// A separate subclass is used for customized node views, so that the
-	// extra checks only have to be made for nodes that are actually
-	// customized.
-	var CustomNodeViewDesc = (function (NodeViewDesc) {
-	  function CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view) {
-	    NodeViewDesc.call(this, parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view);
-	    this.spec = spec;
-	  }
-
-	  if ( NodeViewDesc ) { CustomNodeViewDesc.__proto__ = NodeViewDesc; }
-	  CustomNodeViewDesc.prototype = Object.create( NodeViewDesc && NodeViewDesc.prototype );
-	  CustomNodeViewDesc.prototype.constructor = CustomNodeViewDesc;
-
-	  // A custom `update` method gets to decide whether the update goes
-	  // through. If it does, and there's a `contentDOM` node, our logic
-	  // updates the children.
-	  CustomNodeViewDesc.prototype.update = function update (node, outerDeco, innerDeco, view) {
-	    if (this.dirty == NODE_DIRTY) { return false }
-	    if (this.spec.update) {
-	      var result$$1 = this.spec.update(node, outerDeco);
-	      if (result$$1) { this.updateInner(node, outerDeco, innerDeco, view); }
-	      return result$$1
-	    } else if (!this.contentDOM && !node.isLeaf) {
-	      return false
-	    } else {
-	      return NodeViewDesc.prototype.update.call(this, node, outerDeco, innerDeco, view)
-	    }
-	  };
-
-	  CustomNodeViewDesc.prototype.selectNode = function selectNode () {
-	    this.spec.selectNode ? this.spec.selectNode() : NodeViewDesc.prototype.selectNode.call(this);
-	  };
-
-	  CustomNodeViewDesc.prototype.deselectNode = function deselectNode () {
-	    this.spec.deselectNode ? this.spec.deselectNode() : NodeViewDesc.prototype.deselectNode.call(this);
-	  };
-
-	  CustomNodeViewDesc.prototype.setSelection = function setSelection (anchor, head, root) {
-	    this.spec.setSelection ? this.spec.setSelection(anchor, head, root) : NodeViewDesc.prototype.setSelection.call(this, anchor, head, root);
-	  };
-
-	  CustomNodeViewDesc.prototype.destroy = function destroy () {
-	    if (this.spec.destroy) { this.spec.destroy(); }
-	    NodeViewDesc.prototype.destroy.call(this);
-	  };
-
-	  CustomNodeViewDesc.prototype.stopEvent = function stopEvent (event) {
-	    return this.spec.stopEvent ? this.spec.stopEvent(event) : false
-	  };
-
-	  CustomNodeViewDesc.prototype.ignoreMutation = function ignoreMutation (mutation) {
-	    return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : NodeViewDesc.prototype.ignoreMutation.call(this, mutation)
-	  };
-
-	  return CustomNodeViewDesc;
-	}(NodeViewDesc));
-
-	// : (dom.Node, [ViewDesc])
-	// Sync the content of the given DOM node with the nodes associated
-	// with the given array of view descs, recursing into mark descs
-	// because this should sync the subtree for a whole node at a time.
-	function renderDescs(parentDOM, descs) {
-	  var dom = parentDOM.firstChild;
-	  for (var i = 0; i < descs.length; i++) {
-	    var desc = descs[i], childDOM = desc.dom;
-	    if (childDOM.parentNode == parentDOM) {
-	      while (childDOM != dom) { dom = rm(dom); }
-	      dom = dom.nextSibling;
-	    } else {
-	      parentDOM.insertBefore(childDOM, dom);
-	    }
-	    if (desc instanceof MarkViewDesc) {
-	      var pos = dom ? dom.previousSibling : parentDOM.lastChild;
-	      renderDescs(desc.contentDOM, desc.children);
-	      dom = pos ? pos.nextSibling : parentDOM.firstChild;
-	    }
-	  }
-	  while (dom) { dom = rm(dom); }
-	}
-
-	function OuterDecoLevel(nodeName) {
-	  if (nodeName) { this.nodeName = nodeName; }
-	}
-	OuterDecoLevel.prototype = Object.create(null);
-
-	var noDeco = [new OuterDecoLevel];
-
-	function computeOuterDeco(outerDeco, node, needsWrap) {
-	  if (outerDeco.length == 0) { return noDeco }
-
-	  var top = needsWrap ? noDeco[0] : new OuterDecoLevel, result$$1 = [top];
-
-	  for (var i = 0; i < outerDeco.length; i++) {
-	    var attrs = outerDeco[i].type.attrs, cur = top;
-	    if (!attrs) { continue }
-	    if (attrs.nodeName)
-	      { result$$1.push(cur = new OuterDecoLevel(attrs.nodeName)); }
-
-	    for (var name in attrs) {
-	      var val = attrs[name];
-	      if (val == null) { continue }
-	      if (needsWrap && result$$1.length == 1)
-	        { result$$1.push(cur = top = new OuterDecoLevel(node.isInline ? "span" : "div")); }
-	      if (name == "class") { cur.class = (cur.class ? cur.class + " " : "") + val; }
-	      else if (name == "style") { cur.style = (cur.style ? cur.style + ";" : "") + val; }
-	      else if (name != "nodeName") { cur[name] = val; }
-	    }
-	  }
-
-	  return result$$1
-	}
-
-	function patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {
-	  // Shortcut for trivial case
-	  if (prevComputed == noDeco && curComputed == noDeco) { return nodeDOM }
-
-	  var curDOM = nodeDOM;
-	  for (var i = 0; i < curComputed.length; i++) {
-	    var deco = curComputed[i], prev = prevComputed[i];
-	    if (i) {
-	      var parent = (void 0);
-	      if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&
-	          (parent = nodeDOM.parentNode) && parent.tagName.toLowerCase() == deco.nodeName) {
-	        curDOM = parent;
-	      } else {
-	        parent = document.createElement(deco.nodeName);
-	        parent.appendChild(curDOM);
-	        curDOM = parent;
-	      }
-	    }
-	    patchAttributes(curDOM, prev || noDeco[0], deco);
-	  }
-	  return curDOM
-	}
-
-	function patchAttributes(dom, prev, cur) {
-	  for (var name in prev)
-	    { if (name != "class" && name != "style" && name != "nodeName" && !(name in cur))
-	      { dom.removeAttribute(name); } }
-	  for (var name$1 in cur)
-	    { if (name$1 != "class" && name$1 != "style" && name$1 != "nodeName" && cur[name$1] != prev[name$1])
-	      { dom.setAttribute(name$1, cur[name$1]); } }
-	  if (prev.class != cur.class) {
-	    var prevList = prev.class ? prev.class.split(" ") : nothing;
-	    var curList = cur.class ? cur.class.split(" ") : nothing;
-	    for (var i = 0; i < prevList.length; i++) { if (curList.indexOf(prevList[i]) == -1)
-	      { dom.classList.remove(prevList[i]); } }
-	    for (var i$1 = 0; i$1 < curList.length; i$1++) { if (prevList.indexOf(curList[i$1]) == -1)
-	      { dom.classList.add(curList[i$1]); } }
-	  }
-	  if (prev.style != cur.style) {
-	    if (prev.style) {
-	      var prop = /\s*([\w\-\xa1-\uffff]+)\s*:(?:"(?:\\.|[^"])*"|'(?:\\.|[^'])*'|\(.*?\)|[^;])*/g, m;
-	      while (m = prop.exec(prev.style))
-	        { dom.style[m[1].toLowerCase()] = ""; }
-	    }
-	    if (cur.style)
-	      { dom.style.cssText += cur.style; }
-	  }
-	}
-
-	function applyOuterDeco(dom, deco, node) {
-	  return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1))
-	}
-
-	// : ([Decoration], [Decoration]) → bool
-	function sameOuterDeco(a, b) {
-	  if (a.length != b.length) { return false }
-	  for (var i = 0; i < a.length; i++) { if (!a[i].type.eq(b[i].type)) { return false } }
-	  return true
-	}
-
-	// Remove a DOM node and return its next sibling.
-	function rm(dom) {
-	  var next = dom.nextSibling;
-	  dom.parentNode.removeChild(dom);
-	  return next
-	}
-
-	// Helper class for incrementally updating a tree of mark descs and
-	// the widget and node descs inside of them.
-	var ViewTreeUpdater = function ViewTreeUpdater(top) {
-	  this.top = top;
-	  // Index into `this.top`'s child array, represents the current
-	  // update position.
-	  this.index = 0;
-	  // When entering a mark, the current top and index are pushed
-	  // onto this.
-	  this.stack = [];
-	  // Tracks whether anything was changed
-	  this.changed = false;
-
-	  this.preMatched = preMatch(top.node.content, top.children);
-	};
-
-	// Destroy and remove the children between the given indices in
-	// `this.top`.
-	ViewTreeUpdater.prototype.destroyBetween = function destroyBetween (start, end) {
-	    var this$1 = this;
-
-	  if (start == end) { return }
-	  for (var i = start; i < end; i++) { this$1.top.children[i].destroy(); }
-	  this.top.children.splice(start, end - start);
-	  this.changed = true;
-	};
-
-	// Destroy all remaining children in `this.top`.
-	ViewTreeUpdater.prototype.destroyRest = function destroyRest () {
-	  this.destroyBetween(this.index, this.top.children.length);
-	};
-
-	// : ([Mark], EditorView)
-	// Sync the current stack of mark descs with the given array of
-	// marks, reusing existing mark descs when possible.
-	ViewTreeUpdater.prototype.syncToMarks = function syncToMarks (marks, inline, view) {
-	    var this$1 = this;
-
-	  var keep = 0, depth = this.stack.length >> 1;
-	  var maxKeep = Math.min(depth, marks.length), next;
-	  while (keep < maxKeep &&
-	         (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1]).matchesMark(marks[keep]))
-	    { keep++; }
-
-	  while (keep < depth) {
-	    this$1.destroyRest();
-	    this$1.top.dirty = NOT_DIRTY;
-	    this$1.index = this$1.stack.pop();
-	    this$1.top = this$1.stack.pop();
-	    depth--;
-	  }
-	  while (depth < marks.length) {
-	    this$1.stack.push(this$1.top, this$1.index + 1);
-	    if (this$1.index < this$1.top.children.length &&
-	        (next = this$1.top.children[this$1.index]).matchesMark(marks[depth])) {
-	      this$1.top = next;
-	    } else {
-	      var markDesc = MarkViewDesc.create(this$1.top, marks[depth], inline, view);
-	      this$1.top.children.splice(this$1.index, 0, markDesc);
-	      this$1.top = markDesc;
-	      this$1.changed = true;
-	    }
-	    this$1.index = 0;
-	    depth++;
-	  }
-	};
-
-	// : (Node, [Decoration], DecorationSet) → bool
-	// Try to find a node desc matching the given data. Skip over it and
-	// return true when successful.
-	ViewTreeUpdater.prototype.findNodeMatch = function findNodeMatch (node, outerDeco, innerDeco, index) {
-	    var this$1 = this;
-
-	  for (var i = this.index, children = this.top.children, e = Math.min(children.length, i + 5); i < e; i++) {
-	    var child = children[i], preMatched = (void 0);
-	    if (child.matchesNode(node, outerDeco, innerDeco) &&
-	        ((preMatched = this$1.preMatched.indexOf(child)) == -1 || preMatched == index)) {
-	      this$1.destroyBetween(this$1.index, i);
-	      this$1.index++;
-	      return true
-	    }
-	  }
-	  return false
-	};
-
-	// : (Node, [Decoration], DecorationSet, EditorView, Fragment, number) → bool
-	// Try to update the next node, if any, to the given data. Checks
-	// pre-matches to avoid overwriting nodes that could still be used.
-	ViewTreeUpdater.prototype.updateNextNode = function updateNextNode (node, outerDeco, innerDeco, view, index) {
-	  if (this.index == this.top.children.length) { return false }
-	  var next = this.top.children[this.index];
-	  if (next instanceof NodeViewDesc) {
-	    var preMatch = this.preMatched.indexOf(next);
-	    if (preMatch > -1 && preMatch != index) { return false }
-	    var nextDOM = next.dom;
-	    if (next.update(node, outerDeco, innerDeco, view)) {
-	      if (next.dom != nextDOM) { this.changed = true; }
-	      this.index++;
-	      return true
-	    }
-	  }
-	  return false
-	};
-
-	// : (Node, [Decoration], DecorationSet, EditorView)
-	// Insert the node as a newly created node desc.
-	ViewTreeUpdater.prototype.addNode = function addNode (node, outerDeco, innerDeco, view, pos) {
-	  this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos));
-	  this.changed = true;
-	};
-
-	ViewTreeUpdater.prototype.placeWidget = function placeWidget (widget, view, pos) {
-	  if (this.index < this.top.children.length && this.top.children[this.index].matchesWidget(widget)) {
-	    this.index++;
-	  } else {
-	    var desc = new (widget.spec.isCursorWrapper ? CursorWrapperDesc : WidgetViewDesc)(this.top, widget, view, pos);
-	    this.top.children.splice(this.index++, 0, desc);
-	    this.changed = true;
-	  }
-	};
-
-	// Make sure a textblock looks and behaves correctly in
-	// contentEditable.
-	ViewTreeUpdater.prototype.addTextblockHacks = function addTextblockHacks () {
-	  var lastChild = this.top.children[this.index - 1];
-	  while (lastChild instanceof MarkViewDesc) { lastChild = lastChild.children[lastChild.children.length - 1]; }
-
-	  if (!lastChild || // Empty textblock
-	      !(lastChild instanceof TextViewDesc) ||
-	      /\n$/.test(lastChild.node.text)) {
-	    if (this.index < this.top.children.length && this.top.children[this.index].matchesHack()) {
-	      this.index++;
-	    } else {
-	      var dom = document.createElement("br");
-	      this.top.children.splice(this.index++, 0, new BRHackViewDesc(this.top, nothing, dom, null));
-	      this.changed = true;
-	    }
-	  }
-	};
-
-	// : (Fragment, [ViewDesc]) → [ViewDesc]
-	// Iterate from the end of the fragment and array of descs to find
-	// directly matching ones, in order to avoid overeagerly reusing
-	// those for other nodes. Returns an array whose positions correspond
-	// to node positions in the fragment, and whose elements are either
-	// descs matched to the child at that index, or empty.
-	function preMatch(frag, descs) {
-	  var result$$1 = [], end = frag.childCount;
-	  for (var i = descs.length - 1; end > 0 && i >= 0; i--) {
-	    var desc = descs[i], node = desc.node;
-	    if (!node) { continue }
-	    if (node != frag.child(end - 1)) { break }
-	    result$$1[--end] = desc;
-	  }
-	  return result$$1
-	}
-
-	function compareSide(a, b) { return a.type.side - b.type.side }
-
-	// : (ViewDesc, DecorationSet, (Decoration), (Node, [Decoration], DecorationSet, number))
-	// This function abstracts iterating over the nodes and decorations in
-	// a fragment. Calls `onNode` for each node, with its local and child
-	// decorations. Splits text nodes when there is a decoration starting
-	// or ending inside of them. Calls `onWidget` for each widget.
-	function iterDeco(parent, deco, onWidget, onNode) {
-	  var locals = deco.locals(parent), offset = 0;
-	  // Simple, cheap variant for when there are no local decorations
-	  if (locals.length == 0) {
-	    for (var i = 0; i < parent.childCount; i++) {
-	      var child = parent.child(i);
-	      onNode(child, locals, deco.forChild(offset, child), i);
-	      offset += child.nodeSize;
-	    }
-	    return
-	  }
-
-	  var decoIndex = 0, active = [], restNode = null;
-	  for (var parentIndex = 0;;) {
-	    if (decoIndex < locals.length && locals[decoIndex].to == offset) {
-	      var widget = locals[decoIndex++], widgets = (void 0);
-	      while (decoIndex < locals.length && locals[decoIndex].to == offset)
-	        { (widgets || (widgets = [widget])).push(locals[decoIndex++]); }
-	      if (widgets) {
-	        widgets.sort(compareSide);
-	        for (var i$1 = 0; i$1 < widgets.length; i$1++) { onWidget(widgets[i$1], parentIndex); }
-	      } else {
-	        onWidget(widget, parentIndex);
-	      }
-	    }
-
-	    var child$1 = (void 0);
-	    if (restNode) {
-	      child$1 = restNode;
-	      restNode = null;
-	    } else if (parentIndex < parent.childCount) {
-	      child$1 = parent.child(parentIndex++);
-	    } else {
-	      break
-	    }
-
-	    for (var i$2 = 0; i$2 < active.length; i$2++) { if (active[i$2].to <= offset) { active.splice(i$2--, 1); } }
-	    while (decoIndex < locals.length && locals[decoIndex].from == offset) { active.push(locals[decoIndex++]); }
-
-	    var end = offset + child$1.nodeSize;
-	    if (child$1.isText) {
-	      var cutAt = end;
-	      if (decoIndex < locals.length && locals[decoIndex].from < cutAt) { cutAt = locals[decoIndex].from; }
-	      for (var i$3 = 0; i$3 < active.length; i$3++) { if (active[i$3].to < cutAt) { cutAt = active[i$3].to; } }
-	      if (cutAt < end) {
-	        restNode = child$1.cut(cutAt - offset);
-	        child$1 = child$1.cut(0, cutAt - offset);
-	        end = cutAt;
-	      }
-	    }
-
-	    onNode(child$1, active.length ? active.slice() : nothing, deco.forChild(offset, child$1), parentIndex - 1);
-	    offset = end;
-	  }
-	}
-
-	// Pre-calculate and cache the set of custom view specs for a given
-	// prop object.
-	var cachedCustomViews;
-	var cachedCustomFor;
-	function customNodeViews(view) {
-	  if (cachedCustomFor == view._props) { return cachedCustomViews }
-	  cachedCustomFor = view._props;
-	  return cachedCustomViews = buildCustomViews(view)
-	}
-	function buildCustomViews(view) {
-	  var result$$1 = {};
-	  view.someProp("nodeViews", function (obj) {
-	    for (var prop in obj) { if (!Object.prototype.hasOwnProperty.call(result$$1, prop))
-	      { result$$1[prop] = obj[prop]; } }
-	  });
-	  return result$$1
-	}
-
-	// List markers in Mobile Safari will mysteriously disappear
-	// sometimes. This works around that.
-	function iosHacks(dom) {
-	  if (dom.nodeName == "UL" || dom.nodeName == "OL") {
-	    var oldCSS = dom.style.cssText;
-	    dom.style.cssText = oldCSS + "; list-style: square !important";
-	    window.getComputedStyle(dom).listStyle;
-	    dom.style.cssText = oldCSS;
-	  }
-	}
-
-	function moveSelectionBlock(state, dir) {
-	  var ref = state.selection;
-	  var $anchor = ref.$anchor;
-	  var $head = ref.$head;
-	  var $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);
-	  var $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null;
-	  return $start && dist$2.Selection.findFrom($start, dir)
-	}
-
-	function apply(view, sel) {
-	  view.dispatch(view.state.tr.setSelection(sel).scrollIntoView());
-	  return true
-	}
-
-	function selectHorizontally(view, dir) {
-	  var sel = view.state.selection;
-	  if (sel instanceof dist$2.TextSelection) {
-	    if (!sel.empty) {
-	      return false
-	    } else if (view.endOfTextblock(dir > 0 ? "right" : "left")) {
-	      var next = moveSelectionBlock(view.state, dir);
-	      if (next && (next instanceof dist$2.NodeSelection)) { return apply(view, next) }
-	      return false
-	    } else {
-	      var $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc;
-	      if (node && dist$2.NodeSelection.isSelectable(node)) {
-	        var nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;
-	        if (node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM)
-	          { return apply(view, new dist$2.NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head)) }
-	      }
-	      return false
-	    }
-	  } else if (sel instanceof dist$2.NodeSelection && sel.node.isInline) {
-	    return apply(view, new dist$2.TextSelection(dir > 0 ? sel.$to : sel.$from))
-	  } else {
-	    var next$1 = moveSelectionBlock(view.state, dir);
-	    if (next$1) { return apply(view, next$1) }
-	    return false
-	  }
-	}
-
-	function nodeLen(node) {
-	  return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length
-	}
-
-	function isIgnorable(dom) {
-	  var desc = dom.pmViewDesc;
-	  return desc && desc.size == 0 && (dom.nextSibling || dom.nodeName != "BR")
-	}
-
-	// Make sure the cursor isn't directly after one or more ignored
-	// nodes, which will confuse the browser's cursor motion logic.
-	function skipIgnoredNodesLeft(view) {
-	  var sel = view.root.getSelection();
-	  var node = sel.focusNode, offset = sel.focusOffset;
-	  if (!node) { return }
-	  var moveNode, moveOffset, force = false;
-	  // Gecko will do odd things when the selection is directly in front
-	  // of a non-editable node, so in that case, move it into the next
-	  // node if possible. Issue prosemirror/prosemirror#832.
-	  if (result.gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset])) { force = true; }
-	  for (;;) {
-	    if (offset > 0) {
-	      if (node.nodeType != 1) {
-	        if (node.nodeType == 3 && node.nodeValue.charAt(offset - 1) == "\ufeff") {
-	          // IE11's cursor will still be stuck when placed at the
-	          // beginning of the cursor wrapper text node (#807)
-	          if (result.ie && result.ie_version <= 11) { force = true; }
-	          moveNode = node;
-	          moveOffset = --offset;
-	        } else { break }
-	      } else {
-	        var before = node.childNodes[offset - 1];
-	        if (isIgnorable(before)) {
-	          moveNode = node;
-	          moveOffset = --offset;
-	        } else if (before.nodeType == 3) {
-	          node = before;
-	          offset = node.nodeValue.length;
-	        } else { break }
-	      }
-	    } else if (isBlockNode(node)) {
-	      break
-	    } else {
-	      var prev = node.previousSibling;
-	      while (prev && isIgnorable(prev)) {
-	        moveNode = node.parentNode;
-	        moveOffset = domIndex(prev);
-	        prev = prev.previousSibling;
-	      }
-	      if (!prev) {
-	        node = node.parentNode;
-	        if (node == view.dom) { break }
-	        offset = 0;
-	      } else {
-	        node = prev;
-	        offset = nodeLen(node);
-	      }
-	    }
-	  }
-	  if (force) { setSelFocus(view, sel, node, offset); }
-	  else if (moveNode) { setSelFocus(view, sel, moveNode, moveOffset); }
-	}
-
-	// Make sure the cursor isn't directly before one or more ignored
-	// nodes.
-	function skipIgnoredNodesRight(view) {
-	  var sel = view.root.getSelection();
-	  var node = sel.focusNode, offset = sel.focusOffset;
-	  if (!node) { return }
-	  var len = nodeLen(node);
-	  var moveNode, moveOffset;
-	  for (;;) {
-	    if (offset < len) {
-	      if (node.nodeType != 1) { break }
-	      var after = node.childNodes[offset];
-	      if (isIgnorable(after)) {
-	        moveNode = node;
-	        moveOffset = ++offset;
-	      }
-	      else { break }
-	    } else if (isBlockNode(node)) {
-	      break
-	    } else {
-	      var next = node.nextSibling;
-	      while (next && isIgnorable(next)) {
-	        moveNode = next.parentNode;
-	        moveOffset = domIndex(next) + 1;
-	        next = next.nextSibling;
-	      }
-	      if (!next) {
-	        node = node.parentNode;
-	        if (node == view.dom) { break }
-	        offset = len = 0;
-	      } else {
-	        node = next;
-	        offset = 0;
-	        len = nodeLen(node);
-	      }
-	    }
-	  }
-	  if (moveNode) { setSelFocus(view, sel, moveNode, moveOffset); }
-	}
-
-	function isBlockNode(dom) {
-	  var desc = dom.pmViewDesc;
-	  return desc && desc.node && desc.node.isBlock
-	}
-
-	function setSelFocus(view, sel, node, offset) {
-	  if (selectionCollapsed(sel)) {
-	    var range = document.createRange();
-	    range.setEnd(node, offset);
-	    range.setStart(node, offset);
-	    sel.removeAllRanges();
-	    sel.addRange(range);
-	  } else if (sel.extend) {
-	    sel.extend(node, offset);
-	  }
-	  view.selectionReader.storeDOMState(view.selection);
-	}
-
-	// : (EditorState, number)
-	// Check whether vertical selection motion would involve node
-	// selections. If so, apply it (if not, the result is left to the
-	// browser)
-	function selectVertically(view, dir) {
-	  var sel = view.state.selection;
-	  if (sel instanceof dist$2.TextSelection && !sel.empty) { return false }
-	  var $from = sel.$from;
-	  var $to = sel.$to;
-
-	  if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? "up" : "down")) {
-	    var next = moveSelectionBlock(view.state, dir);
-	    if (next && (next instanceof dist$2.NodeSelection))
-	      { return apply(view, next) }
-	  }
-	  if (!$from.parent.inlineContent) {
-	    var beyond = dist$2.Selection.findFrom(dir < 0 ? $from : $to, dir);
-	    return beyond ? apply(view, beyond) : true
-	  }
-	  return false
-	}
-
-	function stopNativeHorizontalDelete(view, dir) {
-	  if (!(view.state.selection instanceof dist$2.TextSelection)) { return true }
-	  var ref = view.state.selection;
-	  var $head = ref.$head;
-	  var $anchor = ref.$anchor;
-	  var empty = ref.empty;
-	  if (!$head.sameParent($anchor)) { return true }
-	  if (!empty) { return false }
-	  if (view.endOfTextblock(dir > 0 ? "forward" : "backward")) { return true }
-	  var nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);
-	  if (nextNode && !nextNode.isText) {
-	    var tr = view.state.tr;
-	    if (dir < 0) { tr.delete($head.pos - nextNode.nodeSize, $head.pos); }
-	    else { tr.delete($head.pos, $head.pos + nextNode.nodeSize); }
-	    view.dispatch(tr);
-	    return true
-	  }
-	  return false
-	}
-
-	// A backdrop key mapping used to make sure we always suppress keys
-	// that have a dangerous default effect, even if the commands they are
-	// bound to return false, and to make sure that cursor-motion keys
-	// find a cursor (as opposed to a node selection) when pressed. For
-	// cursor-motion keys, the code in the handlers also takes care of
-	// block selections.
-
-	function getMods(event) {
-	  var result$$1 = "";
-	  if (event.ctrlKey) { result$$1 += "c"; }
-	  if (event.metaKey) { result$$1 += "m"; }
-	  if (event.altKey) { result$$1 += "a"; }
-	  if (event.shiftKey) { result$$1 += "s"; }
-	  return result$$1
-	}
-
-	function captureKeyDown(view, event) {
-	  var code = event.keyCode, mods = getMods(event);
-	  if (code == 8 || (result.mac && code == 72 && mods == "c")) { // Backspace, Ctrl-h on Mac
-	    return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodesLeft(view)
-	  } else if (code == 46 || (result.mac && code == 68 && mods == "c")) { // Delete, Ctrl-d on Mac
-	    return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodesRight(view)
-	  } else if (code == 13 || code == 27) { // Enter, Esc
-	    return true
-	  } else if (code == 37) { // Left arrow
-	    return selectHorizontally(view, -1) || skipIgnoredNodesLeft(view)
-	  } else if (code == 39) { // Right arrow
-	    return selectHorizontally(view, 1) || skipIgnoredNodesRight(view)
-	  } else if (code == 38) { // Up arrow
-	    return selectVertically(view, -1) || skipIgnoredNodesLeft(view)
-	  } else if (code == 40) { // Down arrow
-	    return selectVertically(view, 1) || skipIgnoredNodesRight(view)
-	  } else if (mods == (result.mac ? "m" : "c") &&
-	             (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]
-	    return true
-	  }
-	  return false
-	}
-
-	var TrackedRecord = function TrackedRecord(prev, mapping, state) {
-	  this.prev = prev;
-	  this.mapping = mapping;
-	  this.state = state;
-	};
-
-	var TrackMappings = function TrackMappings(state) {
-	  this.seen = [new TrackedRecord(null, null, state)];
-	  // Kludge to listen to state changes globally in order to be able
-	  // to find mappings from a given state to another.
-	  dist$2.EditorState.addApplyListener(this.track = this.track.bind(this));
-	};
-
-	TrackMappings.prototype.destroy = function destroy () {
-	  dist$2.EditorState.removeApplyListener(this.track);
-	};
-
-	TrackMappings.prototype.find = function find (state) {
-	    var this$1 = this;
-
-	  for (var i = this.seen.length - 1; i >= 0; i--) {
-	    var record = this$1.seen[i];
-	    if (record.state == state) { return record }
-	  }
-	};
-
-	TrackMappings.prototype.track = function track (old, tr, state) {
-	  var found = this.seen.length < 200 ? this.find(old) : null;
-	  if (found)
-	    { this.seen.push(new TrackedRecord(found, tr.docChanged ? tr.mapping : null, state)); }
-	};
-
-	TrackMappings.prototype.getMapping = function getMapping (state, appendTo) {
-	  var found = this.find(state);
-	  if (!found) { return null }
-	  var mappings = [];
-	  for (var rec = found; rec; rec = rec.prev)
-	    { if (rec.mapping) { mappings.push(rec.mapping); } }
-	  var result = appendTo || new dist$1.Mapping;
-	  for (var i = mappings.length - 1; i >= 0; i--)
-	    { result.appendMapping(mappings[i]); }
-	  return result
-	};
-
-	// Track the state of the DOM selection, creating transactions to
-	// update the selection state when necessary.
-	var SelectionReader = function SelectionReader(view) {
-	  var this$1 = this;
-
-	  this.view = view;
-
-	  // Track the state of the DOM selection.
-	  this.lastAnchorNode = this.lastHeadNode = this.lastAnchorOffset = this.lastHeadOffset = null;
-	  this.lastSelection = view.state.selection;
-	  this.ignoreUpdates = false;
-	  this.suppressUpdates = false;
-	  this.poller = poller(this);
-
-	  view.dom.addEventListener("focus", function () { return this$1.poller.start(hasFocusAndSelection(this$1.view)); });
-	  view.dom.addEventListener("blur", function () { return this$1.poller.stop(); });
-
-	  if (!view.editable) { this.poller.start(false); }
-	};
-
-	SelectionReader.prototype.destroy = function destroy () { this.poller.stop(); };
-
-	SelectionReader.prototype.poll = function poll (origin) { this.poller.poll(origin); };
-
-	SelectionReader.prototype.editableChanged = function editableChanged () {
-	  if (!this.view.editable) { this.poller.start(); }
-	  else if (!hasFocusAndSelection(this.view)) { this.poller.stop(); }
-	};
-
-	// : () → bool
-	// Whether the DOM selection has changed from the last known state.
-	SelectionReader.prototype.domChanged = function domChanged () {
-	  var sel = this.view.root.getSelection();
-	  return sel.anchorNode != this.lastAnchorNode || sel.anchorOffset != this.lastAnchorOffset ||
-	    sel.focusNode != this.lastHeadNode || sel.focusOffset != this.lastHeadOffset
-	};
-
-	// Store the current state of the DOM selection.
-	SelectionReader.prototype.storeDOMState = function storeDOMState (selection) {
-	  var sel = this.view.root.getSelection();
-	  this.lastAnchorNode = sel.anchorNode; this.lastAnchorOffset = sel.anchorOffset;
-	  this.lastHeadNode = sel.focusNode; this.lastHeadOffset = sel.focusOffset;
-	  this.lastSelection = selection;
-	};
-
-	SelectionReader.prototype.clearDOMState = function clearDOMState () {
-	  this.lastAnchorNode = this.lastSelection = null;
-	};
-
-	// : (?string)
-	// When the DOM selection changes in a notable manner, modify the
-	// current selection state to match.
-	SelectionReader.prototype.readFromDOM = function readFromDOM (origin) {
-	  if (this.ignoreUpdates || !this.domChanged() || !hasFocusAndSelection(this.view)) { return }
-	  if (this.suppressUpdates) { return selectionToDOM(this.view) }
-	  if (!this.view.inDOMChange) { this.view.domObserver.flush(); }
-	  if (this.view.inDOMChange) { return }
-
-	  var domSel = this.view.root.getSelection(), doc = this.view.state.doc;
-	  var nearestDesc = this.view.docView.nearestDesc(domSel.focusNode), inWidget = nearestDesc && nearestDesc.size == 0;
-	  var head = this.view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset);
-	  var $head = doc.resolve(head), $anchor, selection;
-	  if (selectionCollapsed(domSel)) {
-	    $anchor = $head;
-	    while (nearestDesc && !nearestDesc.node) { nearestDesc = nearestDesc.parent; }
-	    if (nearestDesc && nearestDesc.node.isAtom && dist$2.NodeSelection.isSelectable(nearestDesc.node) && nearestDesc.parent) {
-	      var pos = nearestDesc.posBefore;
-	      selection = new dist$2.NodeSelection(head == pos ? $head : doc.resolve(pos));
-	    }
-	  } else {
-	    $anchor = doc.resolve(this.view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset));
-	  }
-
-	  if (!selection) {
-	    var bias = origin == "pointer" || (this.view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;
-	    selection = selectionBetween(this.view, $anchor, $head, bias);
-	  }
-	  if (!this.view.state.selection.eq(selection)) {
-	    var tr = this.view.state.tr.setSelection(selection);
-	    if (origin == "pointer") { tr.setMeta("pointer", true); }
-	    this.view.dispatch(tr);
-	  } else {
-	    selectionToDOM(this.view);
-	  }
-	};
-
-	// There's two polling models. On browsers that support the
-	// selectionchange event (everything except Firefox < 52, basically), we
-	// register a listener for that whenever the editor is focused.
-	var SelectionChangePoller = function SelectionChangePoller(reader) {
-	  var this$1 = this;
-
-	  this.listening = false;
-	  this.curOrigin = null;
-	  this.originTime = 0;
-	  this.reader = reader;
-
-	  this.readFunc = function () { return reader.readFromDOM(this$1.originTime > Date.now() - 50 ? this$1.curOrigin : null); };
-	};
-
-	SelectionChangePoller.prototype.poll = function poll (origin) {
-	  this.curOrigin = origin;
-	  this.originTime = Date.now();
-	};
-
-	SelectionChangePoller.prototype.start = function start (andRead) {
-	  if (!this.listening) {
-	    var doc = this.reader.view.dom.ownerDocument;
-	    doc.addEventListener("selectionchange", this.readFunc);
-	    this.listening = true;
-	    if (andRead) { this.readFunc(); }
-	  }
-	};
-
-	SelectionChangePoller.prototype.stop = function stop () {
-	  if (this.listening) {
-	    var doc = this.reader.view.dom.ownerDocument;
-	    doc.removeEventListener("selectionchange", this.readFunc);
-	    this.listening = false;
-	  }
-	};
-
-	// On Browsers that don't support the selectionchange event,
-	// we use timeout-based polling.
-	var TimeoutPoller = function TimeoutPoller(reader) {
-	  // The timeout ID for the poller when active.
-	  this.polling = null;
-	  this.reader = reader;
-	  this.pollFunc = this.doPoll.bind(this, null);
-	};
-
-	TimeoutPoller.prototype.doPoll = function doPoll (origin) {
-	  var view = this.reader.view;
-	  if (view.focused || !view.editable) {
-	    this.reader.readFromDOM(origin);
-	    this.polling = setTimeout(this.pollFunc, 100);
-	  } else {
-	    this.polling = null;
-	  }
-	};
-
-	TimeoutPoller.prototype.poll = function poll (origin) {
-	  clearTimeout(this.polling);
-	  this.polling = setTimeout(origin ? this.doPoll.bind(this, origin) : this.pollFunc, 0);
-	};
-
-	TimeoutPoller.prototype.start = function start () {
-	  if (this.polling == null) { this.poll(); }
-	};
-
-	TimeoutPoller.prototype.stop = function stop () {
-	  clearTimeout(this.polling);
-	  this.polling = null;
-	};
-
-	function poller(reader) {
-	  return new ("onselectionchange" in document ? SelectionChangePoller : TimeoutPoller)(reader)
-	}
-
-	function selectionToDOM(view, takeFocus) {
-	  var sel = view.state.selection;
-	  syncNodeSelection(view, sel);
-
-	  if (view.editable && !view.hasFocus()) {
-	    if (!takeFocus) { return }
-	    // See https://bugzilla.mozilla.org/show_bug.cgi?id=921444
-	    if (result.gecko && result.gecko_version <= 55) {
-	      view.selectionReader.ignoreUpdates = true;
-	      view.dom.focus();
-	      view.selectionReader.ignoreUpdates = false;
-	    }
-	  } else if (!view.editable && !hasSelection(view) && !takeFocus) {
-	    return
-	  }
-
-	  var reader = view.selectionReader;
-	  if (reader.lastSelection && reader.lastSelection.eq(sel) && !reader.domChanged()) { return }
-
-	  reader.ignoreUpdates = true;
-
-	  if (view.cursorWrapper) {
-	    selectCursorWrapper(view);
-	  } else {
-	    var anchor = sel.anchor;
-	    var head = sel.head;
-	    var resetEditableFrom, resetEditableTo;
-	    if (brokenSelectBetweenUneditable && !(sel instanceof dist$2.TextSelection)) {
-	      if (!sel.$from.parent.inlineContent)
-	        { resetEditableFrom = temporarilyEditableNear(view, sel.from); }
-	      if (!sel.empty && !sel.$from.parent.inlineContent)
-	        { resetEditableTo = temporarilyEditableNear(view, sel.to); }
-	    }
-	    view.docView.setSelection(anchor, head, view.root);
-	    if (brokenSelectBetweenUneditable) {
-	      if (resetEditableFrom) { resetEditableFrom.contentEditable = "false"; }
-	      if (resetEditableTo) { resetEditableTo.contentEditable = "false"; }
-	    }
-	    if (sel.visible) {
-	      view.dom.classList.remove("ProseMirror-hideselection");
-	    } else if (anchor != head) {
-	      view.dom.classList.add("ProseMirror-hideselection");
-	      if ("onselectionchange" in document) { removeClassOnSelectionChange(view); }
-	    }
-	  }
-
-	  reader.storeDOMState(sel);
-	  reader.ignoreUpdates = false;
-	}
-
-	// Kludge to work around Webkit not allowing a selection to start/end
-	// between non-editable block nodes. We briefly make something
-	// editable, set the selection, then set it uneditable again.
-
-	var brokenSelectBetweenUneditable = result.safari || result.chrome && result.chrome_version < 63;
-
-	function temporarilyEditableNear(view, pos) {
-	  var ref = view.docView.domFromPos(pos);
-	  var node = ref.node;
-	  var offset = ref.offset;
-	  var after = offset < node.childNodes.length ? node.childNodes[offset] : null;
-	  var before = offset ? node.childNodes[offset - 1] : null;
-	  if ((!after || after.contentEditable == "false") && (!before || before.contentEditable == "false")) {
-	    if (after) {
-	      after.contentEditable = "true";
-	      return after
-	    } else if (before) {
-	      before.contentEditable = "true";
-	      return before
-	    }
-	  }
-	}
-
-	function removeClassOnSelectionChange(view) {
-	  var doc = view.dom.ownerDocument;
-	  doc.removeEventListener("selectionchange", view.hideSelectionGuard);
-	  var domSel = view.root.getSelection();
-	  var node = domSel.anchorNode, offset = domSel.anchorOffset;
-	  doc.addEventListener("selectionchange", view.hideSelectionGuard = function () {
-	    if (domSel.anchorNode != node || domSel.anchorOffset != offset) {
-	      doc.removeEventListener("selectionchange", view.hideSelectionGuard);
-	      view.dom.classList.remove("ProseMirror-hideselection");
-	    }
-	  });
-	}
-
-	function selectCursorWrapper(view) {
-	  var domSel = view.root.getSelection(), range = document.createRange();
-	  var node = view.cursorWrapper.dom;
-	  range.setEnd(node, node.childNodes.length);
-	  range.collapse(false);
-	  domSel.removeAllRanges();
-	  domSel.addRange(range);
-	  // Kludge to kill 'control selection' in IE11 when selecting an
-	  // invisible cursor wrapper, since that would result in those weird
-	  // resize handles and a selection that considers the absolutely
-	  // positioned wrapper, rather than the root editable node, the
-	  // focused element.
-	  if (!view.state.selection.visible && result.ie && result.ie_version <= 11) {
-	    node.disabled = true;
-	    node.disabled = false;
-	  }
-	}
-
-	function syncNodeSelection(view, sel) {
-	  if (sel instanceof dist$2.NodeSelection) {
-	    var desc = view.docView.descAt(sel.from);
-	    if (desc != view.lastSelectedViewDesc) {
-	      clearNodeSelection(view);
-	      if (desc) { desc.selectNode(); }
-	      view.lastSelectedViewDesc = desc;
-	    }
-	  } else {
-	    clearNodeSelection(view);
-	  }
-	}
-
-	// Clear all DOM statefulness of the last node selection.
-	function clearNodeSelection(view) {
-	  if (view.lastSelectedViewDesc) {
-	    view.lastSelectedViewDesc.deselectNode();
-	    view.lastSelectedViewDesc = null;
-	  }
-	}
-
-	function selectionBetween(view, $anchor, $head, bias) {
-	  return view.someProp("createSelectionBetween", function (f) { return f(view, $anchor, $head); })
-	    || dist$2.TextSelection.between($anchor, $head, bias)
-	}
-
-	function hasFocusAndSelection(view) {
-	  if (view.editable && view.root.activeElement != view.dom) { return false }
-	  return hasSelection(view)
-	}
-
-	function hasSelection(view) {
-	  var sel = view.root.getSelection();
-	  if (!sel.anchorNode) { return false }
-	  try {
-	    // Firefox will raise 'permission denied' errors when accessing
-	    // properties of `sel.anchorNode` when it's in a generated CSS
-	    // element.
-	    return view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode)
-	  } catch(_) {
-	    return false
-	  }
-	}
-
-	function nonInclusiveMark(mark) {
-	  return mark.type.spec.inclusive === false
-	}
-
-	function needsCursorWrapper(state) {
-	  var ref = state.selection;
-	  var $head = ref.$head;
-	  var $anchor = ref.$anchor;
-	  var visible = ref.visible;
-	  var $pos = $head.pos == $anchor.pos && (!visible || $head.parent.inlineContent) ? $head : null;
-	  if ($pos && (!visible || state.storedMarks || $pos.parent.content.length == 0 ||
-	               $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.some(nonInclusiveMark)))
-	    { return $pos }
-	  else
-	    { return null }
-	}
-
-	var DOMChange = function DOMChange(view, composing) {
-	  var this$1 = this;
-
-	  this.view = view;
-	  this.state = view.state;
-	  this.composing = composing;
-	  this.from = this.to = null;
-	  this.typeOver = false;
-	  this.timeout = composing ? null : setTimeout(function () { return this$1.finish(); }, DOMChange.commitTimeout);
-	  this.trackMappings = new TrackMappings(view.state);
-
-	  // If there have been changes since this DOM update started, we must
-	  // map our start and end positions, as well as the new selection
-	  // positions, through them. This tracks that mapping.
-	  this.mapping = new dist$1.Mapping;
-	  this.mappingTo = view.state;
-	};
-
-	DOMChange.prototype.addRange = function addRange (from, to) {
-	  if (this.from == null) {
-	    this.from = from;
-	    this.to = to;
-	  } else {
-	    this.from = Math.min(from, this.from);
-	    this.to = Math.max(to, this.to);
-	  }
-	};
-
-	DOMChange.prototype.changedRange = function changedRange () {
-	  if (this.from == null) { return rangeAroundSelection(this.state.selection) }
-	  var $from = this.state.doc.resolve(Math.min(this.from, this.state.selection.from)), $to = this.state.doc.resolve(this.to);
-	  var shared = $from.sharedDepth(this.to);
-	  return {from: $from.before(shared + 1), to: $to.after(shared + 1)}
-	};
-
-	DOMChange.prototype.markDirty = function markDirty (range) {
-	  if (this.from == null) { this.view.docView.markDirty((range = range || this.changedRange()).from, range.to); }
-	  else { this.view.docView.markDirty(this.from, this.to); }
-	};
-
-	DOMChange.prototype.stateUpdated = function stateUpdated (state) {
-	  if (this.trackMappings.getMapping(state, this.mapping)) {
-	    this.trackMappings.destroy();
-	    this.trackMappings = new TrackMappings(state);
-	    this.mappingTo = state;
-	    return true
-	  } else {
-	    this.markDirty();
-	    this.destroy();
-	    return false
-	  }
-	};
-
-	DOMChange.prototype.finish = function finish (force) {
-	  clearTimeout(this.timeout);
-	  if (this.composing && !force) { return }
-	  this.view.domObserver.flush();
-	  var range = this.changedRange();
-	  this.markDirty(range);
-
-	  this.destroy();
-	  var sel = this.state.selection, allowTypeOver = this.typeOver && sel instanceof dist$2.TextSelection &&
-	      !sel.empty && sel.$head.sameParent(sel.$anchor);
-	  readDOMChange(this.view, this.mapping, this.state, range, allowTypeOver);
-
-	  // If the reading didn't result in a view update, force one by
-	  // resetting the view to its current state.
-	  if (this.view.docView.dirty) { this.view.updateState(this.view.state); }
-	};
-
-	DOMChange.prototype.destroy = function destroy () {
-	  clearTimeout(this.timeout);
-	  this.trackMappings.destroy();
-	  this.view.inDOMChange = null;
-	};
-
-	DOMChange.prototype.compositionEnd = function compositionEnd () {
-	    var this$1 = this;
-
-	  if (this.composing) {
-	    this.composing = false;
-	    this.timeout = setTimeout(function () { return this$1.finish(); }, 50);
-	  }
-	};
-
-	DOMChange.start = function start (view, composing) {
-	  if (view.inDOMChange) {
-	    if (composing) {
-	      clearTimeout(view.inDOMChange.timeout);
-	      view.inDOMChange.composing = true;
-	    }
-	  } else {
-	    view.inDOMChange = new DOMChange(view, composing);
-	  }
-	  return view.inDOMChange
-	};
-	DOMChange.commitTimeout = 20;
-
-	// Note that all referencing and parsing is done with the
-	// start-of-operation selection and document, since that's the one
-	// that the DOM represents. If any changes came in in the meantime,
-	// the modification is mapped over those before it is applied, in
-	// readDOMChange.
-
-	function parseBetween(view, oldState, range) {
-	  var ref = view.docView.parseRange(range.from, range.to);
-	  var parent = ref.node;
-	  var fromOffset = ref.fromOffset;
-	  var toOffset = ref.toOffset;
-	  var from = ref.from;
-	  var to = ref.to;
-
-	  var domSel = view.root.getSelection(), find = null, anchor = domSel.anchorNode;
-	  if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {
-	    find = [{node: anchor, offset: domSel.anchorOffset}];
-	    if (!selectionCollapsed(domSel))
-	      { find.push({node: domSel.focusNode, offset: domSel.focusOffset}); }
-	  }
-	  // Work around issue in Chrome where backspacing sometimes replaces
-	  // the deleted content with a random BR node (issues #799, #831)
-	  if (result.chrome && view.lastKeyCode === 8) {
-	    for (var off = toOffset; off > fromOffset; off--) {
-	      var node = parent.childNodes[off - 1], desc = node.pmViewDesc;
-	      if (node.nodeType == "BR" && !desc) { toOffset = off; break }
-	      if (!desc || desc.size) { break }
-	    }
-	  }
-	  var startDoc = oldState.doc;
-	  var parser = view.someProp("domParser") || dist.DOMParser.fromSchema(view.state.schema);
-	  var $from = startDoc.resolve(from);
-	  var sel = null, doc = parser.parse(parent, {
-	    topNode: $from.parent,
-	    topMatch: $from.parent.contentMatchAt($from.index()),
-	    topOpen: true,
-	    from: fromOffset,
-	    to: toOffset,
-	    preserveWhitespace: $from.parent.type.spec.code ? "full" : true,
-	    editableContent: true,
-	    findPositions: find,
-	    ruleFromNode: ruleFromNode(parser, $from),
-	    context: $from
-	  });
-	  if (find && find[0].pos != null) {
-	    var anchor$1 = find[0].pos, head = find[1] && find[1].pos;
-	    if (head == null) { head = anchor$1; }
-	    sel = {anchor: anchor$1 + from, head: head + from};
-	  }
-	  return {doc: doc, sel: sel, from: from, to: to}
-	}
-
-	function ruleFromNode(parser, context) {
-	  return function (dom) {
-	    var desc = dom.pmViewDesc;
-	    if (desc) {
-	      return desc.parseRule()
-	    } else if (dom.nodeName == "BR" && dom.parentNode) {
-	      // Safari replaces the list item with a BR directly in the list node (?!) if you delete the last character in a list item (#708)
-	      if (result.safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName))
-	        { return parser.matchTag(document.createElement("li"), context) }
-	      else if (dom.parentNode.lastChild == dom)
-	        { return {ignore: true} }
-	    }
-	  }
-	}
-
-	function isAtEnd($pos, depth) {
-	  for (var i = depth || 0; i < $pos.depth; i++)
-	    { if ($pos.index(i) + 1 < $pos.node(i).childCount) { return false } }
-	  return $pos.parentOffset == $pos.parent.content.size
-	}
-	function isAtStart($pos, depth) {
-	  for (var i = depth || 0; i < $pos.depth; i++)
-	    { if ($pos.index(0) > 0) { return false } }
-	  return $pos.parentOffset == 0
-	}
-
-	function rangeAroundSelection(selection) {
-	  // Intentionally uses $head/$anchor because those will correspond to the DOM selection
-	  var $from = selection.$anchor.min(selection.$head), $to = selection.$anchor.max(selection.$head);
-
-	  if ($from.sameParent($to) && $from.parent.inlineContent && $from.parentOffset && $to.parentOffset < $to.parent.content.size) {
-	    var startOff = Math.max(0, $from.parentOffset);
-	    var size = $from.parent.content.size;
-	    var endOff = Math.min(size, $to.parentOffset);
-
-	    if (startOff > 0)
-	      { startOff = $from.parent.childBefore(startOff).offset; }
-	    if (endOff < size) {
-	      var after = $from.parent.childAfter(endOff);
-	      endOff = after.offset + after.node.nodeSize;
-	    }
-	    var nodeStart = $from.start();
-	    return {from: nodeStart + startOff, to: nodeStart + endOff}
-	  } else {
-	    for (var depth = 0;; depth++) {
-	      var fromStart = isAtStart($from, depth + 1), toEnd = isAtEnd($to, depth + 1);
-	      if (fromStart || toEnd || $from.index(depth) != $to.index(depth) || $to.node(depth).isTextblock) {
-	        var from = $from.before(depth + 1), to = $to.after(depth + 1);
-	        if (fromStart && $from.index(depth) > 0)
-	          { from -= $from.node(depth).child($from.index(depth) - 1).nodeSize; }
-	        if (toEnd && $to.index(depth) + 1 < $to.node(depth).childCount)
-	          { to += $to.node(depth).child($to.index(depth) + 1).nodeSize; }
-	        return {from: from, to: to}
-	      }
-	    }
-	  }
-	}
-
-	function keyEvent(keyCode, key) {
-	  var event = document.createEvent("Event");
-	  event.initEvent("keydown", true, true);
-	  event.keyCode = keyCode;
-	  event.key = event.code = key;
-	  return event
-	}
-
-	function readDOMChange(view, mapping, oldState, range, allowTypeOver) {
-	  var parse = parseBetween(view, oldState, range);
-
-	  var doc = oldState.doc, compare = doc.slice(parse.from, parse.to);
-	  var preferredPos, preferredSide;
-	  // Prefer anchoring to end when Backspace is pressed
-	  if (view.lastKeyCode === 8 && Date.now() - 100 < view.lastKeyCodeTime) {
-	    preferredPos = oldState.selection.to;
-	    preferredSide = "end";
-	  } else {
-	    preferredPos = oldState.selection.from;
-	    preferredSide = "start";
-	  }
-	  view.lastKeyCode = null;
-
-	  var change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);
-	  if (!change) {
-	    if (allowTypeOver) {
-	      var state = view.state, sel = state.selection;
-	      view.dispatch(state.tr.replaceSelectionWith(state.schema.text(state.doc.textBetween(sel.from, sel.to)), true).scrollIntoView());
-	    } else if (parse.sel) {
-	      var sel$1 = resolveSelection(view, view.state.doc, mapping, parse.sel);
-	      if (sel$1 && !sel$1.eq(view.state.selection)) { view.dispatch(view.state.tr.setSelection(sel$1)); }
-	    }
-	    return
-	  }
-
-	  var $from = parse.doc.resolveNoCache(change.start - parse.from);
-	  var $to = parse.doc.resolveNoCache(change.endB - parse.from);
-	  var nextSel;
-	  // If this looks like the effect of pressing Enter, just dispatch an
-	  // Enter key instead.
-	  if (!$from.sameParent($to) && $from.pos < parse.doc.content.size &&
-	      (nextSel = dist$2.Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&
-	      nextSel.head == $to.pos &&
-	      view.someProp("handleKeyDown", function (f) { return f(view, keyEvent(13, "Enter")); }))
-	    { return }
-	  // Same for backspace
-	  if (oldState.selection.anchor > change.start &&
-	      looksLikeJoin(doc, change.start, change.endA, $from, $to) &&
-	      view.someProp("handleKeyDown", function (f) { return f(view, keyEvent(8, "Backspace")); })) {
-	    if (result.android && result.chrome) { // #820
-	      view.selectionReader.suppressUpdates = true;
-	      setTimeout(function () { return view.selectionReader.suppressUpdates = false; }, 50);
-	    }
-	    return
-	  }
-
-	  var from = mapping.map(change.start), to = mapping.map(change.endA, -1);
-
-	  var tr, storedMarks, markChange, $from1;
-	  if ($from.sameParent($to) && $from.parent.inlineContent) {
-	    if ($from.pos == $to.pos) { // Deletion
-	      tr = view.state.tr.delete(from, to);
-	      storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));
-	    } else if ( // Adding or removing a mark
-	      change.endA == change.endB && ($from1 = doc.resolve(change.start)) &&
-	      (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset),
-	                                 $from1.parent.content.cut($from1.parentOffset, change.endA - $from1.start())))
-	    ) {
-	      tr = view.state.tr;
-	      if (markChange.type == "add") { tr.addMark(from, to, markChange.mark); }
-	      else { tr.removeMark(from, to, markChange.mark); }
-	    } else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {
-	      // Both positions in the same text node -- simply insert text
-	      var text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);
-	      if (view.someProp("handleTextInput", function (f) { return f(view, from, to, text); })) { return }
-	      tr = view.state.tr.insertText(text, from, to);
-	    }
-	  }
-
-	  if (!tr)
-	    { tr = view.state.tr.replace(from, to, parse.doc.slice(change.start - parse.from, change.endB - parse.from)); }
-	  if (parse.sel) {
-	    var sel$2 = resolveSelection(view, tr.doc, mapping, parse.sel);
-	    if (sel$2) { tr.setSelection(sel$2); }
-	  }
-	  if (storedMarks) { tr.ensureMarks(storedMarks); }
-	  view.dispatch(tr.scrollIntoView());
-	}
-
-	function resolveSelection(view, doc, mapping, parsedSel) {
-	  if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size) { return null }
-	  return selectionBetween(view, doc.resolve(mapping.map(parsedSel.anchor)),
-	                          doc.resolve(mapping.map(parsedSel.head)))
-	}
-
-	// : (Fragment, Fragment) → ?{mark: Mark, type: string}
-	// Given two same-length, non-empty fragments of inline content,
-	// determine whether the first could be created from the second by
-	// removing or adding a single mark type.
-	function isMarkChange(cur, prev) {
-	  var curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks;
-	  var added = curMarks, removed = prevMarks, type, mark, update;
-	  for (var i = 0; i < prevMarks.length; i++) { added = prevMarks[i].removeFromSet(added); }
-	  for (var i$1 = 0; i$1 < curMarks.length; i$1++) { removed = curMarks[i$1].removeFromSet(removed); }
-	  if (added.length == 1 && removed.length == 0) {
-	    mark = added[0];
-	    type = "add";
-	    update = function (node) { return node.mark(mark.addToSet(node.marks)); };
-	  } else if (added.length == 0 && removed.length == 1) {
-	    mark = removed[0];
-	    type = "remove";
-	    update = function (node) { return node.mark(mark.removeFromSet(node.marks)); };
-	  } else {
-	    return null
-	  }
-	  var updated = [];
-	  for (var i$2 = 0; i$2 < prev.childCount; i$2++) { updated.push(update(prev.child(i$2))); }
-	  if (dist.Fragment.from(updated).eq(cur)) { return {mark: mark, type: type} }
-	}
-
-	function looksLikeJoin(old, start, end, $newStart, $newEnd) {
-	  if (!$newStart.parent.isTextblock ||
-	      // The content must have shrunk
-	      end - start <= $newEnd.pos - $newStart.pos ||
-	      // newEnd must point directly at or after the end of the block that newStart points into
-	      skipClosingAndOpening($newStart, true, false) < $newEnd.pos)
-	    { return false }
-
-	  var $start = old.resolve(start);
-	  // Start must be at the end of a block
-	  if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock)
-	    { return false }
-	  var $next = old.resolve(skipClosingAndOpening($start, true, true));
-	  // The next textblock must start before end and end near it
-	  if (!$next.parent.isTextblock || $next.pos > end ||
-	      skipClosingAndOpening($next, true, false) < end)
-	    { return false }
-
-	  // The fragments after the join point must match
-	  return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content)
-	}
-
-	function skipClosingAndOpening($pos, fromEnd, mayOpen) {
-	  var depth = $pos.depth, end = fromEnd ? $pos.end() : $pos.pos;
-	  while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {
-	    depth--;
-	    end++;
-	    fromEnd = false;
-	  }
-	  if (mayOpen) {
-	    var next = $pos.node(depth).maybeChild($pos.indexAfter(depth));
-	    while (next && !next.isLeaf) {
-	      next = next.firstChild;
-	      end++;
-	    }
-	  }
-	  return end
-	}
-
-	function findDiff(a, b, pos, preferredPos, preferredSide) {
-	  var start = a.findDiffStart(b, pos);
-	  if (start == null) { return null }
-	  var ref = a.findDiffEnd(b, pos + a.size, pos + b.size);
-	  var endA = ref.a;
-	  var endB = ref.b;
-	  if (preferredSide == "end") {
-	    var adjust = Math.max(0, start - Math.min(endA, endB));
-	    preferredPos -= endA + adjust - start;
-	  }
-	  if (endA < start && a.size < b.size) {
-	    var move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0;
-	    start -= move;
-	    endB = start + (endB - endA);
-	    endA = start;
-	  } else if (endB < start) {
-	    var move$1 = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;
-	    start -= move$1;
-	    endA = start + (endA - endB);
-	    endB = start;
-	  }
-	  return {start: start, endA: endA, endB: endB}
-	}
-
-	function serializeForClipboard(view, slice) {
-	  var context = [];
-	  var content = slice.content;
-	  var openStart = slice.openStart;
-	  var openEnd = slice.openEnd;
-	  while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {
-	    openStart--;
-	    openEnd--;
-	    var node = content.firstChild;
-	    context.push(node.type.name, node.type.hasRequiredAttrs() ? node.attrs : null);
-	    content = node.content;
-	  }
-
-	  var serializer = view.someProp("clipboardSerializer") || dist.DOMSerializer.fromSchema(view.state.schema);
-	  var wrap = document.createElement("div");
-	  wrap.appendChild(serializer.serializeFragment(content));
-
-	  var firstChild = wrap.firstChild, needsWrap;
-	  while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {
-	    for (var i = needsWrap.length - 1; i >= 0; i--) {
-	      var wrapper = document.createElement(needsWrap[i]);
-	      while (wrap.firstChild) { wrapper.appendChild(wrap.firstChild); }
-	      wrap.appendChild(wrapper);
-	    }
-	    firstChild = wrap.firstChild;
-	  }
-
-	  if (firstChild && firstChild.nodeType == 1)
-	    { firstChild.setAttribute("data-pm-slice", (openStart + " " + openEnd + " " + (JSON.stringify(context)))); }
-
-	  var text = view.someProp("clipboardTextSerializer", function (f) { return f(slice); }) ||
-	      slice.content.textBetween(0, slice.content.size, "\n\n");
-
-	  return {dom: wrap, text: text}
-	}
-
-	// : (EditorView, string, string, ?bool, ResolvedPos) → ?Slice
-	// Read a slice of content from the clipboard (or drop data).
-	function parseFromClipboard(view, text, html, plainText, $context) {
-	  var dom, inCode = $context.parent.type.spec.code, slice;
-	  if (!html && !text) { return null }
-	  if ((plainText || inCode || !html) && text) {
-	    view.someProp("transformPastedText", function (f) { text = f(text); });
-	    if (inCode) { return new dist.Slice(dist.Fragment.from(view.state.schema.text(text)), 0, 0) }
-	    var parsed = view.someProp("clipboardTextParser", function (f) { return f(text, $context); });
-	    if (parsed) {
-	      slice = parsed;
-	    } else {
-	      dom = document.createElement("div");
-	      text.trim().split(/(?:\r\n?|\n)+/).forEach(function (block) {
-	        dom.appendChild(document.createElement("p")).textContent = block;
-	      });
-	    }
-	  } else {
-	    view.someProp("transformPastedHTML", function (f) { return html = f(html); });
-	    dom = readHTML(html);
-	  }
-
-	  if (!slice) {
-	    var parser = view.someProp("clipboardParser") || view.someProp("domParser") || dist.DOMParser.fromSchema(view.state.schema);
-	    slice = parser.parseSlice(dom, {preserveWhitespace: true, context: $context});
-	  }
-	  var contextNode = dom && dom.querySelector("[data-pm-slice]");
-	  var sliceData = contextNode && /^(\d+) (\d+) (.*)/.exec(contextNode.getAttribute("data-pm-slice"));
-	  if (sliceData)
-	    { slice = addContext(new dist.Slice(slice.content, Math.min(slice.openStart, +sliceData[1]),
-	                                 Math.min(slice.openEnd, +sliceData[2])), sliceData[3]); }
-	  else // HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent
-	    { slice = dist.Slice.maxOpen(normalizeSiblings(slice.content, $context), false); }
-	  view.someProp("transformPasted", function (f) { slice = f(slice); });
-	  return slice
-	}
-
-	// Takes a slice parsed with parseSlice, which means there hasn't been
-	// any content-expression checking done on the top nodes, tries to
-	// find a parent node in the current context that might fit the nodes,
-	// and if successful, rebuilds the slice so that it fits into that parent.
-	//
-	// This addresses the problem that Transform.replace expects a
-	// coherent slice, and will fail to place a set of siblings that don't
-	// fit anywhere in the schema.
-	function normalizeSiblings(fragment, $context) {
-	  if (fragment.childCount < 2) { return fragment }
-	  var loop = function ( d ) {
-	    var parent = $context.node(d);
-	    var match = parent.contentMatchAt($context.index(d));
-	    var lastWrap = (void 0), result = [];
-	    fragment.forEach(function (node) {
-	      if (!result) { return }
-	      var wrap = match.findWrapping(node.type), inLast;
-	      if (!wrap) { return result = null }
-	      if (inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0)) {
-	        result[result.length - 1] = inLast;
-	      } else {
-	        if (result.length) { result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length); }
-	        var wrapped = withWrappers(node, wrap);
-	        result.push(wrapped);
-	        match = match.matchType(wrapped.type, wrapped.attrs);
-	        lastWrap = wrap;
-	      }
-	    });
-	    if (result) { return { v: dist.Fragment.from(result) } }
-	  };
-
-	  for (var d = $context.depth; d >= 0; d--) {
-	    var returned = loop( d );
-
-	    if ( returned ) { return returned.v; }
-	  }
-	  return fragment
-	}
-
-	function withWrappers(node, wrap, from) {
-	  if ( from === void 0 ) { from = 0; }
-
-	  for (var i = wrap.length - 1; i >= from; i--)
-	    { node = wrap[i].create(null, dist.Fragment.from(node)); }
-	  return node
-	}
-
-	// Used to group adjacent nodes wrapped in similar parents by
-	// normalizeSiblings into the same parent node
-	function addToSibling(wrap, lastWrap, node, sibling, depth) {
-	  if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {
-	    var inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);
-	    if (inner) { return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner)) }
-	    var match = sibling.contentMatchAt(sibling.childCount);
-	    if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1]))
-	      { return sibling.copy(sibling.content.append(dist.Fragment.from(withWrappers(node, wrap, depth + 1)))) }
-	  }
-	}
-
-	function closeRight(node, depth) {
-	  if (depth == 0) { return node }
-	  var fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));
-	  var fill = node.contentMatchAt(node.childCount).fillBefore(dist.Fragment.empty, true);
-	  return node.copy(fragment.append(fill))
-	}
-
-	// Trick from jQuery -- some elements must be wrapped in other
-	// elements for innerHTML to work. I.e. if you do `div.innerHTML =
-	// "<td>..</td>"` the table cells are ignored.
-	var wrapMap = {thead: ["table"], colgroup: ["table"], col: ["table", "colgroup"],
-	                 tr: ["table", "tbody"], td: ["table", "tbody", "tr"], th: ["table", "tbody", "tr"]};
-	var detachedDoc = null;
-	function readHTML(html) {
-	  var metas = /(\s*<meta [^>]*>)*/.exec(html);
-	  if (metas) { html = html.slice(metas[0].length); }
-	  var doc = detachedDoc || (detachedDoc = document.implementation.createHTMLDocument("title"));
-	  var elt = doc.createElement("div");
-	  var firstTag = /(?:<meta [^>]*>)*<([a-z][^>\s]+)/i.exec(html), wrap, depth = 0;
-	  if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()]) {
-	    html = wrap.map(function (n) { return "<" + n + ">"; }).join("") + html + wrap.map(function (n) { return "</" + n + ">"; }).reverse().join("");
-	    depth = wrap.length;
-	  }
-	  elt.innerHTML = html;
-	  for (var i = 0; i < depth; i++) { elt = elt.firstChild; }
-	  return elt
-	}
-
-	function addContext(slice, context) {
-	  if (!slice.size) { return slice }
-	  var schema = slice.content.firstChild.type.schema, array;
-	  try { array = JSON.parse(context); }
-	  catch(e) { return slice }
-	  var content = slice.content;
-	  var openStart = slice.openStart;
-	  var openEnd = slice.openEnd;
-	  for (var i = array.length - 2; i >= 0; i -= 2) {
-	    var type = schema.nodes[array[i]];
-	    if (!type || type.hasRequiredAttrs()) { break }
-	    content = dist.Fragment.from(type.create(array[i + 1], content));
-	    openStart++; openEnd++;
-	  }
-	  return new dist.Slice(content, openStart, openEnd)
-	}
-
-	var observeOptions = {childList: true, characterData: true, attributes: true, subtree: true, characterDataOldValue: true};
-	// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified
-	var useCharData = result.ie && result.ie_version <= 11;
-
-	var DOMObserver = function DOMObserver(view) {
-	  var this$1 = this;
-
-	  this.view = view;
-	  this.observer = window.MutationObserver &&
-	    new window.MutationObserver(function (mutations) { return this$1.registerMutations(mutations); });
-	  if (useCharData)
-	    { this.onCharData = function (e) { return this$1.registerMutation({target: e.target, type: "characterData", oldValue: e.prevValue}); }; }
-	};
-
-	DOMObserver.prototype.start = function start () {
-	  if (this.observer)
-	    { this.observer.observe(this.view.dom, observeOptions); }
-	  if (useCharData)
-	    { this.view.dom.addEventListener("DOMCharacterDataModified", this.onCharData); }
-	};
-
-	DOMObserver.prototype.stop = function stop () {
-	  if (this.observer) {
-	    this.flush();
-	    this.observer.disconnect();
-	  }
-	  if (useCharData)
-	    { this.view.dom.removeEventListener("DOMCharacterDataModified", this.onCharData); }
-	};
-
-	DOMObserver.prototype.flush = function flush () {
-	  if (this.observer)
-	    { this.registerMutations(this.observer.takeRecords()); }
-	};
-
-	DOMObserver.prototype.registerMutations = function registerMutations (mutations) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < mutations.length; i++)
-	    { this$1.registerMutation(mutations[i]); }
-	};
-
-	DOMObserver.prototype.registerMutation = function registerMutation (mut) {
-	  if (!this.view.editable) { return }
-	  var desc = this.view.docView.nearestDesc(mut.target);
-	  if (mut.type == "attributes" &&
-	      (desc == this.view.docView || mut.attributeName == "contenteditable")) { return }
-	  if (!desc || desc.ignoreMutation(mut)) { return }
-
-	  var from, to;
-	  if (mut.type == "childList") {
-	    var fromOffset = mut.previousSibling && mut.previousSibling.parentNode == mut.target
-	        ? domIndex(mut.previousSibling) + 1 : 0;
-	    if (fromOffset == -1) { return }
-	    from = desc.localPosFromDOM(mut.target, fromOffset, -1);
-	    var toOffset = mut.nextSibling && mut.nextSibling.parentNode == mut.target
-	        ? domIndex(mut.nextSibling) : mut.target.childNodes.length;
-	    if (toOffset == -1) { return }
-	    to = desc.localPosFromDOM(mut.target, toOffset, 1);
-	  } else if (mut.type == "attributes") {
-	    from = desc.posAtStart - desc.border;
-	    to = desc.posAtEnd + desc.border;
-	  } else { // "characterData"
-	    from = desc.posAtStart;
-	    to = desc.posAtEnd;
-	    // An event was generated for a text change that didn't change
-	    // any text. Mark the dom change to fall back to assuming the
-	    // selection was typed over with an identical value if it can't
-	    // find another change.
-	    if (mut.target.nodeValue == mut.oldValue) { DOMChange.start(this.view).typeOver = true; }
-	  }
-
-	  DOMChange.start(this.view).addRange(from, to);
-	};
-
-	// A collection of DOM events that occur within the editor, and callback functions
-	// to invoke when the event fires.
-	var handlers = {};
-	var editHandlers = {};
-
-	function initInput(view) {
-	  view.shiftKey = false;
-	  view.mouseDown = null;
-	  view.inDOMChange = null;
-	  view.lastKeyCode = null;
-	  view.lastKeyCodeTime = 0;
-	  view.domObserver = new DOMObserver(view);
-	  view.domObserver.start();
-
-	  view.eventHandlers = Object.create(null);
-	  var loop = function ( event ) {
-	    var handler = handlers[event];
-	    view.dom.addEventListener(event, view.eventHandlers[event] = function (event) {
-	      if (eventBelongsToView(view, event) && !runCustomHandler(view, event) &&
-	          (view.editable || !(event.type in editHandlers)))
-	        { handler(view, event); }
-	    });
-	  };
-
-	  for (var event in handlers) { loop( event ); }
-	  ensureListeners(view);
-	}
-
-	function destroyInput(view) {
-	  view.domObserver.stop();
-	  if (view.inDOMChange) { view.inDOMChange.destroy(); }
-	  for (var type in view.eventHandlers)
-	    { view.dom.removeEventListener(type, view.eventHandlers[type]); }
-	}
-
-	function ensureListeners(view) {
-	  view.someProp("handleDOMEvents", function (currentHandlers) {
-	    for (var type in currentHandlers) { if (!view.eventHandlers[type])
-	      { view.dom.addEventListener(type, view.eventHandlers[type] = function (event) { return runCustomHandler(view, event); }); } }
-	  });
-	}
-
-	function runCustomHandler(view, event) {
-	  return view.someProp("handleDOMEvents", function (handlers) {
-	    var handler = handlers[event.type];
-	    return handler ? handler(view, event) || event.defaultPrevented : false
-	  })
-	}
-
-	function eventBelongsToView(view, event) {
-	  if (!event.bubbles) { return true }
-	  if (event.defaultPrevented) { return false }
-	  for (var node = event.target; node != view.dom; node = node.parentNode)
-	    { if (!node || node.nodeType == 11 ||
-	        (node.pmViewDesc && node.pmViewDesc.stopEvent(event)))
-	      { return false } }
-	  return true
-	}
-
-	function dispatchEvent(view, event) {
-	  if (!runCustomHandler(view, event) && handlers[event.type] &&
-	      (view.editable || !(event.type in editHandlers)))
-	    { handlers[event.type](view, event); }
-	}
-
-	editHandlers.keydown = function (view, event) {
-	  view.shiftKey = event.keyCode == 16 || event.shiftKey;
-	  if (view.inDOMChange) {
-	    if (view.inDOMChange.composing) { return }
-	    view.inDOMChange.finish();
-	  }
-	  view.lastKeyCode = event.keyCode;
-	  view.lastKeyCodeTime = Date.now();
-	  if (view.someProp("handleKeyDown", function (f) { return f(view, event); }) || captureKeyDown(view, event))
-	    { event.preventDefault(); }
-	  else
-	    { view.selectionReader.poll(); }
-	};
-
-	editHandlers.keyup = function (view, e) {
-	  if (e.keyCode == 16) { view.shiftKey = false; }
-	};
-
-	editHandlers.keypress = function (view, event) {
-	  if (view.inDOMChange || !event.charCode ||
-	      event.ctrlKey && !event.altKey || result.mac && event.metaKey) { return }
-
-	  if (view.someProp("handleKeyPress", function (f) { return f(view, event); })) {
-	    event.preventDefault();
-	    return
-	  }
-
-	  var sel = view.state.selection;
-	  if (!(sel instanceof dist$2.TextSelection) || !sel.$from.sameParent(sel.$to)) {
-	    var text = String.fromCharCode(event.charCode);
-	    if (!view.someProp("handleTextInput", function (f) { return f(view, sel.$from.pos, sel.$to.pos, text); }))
-	      { view.dispatch(view.state.tr.insertText(text).scrollIntoView()); }
-	    event.preventDefault();
-	  }
-	};
-
-	function eventCoords(event) { return {left: event.clientX, top: event.clientY} }
-
-	var lastClick = {time: 0, x: 0, y: 0};
-	var oneButLastClick = lastClick;
-
-	function isNear(event, click) {
-	  var dx = click.x - event.clientX, dy = click.y - event.clientY;
-	  return dx * dx + dy * dy < 100
-	}
-
-	function runHandlerOnContext(view, propName, pos, inside, event) {
-	  if (inside == -1) { return false }
-	  var $pos = view.state.doc.resolve(inside);
-	  var loop = function ( i ) {
-	    if (view.someProp(propName, function (f) { return i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true)
-	                                                    : f(view, pos, $pos.node(i), $pos.before(i), event, false); }))
-	      { return { v: true } }
-	  };
-
-	  for (var i = $pos.depth + 1; i > 0; i--) {
-	    var returned = loop( i );
-
-	    if ( returned ) { return returned.v; }
-	  }
-	  return false
-	}
-
-	function updateSelection(view, selection, origin) {
-	  if (!view.focused) { view.focus(); }
-	  var tr = view.state.tr.setSelection(selection);
-	  if (origin == "pointer") { tr.setMeta("pointer", true); }
-	  view.dispatch(tr);
-	}
-
-	function selectClickedLeaf(view, inside) {
-	  if (inside == -1) { return false }
-	  var $pos = view.state.doc.resolve(inside), node = $pos.nodeAfter;
-	  if (node && node.isAtom && dist$2.NodeSelection.isSelectable(node)) {
-	    updateSelection(view, new dist$2.NodeSelection($pos), "pointer");
-	    return true
-	  }
-	  return false
-	}
-
-	function selectClickedNode(view, inside) {
-	  if (inside == -1) { return false }
-	  var sel = view.state.selection, selectedNode, selectAt;
-	  if (sel instanceof dist$2.NodeSelection) { selectedNode = sel.node; }
-
-	  var $pos = view.state.doc.resolve(inside);
-	  for (var i = $pos.depth + 1; i > 0; i--) {
-	    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
-	    if (dist$2.NodeSelection.isSelectable(node)) {
-	      if (selectedNode && sel.$from.depth > 0 &&
-	          i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos)
-	        { selectAt = $pos.before(sel.$from.depth); }
-	      else
-	        { selectAt = $pos.before(i); }
-	      break
-	    }
-	  }
-
-	  if (selectAt != null) {
-	    updateSelection(view, dist$2.NodeSelection.create(view.state.doc, selectAt), "pointer");
-	    return true
-	  } else {
-	    return false
-	  }
-	}
-
-	function handleSingleClick(view, pos, inside, event, selectNode) {
-	  return runHandlerOnContext(view, "handleClickOn", pos, inside, event) ||
-	    view.someProp("handleClick", function (f) { return f(view, pos, event); }) ||
-	    (selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside))
-	}
-
-	function handleDoubleClick(view, pos, inside, event) {
-	  return runHandlerOnContext(view, "handleDoubleClickOn", pos, inside, event) ||
-	    view.someProp("handleDoubleClick", function (f) { return f(view, pos, event); })
-	}
-
-	function handleTripleClick(view, pos, inside, event) {
-	  return runHandlerOnContext(view, "handleTripleClickOn", pos, inside, event) ||
-	    view.someProp("handleTripleClick", function (f) { return f(view, pos, event); }) ||
-	    defaultTripleClick(view, inside)
-	}
-
-	function defaultTripleClick(view, inside) {
-	  var doc = view.state.doc;
-	  if (inside == -1) {
-	    if (doc.inlineContent) {
-	      updateSelection(view, dist$2.TextSelection.create(doc, 0, doc.content.size), "pointer");
-	      return true
-	    }
-	    return false
-	  }
-
-	  var $pos = doc.resolve(inside);
-	  for (var i = $pos.depth + 1; i > 0; i--) {
-	    var node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
-	    var nodePos = $pos.before(i);
-	    if (node.inlineContent)
-	      { updateSelection(view, dist$2.TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size), "pointer"); }
-	    else if (dist$2.NodeSelection.isSelectable(node))
-	      { updateSelection(view, dist$2.NodeSelection.create(doc, nodePos), "pointer"); }
-	    else
-	      { continue }
-	    return true
-	  }
-	}
-
-	function forceDOMFlush(view) {
-	  if (!view.inDOMChange) { return false }
-	  view.inDOMChange.finish(true);
-	  return true
-	}
-
-	var selectNodeModifier = result.mac ? "metaKey" : "ctrlKey";
-
-	handlers.mousedown = function (view, event) {
-	  view.shiftKey = event.shiftKey;
-	  var flushed = forceDOMFlush(view);
-	  var now = Date.now(), type;
-	  if (now - lastClick.time >= 500 || !isNear(event, lastClick) || event[selectNodeModifier]) { type = "singleClick"; }
-	  else if (now - oneButLastClick.time >= 600 || !isNear(event, oneButLastClick)) { type = "doubleClick"; }
-	  else { type = "tripleClick"; }
-	  oneButLastClick = lastClick;
-	  lastClick = {time: now, x: event.clientX, y: event.clientY};
-
-	  var pos = view.posAtCoords(eventCoords(event));
-	  if (!pos) { return }
-
-	  if (type == "singleClick")
-	    { view.mouseDown = new MouseDown(view, pos, event, flushed); }
-	  else if ((type == "doubleClick" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event))
-	    { event.preventDefault(); }
-	  else
-	    { view.selectionReader.poll("pointer"); }
-	};
-
-	var MouseDown = function MouseDown(view, pos, event, flushed) {
-	  var this$1 = this;
-
-	  this.view = view;
-	  this.pos = pos;
-	  this.event = event;
-	  this.flushed = flushed;
-	  this.selectNode = event[selectNodeModifier];
-	  this.allowDefault = event.shiftKey;
-
-	  var targetNode, targetPos;
-	  if (pos.inside > -1) {
-	    targetNode = view.state.doc.nodeAt(pos.inside);
-	    targetPos = pos.inside;
-	  } else {
-	    var $pos = view.state.doc.resolve(pos.pos);
-	    targetNode = $pos.parent;
-	    targetPos = $pos.depth ? $pos.before() : 0;
-	  }
-
-	  this.mightDrag = null;
-	  this.target = flushed ? null : event.target;
-	  if (targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||
-	      view.state.selection instanceof dist$2.NodeSelection && targetPos == view.state.selection.from)
-	    { this.mightDrag = {node: targetNode,
-	                      pos: targetPos,
-	                      addAttr: this.target && !this.target.draggable,
-	                      setUneditable: this.target && result.gecko && !this.target.hasAttribute("contentEditable")}; }
-
-	  if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {
-	    this.view.domObserver.stop();
-	    if (this.mightDrag.addAttr) { this.target.draggable = true; }
-	    if (this.mightDrag.setUneditable)
-	      { setTimeout(function () { return this$1.target.setAttribute("contentEditable", "false"); }, 20); }
-	    this.view.domObserver.start();
-	  }
-
-	  view.root.addEventListener("mouseup", this.up = this.up.bind(this));
-	  view.root.addEventListener("mousemove", this.move = this.move.bind(this));
-	  view.selectionReader.poll("pointer");
-	};
-
-	MouseDown.prototype.done = function done () {
-	  this.view.root.removeEventListener("mouseup", this.up);
-	  this.view.root.removeEventListener("mousemove", this.move);
-	  if (this.mightDrag && this.target) {
-	    this.view.domObserver.stop();
-	    if (this.mightDrag.addAttr) { this.target.draggable = false; }
-	    if (this.mightDrag.setUneditable) { this.target.removeAttribute("contentEditable"); }
-	    this.view.domObserver.start();
-	  }
-	  this.view.mouseDown = null;
-	};
-
-	MouseDown.prototype.up = function up (event) {
-	  this.done();
-
-	  if (!this.view.dom.contains(event.target.nodeType == 3 ? event.target.parentNode : event.target))
-	    { return }
-
-	  if (this.allowDefault) {
-	    // Force a cursor wrapper redraw if this was suppressed (to avoid an issue with IE drag-selection)
-	    if (result.ie && needsCursorWrapper(this.view.state)) { this.view.updateState(this.view.state); }
-	    this.view.selectionReader.poll("pointer");
-	  } else if (handleSingleClick(this.view, this.pos.pos, this.pos.inside, event, this.selectNode)) {
-	    event.preventDefault();
-	  } else if (this.flushed) {
-	    updateSelection(this.view, dist$2.Selection.near(this.view.state.doc.resolve(this.pos.pos)), "pointer");
-	    event.preventDefault();
-	  } else {
-	    this.view.selectionReader.poll("pointer");
-	  }
-	};
-
-	MouseDown.prototype.move = function move (event) {
-	  if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 ||
-	                             Math.abs(this.event.y - event.clientY) > 4))
-	    { this.allowDefault = true; }
-	  this.view.selectionReader.poll("pointer");
-	};
-
-	handlers.touchdown = function (view) {
-	  forceDOMFlush(view);
-	  view.selectionReader.poll("pointer");
-	};
-
-	handlers.contextmenu = function (view) { return forceDOMFlush(view); };
-
-	// Input compositions are hard. Mostly because the events fired by
-	// browsers are A) very unpredictable and inconsistent, and B) not
-	// cancelable.
-	//
-	// ProseMirror has the problem that it must not update the DOM during
-	// a composition, or the browser will cancel it. What it does is keep
-	// long-running operations (delayed DOM updates) when a composition is
-	// active.
-	//
-	// We _do not_ trust the information in the composition events which,
-	// apart from being very uninformative to begin with, is often just
-	// plain wrong. Instead, when a composition ends, we parse the dom
-	// around the original selection, and derive an update from that.
-
-	editHandlers.compositionstart = editHandlers.compositionupdate = function (view) {
-	  DOMChange.start(view, true);
-	};
-
-	editHandlers.compositionend = function (view, e) {
-	  if (!view.inDOMChange) {
-	    // We received a compositionend without having seen any previous
-	    // events for the composition. If there's data in the event
-	    // object, we assume that it's a real change, and start a
-	    // composition. Otherwise, we just ignore it.
-	    if (e.data) { DOMChange.start(view, true); }
-	    else { return }
-	  }
-
-	  view.inDOMChange.compositionEnd();
-	};
-
-	editHandlers.input = function (view) {
-	  var change = DOMChange.start(view);
-	  if (!change.composing) { change.finish(); }
-	};
-
-	function captureCopy(view, dom) {
-	  // The extra wrapper is somehow necessary on IE/Edge to prevent the
-	  // content from being mangled when it is put onto the clipboard
-	  var doc = dom.ownerDocument;
-	  var wrap = doc.body.appendChild(doc.createElement("div"));
-	  wrap.appendChild(dom);
-	  wrap.style.cssText = "position: fixed; left: -10000px; top: 10px";
-	  var sel = getSelection(), range = doc.createRange();
-	  range.selectNodeContents(dom);
-	  // Done because IE will fire a selectionchange moving the selection
-	  // to its start when removeAllRanges is called and the editor still
-	  // has focus (which will mess up the editor's selection state).
-	  view.dom.blur();
-	  sel.removeAllRanges();
-	  sel.addRange(range);
-	  setTimeout(function () {
-	    doc.body.removeChild(wrap);
-	    view.focus();
-	  }, 50);
-	}
-
-	// This is very crude, but unfortunately both these browsers _pretend_
-	// that they have a clipboard API—all the objects and methods are
-	// there, they just don't work, and they are hard to test.
-	var brokenClipboardAPI = (result.ie && result.ie_version < 15) ||
-	      (result.ios && result.webkit_version < 604);
-
-	handlers.copy = editHandlers.cut = function (view, e) {
-	  var sel = view.state.selection, cut = e.type == "cut";
-	  if (sel.empty) { return }
-
-	  // IE and Edge's clipboard interface is completely broken
-	  var data = brokenClipboardAPI ? null : e.clipboardData;
-	  var slice = sel.content();
-	  var ref = serializeForClipboard(view, slice);
-	  var dom = ref.dom;
-	  var text = ref.text;
-	  if (data) {
-	    e.preventDefault();
-	    data.clearData();
-	    data.setData("text/html", dom.innerHTML);
-	    data.setData("text/plain", text);
-	  } else {
-	    captureCopy(view, dom);
-	  }
-	  if (cut) { view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta("uiEvent", "cut")); }
-	};
-
-	function sliceSingleNode(slice) {
-	  return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null
-	}
-
-	function capturePaste(view, e) {
-	  var doc = view.dom.ownerDocument;
-	  var plainText = view.shiftKey || view.state.selection.$from.parent.type.spec.code;
-	  var target = doc.body.appendChild(doc.createElement(plainText ? "textarea" : "div"));
-	  if (!plainText) { target.contentEditable = "true"; }
-	  target.style.cssText = "position: fixed; left: -10000px; top: 10px";
-	  target.focus();
-	  setTimeout(function () {
-	    view.focus();
-	    doc.body.removeChild(target);
-	    if (plainText) { doPaste(view, target.value, null, e); }
-	    else { doPaste(view, target.textContent, target.innerHTML, e); }
-	  }, 50);
-	}
-
-	function doPaste(view, text, html, e) {
-	  var slice = parseFromClipboard(view, text, html, view.shiftKey, view.state.selection.$from);
-	  if (!slice) { return false }
-
-	  if (view.someProp("handlePaste", function (f) { return f(view, e, slice); })) { return true }
-
-	  var singleNode = sliceSingleNode(slice);
-	  var tr = singleNode ? view.state.tr.replaceSelectionWith(singleNode, view.shiftKey) : view.state.tr.replaceSelection(slice);
-	  view.dispatch(tr.scrollIntoView().setMeta("paste", true).setMeta("uiEvent", "paste"));
-	  return true
-	}
-
-	editHandlers.paste = function (view, e) {
-	  var data = brokenClipboardAPI ? null : e.clipboardData;
-	  if (data && doPaste(view, data.getData("text/plain"), data.getData("text/html"), e))
-	    { e.preventDefault(); }
-	  else
-	    { capturePaste(view, e); }
-	};
-
-	var Dragging = function Dragging(slice, move) {
-	  this.slice = slice;
-	  this.move = move;
-	};
-
-	var dragCopyModifier = result.mac ? "altKey" : "ctrlKey";
-
-	handlers.dragstart = function (view, e) {
-	  var mouseDown = view.mouseDown;
-	  if (mouseDown) { mouseDown.done(); }
-	  if (!e.dataTransfer) { return }
-
-	  var sel = view.state.selection;
-	  var pos = sel.empty ? null : view.posAtCoords(eventCoords(e));
-	  if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof dist$2.NodeSelection ? sel.to - 1: sel.to)) ; else if (mouseDown && mouseDown.mightDrag) {
-	    view.dispatch(view.state.tr.setSelection(dist$2.NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos)));
-	  } else if (e.target && e.target.nodeType == 1) {
-	    var desc = view.docView.nearestDesc(e.target, true);
-	    if (!desc || !desc.node.type.spec.draggable || desc == view.docView) { return }
-	    view.dispatch(view.state.tr.setSelection(dist$2.NodeSelection.create(view.state.doc, desc.posBefore)));
-	  }
-	  var slice = view.state.selection.content();
-	  var ref = serializeForClipboard(view, slice);
-	  var dom = ref.dom;
-	  var text = ref.text;
-	  e.dataTransfer.clearData();
-	  e.dataTransfer.setData(brokenClipboardAPI ? "Text" : "text/html", dom.innerHTML);
-	  if (!brokenClipboardAPI) { e.dataTransfer.setData("text/plain", text); }
-	  view.dragging = new Dragging(slice, !e[dragCopyModifier]);
-	};
-
-	handlers.dragend = function (view) {
-	  window.setTimeout(function () { return view.dragging = null; }, 50);
-	};
-
-	editHandlers.dragover = editHandlers.dragenter = function (_, e) { return e.preventDefault(); };
-
-	editHandlers.drop = function (view, e) {
-	  var dragging = view.dragging;
-	  view.dragging = null;
-
-	  if (!e.dataTransfer) { return }
-
-	  var eventPos = view.posAtCoords(eventCoords(e));
-	  if (!eventPos) { return }
-	  var $mouse = view.state.doc.resolve(eventPos.pos);
-	  if (!$mouse) { return }
-	  var slice = dragging && dragging.slice ||
-	      parseFromClipboard(view, e.dataTransfer.getData(brokenClipboardAPI ? "Text" : "text/plain"),
-	                         brokenClipboardAPI ? null : e.dataTransfer.getData("text/html"), false, $mouse);
-	  if (!slice) { return }
-
-	  e.preventDefault();
-	  if (view.someProp("handleDrop", function (f) { return f(view, e, slice, dragging && dragging.move); })) { return }
-	  var insertPos = slice ? dist$1.dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;
-	  if (insertPos == null) { insertPos = $mouse.pos; }
-
-	  var tr = view.state.tr;
-	  if (dragging && dragging.move) { tr.deleteSelection(); }
-
-	  var pos = tr.mapping.map(insertPos);
-	  var isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;
-	  var beforeInsert = tr.doc;
-	  if (isNode)
-	    { tr.replaceRangeWith(pos, pos, slice.content.firstChild); }
-	  else
-	    { tr.replaceRange(pos, pos, slice); }
-	  if (tr.doc.eq(beforeInsert)) { return }
-
-	  var $pos = tr.doc.resolve(pos);
-	  if (isNode && dist$2.NodeSelection.isSelectable(slice.content.firstChild) &&
-	      $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild))
-	    { tr.setSelection(new dist$2.NodeSelection($pos)); }
-	  else
-	    { tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(tr.mapping.map(insertPos)))); }
-	  view.focus();
-	  view.dispatch(tr.setMeta("uiEvent", "drop"));
-	};
-
-	handlers.focus = function (view) {
-	  if (!view.focused) {
-	    view.dom.classList.add("ProseMirror-focused");
-	    view.focused = true;
-	  }
-	};
-
-	handlers.blur = function (view) {
-	  if (view.focused) {
-	    view.dom.classList.remove("ProseMirror-focused");
-	    view.focused = false;
-	  }
-	};
-
-	// Make sure all handlers get registered
-	for (var prop in editHandlers) { handlers[prop] = editHandlers[prop]; }
-
-	function compareObjs(a, b) {
-	  if (a == b) { return true }
-	  for (var p in a) { if (a[p] !== b[p]) { return false } }
-	  for (var p$1 in b) { if (!(p$1 in a)) { return false } }
-	  return true
-	}
-
-	var WidgetType = function WidgetType(toDOM, spec) {
-	  this.spec = spec || noSpec;
-	  this.side = this.spec.side || 0;
-	  this.toDOM = toDOM;
-	};
-
-	WidgetType.prototype.map = function map (mapping, span, offset, oldOffset) {
-	  var ref = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);
-	    var pos = ref.pos;
-	    var deleted = ref.deleted;
-	  return deleted ? null : new Decoration(pos - offset, pos - offset, this)
-	};
-
-	WidgetType.prototype.valid = function valid () { return true };
-
-	WidgetType.prototype.eq = function eq (other) {
-	  return this == other ||
-	    (other instanceof WidgetType &&
-	     (this.spec.key && this.spec.key == other.spec.key ||
-	      this.toDOM == other.toDOM && compareObjs(this.spec, other.spec)))
-	};
-
-	var InlineType = function InlineType(attrs, spec) {
-	  this.spec = spec || noSpec;
-	  this.attrs = attrs;
-	};
-
-	InlineType.prototype.map = function map (mapping, span, offset, oldOffset) {
-	  var from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;
-	  var to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;
-	  return from >= to ? null : new Decoration(from, to, this)
-	};
-
-	InlineType.prototype.valid = function valid (_, span) { return span.from < span.to };
-
-	InlineType.prototype.eq = function eq (other) {
-	  return this == other ||
-	    (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&
-	     compareObjs(this.spec, other.spec))
-	};
-
-	InlineType.is = function is (span) { return span.type instanceof InlineType };
-
-	var NodeType = function NodeType(attrs, spec) {
-	  this.spec = spec || noSpec;
-	  this.attrs = attrs;
-	};
-
-	NodeType.prototype.map = function map (mapping, span, offset, oldOffset) {
-	  var from = mapping.mapResult(span.from + oldOffset, 1);
-	  if (from.deleted) { return null }
-	  var to = mapping.mapResult(span.to + oldOffset, -1);
-	  if (to.deleted || to.pos <= from.pos) { return null }
-	  return new Decoration(from.pos - offset, to.pos - offset, this)
-	};
-
-	NodeType.prototype.valid = function valid (node, span) {
-	  var ref = node.content.findIndex(span.from);
-	    var index = ref.index;
-	    var offset = ref.offset;
-	  return offset == span.from && offset + node.child(index).nodeSize == span.to
-	};
-
-	NodeType.prototype.eq = function eq (other) {
-	  return this == other ||
-	    (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&
-	     compareObjs(this.spec, other.spec))
-	};
-
-	// ::- Decoration objects can be provided to the view through the
-	// [`decorations` prop](#view.EditorProps.decorations). They come in
-	// several variants—see the static members of this class for details.
-	var Decoration = function Decoration(from, to, type) {
-	  // :: number
-	  // The start position of the decoration.
-	  this.from = from;
-	  // :: number
-	  // The end position. Will be the same as `from` for [widget
-	  // decorations](#view.Decoration^widget).
-	  this.to = to;
-	  this.type = type;
-	};
-
-	var prototypeAccessors$2 = { spec: {} };
-
-	Decoration.prototype.copy = function copy (from, to) {
-	  return new Decoration(from, to, this.type)
-	};
-
-	Decoration.prototype.eq = function eq (other) {
-	  return this.type.eq(other.type) && this.from == other.from && this.to == other.to
-	};
-
-	Decoration.prototype.map = function map (mapping, offset, oldOffset) {
-	  return this.type.map(mapping, this, offset, oldOffset)
-	};
-
-	// :: (number, union<(view: EditorView, getPos: () → number) → dom.Node, dom.Node>, ?Object) → Decoration
-	// Creates a widget decoration, which is a DOM node that's shown in
-	// the document at the given position. It is recommended that you
-	// delay rendering the widget by passing a function that will be
-	// called when the widget is actually drawn in a view, but you can
-	// also directly pass a DOM node. `getPos` can be used to find the
-	// widget's current document position.
-	//
-	// spec::- These options are supported:
-	//
-	//   side:: ?number
-	//   Controls which side of the document position this widget is
-	//   associated with. When negative, it is drawn before a cursor
-	//   at its position, and content inserted at that position ends
-	//   up after the widget. When zero (the default) or positive, the
-	//   widget is drawn after the cursor and content inserted there
-	//   ends up before the widget.
-	//
-	//   When there are multiple widgets at a given position, their
-	//   `side` values determine the order in which they appear. Those
-	//   with lower values appear first. The ordering of widgets with
-	//   the same `side` value is unspecified.
-	//
-	//   When `marks` is null, `side` also determines the marks that
-	//   the widget is wrapped in—those of the node before when
-	//   negative, those of the node after when positive.
-	//
-	//   marks:: ?[Mark]
-	//   The precise set of marks to draw around the widget.
-	//
-	//   stopEvent:: ?(event: dom.Event) → bool
-	//   Can be used to control which DOM events, when they bubble out
-	//   of this widget, the editor view should ignore.
-	//
-	//   key:: ?string
-	//   When comparing decorations of this type (in order to decide
-	//   whether it needs to be redrawn), ProseMirror will by default
-	//   compare the widget DOM node by identity. If you pass a key,
-	//   that key will be compared instead, which can be useful when
-	//   you generate decorations on the fly and don't want to store
-	//   and reuse DOM nodes. Make sure that any widgets with the same
-	//   key are interchangeable—if widgets differ in, for example,
-	//   the behavior of some event handler, they should get
-	//   different keys.
-	Decoration.widget = function widget (pos, toDOM, spec) {
-	  return new Decoration(pos, pos, new WidgetType(toDOM, spec))
-	};
-
-	// :: (number, number, DecorationAttrs, ?Object) → Decoration
-	// Creates an inline decoration, which adds the given attributes to
-	// each inline node between `from` and `to`.
-	//
-	// spec::- These options are recognized:
-	//
-	//   inclusiveStart:: ?bool
-	//   Determines how the left side of the decoration is
-	//   [mapped](#transform.Position_Mapping) when content is
-	//   inserted directly at that positon. By default, the decoration
-	//   won't include the new content, but you can set this to `true`
-	//   to make it inclusive.
-	//
-	//   inclusiveEnd:: ?bool
-	//   Determines how the right side of the decoration is mapped.
-	//   See
-	//   [`inclusiveStart`](#view.Decoration^inline^spec.inclusiveStart).
-	Decoration.inline = function inline (from, to, attrs, spec) {
-	  return new Decoration(from, to, new InlineType(attrs, spec))
-	};
-
-	// :: (number, number, DecorationAttrs, ?Object) → Decoration
-	// Creates a node decoration. `from` and `to` should point precisely
-	// before and after a node in the document. That node, and only that
-	// node, will receive the given attributes.
-	Decoration.node = function node (from, to, attrs, spec) {
-	  return new Decoration(from, to, new NodeType(attrs, spec))
-	};
-
-	// :: Object
-	// The spec provided when creating this decoration. Can be useful
-	// if you've stored extra information in that object.
-	prototypeAccessors$2.spec.get = function () { return this.type.spec };
-
-	Object.defineProperties( Decoration.prototype, prototypeAccessors$2 );
-
-	// DecorationAttrs:: interface
-	// A set of attributes to add to a decorated node. Most properties
-	// simply directly correspond to DOM attributes of the same name,
-	// which will be set to the property's value. These are exceptions:
-	//
-	//   class:: ?string
-	//   A CSS class name or a space-separated set of class names to be
-	//   _added_ to the classes that the node already had.
-	//
-	//   style:: ?string
-	//   A string of CSS to be _added_ to the node's existing `style` property.
-	//
-	//   nodeName:: ?string
-	//   When non-null, the target node is wrapped in a DOM element of
-	//   this type (and the other attributes are applied to this element).
-
-	var none = [];
-	var noSpec = {};
-
-	// ::- A collection of [decorations](#view.Decoration), organized in
-	// such a way that the drawing algorithm can efficiently use and
-	// compare them. This is a persistent data structure—it is not
-	// modified, updates create a new value.
-	var DecorationSet = function DecorationSet(local, children) {
-	  this.local = local && local.length ? local : none;
-	  this.children = children && children.length ? children : none;
-	};
-
-	// :: (Node, [Decoration]) → DecorationSet
-	// Create a set of decorations, using the structure of the given
-	// document.
-	DecorationSet.create = function create (doc, decorations) {
-	  return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty
-	};
-
-	// :: (?number, ?number, ?(spec: Object) → bool) → [Decoration]
-	// Find all decorations in this set which touch the given range
-	// (including decorations that start or end directly at the
-	// boundaries) and match the given predicate on their spec. When
-	// `start` and `end` are omitted, all decorations in the set are
-	// considered. When `predicate` isn't given, all decorations are
-	// asssumed to match.
-	DecorationSet.prototype.find = function find (start, end, predicate) {
-	  var result = [];
-	  this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);
-	  return result
-	};
-
-	DecorationSet.prototype.findInner = function findInner (start, end, result, offset, predicate) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.local.length; i++) {
-	    var span = this$1.local[i];
-	    if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec)))
-	      { result.push(span.copy(span.from + offset, span.to + offset)); }
-	  }
-	  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3) {
-	    if (this$1.children[i$1] < end && this$1.children[i$1 + 1] > start) {
-	      var childOff = this$1.children[i$1] + 1;
-	      this$1.children[i$1 + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate);
-	    }
-	  }
-	};
-
-	// :: (Mapping, Node, ?Object) → DecorationSet
-	// Map the set of decorations in response to a change in the
-	// document.
-	//
-	// options::- An optional set of options.
-	//
-	//   onRemove:: ?(decorationSpec: Object)
-	//   When given, this function will be called for each decoration
-	//   that gets dropped as a result of the mapping, passing the
-	//   spec of that decoration.
-	DecorationSet.prototype.map = function map (mapping, doc, options) {
-	  if (this == empty || mapping.maps.length == 0) { return this }
-	  return this.mapInner(mapping, doc, 0, 0, options || noSpec)
-	};
-
-	DecorationSet.prototype.mapInner = function mapInner (mapping, node, offset, oldOffset, options) {
-	    var this$1 = this;
-
-	  var newLocal;
-	  for (var i = 0; i < this.local.length; i++) {
-	    var mapped = this$1.local[i].map(mapping, offset, oldOffset);
-	    if (mapped && mapped.type.valid(node, mapped)) { (newLocal || (newLocal = [])).push(mapped); }
-	    else if (options.onRemove) { options.onRemove(this$1.local[i].spec); }
-	  }
-
-	  if (this.children.length)
-	    { return mapChildren(this.children, newLocal, mapping, node, offset, oldOffset, options) }
-	  else
-	    { return newLocal ? new DecorationSet(newLocal.sort(byPos)) : empty }
-	};
-
-	// :: (Node, [Decoration]) → DecorationSet
-	// Add the given array of decorations to the ones in the set,
-	// producing a new set. Needs access to the current document to
-	// create the appropriate tree structure.
-	DecorationSet.prototype.add = function add (doc, decorations) {
-	  if (!decorations.length) { return this }
-	  if (this == empty) { return DecorationSet.create(doc, decorations) }
-	  return this.addInner(doc, decorations, 0)
-	};
-
-	DecorationSet.prototype.addInner = function addInner (doc, decorations, offset) {
-	    var this$1 = this;
-
-	  var children, childIndex = 0;
-	  doc.forEach(function (childNode, childOffset) {
-	    var baseOffset = childOffset + offset, found;
-	    if (!(found = takeSpansForNode(decorations, childNode, baseOffset))) { return }
-
-	    if (!children) { children = this$1.children.slice(); }
-	    while (childIndex < children.length && children[childIndex] < childOffset) { childIndex += 3; }
-	    if (children[childIndex] == childOffset)
-	      { children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1); }
-	    else
-	      { children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec)); }
-	    childIndex += 3;
-	  });
-
-	  var local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset);
-	  return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local,
-	                           children || this.children)
-	};
-
-	// :: ([Decoration]) → DecorationSet
-	// Create a new set that contains the decorations in this set, minus
-	// the ones in the given array.
-	DecorationSet.prototype.remove = function remove (decorations) {
-	  if (decorations.length == 0 || this == empty) { return this }
-	  return this.removeInner(decorations, 0)
-	};
-
-	DecorationSet.prototype.removeInner = function removeInner (decorations, offset) {
-	    var this$1 = this;
-
-	  var children = this.children, local = this.local;
-	  for (var i = 0; i < children.length; i += 3) {
-	    var found = (void 0), from = children[i] + offset, to = children[i + 1] + offset;
-	    for (var j = 0, span = (void 0); j < decorations.length; j++) { if (span = decorations[j]) {
-	      if (span.from > from && span.to < to) {
-	        decorations[j] = null
-	        ;(found || (found = [])).push(span);
-	      }
-	    } }
-	    if (!found) { continue }
-	    if (children == this$1.children) { children = this$1.children.slice(); }
-	    var removed = children[i + 2].removeInner(found, from + 1);
-	    if (removed != empty) {
-	      children[i + 2] = removed;
-	    } else {
-	      children.splice(i, 3);
-	      i -= 3;
-	    }
-	  }
-	  if (local.length) { for (var i$1 = 0, span$1 = (void 0); i$1 < decorations.length; i$1++) { if (span$1 = decorations[i$1]) {
-	    for (var j$1 = 0; j$1 < local.length; j$1++) { if (local[j$1].type.eq(span$1.type)) {
-	      if (local == this$1.local) { local = this$1.local.slice(); }
-	      local.splice(j$1--, 1);
-	    } }
-	  } } }
-	  if (children == this.children && local == this.local) { return this }
-	  return local.length || children.length ? new DecorationSet(local, children) : empty
-	};
-
-	DecorationSet.prototype.forChild = function forChild (offset, node) {
-	    var this$1 = this;
-
-	  if (this == empty) { return this }
-	  if (node.isLeaf) { return DecorationSet.empty }
-
-	  var child, local;
-	  for (var i = 0; i < this.children.length; i += 3) { if (this$1.children[i] >= offset) {
-	    if (this$1.children[i] == offset) { child = this$1.children[i + 2]; }
-	    break
-	  } }
-	  var start = offset + 1, end = start + node.content.size;
-	  for (var i$1 = 0; i$1 < this.local.length; i$1++) {
-	    var dec = this$1.local[i$1];
-	    if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {
-	      var from = Math.max(start, dec.from) - start, to = Math.min(end, dec.to) - start;
-	      if (from < to) { (local || (local = [])).push(dec.copy(from, to)); }
-	    }
-	  }
-	  if (local) {
-	    var localSet = new DecorationSet(local.sort(byPos));
-	    return child ? new DecorationGroup([localSet, child]) : localSet
-	  }
-	  return child || empty
-	};
-
-	DecorationSet.prototype.eq = function eq (other) {
-	    var this$1 = this;
-
-	  if (this == other) { return true }
-	  if (!(other instanceof DecorationSet) ||
-	      this.local.length != other.local.length ||
-	      this.children.length != other.children.length) { return false }
-	  for (var i = 0; i < this.local.length; i++)
-	    { if (!this$1.local[i].eq(other.local[i])) { return false } }
-	  for (var i$1 = 0; i$1 < this.children.length; i$1 += 3)
-	    { if (this$1.children[i$1] != other.children[i$1] ||
-	        this$1.children[i$1 + 1] != other.children[i$1 + 1] ||
-	        !this$1.children[i$1 + 2].eq(other.children[i$1 + 2])) { return false } }
-	  return false
-	};
-
-	DecorationSet.prototype.locals = function locals (node) {
-	  return removeOverlap(this.localsInner(node))
-	};
-
-	DecorationSet.prototype.localsInner = function localsInner (node) {
-	    var this$1 = this;
-
-	  if (this == empty) { return none }
-	  if (node.inlineContent || !this.local.some(InlineType.is)) { return this.local }
-	  var result = [];
-	  for (var i = 0; i < this.local.length; i++) {
-	    if (!(this$1.local[i].type instanceof InlineType))
-	      { result.push(this$1.local[i]); }
-	  }
-	  return result
-	};
-
-	var empty = new DecorationSet();
-
-	// :: DecorationSet
-	// The empty set of decorations.
-	DecorationSet.empty = empty;
-
-	DecorationSet.removeOverlap = removeOverlap;
-
-	// :- An abstraction that allows the code dealing with decorations to
-	// treat multiple DecorationSet objects as if it were a single object
-	// with (a subset of) the same interface.
-	var DecorationGroup = function DecorationGroup(members) {
-	  this.members = members;
-	};
-
-	DecorationGroup.prototype.forChild = function forChild (offset, child) {
-	    var this$1 = this;
-
-	  if (child.isLeaf) { return DecorationSet.empty }
-	  var found = [];
-	  for (var i = 0; i < this.members.length; i++) {
-	    var result = this$1.members[i].forChild(offset, child);
-	    if (result == empty) { continue }
-	    if (result instanceof DecorationGroup) { found = found.concat(result.members); }
-	    else { found.push(result); }
-	  }
-	  return DecorationGroup.from(found)
-	};
-
-	DecorationGroup.prototype.eq = function eq (other) {
-	    var this$1 = this;
-
-	  if (!(other instanceof DecorationGroup) ||
-	      other.members.length != this.members.length) { return false }
-	  for (var i = 0; i < this.members.length; i++)
-	    { if (!this$1.members[i].eq(other.members[i])) { return false } }
-	  return true
-	};
-
-	DecorationGroup.prototype.locals = function locals (node) {
-	    var this$1 = this;
-
-	  var result, sorted = true;
-	  for (var i = 0; i < this.members.length; i++) {
-	    var locals = this$1.members[i].localsInner(node);
-	    if (!locals.length) { continue }
-	    if (!result) {
-	      result = locals;
-	    } else {
-	      if (sorted) {
-	        result = result.slice();
-	        sorted = false;
-	      }
-	      for (var j = 0; j < locals.length; j++) { result.push(locals[j]); }
-	    }
-	  }
-	  return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none
-	};
-
-	// : ([DecorationSet]) → union<DecorationSet, DecorationGroup>
-	// Create a group for the given array of decoration sets, or return
-	// a single set when possible.
-	DecorationGroup.from = function from (members) {
-	  switch (members.length) {
-	    case 0: return empty
-	    case 1: return members[0]
-	    default: return new DecorationGroup(members)
-	  }
-	};
-
-	function mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {
-	  var children = oldChildren.slice();
-
-	  // Mark the children that are directly touched by changes, and
-	  // move those that are after the changes.
-	  var shift = function (oldStart, oldEnd, newStart, newEnd) {
-	    for (var i = 0; i < children.length; i += 3) {
-	      var end = children[i + 1], dSize = (void 0);
-	      if (end == -1 || oldStart > end + oldOffset) { continue }
-	      if (oldEnd >= children[i] + oldOffset) {
-	        children[i + 1] = -1;
-	      } else if (dSize = (newEnd - newStart) - (oldEnd - oldStart) + (oldOffset - offset)) {
-	        children[i] += dSize;
-	        children[i + 1] += dSize;
-	      }
-	    }
-	  };
-	  for (var i = 0; i < mapping.maps.length; i++) { mapping.maps[i].forEach(shift); }
-
-	  // Find the child nodes that still correspond to a single node,
-	  // recursively call mapInner on them and update their positions.
-	  var mustRebuild = false;
-	  for (var i$1 = 0; i$1 < children.length; i$1 += 3) { if (children[i$1 + 1] == -1) { // Touched nodes
-	    var from = mapping.map(children[i$1] + oldOffset), fromLocal = from - offset;
-	    if (fromLocal < 0 || fromLocal >= node.content.size) {
-	      mustRebuild = true;
-	      continue
-	    }
-	    // Must read oldChildren because children was tagged with -1
-	    var to = mapping.map(oldChildren[i$1 + 1] + oldOffset, -1), toLocal = to - offset;
-	    var ref = node.content.findIndex(fromLocal);
-	    var index = ref.index;
-	    var childOffset = ref.offset;
-	    var childNode = node.maybeChild(index);
-	    if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {
-	      var mapped = children[i$1 + 2].mapInner(mapping, childNode, from + 1, children[i$1] + oldOffset + 1, options);
-	      if (mapped != empty) {
-	        children[i$1] = fromLocal;
-	        children[i$1 + 1] = toLocal;
-	        children[i$1 + 2] = mapped;
-	      } else {
-	        children.splice(i$1, 3);
-	        i$1 -= 3;
-	      }
-	    } else {
-	      mustRebuild = true;
-	    }
-	  } }
-
-	  // Remaining children must be collected and rebuilt into the appropriate structure
-	  if (mustRebuild) {
-	    var decorations = mapAndGatherRemainingDecorations(children, newLocal ? moveSpans(newLocal, offset) : [], mapping,
-	                                                       offset, oldOffset, options);
-	    var built = buildTree(decorations, node, 0, options);
-	    newLocal = built.local;
-	    for (var i$2 = 0; i$2 < children.length; i$2 += 3) { if (children[i$2 + 1] == -1) {
-	      children.splice(i$2, 3);
-	      i$2 -= 3;
-	    } }
-	    for (var i$3 = 0, j = 0; i$3 < built.children.length; i$3 += 3) {
-	      var from$1 = built.children[i$3];
-	      while (j < children.length && children[j] < from$1) { j += 3; }
-	      children.splice(j, 0, built.children[i$3], built.children[i$3 + 1], built.children[i$3 + 2]);
-	    }
-	  }
-
-	  return new DecorationSet(newLocal && newLocal.sort(byPos), children)
-	}
-
-	function moveSpans(spans, offset) {
-	  if (!offset || !spans.length) { return spans }
-	  var result = [];
-	  for (var i = 0; i < spans.length; i++) {
-	    var span = spans[i];
-	    result.push(new Decoration(span.from + offset, span.to + offset, span.type));
-	  }
-	  return result
-	}
-
-	function mapAndGatherRemainingDecorations(children, decorations, mapping, offset, oldOffset, options) {
-	  // Gather all decorations from the remaining marked children
-	  function gather(set, oldOffset) {
-	    for (var i = 0; i < set.local.length; i++) {
-	      var mapped = set.local[i].map(mapping, offset, oldOffset);
-	      if (mapped) { decorations.push(mapped); }
-	      else if (options.onRemove) { options.onRemove(set.local[i].spec); }
-	    }
-	    for (var i$1 = 0; i$1 < set.children.length; i$1 += 3)
-	      { gather(set.children[i$1 + 2], set.children[i$1] + oldOffset + 1); }
-	  }
-	  for (var i = 0; i < children.length; i += 3) { if (children[i + 1] == -1)
-	    { gather(children[i + 2], children[i] + oldOffset + 1); } }
-
-	  return decorations
-	}
-
-	function takeSpansForNode(spans, node, offset) {
-	  if (node.isLeaf) { return null }
-	  var end = offset + node.nodeSize, found = null;
-	  for (var i = 0, span = (void 0); i < spans.length; i++) {
-	    if ((span = spans[i]) && span.from > offset && span.to < end) {
-	      (found || (found = [])).push(span);
-	      spans[i] = null;
-	    }
-	  }
-	  return found
-	}
-
-	function withoutNulls(array) {
-	  var result = [];
-	  for (var i = 0; i < array.length; i++)
-	    { if (array[i] != null) { result.push(array[i]); } }
-	  return result
-	}
-
-	// : ([Decoration], Node, number) → DecorationSet
-	// Build up a tree that corresponds to a set of decorations. `offset`
-	// is a base offset that should be subtractet from the `from` and `to`
-	// positions in the spans (so that we don't have to allocate new spans
-	// for recursive calls).
-	function buildTree(spans, node, offset, options) {
-	  var children = [], hasNulls = false;
-	  node.forEach(function (childNode, localStart) {
-	    var found = takeSpansForNode(spans, childNode, localStart + offset);
-	    if (found) {
-	      hasNulls = true;
-	      var subtree = buildTree(found, childNode, offset + localStart + 1, options);
-	      if (subtree != empty)
-	        { children.push(localStart, localStart + childNode.nodeSize, subtree); }
-	    }
-	  });
-	  var locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);
-	  for (var i = 0; i < locals.length; i++) { if (!locals[i].type.valid(node, locals[i])) {
-	    if (options.onRemove) { options.onRemove(locals[i].spec); }
-	    locals.splice(i--, 1);
-	  } }
-	  return locals.length || children.length ? new DecorationSet(locals, children) : empty
-	}
-
-	// : (Decoration, Decoration) → number
-	// Used to sort decorations so that ones with a low start position
-	// come first, and within a set with the same start position, those
-	// with an smaller end position come first.
-	function byPos(a, b) {
-	  return a.from - b.from || a.to - b.to
-	}
-
-	// : ([Decoration]) → [Decoration]
-	// Scan a sorted array of decorations for partially overlapping spans,
-	// and split those so that only fully overlapping spans are left (to
-	// make subsequent rendering easier). Will return the input array if
-	// no partially overlapping spans are found (the common case).
-	function removeOverlap(spans) {
-	  var working = spans;
-	  for (var i = 0; i < working.length - 1; i++) {
-	    var span = working[i];
-	    if (span.from != span.to) { for (var j = i + 1; j < working.length; j++) {
-	      var next = working[j];
-	      if (next.from == span.from) {
-	        if (next.to != span.to) {
-	          if (working == spans) { working = spans.slice(); }
-	          // Followed by a partially overlapping larger span. Split that
-	          // span.
-	          working[j] = next.copy(next.from, span.to);
-	          insertAhead(working, j + 1, next.copy(span.to, next.to));
-	        }
-	        continue
-	      } else {
-	        if (next.from < span.to) {
-	          if (working == spans) { working = spans.slice(); }
-	          // The end of this one overlaps with a subsequent span. Split
-	          // this one.
-	          working[i] = span.copy(span.from, next.from);
-	          insertAhead(working, j, span.copy(next.from, span.to));
-	        }
-	        break
-	      }
-	    } }
-	  }
-	  return working
-	}
-
-	function insertAhead(array, i, deco) {
-	  while (i < array.length && byPos(deco, array[i]) > 0) { i++; }
-	  array.splice(i, 0, deco);
-	}
-
-	// : (EditorView) → union<DecorationSet, DecorationGroup>
-	// Get the decorations associated with the current props of a view.
-	function viewDecorations(view) {
-	  var found = [];
-	  view.someProp("decorations", function (f) {
-	    var result = f(view.state);
-	    if (result && result != empty) { found.push(result); }
-	  });
-	  if (view.cursorWrapper)
-	    { found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco])); }
-	  return DecorationGroup.from(found)
-	}
-
-	// ::- An editor view manages the DOM structure that represents an
-	// editable document. Its state and behavior are determined by its
-	// [props](#view.DirectEditorProps).
-	var EditorView = function EditorView(place, props) {
-	  this._props = props;
-	  // :: EditorState
-	  // The view's current [state](#state.EditorState).
-	  this.state = props.state;
-
-	  this.dispatch = this.dispatch.bind(this);
-
-	  this._root = null;
-	  this.focused = false;
-
-	  // :: dom.Element
-	  // An editable DOM node containing the document. (You probably
-	  // should not directly interfere with its content.)
-	  this.dom = (place && place.mount) || document.createElement("div");
-	  if (place) {
-	    if (place.appendChild) { place.appendChild(this.dom); }
-	    else if (place.apply) { place(this.dom); }
-	    else if (place.mount) { this.mounted = true; }
-	  }
-
-	  this.editable = getEditable(this);
-	  this.cursorWrapper = null;
-	  updateCursorWrapper(this);
-	  this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);
-
-	  this.lastSelectedViewDesc = null;
-	  // :: ?{slice: Slice, move: bool}
-	  // When editor content is being dragged, this object contains
-	  // information about the dragged slice and whether it is being
-	  // copied or moved. At any other time, it is null.
-	  this.dragging = null;
-	  initInput(this); // Must be done before creating a SelectionReader
-
-	  this.selectionReader = new SelectionReader(this);
-
-	  this.pluginViews = [];
-	  this.updatePluginViews();
-	};
-
-	var prototypeAccessors = { props: {},root: {} };
-
-	// :: DirectEditorProps
-	// The view's current [props](#view.EditorProps).
-	prototypeAccessors.props.get = function () {
-	    var this$1 = this;
-
-	  if (this._props.state != this.state) {
-	    var prev = this._props;
-	    this._props = {};
-	    for (var name in prev) { this$1._props[name] = prev[name]; }
-	    this._props.state = this.state;
-	  }
-	  return this._props
-	};
-
-	// :: (DirectEditorProps)
-	// Update the view's props. Will immediately cause an update to
-	// the DOM.
-	EditorView.prototype.update = function update (props) {
-	  if (props.handleDOMEvents != this._props.handleDOMEvents) { ensureListeners(this); }
-	  this._props = props;
-	  this.updateState(props.state);
-	};
-
-	// :: (DirectEditorProps)
-	// Update the view by updating existing props object with the object
-	// given as argument. Equivalent to `view.update(Object.assign({},
-	// view.props, props))`.
-	EditorView.prototype.setProps = function setProps (props) {
-	    var this$1 = this;
-
-	  var updated = {};
-	  for (var name in this$1._props) { updated[name] = this$1._props[name]; }
-	  updated.state = this.state;
-	  for (var name$1 in props) { updated[name$1] = props[name$1]; }
-	  this.update(updated);
-	};
-
-	// :: (EditorState)
-	// Update the editor's `state` prop, without touching any of the
-	// other props.
-	EditorView.prototype.updateState = function updateState (state) {
-	    var this$1 = this;
-
-	  var prev = this.state;
-	  this.state = state;
-	  if (prev.plugins != state.plugins) { ensureListeners(this); }
-
-	  this.domObserver.flush();
-	  if (this.inDOMChange && this.inDOMChange.stateUpdated(state)) { return }
-
-	  var prevEditable = this.editable;
-	  this.editable = getEditable(this);
-	  updateCursorWrapper(this);
-	  var innerDeco = viewDecorations(this), outerDeco = computeDocDeco(this);
-
-	  var scroll = prev.config != state.config ? "reset"
-	      : state.scrollToSelection > prev.scrollToSelection ? "to selection" : "preserve";
-	  var updateDoc = !this.docView.matchesNode(state.doc, outerDeco, innerDeco);
-	  var updateSel = updateDoc || !state.selection.eq(prev.selection) || this.selectionReader.domChanged();
-	  var oldScrollPos = scroll == "preserve" && updateSel && storeScrollPos(this);
-
-	  if (updateSel) {
-	    this.domObserver.stop();
-	    if (updateDoc) {
-	      if (!this.docView.update(state.doc, outerDeco, innerDeco, this)) {
-	        this.docView.destroy();
-	        this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);
-	      }
-	      this.selectionReader.clearDOMState();
-	    }
-	    selectionToDOM(this);
-	    this.domObserver.start();
-	  }
-
-	  if (prevEditable != this.editable) { this.selectionReader.editableChanged(); }
-	  this.updatePluginViews(prev);
-
-	  if (scroll == "reset") {
-	    this.dom.scrollTop = 0;
-	  } else if (scroll == "to selection") {
-	    if (this.someProp("handleScrollToSelection", function (f) { return f(this$1); }))
-	      ; // Handled
-	    else if (state.selection instanceof dist$2.NodeSelection)
-	      { scrollRectIntoView(this, this.docView.domAfterPos(state.selection.from).getBoundingClientRect()); }
-	    else
-	      { scrollRectIntoView(this, this.coordsAtPos(state.selection.head)); }
-	  } else if (oldScrollPos) {
-	    resetScrollPos(oldScrollPos);
-	  }
-	};
-
-	EditorView.prototype.destroyPluginViews = function destroyPluginViews () {
-	  var view;
-	  while (view = this.pluginViews.pop()) { if (view.destroy) { view.destroy(); } }
-	};
-
-	EditorView.prototype.updatePluginViews = function updatePluginViews (prevState) {
-	    var this$1 = this;
-
-	  var plugins = this.state.plugins;
-	  if (!prevState || prevState.plugins != plugins) {
-	    this.destroyPluginViews();
-	    for (var i = 0; i < plugins.length; i++) {
-	      var plugin = plugins[i];
-	      if (plugin.spec.view) { this$1.pluginViews.push(plugin.spec.view(this$1)); }
-	    }
-	  } else {
-	    for (var i$1 = 0; i$1 < this.pluginViews.length; i$1++) {
-	      var pluginView = this$1.pluginViews[i$1];
-	      if (pluginView.update) { pluginView.update(this$1, prevState); }
-	    }
-	  }
-	};
-
-	// :: (string, ?(prop: *) → *) → *
-	// Goes over the values of a prop, first those provided directly,
-	// then those from plugins (in order), and calls `f` every time a
-	// non-undefined value is found. When `f` returns a truthy value,
-	// that is immediately returned. When `f` isn't provided, it is
-	// treated as the identity function (the prop value is returned
-	// directly).
-	EditorView.prototype.someProp = function someProp (propName, f) {
-	  var prop = this._props && this._props[propName], value;
-	  if (prop != null && (value = f ? f(prop) : prop)) { return value }
-	  var plugins = this.state.plugins;
-	  if (plugins) { for (var i = 0; i < plugins.length; i++) {
-	    var prop$1 = plugins[i].props[propName];
-	    if (prop$1 != null && (value = f ? f(prop$1) : prop$1)) { return value }
-	  } }
-	};
-
-	// :: () → bool
-	// Query whether the view has focus.
-	EditorView.prototype.hasFocus = function hasFocus () {
-	  return this.root.activeElement == this.dom
-	};
-
-	// :: ()
-	// Focus the editor.
-	EditorView.prototype.focus = function focus () {
-	  this.domObserver.stop();
-	  selectionToDOM(this, true);
-	  this.domObserver.start();
-	  if (this.editable) { this.dom.focus(); }
-	};
-
-	// :: union<dom.Document, dom.DocumentFragment>
-	// Get the document root in which the editor exists. This will
-	// usually be the top-level `document`, but might be a [shadow
-	// DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)
-	// root if the editor is inside one.
-	prototypeAccessors.root.get = function () {
-	    var this$1 = this;
-
-	  var cached = this._root;
-	  if (cached == null) { for (var search = this.dom.parentNode; search; search = search.parentNode) {
-	    if (search.nodeType == 9 || (search.nodeType == 11 && search.host))
-	      { return this$1._root = search }
-	  } }
-	  return cached || document
-	};
-
-	// :: ({left: number, top: number}) → ?{pos: number, inside: number}
-	// Given a pair of viewport coordinates, return the document
-	// position that corresponds to them. May return null if the given
-	// coordinates aren't inside of the visible editor. When an object
-	// is returned, its `pos` property is the position nearest to the
-	// coordinates, and its `inside` property holds the position of the
-	// inner node that the position falls inside of, or -1 if it is at
-	// the top level, not in any node.
-	EditorView.prototype.posAtCoords = function posAtCoords$1 (coords) {
-	  var pos = posAtCoords(this, coords);
-	  if (this.inDOMChange && pos) {
-	    pos.pos = this.inDOMChange.mapping.map(pos.pos);
-	    if (pos.inside != -1) { pos.inside = this.inDOMChange.mapping.map(pos.inside); }
-	  }
-	  return pos
-	};
-
-	// :: (number) → {left: number, right: number, top: number, bottom: number}
-	// Returns the viewport rectangle at a given document position. `left`
-	// and `right` will be the same number, as this returns a flat
-	// cursor-ish rectangle.
-	EditorView.prototype.coordsAtPos = function coordsAtPos$1 (pos) {
-	  if (this.inDOMChange)
-	    { pos = this.inDOMChange.mapping.invert().map(pos); }
-	  return coordsAtPos(this, pos)
-	};
-
-	// :: (number) → {node: dom.Node, offset: number}
-	// Find the DOM position that corresponds to the given document
-	// position. Note that you should **not** mutate the editor's
-	// internal DOM, only inspect it (and even that is usually not
-	// necessary).
-	EditorView.prototype.domAtPos = function domAtPos (pos) {
-	  if (this.inDOMChange)
-	    { pos = this.inDOMChange.mapping.invert().map(pos); }
-	  return this.docView.domFromPos(pos)
-	};
-
-	// :: (number) → ?dom.Node
-	// Find the DOM node that represents the document node after the
-	// given position. May return `null` when the position doesn't point
-	// in front of a node or if the node is inside an opaque node view.
-	//
-	// This is intended to be able to call things like
-	// `getBoundingClientRect` on that DOM node. Do **not** mutate the
-	// editor DOM directly, or add styling this way, since that will be
-	// immediately overriden by the editor as it redraws the node.
-	EditorView.prototype.nodeDOM = function nodeDOM (pos) {
-	  if (this.inDOMChange)
-	    { pos = this.inDOMChange.mapping.invert().map(pos); }
-	  var desc = this.docView.descAt(pos);
-	  return desc ? desc.nodeDOM : null
-	};
-
-	// :: (dom.Node, number, ?number) → number
-	// Find the document position that corresponds to a given DOM
-	// position. (Whenever possible, it is preferable to inspect the
-	// document structure directly, rather than poking around in the
-	// DOM, but sometimes—for example when interpreting an event
-	// target—you don't have a choice.)
-	//
-	// The `bias` parameter can be used to influence which side of a DOM
-	// node to use when the position is inside a leaf node.
-	EditorView.prototype.posAtDOM = function posAtDOM (node, offset, bias) {
-	    if ( bias === void 0 ) { bias = -1; }
-
-	  var pos = this.docView.posFromDOM(node, offset, bias);
-	  if (pos == null) { throw new RangeError("DOM position not inside the editor") }
-	  if (this.inDOMChange)
-	    { pos = this.inDOMChange.mapping.map(pos); }
-	  return pos
-	};
-
-	// :: (union<"up", "down", "left", "right", "forward", "backward">, ?EditorState) → bool
-	// Find out whether the selection is at the end of a textblock when
-	// moving in a given direction. When, for example, given `"left"`,
-	// it will return true if moving left from the current cursor
-	// position would leave that position's parent textblock. Will apply
-	// to the view's current state by default, but it is possible to
-	// pass a different state.
-	EditorView.prototype.endOfTextblock = function endOfTextblock$1 (dir, state) {
-	  return endOfTextblock(this, state || this.state, dir)
-	};
-
-	// :: ()
-	// Removes the editor from the DOM and destroys all [node
-	// views](#view.NodeView).
-	EditorView.prototype.destroy = function destroy () {
-	  if (!this.docView) { return }
-	  destroyInput(this);
-	  this.destroyPluginViews();
-	  this.selectionReader.destroy();
-	  if (this.mounted) {
-	    this.docView.update(this.state.doc, [], viewDecorations(this), this);
-	    this.dom.textContent = "";
-	  } else if (this.dom.parentNode) {
-	    this.dom.parentNode.removeChild(this.dom);
-	  }
-	  this.docView.destroy();
-	  this.docView = null;
-	};
-
-	// Used for testing.
-	EditorView.prototype.dispatchEvent = function dispatchEvent$1 (event) {
-	  return dispatchEvent(this, event)
-	};
-
-	// :: (Transaction)
-	// Dispatch a transaction. Will call
-	// [`dispatchTransaction`](#view.DirectEditorProps.dispatchTransaction)
-	// when given, and otherwise defaults to applying the transaction to
-	// the current state and calling
-	// [`updateState`](#view.EditorView.updateState) with the result.
-	// This method is bound to the view instance, so that it can be
-	// easily passed around.
-	EditorView.prototype.dispatch = function dispatch (tr) {
-	  var dispatchTransaction = this._props.dispatchTransaction;
-	  if (dispatchTransaction) { dispatchTransaction.call(this, tr); }
-	  else { this.updateState(this.state.apply(tr)); }
-	};
-
-	Object.defineProperties( EditorView.prototype, prototypeAccessors );
-
-	function computeDocDeco(view) {
-	  var attrs = Object.create(null);
-	  attrs.class = "ProseMirror" + (view.focused ? " ProseMirror-focused" : "");
-	  attrs.contenteditable = String(view.editable);
-
-	  view.someProp("attributes", function (value) {
-	    if (typeof value == "function") { value = value(view.state); }
-	    if (value) { for (var attr in value) {
-	      if (attr == "class")
-	        { attrs.class += " " + value[attr]; }
-	      else if (!attrs[attr] && attr != "contenteditable" && attr != "nodeName")
-	        { attrs[attr] = String(value[attr]); }
-	    } }
-	  });
-
-	  return [Decoration.node(0, view.state.doc.content.size, attrs)]
-	}
-
-	function cursorWrapperDOM(visible) {
-	  var span = document.createElement("span");
-	  span.textContent = "\ufeff"; // zero-width non-breaking space
-	  if (!visible) {
-	    span.style.position = "absolute";
-	    span.style.left = "-100000px";
-	  }
-	  return span
-	}
-
-	function updateCursorWrapper(view) {
-	  var $pos = needsCursorWrapper(view.state);
-	  // On IE/Edge, moving the DOM selection will abort a mouse drag, so
-	  // there we delay the creation of the wrapper when the mouse is down.
-	  if ($pos && !(result.ie && view.mouseDown)) {
-	    var visible = view.state.selection.visible;
-	    // Needs a cursor wrapper
-	    var marks = view.state.storedMarks || $pos.marks(), dom;
-	    if (!view.cursorWrapper || !dist.Mark.sameSet(view.cursorWrapper.deco.spec.marks, marks) ||
-	        view.cursorWrapper.dom.textContent != "\ufeff" ||
-	        view.cursorWrapper.deco.spec.visible != visible)
-	      { dom = cursorWrapperDOM(visible); }
-	    else if (view.cursorWrapper.deco.pos != $pos.pos)
-	      { dom = view.cursorWrapper.dom; }
-	    if (dom)
-	      { view.cursorWrapper = {dom: dom, deco: Decoration.widget($pos.pos, dom, {isCursorWrapper: true, marks: marks, raw: true, visible: visible})}; }
-	  } else {
-	    view.cursorWrapper = null;
-	  }
-	}
-
-	function getEditable(view) {
-	  return !view.someProp("editable", function (value) { return value(view.state) === false; })
-	}
-
-	// EditorProps:: interface
-	//
-	// Props are configuration values that can be passed to an editor view
-	// or included in a plugin. This interface lists the supported props.
-	//
-	// The various event-handling functions may all return `true` to
-	// indicate that they handled the given event. The view will then take
-	// care to call `preventDefault` on the event, except with
-	// `handleDOMEvents`, where the handler itself is responsible for that.
-	//
-	// How a prop is resolved depends on the prop. Handler functions are
-	// called one at a time, starting with the base props and then
-	// searching through the plugins (in order of appearance) until one of
-	// them returns true. For some props, the first plugin that yields a
-	// value gets precedence.
-	//
-	//   handleDOMEvents:: ?Object<(view: EditorView, event: dom.Event) → bool>
-	//   Can be an object mapping DOM event type names to functions that
-	//   handle them. Such functions will be called before any handling
-	//   ProseMirror does of events fired on the editable DOM element.
-	//   Contrary to the other event handling props, when returning true
-	//   from such a function, you are responsible for calling
-	//   `preventDefault` yourself (or not, if you want to allow the
-	//   default behavior).
-	//
-	//   handleKeyDown:: ?(view: EditorView, event: dom.KeyboardEvent) → bool
-	//   Called when the editor receives a `keydown` event.
-	//
-	//   handleKeyPress:: ?(view: EditorView, event: dom.KeyboardEvent) → bool
-	//   Handler for `keypress` events.
-	//
-	//   handleTextInput:: ?(view: EditorView, from: number, to: number, text: string) → bool
-	//   Whenever the user directly input text, this handler is called
-	//   before the input is applied. If it returns `true`, the default
-	//   behavior of actually inserting the text is suppressed.
-	//
-	//   handleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-	//   Called for each node around a click, from the inside out. The
-	//   `direct` flag will be true for the inner node.
-	//
-	//   handleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-	//   Called when the editor is clicked, after `handleClickOn` handlers
-	//   have been called.
-	//
-	//   handleDoubleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-	//   Called for each node around a double click.
-	//
-	//   handleDoubleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-	//   Called when the editor is double-clicked, after `handleDoubleClickOn`.
-	//
-	//   handleTripleClickOn:: ?(view: EditorView, pos: number, node: Node, nodePos: number, event: dom.MouseEvent, direct: bool) → bool
-	//   Called for each node around a triple click.
-	//
-	//   handleTripleClick:: ?(view: EditorView, pos: number, event: dom.MouseEvent) → bool
-	//   Called when the editor is triple-clicked, after `handleTripleClickOn`.
-	//
-	//   handlePaste:: ?(view: EditorView, event: dom.Event, slice: Slice) → bool
-	//   Can be used to override the behavior of pasting. `slice` is the
-	//   pasted content parsed by the editor, but you can directly access
-	//   the event to get at the raw content.
-	//
-	//   handleDrop:: ?(view: EditorView, event: dom.Event, slice: Slice, moved: bool) → bool
-	//   Called when something is dropped on the editor. `moved` will be
-	//   true if this drop moves from the current selection (which should
-	//   thus be deleted).
-	//
-	//   handleScrollToSelection:: ?(view: EditorView) → bool
-	//   Called when the view, after updating its state, tries to scroll
-	//   the selection into view. A handler function may return false to
-	//   indicate that it did not handle the scrolling and further
-	//   handlers or the default behavior should be tried.
-	//
-	//   createSelectionBetween:: ?(view: EditorView, anchor: ResolvedPos, head: ResolvedPos) → ?Selection
-	//   Can be used to override the way a selection is created when
-	//   reading a DOM selection between the given anchor and head.
-	//
-	//   domParser:: ?DOMParser
-	//   The [parser](#model.DOMParser) to use when reading editor changes
-	//   from the DOM. Defaults to calling
-	//   [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) on the
-	//   editor's schema.
-	//
-	//   transformPastedHTML:: ?(html: string) → string
-	//   Can be used to transform pasted HTML text, _before_ it is parsed,
-	//   for example to clean it up.
-	//
-	//   clipboardParser:: ?DOMParser
-	//   The [parser](#model.DOMParser) to use when reading content from
-	//   the clipboard. When not given, the value of the
-	//   [`domParser`](#view.EditorProps.domParser) prop is used.
-	//
-	//   transformPastedText:: ?(text: string) → string
-	//   Transform pasted plain text.
-	//
-	//   clipboardTextParser:: ?(text: string, $context: ResolvedPos) → Slice
-	//   A function to parse text from the clipboard into a document
-	//   slice. Called after
-	//   [`transformPastedText`](#view.EditorProps.transformPastedText).
-	//   The default behavior is to split the text into lines, wrap them
-	//   in `<p>` tags, and call
-	//   [`clipboardParser`](#view.EditorProps.clipboardParser) on it.
-	//
-	//   transformPasted:: ?(Slice) → Slice
-	//   Can be used to transform pasted content before it is applied to
-	//   the document.
-	//
-	//   nodeViews:: ?Object<(node: Node, view: EditorView, getPos: () → number, decorations: [Decoration]) → NodeView>
-	//   Allows you to pass custom rendering and behavior logic for nodes
-	//   and marks. Should map node and mark names to constructor
-	//   functions that produce a [`NodeView`](#view.NodeView) object
-	//   implementing the node's display behavior. `getPos` is a function
-	//   that can be called to get the node's current position, which can
-	//   be useful when creating transactions to update it.
-	//
-	//   `decorations` is an array of node or inline decorations that are
-	//   active around the node. They are automatically drawn in the
-	//   normal way, and you will usually just want to ignore this, but
-	//   they can also be used as a way to provide context information to
-	//   the node view without adding it to the document itself.
-	//
-	//   clipboardSerializer:: ?DOMSerializer
-	//   The DOM serializer to use when putting content onto the
-	//   clipboard. If not given, the result of
-	//   [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)
-	//   will be used.
-	//
-	//   clipboardTextSerializer:: ?(Slice) → string
-	//   A function that will be called to get the text for the current
-	//   selection when copying text to the clipboard. By default, the
-	//   editor will use [`textBetween`](#model.Node.textBetween) on the
-	//   selected range.
-	//
-	//   decorations:: ?(state: EditorState) → ?DecorationSet
-	//   A set of [document decorations](#view.Decoration) to show in the
-	//   view.
-	//
-	//   editable:: ?(state: EditorState) → bool
-	//   When this returns false, the content of the view is not directly
-	//   editable.
-	//
-	//   attributes:: ?union<Object<string>, (EditorState) → ?Object<string>>
-	//   Control the DOM attributes of the editable element. May be either
-	//   an object or a function going from an editor state to an object.
-	//   By default, the element will get a class `"ProseMirror"`, and
-	//   will have its `contentEditable` attribute determined by the
-	//   [`editable` prop](#view.EditorProps.editable). Additional classes
-	//   provided here will be added to the class. For other attributes,
-	//   the value provided first (as in
-	//   [`someProp`](#view.EditorView.someProp)) will be used.
-	//
-	//   scrollThreshold:: ?number
-	//   Determines the distance (in pixels) between the cursor and the
-	//   end of the visible viewport at which point, when scrolling the
-	//   cursor into view, scrolling takes place. Defaults to 0.
-	//
-	//   scrollMargin:: ?number
-	//   Determines the extra space (in pixels) that is left above or
-	//   below the cursor when it is scrolled into view. Defaults to 5.
-
-	// DirectEditorProps:: interface extends EditorProps
-	//
-	// The props object given directly to the editor view supports two
-	// fields that can't be used in plugins:
-	//
-	//   state:: EditorState
-	//   The current state of the editor.
-	//
-	//   dispatchTransaction:: ?(tr: Transaction)
-	//   The callback over which to send transactions (state updates)
-	//   produced by the view. If you specify this, you probably want to
-	//   make sure this ends up calling the view's
-	//   [`updateState`](#view.EditorView.updateState) method with a new
-	//   state that has the transaction
-	//   [applied](#state.EditorState.apply). The callback will be bound to have
-	//   the view instance as its `this` binding.
-
-	exports.EditorView = EditorView;
-	exports.Decoration = Decoration;
-	exports.DecorationSet = DecorationSet;
-	exports.__serializeForClipboard = serializeForClipboard;
-	exports.__parseFromClipboard = parseFromClipboard;
-
-	});
-
-	unwrapExports(dist$3);
-	var dist_1$3 = dist$3.EditorView;
-	var dist_2$3 = dist$3.Decoration;
-	var dist_3$3 = dist$3.DecorationSet;
-	var dist_4$3 = dist$3.__serializeForClipboard;
-	var dist_5$3 = dist$3.__parseFromClipboard;
-
-	var dropcursor = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-	var gecko = typeof navigator != "undefined" && /gecko\/\d/i.test(navigator.userAgent);
-	var linux = typeof navigator != "undefined" && /linux/i.test(navigator.platform);
-
-	function dropCursor(options) {
-	  function dispatch(view, data) {
-	    view.dispatch(view.state.tr.setMeta(plugin, data));
-	  }
-
-	  var timeout = null;
-	  function scheduleRemoval(view, time) {
-	    clearTimeout(timeout);
-	    timeout = setTimeout(function () {
-	      if (plugin.getState(view.state)) { dispatch(view, {type: "remove"}); }
-	    }, time);
-	  }
-
-	  var plugin = new dist$2.Plugin({
-	    state: {
-	      init: function init() { return null },
-	      apply: function apply(tr, prev, state) {
-	        // Firefox on Linux gets really confused an breaks dragging when we
-	        // mess with the nodes around the target node during a drag. So
-	        // disable this plugin there. See https://bugzilla.mozilla.org/show_bug.cgi?id=1323170
-	        if (gecko && linux) { return null }
-	        var command = tr.getMeta("uiEvent") == "drop" ? {type: "remove"} : tr.getMeta(plugin);
-	        if (!command) { return prev }
-	        if (command.type == "set") { return pluginStateFor(state, command.pos, options) }
-	        return null
-	      }
-	    },
-	    props: {
-	      handleDOMEvents: {
-	        dragover: function dragover(view, event) {
-	          var active = plugin.getState(view.state);
-	          var pos = view.posAtCoords({left: event.clientX, top: event.clientY});
-	          if (pos) {
-	            var target = pos.pos;
-	            if (view.dragging && view.dragging.slice) {
-	              target = dist$1.dropPoint(view.state.doc, target, view.dragging.slice);
-	              if (target == null) { target = pos.pos; }
-	            }
-	            if (!active || active.pos != target)
-	              { dispatch(view, {type: "set", pos: target}); }
-	          }
-	          scheduleRemoval(view, 5000);
-	          return false
-	        },
-
-	        dragend: function dragend(view) {
-	          scheduleRemoval(view, 20);
-	          return false
-	        },
-
-	        drop: function drop(view) {
-	          scheduleRemoval(view, 20);
-	          return false
-	        },
-
-	        dragleave: function dragleave(view, event) {
-	          if (event.target == view.dom || !view.dom.contains(event.relatedTarget)) { dispatch(view, {type: "remove"}); }
-	          return false
-	        }
-	      },
-	      decorations: function decorations(state) {
-	        var active = plugin.getState(state);
-	        return active && active.deco
-	      }
-	    }
-	  });
-	  return plugin
-	}
-
-	function style(options, side) {
-	  var width = (options && options.width) || 1;
-	  var color = (options && options.color) || "black";
-	  return ("border-" + side + ": " + width + "px solid " + color + "; margin-" + side + ": -" + width + "px")
-	}
-
-	function pluginStateFor(state, pos, options) {
-	  var $pos = state.doc.resolve(pos), deco;
-	  if (!$pos.parent.inlineContent) {
-	    var before, after;
-	    if (before = $pos.nodeBefore)
-	      { deco = dist$3.Decoration.node(pos - before.nodeSize, pos, {nodeName: "div", style: style(options, "right")}); }
-	    else if (after = $pos.nodeAfter)
-	      { deco = dist$3.Decoration.node(pos, pos + after.nodeSize, {nodeName: "div", style: style(options, "left")}); }
-	  }
-	  if (!deco) {
-	    var node = document.createElement("span");
-	    node.textContent = "\u200b";
-	    node.style.cssText = style(options, "left") + "; display: inline-block; pointer-events: none";
-	    deco = dist$3.Decoration.widget(pos, node);
-	  }
-	  return {pos: pos, deco: dist$3.DecorationSet.create(state.doc, [deco])}
-	}
-
-	exports.dropCursor = dropCursor;
-
-	});
-
-	unwrapExports(dropcursor);
-	var dropcursor_1 = dropcursor.dropCursor;
-
-	var base = {
-	  8: "Backspace",
-	  9: "Tab",
-	  10: "Enter",
-	  12: "NumLock",
-	  13: "Enter",
-	  16: "Shift",
-	  17: "Control",
-	  18: "Alt",
-	  20: "CapsLock",
-	  27: "Escape",
-	  32: " ",
-	  33: "PageUp",
-	  34: "PageDown",
-	  35: "End",
-	  36: "Home",
-	  37: "ArrowLeft",
-	  38: "ArrowUp",
-	  39: "ArrowRight",
-	  40: "ArrowDown",
-	  44: "PrintScreen",
-	  45: "Insert",
-	  46: "Delete",
-	  59: ";",
-	  61: "=",
-	  91: "Meta",
-	  92: "Meta",
-	  106: "*",
-	  107: "+",
-	  108: ",",
-	  109: "-",
-	  110: ".",
-	  111: "/",
-	  144: "NumLock",
-	  145: "ScrollLock",
-	  160: "Shift",
-	  161: "Shift",
-	  162: "Control",
-	  163: "Control",
-	  164: "Alt",
-	  165: "Alt",
-	  173: "-",
-	  186: ";",
-	  187: "=",
-	  188: ",",
-	  189: "-",
-	  190: ".",
-	  191: "/",
-	  192: "`",
-	  219: "[",
-	  220: "\\",
-	  221: "]",
-	  222: "'",
-	  229: "q"
-	};
-	var shift = {
-	  48: ")",
-	  49: "!",
-	  50: "@",
-	  51: "#",
-	  52: "$",
-	  53: "%",
-	  54: "^",
-	  55: "&",
-	  56: "*",
-	  57: "(",
-	  59: ";",
-	  61: "+",
-	  173: "_",
-	  186: ":",
-	  187: "+",
-	  188: "<",
-	  189: "_",
-	  190: ">",
-	  191: "?",
-	  192: "~",
-	  219: "{",
-	  220: "|",
-	  221: "}",
-	  222: "\"",
-	  229: "Q"
-	};
-
-	var chrome = typeof navigator != "undefined" && /Chrome\/(\d+)/.exec(navigator.userAgent);
-	var safari = typeof navigator != "undefined" && /Apple Computer/.test(navigator.vendor);
-	var gecko = typeof navigator != "undefined" && /Gecko\/\d+/.test(navigator.userAgent);
-	var mac = typeof navigator != "undefined" && /Mac/.test(navigator.platform);
-	var brokenModifierNames = chrome && (mac || +chrome[1] < 57) || gecko && mac;
-
-	// Fill in the digit keys
-	for (var i = 0; i < 10; i++) { base[48 + i] = base[96 + i] = String(i); }
-
-	// The function keys
-	for (var i = 1; i <= 24; i++) { base[i + 111] = "F" + i; }
-
-	// And the alphabetic keys
-	for (var i = 65; i <= 90; i++) {
-	  base[i] = String.fromCharCode(i + 32);
-	  shift[i] = String.fromCharCode(i);
-	}
-
-	// For each code that doesn't have a shift-equivalent, copy the base name
-	for (var code in base) { if (!shift.hasOwnProperty(code)) { shift[code] = base[code]; } }
-
-	function keyName(event) {
-	  // Don't trust event.key in Chrome when there are modifiers until
-	  // they fix https://bugs.chromium.org/p/chromium/issues/detail?id=633838
-	  var ignoreKey = brokenModifierNames && (event.ctrlKey || event.altKey || event.metaKey) ||
-	    safari && event.shiftKey && event.key && event.key.length == 1;
-	  var name = (!ignoreKey && event.key) ||
-	    (event.shiftKey ? shift : base)[event.keyCode] ||
-	    event.key || "Unidentified";
-	  // Edge sometimes produces wrong names (Issue #3)
-	  if (name == "Esc") { name = "Escape"; }
-	  if (name == "Del") { name = "Delete"; }
-	  // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/
-	  if (name == "Left") { name = "ArrowLeft"; }
-	  if (name == "Up") { name = "ArrowUp"; }
-	  if (name == "Right") { name = "ArrowRight"; }
-	  if (name == "Down") { name = "ArrowDown"; }
-	  return name
-	}
-
-	var w3cKeyname = keyName;
-	keyName.base = base;
-	keyName.shift = shift;
-
-	var keymap_1 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-	function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-	var keyName = _interopDefault(w3cKeyname);
-
-
-	// declare global: navigator
-
-	var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform) : false;
-
-	function normalizeKeyName(name) {
-	  var parts = name.split(/-(?!$)/), result = parts[parts.length - 1];
-	  if (result == "Space") { result = " "; }
-	  var alt, ctrl, shift, meta;
-	  for (var i = 0; i < parts.length - 1; i++) {
-	    var mod = parts[i];
-	    if (/^(cmd|meta|m)$/i.test(mod)) { meta = true; }
-	    else if (/^a(lt)?$/i.test(mod)) { alt = true; }
-	    else if (/^(c|ctrl|control)$/i.test(mod)) { ctrl = true; }
-	    else if (/^s(hift)?$/i.test(mod)) { shift = true; }
-	    else if (/^mod$/i.test(mod)) { if (mac) { meta = true; } else { ctrl = true; } }
-	    else { throw new Error("Unrecognized modifier name: " + mod) }
-	  }
-	  if (alt) { result = "Alt-" + result; }
-	  if (ctrl) { result = "Ctrl-" + result; }
-	  if (meta) { result = "Meta-" + result; }
-	  if (shift) { result = "Shift-" + result; }
-	  return result
-	}
-
-	function normalize(map) {
-	  var copy = Object.create(null);
-	  for (var prop in map) { copy[normalizeKeyName(prop)] = map[prop]; }
-	  return copy
-	}
-
-	function modifiers(name, event, shift) {
-	  if (event.altKey) { name = "Alt-" + name; }
-	  if (event.ctrlKey) { name = "Ctrl-" + name; }
-	  if (event.metaKey) { name = "Meta-" + name; }
-	  if (shift !== false && event.shiftKey) { name = "Shift-" + name; }
-	  return name
-	}
-
-	// :: (Object) → Plugin
-	// Create a keymap plugin for the given set of bindings.
-	//
-	// Bindings should map key names to [command](#commands)-style
-	// functions, which will be called with `(EditorState, dispatch,
-	// EditorView)` arguments, and should return true when they've handled
-	// the key. Note that the view argument isn't part of the command
-	// protocol, but can be used as an escape hatch if a binding needs to
-	// directly interact with the UI.
-	//
-	// Key names may be strings like `"Shift-Ctrl-Enter"`—a key
-	// identifier prefixed with zero or more modifiers. Key identifiers
-	// are based on the strings that can appear in
-	// [`KeyEvent.key`](https://developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).
-	// Use lowercase letters to refer to letter keys (or uppercase letters
-	// if you want shift to be held). You may use `"Space"` as an alias
-	// for the `" "` name.
-	//
-	// Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or
-	// `a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or
-	// `Meta-`) are recognized. For characters that are created by holding
-	// shift, the `Shift-` prefix is implied, and should not be added
-	// explicitly.
-	//
-	// You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on
-	// other platforms.
-	//
-	// You can add multiple keymap plugins to an editor. The order in
-	// which they appear determines their precedence (the ones early in
-	// the array get to dispatch first).
-	function keymap(bindings) {
-	  return new dist$2.Plugin({props: {handleKeyDown: keydownHandler(bindings)}})
-	}
-
-	// :: (Object) → (view: EditorView, event: dom.Event) → bool
-	// Given a set of bindings (using the same format as
-	// [`keymap`](#keymap.keymap), return a [keydown
-	// handler](#view.EditorProps.handleKeyDown) handles them.
-	function keydownHandler(bindings) {
-	  var map = normalize(bindings);
-	  return function(view, event) {
-	    var name = keyName(event), isChar = name.length == 1 && name != " ", baseName;
-	    var direct = map[modifiers(name, event, !isChar)];
-	    if (direct && direct(view.state, view.dispatch, view)) { return true }
-	    if (isChar && (event.shiftKey || event.altKey || event.metaKey) &&
-	        (baseName = keyName.base[event.keyCode]) && baseName != name) {
-	      var fromCode = map[modifiers(baseName, event, true)];
-	      if (fromCode && fromCode(view.state, view.dispatch, view)) { return true }
-	    }
-	    return false
-	  }
-	}
-
-	exports.keymap = keymap;
-	exports.keydownHandler = keydownHandler;
-
-	});
-
-	unwrapExports(keymap_1);
-	var keymap_2 = keymap_1.keymap;
-	var keymap_3 = keymap_1.keydownHandler;
-
-	var dist$4 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-
-	// ::- Gap cursor selections are represented using this class. Its
-	// `$anchor` and `$head` properties both point at the cursor position.
-	var GapCursor = (function (Selection$$1) {
-	  function GapCursor($pos) {
-	    Selection$$1.call(this, $pos, $pos);
-	  }
-
-	  if ( Selection$$1 ) { GapCursor.__proto__ = Selection$$1; }
-	  GapCursor.prototype = Object.create( Selection$$1 && Selection$$1.prototype );
-	  GapCursor.prototype.constructor = GapCursor;
-
-	  GapCursor.prototype.map = function map (doc, mapping) {
-	    var $pos = doc.resolve(mapping.map(this.head));
-	    return GapCursor.valid($pos) ? new GapCursor($pos) : Selection$$1.near($pos)
-	  };
-
-	  GapCursor.prototype.content = function content () { return dist.Slice.empty };
-
-	  GapCursor.prototype.eq = function eq (other) {
-	    return other instanceof GapCursor && other.head == this.head
-	  };
-
-	  GapCursor.prototype.toJSON = function toJSON () {
-	    return {type: "gapcursor", pos: this.head}
-	  };
-
-	  GapCursor.fromJSON = function fromJSON (doc, json) {
-	    if (typeof json.pos != "number") { throw new RangeError("Invalid input for GapCursor.fromJSON") }
-	    return new GapCursor(doc.resolve(json.pos))
-	  };
-
-	  GapCursor.prototype.getBookmark = function getBookmark () { return new GapBookmark(this.anchor) };
-
-	  GapCursor.valid = function valid ($pos) {
-	    var parent = $pos.parent;
-	    if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos)) { return false }
-	    var override = parent.type.spec.allowGapCursor;
-	    if (override != null) { return override }
-	    var deflt = parent.contentMatchAt($pos.index()).defaultType;
-	    return deflt && deflt.isTextblock
-	  };
-
-	  GapCursor.findFrom = function findFrom ($pos, dir, mustMove) {
-	    if (!mustMove && GapCursor.valid($pos)) { return $pos }
-
-	    var pos = $pos.pos, next = null;
-	    // Scan up from this position
-	    for (var d = $pos.depth;; d--) {
-	      var parent = $pos.node(d);
-	      if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {
-	        next = parent.maybeChild(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);
-	        break
-	      } else if (d == 0) {
-	        return null
-	      }
-	      pos += dir;
-	      var $cur = $pos.doc.resolve(pos);
-	      if (GapCursor.valid($cur)) { return $cur }
-	    }
-
-	    // And then down into the next node
-	    for (;;) {
-	      next = dir > 0 ? next.firstChild : next.lastChild;
-	      if (!next) { break }
-	      pos += dir;
-	      var $cur$1 = $pos.doc.resolve(pos);
-	      if (GapCursor.valid($cur$1)) { return $cur$1 }
-	    }
-
-	    return null
-	  };
-
-	  return GapCursor;
-	}(dist$2.Selection));
-
-	GapCursor.prototype.visible = false;
-
-	dist$2.Selection.jsonID("gapcursor", GapCursor);
-
-	var GapBookmark = function GapBookmark(pos) {
-	  this.pos = pos;
-	};
-	GapBookmark.prototype.map = function map (mapping) {
-	  return new GapBookmark(mapping.map(this.pos))
-	};
-	GapBookmark.prototype.resolve = function resolve (doc) {
-	  var $pos = doc.resolve(this.pos);
-	  return GapCursor.valid($pos) ? new GapCursor($pos) : dist$2.Selection.near($pos)
-	};
-
-	function closedBefore($pos) {
-	  for (var d = $pos.depth; d >= 0; d--) {
-	    var index = $pos.index(d);
-	    // At the start of this parent, look at next one
-	    if (index == 0) { continue }
-	    // See if the node before (or its first ancestor) is closed
-	    for (var before = $pos.node(d).child(index - 1);; before = before.lastChild) {
-	      if (before.isTextblock) { return false }
-	      if (before.childCount == 0 || before.isAtom || before.type.spec.isolating) { return true }
-	    }
-	  }
-	  // Hit start of document
-	  return true
-	}
-
-	function closedAfter($pos) {
-	  for (var d = $pos.depth; d >= 0; d--) {
-	    var index = $pos.indexAfter(d), parent = $pos.node(d);
-	    if (index == parent.childCount) { continue }
-	    for (var after = parent.child(index);; after = after.firstChild) {
-	      if (after.isTextblock) { return false }
-	      if (after.childCount == 0 || after.isAtom || after.type.spec.isolating) { return true }
-	    }
-	  }
-	  return true
-	}
-
-	// :: () → Plugin
-	// Create a gap cursor plugin. When enabled, this will capture clicks
-	// near and arrow-key-motion past places that don't have a normally
-	// selectable position nearby, and create a gap cursor selection for
-	// them. The cursor is drawn as an element with class
-	// `ProseMirror-gapcursor`. You can either include
-	// `style/gapcursor.css` from the package's directory or add your own
-	// styles to make it visible.
-	var gapCursor = function() {
-	  return new dist$2.Plugin({
-	    props: {
-	      decorations: drawGapCursor,
-
-	      createSelectionBetween: function createSelectionBetween(_view, $anchor, $head) {
-	        if ($anchor.pos == $head.pos && GapCursor.valid($head)) { return new GapCursor($head) }
-	      },
-
-	      handleClick: handleClick,
-	      handleKeyDown: handleKeyDown
-	    }
-	  })
-	};
-
-	var handleKeyDown = keymap_1.keydownHandler({
-	  "ArrowLeft": arrow("horiz", -1),
-	  "ArrowRight": arrow("horiz", 1),
-	  "ArrowUp": arrow("vert", -1),
-	  "ArrowDown": arrow("vert", 1)
-	});
-
-	function arrow(axis, dir) {
-	  var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
-	  return function(state, dispatch, view) {
-	    var sel = state.selection;
-	    var $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;
-	    if (sel instanceof dist$2.TextSelection) {
-	      if (!view.endOfTextblock(dirStr)) { return false }
-	      mustMove = false;
-	      $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());
-	    }
-	    var $found = GapCursor.findFrom($start, dir, mustMove);
-	    if (!$found) { return false }
-	    if (dispatch) { dispatch(state.tr.setSelection(new GapCursor($found))); }
-	    return true
-	  }
-	}
-
-	function handleClick(view, pos, event) {
-	  var $pos = view.state.doc.resolve(pos);
-	  if (!GapCursor.valid($pos)) { return false }
-	  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
-	  var inside = ref.inside;
-	  if (inside > -1 && dist$2.NodeSelection.isSelectable(view.state.doc.nodeAt(inside))) { return false }
-	  view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));
-	  return true
-	}
-
-	function drawGapCursor(state) {
-	  if (!(state.selection instanceof GapCursor)) { return null }
-	  var node = document.createElement("div");
-	  node.className = "ProseMirror-gapcursor";
-	  return dist$3.DecorationSet.create(state.doc, [dist$3.Decoration.widget(state.selection.head, node, {key: "gapcursor"})])
-	}
-
-	exports.gapCursor = gapCursor;
-	exports.GapCursor = GapCursor;
-
-	});
-
-	unwrapExports(dist$4);
-	var dist_1$4 = dist$4.gapCursor;
-	var dist_2$4 = dist$4.GapCursor;
-
-	var GOOD_LEAF_SIZE = 200;
-
-	// :: class<T> A rope sequence is a persistent sequence data structure
-	// that supports appending, prepending, and slicing without doing a
-	// full copy. It is represented as a mostly-balanced tree.
-	var RopeSequence = function RopeSequence () {};
-
-	RopeSequence.prototype.append = function append (other) {
-	  if (!other.length) { return this }
-	  other = RopeSequence.from(other);
-
-	  return (!this.length && other) ||
-	    (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||
-	    (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||
-	    this.appendInner(other)
-	};
-
-	// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>
-	// Prepend an array or other rope to this one, returning a new rope.
-	RopeSequence.prototype.prepend = function prepend (other) {
-	  if (!other.length) { return this }
-	  return RopeSequence.from(other).append(this)
-	};
-
-	RopeSequence.prototype.appendInner = function appendInner (other) {
-	  return new Append(this, other)
-	};
-
-	// :: (?number, ?number) → RopeSequence<T>
-	// Create a rope repesenting a sub-sequence of this rope.
-	RopeSequence.prototype.slice = function slice (from, to) {
-	    if ( from === void 0 ) { from = 0; }
-	    if ( to === void 0 ) { to = this.length; }
-
-	  if (from >= to) { return RopeSequence.empty }
-	  return this.sliceInner(Math.max(0, from), Math.min(this.length, to))
-	};
-
-	// :: (number) → T
-	// Retrieve the element at the given position from this rope.
-	RopeSequence.prototype.get = function get (i) {
-	  if (i < 0 || i >= this.length) { return undefined }
-	  return this.getInner(i)
-	};
-
-	// :: ((element: T, index: number) → ?bool, ?number, ?number)
-	// Call the given function for each element between the given
-	// indices. This tends to be more efficient than looping over the
-	// indices and calling `get`, because it doesn't have to descend the
-	// tree for every element.
-	RopeSequence.prototype.forEach = function forEach (f, from, to) {
-	    if ( from === void 0 ) { from = 0; }
-	    if ( to === void 0 ) { to = this.length; }
-
-	  if (from <= to)
-	    { this.forEachInner(f, from, to, 0); }
-	  else
-	    { this.forEachInvertedInner(f, from, to, 0); }
-	};
-
-	// :: ((element: T, index: number) → U, ?number, ?number) → [U]
-	// Map the given functions over the elements of the rope, producing
-	// a flat array.
-	RopeSequence.prototype.map = function map (f, from, to) {
-	    if ( from === void 0 ) { from = 0; }
-	    if ( to === void 0 ) { to = this.length; }
-
-	  var result = [];
-	  this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);
-	  return result
-	};
-
-	// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>
-	// Create a rope representing the given array, or return the rope
-	// itself if a rope was given.
-	RopeSequence.from = function from (values) {
-	  if (values instanceof RopeSequence) { return values }
-	  return values && values.length ? new Leaf(values) : RopeSequence.empty
-	};
-
-	var Leaf = (function (RopeSequence) {
-	  function Leaf(values) {
-	    RopeSequence.call(this);
-	    this.values = values;
-	  }
-
-	  if ( RopeSequence ) { Leaf.__proto__ = RopeSequence; }
-	  Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );
-	  Leaf.prototype.constructor = Leaf;
-
-	  var prototypeAccessors = { length: {},depth: {} };
-
-	  Leaf.prototype.flatten = function flatten () {
-	    return this.values
-	  };
-
-	  Leaf.prototype.sliceInner = function sliceInner (from, to) {
-	    if (from == 0 && to == this.length) { return this }
-	    return new Leaf(this.values.slice(from, to))
-	  };
-
-	  Leaf.prototype.getInner = function getInner (i) {
-	    return this.values[i]
-	  };
-
-	  Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {
-	    var this$1 = this;
-
-	    for (var i = from; i < to; i++)
-	      { if (f(this$1.values[i], start + i) === false) { return false } }
-	  };
-
-	  Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {
-	    var this$1 = this;
-
-	    for (var i = from - 1; i >= to; i--)
-	      { if (f(this$1.values[i], start + i) === false) { return false } }
-	  };
-
-	  Leaf.prototype.leafAppend = function leafAppend (other) {
-	    if (this.length + other.length <= GOOD_LEAF_SIZE)
-	      { return new Leaf(this.values.concat(other.flatten())) }
-	  };
-
-	  Leaf.prototype.leafPrepend = function leafPrepend (other) {
-	    if (this.length + other.length <= GOOD_LEAF_SIZE)
-	      { return new Leaf(other.flatten().concat(this.values)) }
-	  };
-
-	  prototypeAccessors.length.get = function () { return this.values.length };
-
-	  prototypeAccessors.depth.get = function () { return 0 };
-
-	  Object.defineProperties( Leaf.prototype, prototypeAccessors );
-
-	  return Leaf;
-	}(RopeSequence));
-
-	// :: RopeSequence
-	// The empty rope sequence.
-	RopeSequence.empty = new Leaf([]);
-
-	var Append = (function (RopeSequence) {
-	  function Append(left, right) {
-	    RopeSequence.call(this);
-	    this.left = left;
-	    this.right = right;
-	    this.length = left.length + right.length;
-	    this.depth = Math.max(left.depth, right.depth) + 1;
-	  }
-
-	  if ( RopeSequence ) { Append.__proto__ = RopeSequence; }
-	  Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );
-	  Append.prototype.constructor = Append;
-
-	  Append.prototype.flatten = function flatten () {
-	    return this.left.flatten().concat(this.right.flatten())
-	  };
-
-	  Append.prototype.getInner = function getInner (i) {
-	    return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)
-	  };
-
-	  Append.prototype.forEachInner = function forEachInner (f, from, to, start) {
-	    var leftLen = this.left.length;
-	    if (from < leftLen &&
-	        this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)
-	      { return false }
-	    if (to > leftLen &&
-	        this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)
-	      { return false }
-	  };
-
-	  Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {
-	    var leftLen = this.left.length;
-	    if (from > leftLen &&
-	        this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)
-	      { return false }
-	    if (to < leftLen &&
-	        this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)
-	      { return false }
-	  };
-
-	  Append.prototype.sliceInner = function sliceInner (from, to) {
-	    if (from == 0 && to == this.length) { return this }
-	    var leftLen = this.left.length;
-	    if (to <= leftLen) { return this.left.slice(from, to) }
-	    if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }
-	    return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))
-	  };
-
-	  Append.prototype.leafAppend = function leafAppend (other) {
-	    var inner = this.right.leafAppend(other);
-	    if (inner) { return new Append(this.left, inner) }
-	  };
-
-	  Append.prototype.leafPrepend = function leafPrepend (other) {
-	    var inner = this.left.leafPrepend(other);
-	    if (inner) { return new Append(inner, this.right) }
-	  };
-
-	  Append.prototype.appendInner = function appendInner (other) {
-	    if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)
-	      { return new Append(this.left, new Append(this.right, other)) }
-	    return new Append(this, other)
-	  };
-
-	  return Append;
-	}(RopeSequence));
-
-	var dist$5 = RopeSequence;
-
-	var history_1 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-	function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; }
-
-	var RopeSequence = _interopDefault(dist$5);
-
-
-
-	// ProseMirror's history isn't simply a way to roll back to a previous
-	// state, because ProseMirror supports applying changes without adding
-	// them to the history (for example during collaboration).
-	//
-	// To this end, each 'Branch' (one for the undo history and one for
-	// the redo history) keeps an array of 'Items', which can optionally
-	// hold a step (an actual undoable change), and always hold a position
-	// map (which is needed to move changes below them to apply to the
-	// current document).
-	//
-	// An item that has both a step and a selection bookmark is the start
-	// of an 'event' — a group of changes that will be undone or redone at
-	// once. (It stores only the bookmark, since that way we don't have to
-	// provide a document until the selection is actually applied, which
-	// is useful when compressing.)
-
-	// Used to schedule history compression
-	var max_empty_items = 500;
-
-	var Branch = function Branch(items, eventCount) {
-	  this.items = items;
-	  this.eventCount = eventCount;
-	};
-
-	// : (Node, bool, ?Item) → ?{transform: Transform, selection: Object}
-	// Pop the latest event off the branch's history and apply it
-	// to a document transform.
-	Branch.prototype.popEvent = function popEvent (state, preserveItems) {
-	    var this$1 = this;
-
-	  if (this.eventCount == 0) { return null }
-
-	  var end = this.items.length;
-	  for (;; end--) {
-	    var next = this$1.items.get(end - 1);
-	    if (next.selection) { --end; break }
-	  }
-
-	  var remap, mapFrom;
-	  if (preserveItems) {
-	    remap = this.remapping(end, this.items.length);
-	    mapFrom = remap.maps.length;
-	  }
-	  var transform = state.tr;
-	  var selection, remaining;
-	  var addAfter = [], addBefore = [];
-
-	  this.items.forEach(function (item, i) {
-	    if (!item.step) {
-	      if (!remap) {
-	        remap = this$1.remapping(end, i + 1);
-	        mapFrom = remap.maps.length;
-	      }
-	      mapFrom--;
-	      addBefore.push(item);
-	      return
-	    }
-
-	    if (remap) {
-	      addBefore.push(new Item(item.map));
-	      var step = item.step.map(remap.slice(mapFrom)), map;
-
-	      if (step && transform.maybeStep(step).doc) {
-	        map = transform.mapping.maps[transform.mapping.maps.length - 1];
-	        addAfter.push(new Item(map, null, null, addAfter.length + addBefore.length));
-	      }
-	      mapFrom--;
-	      if (map) { remap.appendMap(map, mapFrom); }
-	    } else {
-	      transform.maybeStep(item.step);
-	    }
-
-	    if (item.selection) {
-	      selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;
-	      remaining = new Branch(this$1.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this$1.eventCount - 1);
-	      return false
-	    }
-	  }, this.items.length, 0);
-
-	  return {remaining: remaining, transform: transform, selection: selection}
-	};
-
-	// : (Transform, Selection, Object)
-	// Create a new branch with the given transform added.
-	Branch.prototype.addTransform = function addTransform (transform, selection, histOptions, preserveItems) {
-	  var newItems = [], eventCount = this.eventCount;
-	  var oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;
-
-	  for (var i = 0; i < transform.steps.length; i++) {
-	    var step = transform.steps[i].invert(transform.docs[i]);
-	    var item = new Item(transform.mapping.maps[i], step, selection), merged = (void 0);
-	    if (merged = lastItem && lastItem.merge(item)) {
-	      item = merged;
-	      if (i) { newItems.pop(); }
-	      else { oldItems = oldItems.slice(0, oldItems.length - 1); }
-	    }
-	    newItems.push(item);
-	    if (selection) {
-	      eventCount++;
-	      selection = null;
-	    }
-	    if (!preserveItems) { lastItem = item; }
-	  }
-	  var overflow = eventCount - histOptions.depth;
-	  if (overflow > DEPTH_OVERFLOW) {
-	    oldItems = cutOffEvents(oldItems, overflow);
-	    eventCount -= overflow;
-	  }
-	  return new Branch(oldItems.append(newItems), eventCount)
-	};
-
-	Branch.prototype.remapping = function remapping (from, to) {
-	  var maps = [], mirrors = [];
-	  this.items.forEach(function (item, i) {
-	    if (item.mirrorOffset != null) {
-	      var mirrorPos = i - item.mirrorOffset;
-	      if (mirrorPos >= from) { mirrors.push(maps.length - item.mirrorOffset, maps.length); }
-	    }
-	    maps.push(item.map);
-	  }, from, to);
-	  return new dist$1.Mapping(maps, mirrors)
-	};
-
-	Branch.prototype.addMaps = function addMaps (array) {
-	  if (this.eventCount == 0) { return this }
-	  return new Branch(this.items.append(array.map(function (map) { return new Item(map); })), this.eventCount)
-	};
-
-	// : ([StepMap], Transform, [number])
-	// When the collab module receives remote changes, the history has
-	// to know about those, so that it can adjust the steps that were
-	// rebased on top of the remote changes, and include the position
-	// maps for the remote changes in its array of items.
-	Branch.prototype.rebased = function rebased (rebasedTransform, rebasedCount) {
-	  if (!this.eventCount) { return this }
-
-	  var rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);
-
-	  var mapping = rebasedTransform.mapping;
-	  var newUntil = rebasedTransform.steps.length;
-	  var eventCount = this.eventCount;
-	  this.items.forEach(function (item) { if (item.selection) { eventCount--; } }, this.items.length - rebasedCount);
-
-	  var iRebased = rebasedCount;
-	  this.items.forEach(function (item) {
-	    var pos = mapping.getMirror(--iRebased);
-	    if (pos == null) { return }
-	    newUntil = Math.min(newUntil, pos);
-	    var map = mapping.maps[pos];
-	    if (item.step) {
-	      var step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);
-	      var selection = item.selection && item.selection.map(mapping.slice(iRebased, pos));
-	      if (selection) { eventCount++; }
-	      rebasedItems.push(new Item(map, step, selection));
-	    } else {
-	      rebasedItems.push(new Item(map));
-	    }
-	  }, start);
-
-	  var newMaps = [];
-	  for (var i = rebasedCount; i < newUntil; i++)
-	    { newMaps.push(new Item(mapping.maps[i])); }
-	  var items = this.items.slice(0, start).append(newMaps).append(rebasedItems);
-	  var branch = new Branch(items, eventCount);
-
-	  if (branch.emptyItemCount() > max_empty_items)
-	    { branch = branch.compress(this.items.length - rebasedItems.length); }
-	  return branch
-	};
-
-	Branch.prototype.emptyItemCount = function emptyItemCount () {
-	  var count = 0;
-	  this.items.forEach(function (item) { if (!item.step) { count++; } });
-	  return count
-	};
-
-	// Compressing a branch means rewriting it to push the air (map-only
-	// items) out. During collaboration, these naturally accumulate
-	// because each remote change adds one. The `upto` argument is used
-	// to ensure that only the items below a given level are compressed,
-	// because `rebased` relies on a clean, untouched set of items in
-	// order to associate old items with rebased steps.
-	Branch.prototype.compress = function compress (upto) {
-	    if ( upto === void 0 ) { upto = this.items.length; }
-
-	  var remap = this.remapping(0, upto), mapFrom = remap.maps.length;
-	  var items = [], events = 0;
-	  this.items.forEach(function (item, i) {
-	    if (i >= upto) {
-	      items.push(item);
-	      if (item.selection) { events++; }
-	    } else if (item.step) {
-	      var step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();
-	      mapFrom--;
-	      if (map) { remap.appendMap(map, mapFrom); }
-	      if (step) {
-	        var selection = item.selection && item.selection.map(remap.slice(mapFrom));
-	        if (selection) { events++; }
-	        var newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;
-	        if (merged = items.length && items[last].merge(newItem))
-	          { items[last] = merged; }
-	        else
-	          { items.push(newItem); }
-	      }
-	    } else if (item.map) {
-	      mapFrom--;
-	    }
-	  }, this.items.length, 0);
-	  return new Branch(RopeSequence.from(items.reverse()), events)
-	};
-
-	Branch.empty = new Branch(RopeSequence.empty, 0);
-
-	function cutOffEvents(items, n) {
-	  var cutPoint;
-	  items.forEach(function (item, i) {
-	    if (item.selection && (n-- == 0)) {
-	      cutPoint = i;
-	      return false
-	    }
-	  });
-	  return items.slice(cutPoint)
-	}
-
-	var Item = function Item(map, step, selection, mirrorOffset) {
-	  this.map = map;
-	  this.step = step;
-	  this.selection = selection;
-	  this.mirrorOffset = mirrorOffset;
-	};
-
-	Item.prototype.merge = function merge (other) {
-	  if (this.step && other.step && !other.selection) {
-	    var step = other.step.merge(this.step);
-	    if (step) { return new Item(step.getMap().invert(), step, this.selection) }
-	  }
-	};
-
-	// The value of the state field that tracks undo/redo history for that
-	// state. Will be stored in the plugin state when the history plugin
-	// is active.
-	var HistoryState = function HistoryState(done, undone, prevMap, prevTime) {
-	  this.done = done;
-	  this.undone = undone;
-	  this.prevMap = prevMap;
-	  this.prevTime = prevTime;
-	};
-
-	var DEPTH_OVERFLOW = 20;
-
-	// : (EditorState, EditorState, Selection, Object)
-	// Record a transformation in undo history.
-	function applyTransaction(history, state, tr, options) {
-	  var newState = tr.getMeta(historyKey), rebased;
-	  if (newState) { return newState }
-
-	  if (tr.getMeta(closeHistoryKey)) { history = new HistoryState(history.done, history.undone, null, 0); }
-
-	  var appended = tr.getMeta("appendedTransaction");
-	  if (tr.steps.length == 0) {
-	    return history
-	  } else if ((appended || tr).getMeta("addToHistory") !== false) {
-	    // Group transforms that occur in quick succession into one event.
-	    var newGroup = history.prevTime < (tr.time || 0) - options.newGroupDelay ||
-	        !appended && !isAdjacentToLastStep(tr, history.prevMap, history.done);
-	    return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : null,
-	                                                      options, mustPreserveItems(state)),
-	                            Branch.empty, tr.mapping.maps[tr.steps.length - 1], tr.time)
-	  } else if (rebased = tr.getMeta("rebased")) {
-	    // Used by the collab module to tell the history that some of its
-	    // content has been rebased.
-	    return new HistoryState(history.done.rebased(tr, rebased),
-	                            history.undone.rebased(tr, rebased),
-	                            history.prevMap && tr.mapping.maps[tr.steps.length - 1], history.prevTime)
-	  } else {
-	    return new HistoryState(history.done.addMaps(tr.mapping.maps),
-	                            history.undone.addMaps(tr.mapping.maps),
-	                            history.prevMap, history.prevTime)
-	  }
-	}
-
-	function isAdjacentToLastStep(transform, prevMap, done) {
-	  if (!prevMap) { return false }
-	  var firstMap = transform.mapping.maps[0], adjacent = false;
-	  if (!firstMap) { return true }
-	  firstMap.forEach(function (start, end) {
-	    done.items.forEach(function (item) {
-	      if (item.step) {
-	        prevMap.forEach(function (_start, _end, rStart, rEnd) {
-	          if (start <= rEnd && end >= rStart) { adjacent = true; }
-	        });
-	        return false
-	      } else {
-	        start = item.map.invert().map(start, -1);
-	        end = item.map.invert().map(end, 1);
-	      }
-	    }, done.items.length, 0);
-	  });
-	  return adjacent
-	}
-
-	// : (HistoryState, EditorState, (tr: Transaction), bool)
-	// Apply the latest event from one branch to the document and optionally
-	// shift the event onto the other branch. Returns true when an event could
-	// be shifted.
-	function histTransaction(history, state, dispatch, redo) {
-	  var preserveItems = mustPreserveItems(state), histOptions = historyKey.get(state).spec.config;
-	  var pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);
-	  if (!pop) { return }
-
-	  var selection = pop.selection.resolve(pop.transform.doc);
-	  var added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(),
-	                                                                  histOptions, preserveItems);
-
-	  var newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0);
-	  dispatch(pop.transform.setSelection(selection).setMeta(historyKey, newHist).scrollIntoView());
-	}
-
-	var cachedPreserveItems = false;
-	var cachedPreserveItemsPlugins = null;
-	// Check whether any plugin in the given state has a
-	// `historyPreserveItems` property in its spec, in which case we must
-	// preserve steps exactly as they came in, so that they can be
-	// rebased.
-	function mustPreserveItems(state) {
-	  var plugins = state.plugins;
-	  if (cachedPreserveItemsPlugins != plugins) {
-	    cachedPreserveItems = false;
-	    cachedPreserveItemsPlugins = plugins;
-	    for (var i = 0; i < plugins.length; i++) { if (plugins[i].spec.historyPreserveItems) {
-	      cachedPreserveItems = true;
-	      break
-	    } }
-	  }
-	  return cachedPreserveItems
-	}
-
-	// :: (Transaction) → Transaction
-	// Set a flag on the given transaction that will prevent further steps
-	// from being appended to an existing history event (so that they
-	// require a separate undo command to undo).
-	function closeHistory(tr) {
-	  return tr.setMeta(closeHistoryKey, true)
-	}
-
-	var historyKey = new dist$2.PluginKey("history");
-	var closeHistoryKey = new dist$2.PluginKey("closeHistory");
-
-	// :: (?Object) → Plugin
-	// Returns a plugin that enables the undo history for an editor. The
-	// plugin will track undo and redo stacks, which can be used with the
-	// [`undo`](#history.undo) and [`redo`](#history.redo) commands.
-	//
-	// You can set an `"addToHistory"` [metadata
-	// property](#state.Transaction.setMeta) of `false` on a transaction
-	// to prevent it from being rolled back by undo.
-	//
-	//   config::-
-	//   Supports the following configuration options:
-	//
-	//     depth:: ?number
-	//     The amount of history events that are collected before the
-	//     oldest events are discarded. Defaults to 100.
-	//
-	//     newGroupDelay:: ?number
-	//     The delay between changes after which a new group should be
-	//     started. Defaults to 500 (milliseconds). Note that when changes
-	//     aren't adjacent, a new group is always started.
-	function history(config) {
-	  config = {depth: config && config.depth || 100,
-	            newGroupDelay: config && config.newGroupDelay || 500};
-	  return new dist$2.Plugin({
-	    key: historyKey,
-
-	    state: {
-	      init: function init() {
-	        return new HistoryState(Branch.empty, Branch.empty, null, 0)
-	      },
-	      apply: function apply(tr, hist, state) {
-	        return applyTransaction(hist, state, tr, config)
-	      }
-	    },
-
-	    config: config
-	  })
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// A command function that undoes the last change, if any.
-	function undo(state, dispatch) {
-	  var hist = historyKey.getState(state);
-	  if (!hist || hist.done.eventCount == 0) { return false }
-	  if (dispatch) { histTransaction(hist, state, dispatch, false); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// A command function that redoes the last undone change, if any.
-	function redo(state, dispatch) {
-	  var hist = historyKey.getState(state);
-	  if (!hist || hist.undone.eventCount == 0) { return false }
-	  if (dispatch) { histTransaction(hist, state, dispatch, true); }
-	  return true
-	}
-
-	// :: (EditorState) → number
-	// The amount of undoable events available in a given state.
-	function undoDepth(state) {
-	  var hist = historyKey.getState(state);
-	  return hist ? hist.done.eventCount : 0
-	}
-
-	// :: (EditorState) → number
-	// The amount of redoable events available in a given editor state.
-	function redoDepth(state) {
-	  var hist = historyKey.getState(state);
-	  return hist ? hist.undone.eventCount : 0
-	}
-
-	exports.HistoryState = HistoryState;
-	exports.closeHistory = closeHistory;
-	exports.history = history;
-	exports.undo = undo;
-	exports.redo = redo;
-	exports.undoDepth = undoDepth;
-	exports.redoDepth = redoDepth;
-
-	});
-
-	unwrapExports(history_1);
-	var history_2 = history_1.HistoryState;
-	var history_3 = history_1.closeHistory;
-	var history_4 = history_1.history;
-	var history_5 = history_1.undo;
-	var history_6 = history_1.redo;
-	var history_7 = history_1.undoDepth;
-	var history_8 = history_1.redoDepth;
-
-	var commands = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Delete the selection, if there is one.
-	function deleteSelection(state, dispatch) {
-	  if (state.selection.empty) { return false }
-	  if (dispatch) { dispatch(state.tr.deleteSelection().scrollIntoView()); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-	// If the selection is empty and at the start of a textblock, try to
-	// reduce the distance between that block and the one before it—if
-	// there's a block directly before it that can be joined, join them.
-	// If not, try to move the selected block closer to the next one in
-	// the document structure by lifting it out of its parent or moving it
-	// into a parent of the previous block. Will use the view for accurate
-	// (bidi-aware) start-of-textblock detection if given.
-	function joinBackward(state, dispatch, view) {
-	  var ref = state.selection;
-	  var $cursor = ref.$cursor;
-	  if (!$cursor || (view ? !view.endOfTextblock("backward", state)
-	                        : $cursor.parentOffset > 0))
-	    { return false }
-
-	  var $cut = findCutBefore($cursor);
-
-	  // If there is no node before this, try to lift
-	  if (!$cut) {
-	    var range = $cursor.blockRange(), target = range && dist$1.liftTarget(range);
-	    if (target == null) { return false }
-	    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-	    return true
-	  }
-
-	  var before = $cut.nodeBefore;
-	  // Apply the joining algorithm
-	  if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))
-	    { return true }
-
-	  // If the node below has no content and the node above is
-	  // selectable, delete the node below and select the one above.
-	  if ($cursor.parent.content.size == 0 &&
-	      (textblockAt(before, "end") || dist$2.NodeSelection.isSelectable(before))) {
-	    if (dispatch) {
-	      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
-	      tr.setSelection(textblockAt(before, "end") ? dist$2.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)
-	                      : dist$2.NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));
-	      dispatch(tr.scrollIntoView());
-	    }
-	    return true
-	  }
-
-	  // If the node before is an atom, delete it
-	  if (before.isAtom && $cut.depth == $cursor.depth - 1) {
-	    if (dispatch) { dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView()); }
-	    return true
-	  }
-
-	  return false
-	}
-
-	function textblockAt(node, side) {
-	  for (; node; node = (side == "start" ? node.firstChild : node.lastChild))
-	    { if (node.isTextblock) { return true } }
-	  return false
-	}
-
-	// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-	// When the selection is empty and at the start of a textblock, select
-	// the node before that textblock, if possible. This is intended to be
-	// bound to keys like backspace, after
-	// [`joinBackward`](#commands.joinBackward) or other deleting
-	// commands, as a fall-back behavior when the schema doesn't allow
-	// deletion at the selected point.
-	function selectNodeBackward(state, dispatch, view) {
-	  var ref = state.selection;
-	  var $cursor = ref.$cursor;
-	  if (!$cursor || (view ? !view.endOfTextblock("backward", state)
-	                        : $cursor.parentOffset > 0))
-	    { return false }
-
-	  var $cut = findCutBefore($cursor), node = $cut && $cut.nodeBefore;
-	  if (!node || !dist$2.NodeSelection.isSelectable(node)) { return false }
-	  if (dispatch)
-	    { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView()); }
-	  return true
-	}
-
-	function findCutBefore($pos) {
-	  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
-	    if ($pos.index(i) > 0) { return $pos.doc.resolve($pos.before(i + 1)) }
-	    if ($pos.node(i).type.spec.isolating) { break }
-	  } }
-	  return null
-	}
-
-	// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-	// If the selection is empty and the cursor is at the end of a
-	// textblock, try to reduce or remove the boundary between that block
-	// and the one after it, either by joining them or by moving the other
-	// block closer to this one in the tree structure. Will use the view
-	// for accurate start-of-textblock detection if given.
-	function joinForward(state, dispatch, view) {
-	  var ref = state.selection;
-	  var $cursor = ref.$cursor;
-	  if (!$cursor || (view ? !view.endOfTextblock("forward", state)
-	                        : $cursor.parentOffset < $cursor.parent.content.size))
-	    { return false }
-
-	  var $cut = findCutAfter($cursor);
-
-	  // If there is no node after this, there's nothing to do
-	  if (!$cut) { return false }
-
-	  var after = $cut.nodeAfter;
-	  // Try the joining algorithm
-	  if (deleteBarrier(state, $cut, dispatch)) { return true }
-
-	  // If the node above has no content and the node below is
-	  // selectable, delete the node above and select the one below.
-	  if ($cursor.parent.content.size == 0 &&
-	      (textblockAt(after, "start") || dist$2.NodeSelection.isSelectable(after))) {
-	    if (dispatch) {
-	      var tr = state.tr.deleteRange($cursor.before(), $cursor.after());
-	      tr.setSelection(textblockAt(after, "start") ? dist$2.Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)
-	                      : dist$2.NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));
-	      dispatch(tr.scrollIntoView());
-	    }
-	    return true
-	  }
-
-	  // If the next node is an atom, delete it
-	  if (after.isAtom && $cut.depth == $cursor.depth - 1) {
-	    if (dispatch) { dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView()); }
-	    return true
-	  }
-
-	  return false
-	}
-
-	// :: (EditorState, ?(tr: Transaction), ?EditorView) → bool
-	// When the selection is empty and at the end of a textblock, select
-	// the node coming after that textblock, if possible. This is intended
-	// to be bound to keys like delete, after
-	// [`joinForward`](#commands.joinForward) and similar deleting
-	// commands, to provide a fall-back behavior when the schema doesn't
-	// allow deletion at the selected point.
-	function selectNodeForward(state, dispatch, view) {
-	  var ref = state.selection;
-	  var $cursor = ref.$cursor;
-	  if (!$cursor || (view ? !view.endOfTextblock("forward", state)
-	                        : $cursor.parentOffset < $cursor.parent.content.size))
-	    { return false }
-
-	  var $cut = findCutAfter($cursor), node = $cut && $cut.nodeAfter;
-	  if (!node || !dist$2.NodeSelection.isSelectable(node)) { return false }
-	  if (dispatch)
-	    { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, $cut.pos)).scrollIntoView()); }
-	  return true
-	}
-
-	function findCutAfter($pos) {
-	  if (!$pos.parent.type.spec.isolating) { for (var i = $pos.depth - 1; i >= 0; i--) {
-	    var parent = $pos.node(i);
-	    if ($pos.index(i) + 1 < parent.childCount) { return $pos.doc.resolve($pos.after(i + 1)) }
-	    if (parent.type.spec.isolating) { break }
-	  } }
-	  return null
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Join the selected block or, if there is a text selection, the
-	// closest ancestor block of the selection that can be joined, with
-	// the sibling above it.
-	function joinUp(state, dispatch) {
-	  var sel = state.selection, nodeSel = sel instanceof dist$2.NodeSelection, point;
-	  if (nodeSel) {
-	    if (sel.node.isTextblock || !dist$1.canJoin(state.doc, sel.from)) { return false }
-	    point = sel.from;
-	  } else {
-	    point = dist$1.joinPoint(state.doc, sel.from, -1);
-	    if (point == null) { return false }
-	  }
-	  if (dispatch) {
-	    var tr = state.tr.join(point);
-	    if (nodeSel) { tr.setSelection(dist$2.NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize)); }
-	    dispatch(tr.scrollIntoView());
-	  }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Join the selected block, or the closest ancestor of the selection
-	// that can be joined, with the sibling after it.
-	function joinDown(state, dispatch) {
-	  var sel = state.selection, point;
-	  if (sel instanceof dist$2.NodeSelection) {
-	    if (sel.node.isTextblock || !dist$1.canJoin(state.doc, sel.to)) { return false }
-	    point = sel.to;
-	  } else {
-	    point = dist$1.joinPoint(state.doc, sel.to, 1);
-	    if (point == null) { return false }
-	  }
-	  if (dispatch)
-	    { dispatch(state.tr.join(point).scrollIntoView()); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Lift the selected block, or the closest ancestor block of the
-	// selection that can be lifted, out of its parent node.
-	function lift(state, dispatch) {
-	  var ref = state.selection;
-	  var $from = ref.$from;
-	  var $to = ref.$to;
-	  var range = $from.blockRange($to), target = range && dist$1.liftTarget(range);
-	  if (target == null) { return false }
-	  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// If the selection is in a node whose type has a truthy
-	// [`code`](#model.NodeSpec.code) property in its spec, replace the
-	// selection with a newline character.
-	function newlineInCode(state, dispatch) {
-	  var ref = state.selection;
-	  var $head = ref.$head;
-	  var $anchor = ref.$anchor;
-	  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
-	  if (dispatch) { dispatch(state.tr.insertText("\n").scrollIntoView()); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// When the selection is in a node with a truthy
-	// [`code`](#model.NodeSpec.code) property in its spec, create a
-	// default block after the code block, and move the cursor there.
-	function exitCode(state, dispatch) {
-	  var ref = state.selection;
-	  var $head = ref.$head;
-	  var $anchor = ref.$anchor;
-	  if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) { return false }
-	  var above = $head.node(-1), after = $head.indexAfter(-1), type = above.contentMatchAt(after).defaultType;
-	  if (!above.canReplaceWith(after, after, type)) { return false }
-	  if (dispatch) {
-	    var pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());
-	    tr.setSelection(dist$2.Selection.near(tr.doc.resolve(pos), 1));
-	    dispatch(tr.scrollIntoView());
-	  }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// If a block node is selected, create an empty paragraph before (if
-	// it is its parent's first child) or after it.
-	function createParagraphNear(state, dispatch) {
-	  var ref = state.selection;
-	  var $from = ref.$from;
-	  var $to = ref.$to;
-	  if ($from.parent.inlineContent || $to.parent.inlineContent) { return false }
-	  var type = $from.parent.contentMatchAt($to.indexAfter()).defaultType;
-	  if (!type || !type.isTextblock) { return false }
-	  if (dispatch) {
-	    var side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;
-	    var tr = state.tr.insert(side, type.createAndFill());
-	    tr.setSelection(dist$2.TextSelection.create(tr.doc, side + 1));
-	    dispatch(tr.scrollIntoView());
-	  }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// If the cursor is in an empty textblock that can be lifted, lift the
-	// block.
-	function liftEmptyBlock(state, dispatch) {
-	  var ref = state.selection;
-	  var $cursor = ref.$cursor;
-	  if (!$cursor || $cursor.parent.content.size) { return false }
-	  if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {
-	    var before = $cursor.before();
-	    if (dist$1.canSplit(state.doc, before)) {
-	      if (dispatch) { dispatch(state.tr.split(before).scrollIntoView()); }
-	      return true
-	    }
-	  }
-	  var range = $cursor.blockRange(), target = range && dist$1.liftTarget(range);
-	  if (target == null) { return false }
-	  if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Split the parent block of the selection. If the selection is a text
-	// selection, also delete its content.
-	function splitBlock(state, dispatch) {
-	  var ref = state.selection;
-	  var $from = ref.$from;
-	  var $to = ref.$to;
-	  if (state.selection instanceof dist$2.NodeSelection && state.selection.node.isBlock) {
-	    if (!$from.parentOffset || !dist$1.canSplit(state.doc, $from.pos)) { return false }
-	    if (dispatch) { dispatch(state.tr.split($from.pos).scrollIntoView()); }
-	    return true
-	  }
-
-	  if (!$from.parent.isBlock) { return false }
-
-	  if (dispatch) {
-	    var atEnd = $to.parentOffset == $to.parent.content.size;
-	    var tr = state.tr;
-	    if (state.selection instanceof dist$2.TextSelection) { tr.deleteSelection(); }
-	    var deflt = $from.depth == 0 ? null : $from.node(-1).contentMatchAt($from.indexAfter(-1)).defaultType;
-	    var types = atEnd && deflt ? [{type: deflt}] : null;
-	    var can = dist$1.canSplit(tr.doc, $from.pos, 1, types);
-	    if (!types && !can && dist$1.canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt && [{type: deflt}])) {
-	      types = [{type: deflt}];
-	      can = true;
-	    }
-	    if (can) {
-	      tr.split(tr.mapping.map($from.pos), 1, types);
-	      if (!atEnd && !$from.parentOffset && $from.parent.type != deflt &&
-	          $from.node(-1).canReplace($from.index(-1), $from.indexAfter(-1), dist.Fragment.from(deflt.create(), $from.parent)))
-	        { tr.setNodeMarkup(tr.mapping.map($from.before()), deflt); }
-	    }
-	    dispatch(tr.scrollIntoView());
-	  }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Acts like [`splitBlock`](#commands.splitBlock), but without
-	// resetting the set of active marks at the cursor.
-	function splitBlockKeepMarks(state, dispatch) {
-	  return splitBlock(state, dispatch && (function (tr) {
-	    var marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());
-	    if (marks) { tr.ensureMarks(marks); }
-	    dispatch(tr);
-	  }))
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Move the selection to the node wrapping the current selection, if
-	// any. (Will not select the document node.)
-	function selectParentNode(state, dispatch) {
-	  var ref = state.selection;
-	  var $from = ref.$from;
-	  var to = ref.to;
-	  var pos;
-	  var same = $from.sharedDepth(to);
-	  if (same == 0) { return false }
-	  pos = $from.before(same);
-	  if (dispatch) { dispatch(state.tr.setSelection(dist$2.NodeSelection.create(state.doc, pos))); }
-	  return true
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Select the whole document.
-	function selectAll(state, dispatch) {
-	  if (dispatch) { dispatch(state.tr.setSelection(new dist$2.AllSelection(state.doc))); }
-	  return true
-	}
-
-	function joinMaybeClear(state, $pos, dispatch) {
-	  var before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();
-	  if (!before || !after || !before.type.compatibleContent(after.type)) { return false }
-	  if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {
-	    if (dispatch) { dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView()); }
-	    return true
-	  }
-	  if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || dist$1.canJoin(state.doc, $pos.pos)))
-	    { return false }
-	  if (dispatch)
-	    { dispatch(state.tr
-	             .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))
-	             .join($pos.pos)
-	             .scrollIntoView()); }
-	  return true
-	}
-
-	function deleteBarrier(state, $cut, dispatch) {
-	  var before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;
-	  if (before.type.spec.isolating || after.type.spec.isolating) { return false }
-	  if (joinMaybeClear(state, $cut, dispatch)) { return true }
-
-	  if ($cut.parent.canReplace($cut.index(), $cut.index() + 1) &&
-	      (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&
-	      match.matchType(conn[0] || after.type).validEnd) {
-	    if (dispatch) {
-	      var end = $cut.pos + after.nodeSize, wrap = dist.Fragment.empty;
-	      for (var i = conn.length - 1; i >= 0; i--)
-	        { wrap = dist.Fragment.from(conn[i].create(null, wrap)); }
-	      wrap = dist.Fragment.from(before.copy(wrap));
-	      var tr = state.tr.step(new dist$1.ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new dist.Slice(wrap, 1, 0), conn.length, true));
-	      var joinAt = end + 2 * conn.length;
-	      if (dist$1.canJoin(tr.doc, joinAt)) { tr.join(joinAt); }
-	      dispatch(tr.scrollIntoView());
-	    }
-	    return true
-	  }
-
-	  var selAfter = dist$2.Selection.findFrom($cut, 1);
-	  var range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && dist$1.liftTarget(range);
-	  if (target != null && target >= $cut.depth) {
-	    if (dispatch) { dispatch(state.tr.lift(range, target).scrollIntoView()); }
-	    return true
-	  }
-
-	  return false
-	}
-
-	// Parameterized commands
-
-	// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Wrap the selection in a node of the given type with the given
-	// attributes.
-	function wrapIn(nodeType, attrs) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var $from = ref.$from;
-	    var $to = ref.$to;
-	    var range = $from.blockRange($to), wrapping = range && dist$1.findWrapping(range, nodeType, attrs);
-	    if (!wrapping) { return false }
-	    if (dispatch) { dispatch(state.tr.wrap(range, wrapping).scrollIntoView()); }
-	    return true
-	  }
-	}
-
-	// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Returns a command that tries to set the selected textblocks to the
-	// given node type with the given attributes.
-	function setBlockType(nodeType, attrs) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var from = ref.from;
-	    var to = ref.to;
-	    var applicable = false;
-	    state.doc.nodesBetween(from, to, function (node, pos) {
-	      if (applicable) { return false }
-	      if (!node.isTextblock || node.hasMarkup(nodeType, attrs)) { return }
-	      if (node.type == nodeType) {
-	        applicable = true;
-	      } else {
-	        var $pos = state.doc.resolve(pos), index = $pos.index();
-	        applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);
-	      }
-	    });
-	    if (!applicable) { return false }
-	    if (dispatch) { dispatch(state.tr.setBlockType(from, to, nodeType, attrs).scrollIntoView()); }
-	    return true
-	  }
-	}
-
-	function markApplies(doc, ranges, type) {
-	  var loop = function ( i ) {
-	    var ref = ranges[i];
-	    var $from = ref.$from;
-	    var $to = ref.$to;
-	    var can = $from.depth == 0 ? doc.type.allowsMarkType(type) : false;
-	    doc.nodesBetween($from.pos, $to.pos, function (node) {
-	      if (can) { return false }
-	      can = node.inlineContent && node.type.allowsMarkType(type);
-	    });
-	    if (can) { return { v: true } }
-	  };
-
-	  for (var i = 0; i < ranges.length; i++) {
-	    var returned = loop( i );
-
-	    if ( returned ) { return returned.v; }
-	  }
-	  return false
-	}
-
-	// :: (MarkType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Create a command function that toggles the given mark with the
-	// given attributes. Will return `false` when the current selection
-	// doesn't support that mark. This will remove the mark if any marks
-	// of that type exist in the selection, or add it otherwise. If the
-	// selection is empty, this applies to the [stored
-	// marks](#state.EditorState.storedMarks) instead of a range of the
-	// document.
-	function toggleMark(markType, attrs) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var empty = ref.empty;
-	    var $cursor = ref.$cursor;
-	    var ranges = ref.ranges;
-	    if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType)) { return false }
-	    if (dispatch) {
-	      if ($cursor) {
-	        if (markType.isInSet(state.storedMarks || $cursor.marks()))
-	          { dispatch(state.tr.removeStoredMark(markType)); }
-	        else
-	          { dispatch(state.tr.addStoredMark(markType.create(attrs))); }
-	      } else {
-	        var has = false, tr = state.tr;
-	        for (var i = 0; !has && i < ranges.length; i++) {
-	          var ref$1 = ranges[i];
-	          var $from = ref$1.$from;
-	          var $to = ref$1.$to;
-	          has = state.doc.rangeHasMark($from.pos, $to.pos, markType);
-	        }
-	        for (var i$1 = 0; i$1 < ranges.length; i$1++) {
-	          var ref$2 = ranges[i$1];
-	          var $from$1 = ref$2.$from;
-	          var $to$1 = ref$2.$to;
-	          if (has) { tr.removeMark($from$1.pos, $to$1.pos, markType); }
-	          else { tr.addMark($from$1.pos, $to$1.pos, markType.create(attrs)); }
-	        }
-	        dispatch(tr.scrollIntoView());
-	      }
-	    }
-	    return true
-	  }
-	}
-
-	function wrapDispatchForJoin(dispatch, isJoinable) {
-	  return function (tr) {
-	    if (!tr.isGeneric) { return dispatch(tr) }
-
-	    var ranges = [];
-	    for (var i = 0; i < tr.mapping.maps.length; i++) {
-	      var map = tr.mapping.maps[i];
-	      for (var j = 0; j < ranges.length; j++)
-	        { ranges[j] = map.map(ranges[j]); }
-	      map.forEach(function (_s, _e, from, to) { return ranges.push(from, to); });
-	    }
-
-	    // Figure out which joinable points exist inside those ranges,
-	    // by checking all node boundaries in their parent nodes.
-	    var joinable = [];
-	    for (var i$1 = 0; i$1 < ranges.length; i$1 += 2) {
-	      var from = ranges[i$1], to = ranges[i$1 + 1];
-	      var $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);
-	      for (var index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {
-	        var after = parent.maybeChild(index);
-	        if (!after) { break }
-	        if (index && joinable.indexOf(pos) == -1) {
-	          var before = parent.child(index - 1);
-	          if (before.type == after.type && isJoinable(before, after))
-	            { joinable.push(pos); }
-	        }
-	        pos += after.nodeSize;
-	      }
-	    }
-	    // Join the joinable points
-	    joinable.sort(function (a, b) { return a - b; });
-	    for (var i$2 = joinable.length - 1; i$2 >= 0; i$2--) {
-	      if (dist$1.canJoin(tr.doc, joinable[i$2])) { tr.join(joinable[i$2]); }
-	    }
-	    dispatch(tr);
-	  }
-	}
-
-	// :: ((state: EditorState, ?(tr: Transaction)) → bool, union<(before: Node, after: Node) → bool, [string]>) → (state: EditorState, ?(tr: Transaction)) → bool
-	// Wrap a command so that, when it produces a transform that causes
-	// two joinable nodes to end up next to each other, those are joined.
-	// Nodes are considered joinable when they are of the same type and
-	// when the `isJoinable` predicate returns true for them or, if an
-	// array of strings was passed, if their node type name is in that
-	// array.
-	function autoJoin(command, isJoinable) {
-	  if (Array.isArray(isJoinable)) {
-	    var types = isJoinable;
-	    isJoinable = function (node) { return types.indexOf(node.type.name) > -1; };
-	  }
-	  return function (state, dispatch) { return command(state, dispatch && wrapDispatchForJoin(dispatch, isJoinable)); }
-	}
-
-	// :: (...[(EditorState, ?(tr: Transaction), ?EditorView) → bool]) → (EditorState, ?(tr: Transaction), ?EditorView) → bool
-	// Combine a number of command functions into a single function (which
-	// calls them one by one until one returns true).
-	function chainCommands() {
-	  var arguments$1 = arguments;
-
-	  var commands = [], len = arguments.length;
-	  while ( len-- ) { commands[ len ] = arguments$1[ len ]; }
-
-	  return function(state, dispatch, view) {
-	    for (var i = 0; i < commands.length; i++)
-	      { if (commands[i](state, dispatch, view)) { return true } }
-	    return false
-	  }
-	}
-
-	var backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);
-	var del = chainCommands(deleteSelection, joinForward, selectNodeForward);
-
-	// :: Object
-	// A basic keymap containing bindings not specific to any schema.
-	// Binds the following keys (when multiple commands are listed, they
-	// are chained with [`chainCommands`](#commands.chainCommands)):
-	//
-	// * **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`
-	// * **Mod-Enter** to `exitCode`
-	// * **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`
-	// * **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
-	// * **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
-	// * **Mod-a** to `selectAll`
-	var pcBaseKeymap = {
-	  "Enter": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),
-	  "Mod-Enter": exitCode,
-	  "Backspace": backspace,
-	  "Mod-Backspace": backspace,
-	  "Delete": del,
-	  "Mod-Delete": del,
-	  "Mod-a": selectAll
-	};
-
-	// :: Object
-	// A copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,
-	// **Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and
-	// **Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like
-	// Ctrl-Delete.
-	var macBaseKeymap = {
-	  "Ctrl-h": pcBaseKeymap["Backspace"],
-	  "Alt-Backspace": pcBaseKeymap["Mod-Backspace"],
-	  "Ctrl-d": pcBaseKeymap["Delete"],
-	  "Ctrl-Alt-Backspace": pcBaseKeymap["Mod-Delete"],
-	  "Alt-Delete": pcBaseKeymap["Mod-Delete"],
-	  "Alt-d": pcBaseKeymap["Mod-Delete"]
-	};
-	for (var key in pcBaseKeymap) { macBaseKeymap[key] = pcBaseKeymap[key]; }
-
-	// declare global: os, navigator
-	var mac = typeof navigator != "undefined" ? /Mac/.test(navigator.platform)
-	          : typeof os != "undefined" ? os.platform() == "darwin" : false;
-
-	// :: Object
-	// Depending on the detected platform, this will hold
-	// [`pcBasekeymap`](#commands.pcBaseKeymap) or
-	// [`macBaseKeymap`](#commands.macBaseKeymap).
-	var baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;
-
-	exports.deleteSelection = deleteSelection;
-	exports.joinBackward = joinBackward;
-	exports.selectNodeBackward = selectNodeBackward;
-	exports.joinForward = joinForward;
-	exports.selectNodeForward = selectNodeForward;
-	exports.joinUp = joinUp;
-	exports.joinDown = joinDown;
-	exports.lift = lift;
-	exports.newlineInCode = newlineInCode;
-	exports.exitCode = exitCode;
-	exports.createParagraphNear = createParagraphNear;
-	exports.liftEmptyBlock = liftEmptyBlock;
-	exports.splitBlock = splitBlock;
-	exports.splitBlockKeepMarks = splitBlockKeepMarks;
-	exports.selectParentNode = selectParentNode;
-	exports.selectAll = selectAll;
-	exports.wrapIn = wrapIn;
-	exports.setBlockType = setBlockType;
-	exports.toggleMark = toggleMark;
-	exports.autoJoin = autoJoin;
-	exports.chainCommands = chainCommands;
-	exports.pcBaseKeymap = pcBaseKeymap;
-	exports.macBaseKeymap = macBaseKeymap;
-	exports.baseKeymap = baseKeymap;
-
-	});
-
-	unwrapExports(commands);
-	var commands_1 = commands.deleteSelection;
-	var commands_2 = commands.joinBackward;
-	var commands_3 = commands.selectNodeBackward;
-	var commands_4 = commands.joinForward;
-	var commands_5 = commands.selectNodeForward;
-	var commands_6 = commands.joinUp;
-	var commands_7 = commands.joinDown;
-	var commands_8 = commands.lift;
-	var commands_9 = commands.newlineInCode;
-	var commands_10 = commands.exitCode;
-	var commands_11 = commands.createParagraphNear;
-	var commands_12 = commands.liftEmptyBlock;
-	var commands_13 = commands.splitBlock;
-	var commands_14 = commands.splitBlockKeepMarks;
-	var commands_15 = commands.selectParentNode;
-	var commands_16 = commands.selectAll;
-	var commands_17 = commands.wrapIn;
-	var commands_18 = commands.setBlockType;
-	var commands_19 = commands.toggleMark;
-	var commands_20 = commands.autoJoin;
-	var commands_21 = commands.chainCommands;
-	var commands_22 = commands.pcBaseKeymap;
-	var commands_23 = commands.macBaseKeymap;
-	var commands_24 = commands.baseKeymap;
-
-	var dist$6 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-	// ::- Input rules are regular expressions describing a piece of text
-	// that, when typed, causes something to happen. This might be
-	// changing two dashes into an emdash, wrapping a paragraph starting
-	// with `"> "` into a blockquote, or something entirely different.
-	var InputRule = function InputRule(match, handler) {
-	  this.match = match;
-	  this.handler = typeof handler == "string" ? stringHandler(handler) : handler;
-	};
-
-	function stringHandler(string) {
-	  return function(state, match, start, end) {
-	    var insert = string;
-	    if (match[1]) {
-	      var offset = match[0].lastIndexOf(match[1]);
-	      insert += match[0].slice(offset + match[1].length);
-	      start += offset;
-	      var cutOff = start - end;
-	      if (cutOff > 0) {
-	        insert = match[0].slice(offset - cutOff, offset) + insert;
-	        start = end;
-	      }
-	    }
-	    var marks = state.doc.resolve(start).marks();
-	    return state.tr.replaceWith(start, end, state.schema.text(insert, marks))
-	  }
-	}
-
-	var MAX_MATCH = 500;
-
-	// :: (config: {rules: [InputRule]}) → Plugin
-	// Create an input rules plugin. When enabled, it will cause text
-	// input that matches any of the given rules to trigger the rule's
-	// action.
-	function inputRules(ref) {
-	  var rules = ref.rules;
-
-	  return new dist$2.Plugin({
-	    state: {
-	      init: function init() { return null },
-	      apply: function apply(tr, prev) {
-	        var stored = tr.getMeta(this);
-	        if (stored) { return stored }
-	        return tr.selectionSet || tr.docChanged ? null : prev
-	      }
-	    },
-
-	    props: {
-	      handleTextInput: function handleTextInput(view, from, to, text) {
-	        var this$1 = this;
-
-	        var state = view.state, $from = state.doc.resolve(from);
-	        if ($from.parent.type.spec.code) { return false }
-	        var textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset,
-	                                                  null, "\ufffc") + text;
-	        for (var i = 0; i < rules.length; i++) {
-	          var match = rules[i].match.exec(textBefore);
-	          var tr = match && rules[i].handler(state, match, from - (match[0].length - text.length), to);
-	          if (!tr) { continue }
-	          view.dispatch(tr.setMeta(this$1, {transform: tr, from: from, to: to, text: text}));
-	          return true
-	        }
-	        return false
-	      }
-	    },
-
-	    isInputRules: true
-	  })
-	}
-
-	// :: (EditorState, ?(Transaction)) → bool
-	// This is a command that will undo an input rule, if applying such a
-	// rule was the last thing that the user did.
-	function undoInputRule(state, dispatch) {
-	  var plugins = state.plugins;
-	  for (var i = 0; i < plugins.length; i++) {
-	    var plugin = plugins[i], undoable = (void 0);
-	    if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {
-	      if (dispatch) {
-	        var tr = state.tr, toUndo = undoable.transform;
-	        for (var j = toUndo.steps.length - 1; j >= 0; j--)
-	          { tr.step(toUndo.steps[j].invert(toUndo.docs[j])); }
-	        var marks = tr.doc.resolve(undoable.from).marks();
-	        dispatch(tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks)));
-	      }
-	      return true
-	    }
-	  }
-	  return false
-	}
-
-	// :: InputRule Converts double dashes to an emdash.
-	var emDash = new InputRule(/--$/, "—");
-	// :: InputRule Converts three dots to an ellipsis character.
-	var ellipsis = new InputRule(/\.\.\.$/, "…");
-	// :: InputRule “Smart” opening double quotes.
-	var openDoubleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(")$/, "“");
-	// :: InputRule “Smart” closing double quotes.
-	var closeDoubleQuote = new InputRule(/"$/, "”");
-	// :: InputRule “Smart” opening single quotes.
-	var openSingleQuote = new InputRule(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(')$/, "‘");
-	// :: InputRule “Smart” closing single quotes.
-	var closeSingleQuote = new InputRule(/'$/, "’");
-
-	// :: [InputRule] Smart-quote related input rules.
-	var smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];
-
-	// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>, ?([string], Node) → bool) → InputRule
-	// Build an input rule for automatically wrapping a textblock when a
-	// given string is typed. The `regexp` argument is
-	// directly passed through to the `InputRule` constructor. You'll
-	// probably want the regexp to start with `^`, so that the pattern can
-	// only occur at the start of a textblock.
-	//
-	// `nodeType` is the type of node to wrap in. If it needs attributes,
-	// you can either pass them directly, or pass a function that will
-	// compute them from the regular expression match.
-	//
-	// By default, if there's a node with the same type above the newly
-	// wrapped node, the rule will try to [join](#transform.Transform.join) those
-	// two nodes. You can pass a join predicate, which takes a regular
-	// expression match and the node before the wrapped node, and can
-	// return a boolean to indicate whether a join should happen.
-	function wrappingInputRule(regexp, nodeType, getAttrs, joinPredicate) {
-	  return new InputRule(regexp, function (state, match, start, end) {
-	    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
-	    var tr = state.tr.delete(start, end);
-	    var $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && dist$1.findWrapping(range, nodeType, attrs);
-	    if (!wrapping) { return null }
-	    tr.wrap(range, wrapping);
-	    var before = tr.doc.resolve(start - 1).nodeBefore;
-	    if (before && before.type == nodeType && dist$1.canJoin(tr.doc, start - 1) &&
-	        (!joinPredicate || joinPredicate(match, before)))
-	      { tr.join(start - 1); }
-	    return tr
-	  })
-	}
-
-	// :: (RegExp, NodeType, ?union<Object, ([string]) → ?Object>) → InputRule
-	// Build an input rule that changes the type of a textblock when the
-	// matched text is typed into it. You'll usually want to start your
-	// regexp with `^` to that it is only matched at the start of a
-	// textblock. The optional `getAttrs` parameter can be used to compute
-	// the new node's attributes, and works the same as in the
-	// `wrappingInputRule` function.
-	function textblockTypeInputRule(regexp, nodeType, getAttrs) {
-	  return new InputRule(regexp, function (state, match, start, end) {
-	    var $start = state.doc.resolve(start);
-	    var attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;
-	    if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType)) { return null }
-	    return state.tr
-	      .delete(start, end)
-	      .setBlockType(start, start, nodeType, attrs)
-	  })
-	}
-
-	exports.InputRule = InputRule;
-	exports.inputRules = inputRules;
-	exports.undoInputRule = undoInputRule;
-	exports.emDash = emDash;
-	exports.ellipsis = ellipsis;
-	exports.openDoubleQuote = openDoubleQuote;
-	exports.closeDoubleQuote = closeDoubleQuote;
-	exports.openSingleQuote = openSingleQuote;
-	exports.closeSingleQuote = closeSingleQuote;
-	exports.smartQuotes = smartQuotes;
-	exports.wrappingInputRule = wrappingInputRule;
-	exports.textblockTypeInputRule = textblockTypeInputRule;
-
-	});
-
-	unwrapExports(dist$6);
-	var dist_1$5 = dist$6.InputRule;
-	var dist_2$5 = dist$6.inputRules;
-	var dist_3$4 = dist$6.undoInputRule;
-	var dist_4$4 = dist$6.emDash;
-	var dist_5$4 = dist$6.ellipsis;
-	var dist_6$3 = dist$6.openDoubleQuote;
-	var dist_7$3 = dist$6.closeDoubleQuote;
-	var dist_8$3 = dist$6.openSingleQuote;
-	var dist_9$3 = dist$6.closeSingleQuote;
-	var dist_10$2 = dist$6.smartQuotes;
-	var dist_11$2 = dist$6.wrappingInputRule;
-	var dist_12$2 = dist$6.textblockTypeInputRule;
-
-	function buildMenuActions (ref) {
-		var schema = ref.schema;
-		var state = ref.state;
-		var commands = ref.commands;
-
-
-		var nodes = Object.entries(schema.nodes)
-			.map(function (ref) {
-				var name = ref[0];
-
-				var active = function (attrs) {
-					if ( attrs === void 0 ) attrs = {};
-
-					return nodeIsActive(state, schema.nodes[name], attrs);
-				};
-				var command = commands[name] ? commands[name] : function () {};
-				return { name: name, active: active, command: command }
-			})
-			.reduce(function (actions, ref) {
-				var obj;
-
-				var name = ref.name;
-				var active = ref.active;
-				var command = ref.command;
-				return Object.assign({}, actions, ( obj = {}, obj[name] = {
-					active: active,
-					command: command,
-				}, obj ));
-		}, {});
-			// .reduce((actions, { name, active, command }) => ({
-			// 	...actions,
-			// 	[name]: {
-			// 		active,
-			// 		command,
-			// 	},
-			// }), {})
-
-		var marks = Object.entries(schema.marks)
-			.map(function (ref) {
-				var name = ref[0];
-
-				var active = function () { return markIsActive(state, schema.marks[name]); };
-				var attrs = getMarkAttrs(state, schema.marks[name]);
-				var command = commands[name] ? commands[name] : function () {};
-				return {
-					name: name,
-					active: active,
-					attrs: attrs,
-					command: command,
-				}
-			})
-			.reduce(function (actions, ref) {
-				var obj;
-
-				var name = ref.name;
-				var active = ref.active;
-				var attrs = ref.attrs;
-				var command = ref.command;
-				return Object.assign({}, actions, ( obj = {}, obj[name] = {
-					active: active,
-					attrs: attrs,
-					command: command,
-				}, obj ));
-		}, {});
-			// .reduce((actions, { name, active, attrs, command }) => ({
-			// 	...actions,
-			// 	[name]: {
-			// 		active,
-			// 		attrs,
-			// 		command,
-			// 	},
-			// }), {})
-
-		return {
-			nodes: nodes,
-			marks: marks,
-		}
-
-	}
-
-	var keymap$$1 = {
-		'Mod-z': history_5,
-		'Shift-Mod-z': history_5,
-		'Mod-BracketLeft': commands_8,
-		Backspace: dist_3$4,
-		Escape: commands_15,
-	};
-
-	if (!isMac) {
-		keymap$$1['Mod-y'] = history_6;
-	}
-
-	var ComponentView = function ComponentView(component, ref) {
-		var node = ref.node;
-		var view = ref.view;
-		var getPos = ref.getPos;
-		var decorations = ref.decorations;
-		var editable = ref.editable;
-
-		this.component = component;
-		this.node = node;
-		this.view = view;
-		this.getPos = getPos;
-		this.decorations = decorations;
-		this.editable = editable;
-
-		this.dom = this.createDOM();
-		this.contentDOM = this._vm.$refs.content;
-	};
-
-	ComponentView.prototype.createDOM = function createDOM () {
-			var this$1 = this;
-
-		var Component = Vue.extend(this.component);
-		this._vm = new Component({
-			propsData: {
-				node: this.node,
-				view: this.view,
-				getPos: this.getPos,
-				decorations: this.decorations,
-				editable: this.editable,
-				updateAttrs: function (attrs) { return this$1.updateAttrs(attrs); },
-				updateContent: function (content) { return this$1.updateContent(content); },
-			},
-		}).$mount();
-		return this._vm.$el
-	};
-
-	ComponentView.prototype.updateAttrs = function updateAttrs (attrs) {
-		var transaction = this.view.state.tr.setNodeMarkup(this.getPos(), null, Object.assign({}, this.node.attrs,
-			attrs));
-		this.view.dispatch(transaction);
-	};
-
-	ComponentView.prototype.updateContent = function updateContent (content) {
-		var transaction = this.view.state.tr.setNodeMarkup(this.getPos(), this.node.type, { content: content });
-		this.view.dispatch(transaction);
-	};
-
-	ComponentView.prototype.ignoreMutation = function ignoreMutation () {
-		return true
-	};
-
-	ComponentView.prototype.stopEvent = function stopEvent () {
-		return true
-	};
-
-	ComponentView.prototype.update = function update (node, decorations) {
-		if (node.type !== this.node.type) {
-			return false
-		}
-
-		if (node === this.node && this.decorations === decorations) {
-			return true
-		}
-
-		this.node = node;
-		this.decorations = decorations;
-		this._vm._props.node = node;
-		this._vm._props.decorations = decorations;
-		return true
-	};
-
-	ComponentView.prototype.destroy = function destroy () {
-		this._vm.$destroy();
-	};
-
-	function initNodeViews$$1(ref) {
-	  var nodes = ref.nodes;
-	  var editable = ref.editable;
-
-	  var nodeViews = {};
-	  Object.keys(nodes).forEach(function (nodeName) {
-	    nodeViews[nodeName] = function (node, view, getPos, decorations) {
-	      var component = nodes[nodeName];
-	      return new ComponentView(component, {
-	        node: node,
-	        view: view,
-	        getPos: getPos,
-	        decorations: decorations,
-	        editable: editable,
-	      })
-	    };
-	  });
-	  return nodeViews
-	}
-
-	var isMac = typeof navigator !== 'undefined' ? /Mac/.test(navigator.platform) : false;
-
-	function getMarkAttrs (state, type) {
-		var ref = state.selection;
-		var from = ref.from;
-		var to = ref.to;
-		var marks = [];
-
-		state.doc.nodesBetween(from, to, function (node) {
-			marks = marks.concat( node.marks);
-		});
-
-		var mark = marks.find(function (mark) { return mark.type.name === type.name; });
-
-		if (mark) {
-			return mark.attrs
-		}
-
-		return {}
-	}
-
-	function markIsActive (state, type) {
-		var ref = state.selection;
-		var from = ref.from;
-		var $from = ref.$from;
-		var to = ref.to;
-		var empty = ref.empty;
-
-		if (empty) {
-			return !!type.isInSet(state.storedMarks || $from.marks())
-		}
-
-		return !!state.doc.rangeHasMark(from, to, type)
-	}
-
-	var dist$7 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-
-
-	// Because working with row and column-spanning cells is not quite
-	// trivial, this code builds up a descriptive structure for a given
-	// table node. The structures are cached with the (persistent) table
-	// nodes as key, so that they only have to be recomputed when the
-	// content of the table changes.
-	//
-	// This does mean that they have to store table-relative, not
-	// document-relative positions. So code that uses them will typically
-	// compute the start position of the table and offset positions passed
-	// to or gotten from this structure by that amount.
-
-	var readFromCache, addToCache;
-	// Prefer using a weak map to cache table maps. Fall back on a
-	// fixed-size cache if that's not supported.
-	if (typeof WeakMap != "undefined") {
-	  var cache = new WeakMap;
-	  readFromCache = function (key) { return cache.get(key); };
-	  addToCache = function (key, value) {
-	    cache.set(key, value);
-	    return value
-	  };
-	} else {
-	  var cache$1 = [], cacheSize = 10, cachePos = 0;
-	  readFromCache = function (key) {
-	    for (var i = 0; i < cache$1.length; i += 2)
-	      { if (cache$1[i] == key) { return cache$1[i + 1] } }
-	  };
-	  addToCache = function (key, value) {
-	    if (cachePos == cacheSize) { cachePos = 0; }
-	    cache$1[cachePos++] = key;
-	    return cache$1[cachePos++] = value
-	  };
-	}
-
-	var Rect = function Rect(left, top, right, bottom) {
-	  this.left = left; this.top = top; this.right = right; this.bottom = bottom;
-	};
-
-	// ::- A table map describes the structore of a given table. To avoid
-	// recomputing them all the time, they are cached per table node. To
-	// be able to do that, positions saved in the map are relative to the
-	// start of the table, rather than the start of the document.
-	var TableMap = function TableMap(width, height, map, problems) {
-	  // :: number The width of the table
-	  this.width = width;
-	  // :: number The table's height
-	  this.height = height;
-	  // :: [number] A width * height array with the start position of
-	  // the cell covering that part of the table in each slot
-	  this.map = map;
-	  // An optional array of problems (cell overlap or non-rectangular
-	  // shape) for the table, used by the table normalizer.
-	  this.problems = problems;
-	};
-
-	// :: (number) → Rect
-	// Find the dimensions of the cell at the given position.
-	TableMap.prototype.findCell = function findCell (pos) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.map.length; i++) {
-	    var curPos = this$1.map[i];
-	    if (curPos != pos) { continue }
-	    var left = i % this$1.width, top = (i / this$1.width) | 0;
-	    var right = left + 1, bottom = top + 1;
-	    for (var j = 1; right < this.width && this.map[i + j] == curPos; j++) { right++; }
-	    for (var j$1 = 1; bottom < this.height && this.map[i + (this.width * j$1)] == curPos; j$1++) { bottom++; }
-	    return new Rect(left, top, right, bottom)
-	  }
-	  throw new RangeError("No cell with offset " + pos + " found")
-	};
-
-	// :: (number) → number
-	// Find the left side of the cell at the given position.
-	TableMap.prototype.colCount = function colCount (pos) {
-	    var this$1 = this;
-
-	  for (var i = 0; i < this.map.length; i++)
-	    { if (this$1.map[i] == pos) { return i % this$1.width } }
-	  throw new RangeError("No cell with offset " + pos + " found")
-	};
-
-	// :: (number, string, number) → ?number
-	// Find the next cell in the given direction, starting from the cell
-	// at `pos`, if any.
-	TableMap.prototype.nextCell = function nextCell (pos, axis, dir) {
-	  var ref = this.findCell(pos);
-	    var left = ref.left;
-	    var right = ref.right;
-	    var top = ref.top;
-	    var bottom = ref.bottom;
-	  if (axis == "horiz") {
-	    if (dir < 0 ? left == 0 : right == this.width) { return null }
-	    return this.map[top * this.width + (dir < 0 ? left - 1 : right)]
-	  } else {
-	    if (dir < 0 ? top == 0 : bottom == this.height) { return null }
-	    return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)]
-	  }
-	};
-
-	// :: (number, number) → Rect
-	// Get the rectangle spanning the two given cells.
-	TableMap.prototype.rectBetween = function rectBetween (a, b) {
-	  var ref = this.findCell(a);
-	    var leftA = ref.left;
-	    var rightA = ref.right;
-	    var topA = ref.top;
-	    var bottomA = ref.bottom;
-	  var ref$1 = this.findCell(b);
-	    var leftB = ref$1.left;
-	    var rightB = ref$1.right;
-	    var topB = ref$1.top;
-	    var bottomB = ref$1.bottom;
-	  return new Rect(Math.min(leftA, leftB), Math.min(topA, topB),
-	                  Math.max(rightA, rightB), Math.max(bottomA, bottomB))
-	};
-
-	// :: (Rect) → [number]
-	// Return the position of all cells that have the top left corner in
-	// the given rectangle.
-	TableMap.prototype.cellsInRect = function cellsInRect (rect) {
-	    var this$1 = this;
-
-	  var result = [], seen = [];
-	  for (var row = rect.top; row < rect.bottom; row++) {
-	    for (var col = rect.left; col < rect.right; col++) {
-	      var index = row * this$1.width + col, pos = this$1.map[index];
-	      if (seen.indexOf(pos) > -1) { continue }
-	      seen.push(pos);
-	      if ((col != rect.left || !col || this$1.map[index - 1] != pos) &&
-	          (row != rect.top || !row || this$1.map[index - this$1.width] != pos))
-	        { result.push(pos); }
-	    }
-	  }
-	  return result
-	};
-
-	// :: (number, number, Node) → number
-	// Return the position at which the cell at the given row and column
-	// starts, or would start, if a cell started there.
-	TableMap.prototype.positionAt = function positionAt (row, col, table) {
-	    var this$1 = this;
-
-	  for (var i = 0, rowStart = 0;; i++) {
-	    var rowEnd = rowStart + table.child(i).nodeSize;
-	    if (i == row) {
-	      var index = col + row * this$1.width, rowEndIndex = (row + 1) * this$1.width;
-	      // Skip past cells from previous rows (via rowspan)
-	      while (index < rowEndIndex && this.map[index] < rowStart) { index++; }
-	      return index == rowEndIndex ? rowEnd - 1 : this$1.map[index]
-	    }
-	    rowStart = rowEnd;
-	  }
-	};
-
-	// :: (Node) → TableMap
-	// Find the table map for the given table node.
-	TableMap.get = function get (table) {
-	  return readFromCache(table) || addToCache(table, computeMap(table))
-	};
-
-	// Compute a table map.
-	function computeMap(table) {
-	  if (table.type.spec.tableRole != "table") { throw new RangeError("Not a table node: " + table.type.name) }
-	  var width = findWidth(table), height = table.childCount;
-	  var map = [], mapPos = 0, problems = null, colWidths = [];
-	  for (var i = 0, e = width * height; i < e; i++) { map[i] = 0; }
-
-	  for (var row = 0, pos = 0; row < height; row++) {
-	    var rowNode = table.child(row);
-	    pos++;
-	    for (var i$1 = 0;; i$1++) {
-	      while (mapPos < map.length && map[mapPos] != 0) { mapPos++; }
-	      if (i$1 == rowNode.childCount) { break }
-	      var cellNode = rowNode.child(i$1);
-	      var ref = cellNode.attrs;
-	      var colspan = ref.colspan;
-	      var rowspan = ref.rowspan;
-	      var colwidth = ref.colwidth;
-	      for (var h = 0; h < rowspan; h++) {
-	        if (h + row >= height) {
-	          (problems || (problems = [])).push({type: "overlong_rowspan", pos: pos, n: rowspan - h});
-	          break
-	        }
-	        var start = mapPos + (h * width);
-	        for (var w = 0; w < colspan; w++) {
-	          if (map[start + w] == 0)
-	            { map[start + w] = pos; }
-	          else
-	            { (problems || (problems = [])).push({type: "collision", row: row, pos: pos, n: colspan - w}); }
-	          var colW = colwidth && colwidth[w];
-	          if (colW) {
-	            var widthIndex = ((start + w) % width) * 2, prev = colWidths[widthIndex];
-	            if (prev == null || (prev != colW && colWidths[widthIndex + 1] == 1)) {
-	              colWidths[widthIndex] = colW;
-	              colWidths[widthIndex + 1] = 1;
-	            } else if (prev == colW) {
-	              colWidths[widthIndex + 1]++;
-	            }
-	          }
-	        }
-	      }
-	      mapPos += colspan;
-	      pos += cellNode.nodeSize;
-	    }
-	    var expectedPos = (row + 1) * width, missing = 0;
-	    while (mapPos < expectedPos) { if (map[mapPos++] == 0) { missing++; } }
-	    if (missing) { (problems || (problems = [])).push({type: "missing", row: row, n: missing}); }
-	    pos++;
-	  }
-
-	  var tableMap = new TableMap(width, height, map, problems), badWidths = false;
-
-	  // For columns that have defined widths, but whose widths disagree
-	  // between rows, fix up the cells whose width doesn't match the
-	  // computed one.
-	  for (var i$2 = 0; !badWidths && i$2 < colWidths.length; i$2 += 2)
-	    { if (colWidths[i$2] != null && colWidths[i$2 + 1] < height) { badWidths = true; } }
-	  if (badWidths) { findBadColWidths(tableMap, colWidths, table); }
-
-	  return tableMap
-	}
-
-	function findWidth(table) {
-	  var width = -1, hasRowSpan = false;
-	  for (var row = 0; row < table.childCount; row++) {
-	    var rowNode = table.child(row), rowWidth = 0;
-	    if (hasRowSpan) { for (var j = 0; j < row; j++) {
-	      var prevRow = table.child(j);
-	      for (var i = 0; i < prevRow.childCount; i++) {
-	        var cell = prevRow.child(i);
-	        if (j + cell.attrs.rowspan > row) { rowWidth += cell.attrs.colspan; }
-	      }
-	    } }
-	    for (var i$1 = 0; i$1 < rowNode.childCount; i$1++) {
-	      var cell$1 = rowNode.child(i$1);
-	      rowWidth += cell$1.attrs.colspan;
-	      if (cell$1.attrs.rowspan > 1) { hasRowSpan = true; }
-	    }
-	    if (width == -1)
-	      { width = rowWidth; }
-	    else if (width != rowWidth)
-	      { width = Math.max(width, rowWidth); }
-	  }
-	  return width
-	}
-
-	function findBadColWidths(map, colWidths, table) {
-	  if (!map.problems) { map.problems = []; }
-	  for (var i = 0, seen = []; i < map.map.length; i++) {
-	    var pos = map.map[i];
-	    if (seen.indexOf(pos) > -1) { continue }
-	    seen.push(pos);
-	    var node = table.nodeAt(pos), updated = null;
-	    for (var j = 0; j < node.attrs.colspan; j++) {
-	      var col = (i + j) % map.width, colWidth = colWidths[col * 2];
-	      if (colWidth != null && (!node.attrs.colwidth || node.attrs.colwidth[j] != colWidth))
-	        { (updated || (updated = freshColWidth(node.attrs)))[j] = colWidth; }
-	    }
-	    if (updated) { map.problems.unshift({type: "colwidth mismatch", pos: pos, colwidth: updated}); }
-	  }
-	}
-
-	function freshColWidth(attrs) {
-	  if (attrs.colwidth) { return attrs.colwidth.slice() }
-	  var result = [];
-	  for (var i = 0; i < attrs.colspan; i++) { result.push(0); }
-	  return result
-	}
-
-	// Various helper function for working with tables
-
-	var key = new dist$2.PluginKey("selectingCells");
-
-	function cellAround($pos) {
-	  for (var d = $pos.depth - 1; d > 0; d--)
-	    { if ($pos.node(d).type.spec.tableRole == "row") { return $pos.node(0).resolve($pos.before(d + 1)) } }
-	  return null
-	}
-
-	function cellWrapping($pos) {
-	  for (var d = $pos.depth - 1; d > 0; d--) {
-	    var role = $pos.node(d).type.spec.tableRole;
-	    if (role === "cell" || role === 'header_cell') { return $pos.node(d) }
-	  }
-	  return null
-	}
-
-	function isInTable(state) {
-	  var $head = state.selection.$head;
-	  for (var d = $head.depth; d > 0; d--) { if ($head.node(d).type.spec.tableRole == "row") { return true } }
-	  return false
-	}
-
-	function selectionCell(state) {
-	  var sel = state.selection;
-	  if (sel.$anchorCell) {
-	    return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;
-	  } else if (sel.node && sel.node.type.spec.tableRole == "cell") {
-	    return sel.$anchor
-	  }
-	  return cellAround(sel.$head) || cellNear(sel.$head)
-	}
-
-	function cellNear($pos) {
-	  for (var after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {
-	    var role = after.type.spec.tableRole;
-	    if (role == "cell" || role == "header_cell") { return $pos.doc.resolve(pos) }
-	  }
-	  for (var before = $pos.nodeBefore, pos$1 = $pos.pos; before; before = before.lastChild, pos$1--) {
-	    var role$1 = before.type.spec.tableRole;
-	    if (role$1 == "cell" || role$1 == "header_cell") { return $pos.doc.resolve(pos$1 - before.nodeSize) }
-	  }
-	}
-
-	function pointsAtCell($pos) {
-	  return $pos.parent.type.spec.tableRole == "row" && $pos.nodeAfter
-	}
-
-	function moveCellForward($pos) {
-	  return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize)
-	}
-
-	function inSameTable($a, $b) {
-	  return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1)
-	}
-
-	function findCell($pos) {
-	  return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1))
-	}
-
-	function colCount($pos) {
-	  return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1))
-	}
-
-	function nextCell($pos, axis, dir) {
-	  var start = $pos.start(-1), map = TableMap.get($pos.node(-1));
-	  var moved = map.nextCell($pos.pos - start, axis, dir);
-	  return moved == null ? null : $pos.node(0).resolve(start + moved)
-	}
-
-	function setAttr(attrs, name, value) {
-	  var result = {};
-	  for (var prop in attrs) { result[prop] = attrs[prop]; }
-	  result[name] = value;
-	  return result
-	}
-
-	function rmColSpan(attrs, pos, n) {
-	  if ( n === void 0 ) { n=1; }
-
-	  var result = setAttr(attrs, "colspan", attrs.colspan - n);
-	  if (result.colwidth) {
-	    result.colwidth = result.colwidth.slice();
-	    result.colwidth.splice(pos, n);
-	    if (!result.colwidth.some(function (w) { return w > 0; })) { result.colwidth = null; }
-	  }
-	  return result
-	}
-
-	function addColSpan(attrs, pos, n) {
-	  if ( n === void 0 ) { n=1; }
-
-	  var result = setAttr(attrs, "colspan", attrs.colspan + n);
-	  if (result.colwidth) {
-	    result.colwidth = result.colwidth.slice();
-	    for (var i = 0; i < n; i++) { result.colwidth.splice(pos, 0, 0); }
-	  }
-	  return result
-	}
-
-	// This file defines a ProseMirror selection subclass that models
-
-	// ::- A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)
-	// subclass that represents a cell selection spanning part of a table.
-	// With the plugin enabled, these will be created when the user
-	// selects across cells, and will be drawn by giving selected cells a
-	// `selectedCell` CSS class.
-	var CellSelection = (function (Selection) {
-	  function CellSelection($anchorCell, $headCell) {
-	    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-	    var table = $anchorCell.node(-1), map = TableMap.get(table), start = $anchorCell.start(-1);
-	    var rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start);
-	    var doc = $anchorCell.node(0);
-	    var cells = map.cellsInRect(rect).filter(function (p) { return p != $headCell.pos - start; });
-	    // Make the head cell the first range, so that it counts as the
-	    // primary part of the selection
-	    cells.unshift($headCell.pos - start);
-	    var ranges = cells.map(function (pos) {
-	      var cell = table.nodeAt(pos), from = pos + start + 1;
-	      return new dist$2.SelectionRange(doc.resolve(from), doc.resolve(from + cell.content.size))
-	    });
-	    Selection.call(this, ranges[0].$from, ranges[0].$to, ranges);
-	    // :: ResolvedPos
-	    // A resolved position pointing _in front of_ the anchor cell (the one
-	    // that doesn't move when extending the selection).
-	    this.$anchorCell = $anchorCell;
-	    // :: ResolvedPos
-	    // A resolved position pointing in front of the head cell (the one
-	    // moves when extending the selection).
-	    this.$headCell = $headCell;
-	  }
-
-	  if ( Selection ) { CellSelection.__proto__ = Selection; }
-	  CellSelection.prototype = Object.create( Selection && Selection.prototype );
-	  CellSelection.prototype.constructor = CellSelection;
-
-	  CellSelection.prototype.map = function map (doc, mapping) {
-	    var $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));
-	    var $headCell = doc.resolve(mapping.map(this.$headCell.pos));
-	    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {
-	      var tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);
-	      if (tableChanged && this.isRowSelection())
-	        { return CellSelection.rowSelection($anchorCell, $headCell) }
-	      else if (tableChanged && this.isColSelection())
-	        { return CellSelection.colSelection($anchorCell, $headCell) }
-	      else
-	        { return new CellSelection($anchorCell, $headCell) }
-	    }
-	    return dist$2.TextSelection.between($anchorCell, $headCell)
-	  };
-
-	  // :: () → Slice
-	  // Returns a rectangular slice of table rows containing the selected
-	  // cells.
-	  CellSelection.prototype.content = function content () {
-	    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
-	    var rect = map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start);
-	    var seen = [], rows = [];
-	    for (var row = rect.top; row < rect.bottom; row++) {
-	      var rowContent = [];
-	      for (var index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {
-	        var pos = map.map[index];
-	        if (seen.indexOf(pos) == -1) {
-	          seen.push(pos);
-	          var cellRect = map.findCell(pos), cell = table.nodeAt(pos);
-	          var extraLeft = rect.left - cellRect.left, extraRight = cellRect.right - rect.right;
-	          if (extraLeft > 0 || extraRight > 0) {
-	            var attrs = cell.attrs;
-	            if (extraLeft > 0) { attrs = rmColSpan(attrs, 0, extraLeft); }
-	            if (extraRight > 0) { attrs = rmColSpan(attrs, attrs.colspan - extraRight, extraRight); }
-	            if (cellRect.left < rect.left) { cell = cell.type.createAndFill(attrs); }
-	            else { cell = cell.type.create(attrs, cell.content); }
-	          }
-	          if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {
-	            var attrs$1 = setAttr(cell.attrs, "rowspan", Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top));
-	            if (cellRect.top < rect.top) { cell = cell.type.createAndFill(attrs$1); }
-	            else { cell = cell.type.create(attrs$1, cell.content); }
-	          }
-	          rowContent.push(cell);
-	        }
-	      }
-	      rows.push(table.child(row).copy(dist.Fragment.from(rowContent)));
-	    }
-
-	    var fragment = this.isColSelection() && this.isRowSelection() ? table : rows;
-	    return new dist.Slice(dist.Fragment.from(fragment), 1, 1)
-	  };
-
-	  CellSelection.prototype.replace = function replace (tr, content) {
-	    if ( content === void 0 ) { content = dist.Slice.empty; }
-
-	    var mapFrom = tr.steps.length, ranges = this.ranges;
-	    for (var i = 0; i < ranges.length; i++) {
-	      var ref = ranges[i];
-	      var $from = ref.$from;
-	      var $to = ref.$to;
-	      var mapping = tr.mapping.slice(mapFrom);
-	      tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? dist.Slice.empty : content);
-	    }
-	    var sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1);
-	    if (sel) { tr.setSelection(sel); }
-	  };
-
-	  CellSelection.prototype.replaceWith = function replaceWith (tr, node) {
-	    this.replace(tr, new dist.Slice(dist.Fragment.from(node), 0, 0));
-	  };
-
-	  CellSelection.prototype.forEachCell = function forEachCell (f) {
-	    var table = this.$anchorCell.node(-1), map = TableMap.get(table), start = this.$anchorCell.start(-1);
-	    var cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start));
-	    for (var i = 0; i < cells.length; i++)
-	      { f(table.nodeAt(cells[i]), start + cells[i]); }
-	  };
-
-	  // :: () → bool
-	  // True if this selection goes all the way from the top to the
-	  // bottom of the table.
-	  CellSelection.prototype.isColSelection = function isColSelection () {
-	    var anchorTop = this.$anchorCell.index(-1), headTop = this.$headCell.index(-1);
-	    if (Math.min(anchorTop, headTop) > 0) { return false }
-	    var anchorBot = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan,
-	        headBot = headTop + this.$headCell.nodeAfter.attrs.rowspan;
-	    return Math.max(anchorBot, headBot) == this.$headCell.node(-1).childCount
-	  };
-
-	  // :: (ResolvedPos, ?ResolvedPos) → CellSelection
-	  // Returns the smallest column selection that covers the given anchor
-	  // and head cell.
-	  CellSelection.colSelection = function colSelection ($anchorCell, $headCell) {
-	    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-	    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
-	    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
-	    var doc = $anchorCell.node(0);
-	    if (anchorRect.top <= headRect.top) {
-	      if (anchorRect.top > 0)
-	        { $anchorCell = doc.resolve(start + map.map[anchorRect.left]); }
-	      if (headRect.bottom < map.height)
-	        { $headCell = doc.resolve(start + map.map[map.width * (map.height - 1) + headRect.right - 1]); }
-	    } else {
-	      if (headRect.top > 0)
-	        { $headCell = doc.resolve(start + map.map[headRect.left]); }
-	      if (anchorRect.bottom < map.height)
-	        { $anchorCell = doc.resolve(start + map.map[map.width * (map.height - 1) + anchorRect.right - 1]); }
-	    }
-	    return new CellSelection($anchorCell, $headCell)
-	  };
-
-	  // :: () → bool
-	  // True if this selection goes all the way from the left to the
-	  // right of the table.
-	  CellSelection.prototype.isRowSelection = function isRowSelection () {
-	    var map = TableMap.get(this.$anchorCell.node(-1)), start = this.$anchorCell.start(-1);
-	    var anchorLeft = map.colCount(this.$anchorCell.pos - start),
-	        headLeft = map.colCount(this.$headCell.pos - start);
-	    if (Math.min(anchorLeft, headLeft) > 0) { return false }
-	    var anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan,
-	        headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;
-	    return Math.max(anchorRight, headRight) == map.width
-	  };
-
-	  CellSelection.prototype.eq = function eq (other) {
-	    return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos &&
-	      other.$headCell.pos == this.$headCell.pos
-	  };
-
-	  // :: (ResolvedPos, ?ResolvedPos) → CellSelection
-	  // Returns the smallest row selection that covers the given anchor
-	  // and head cell.
-	  CellSelection.rowSelection = function rowSelection ($anchorCell, $headCell) {
-	    if ( $headCell === void 0 ) { $headCell = $anchorCell; }
-
-	    var map = TableMap.get($anchorCell.node(-1)), start = $anchorCell.start(-1);
-	    var anchorRect = map.findCell($anchorCell.pos - start), headRect = map.findCell($headCell.pos - start);
-	    var doc = $anchorCell.node(0);
-	    if (anchorRect.left <= headRect.left) {
-	      if (anchorRect.left > 0)
-	        { $anchorCell = doc.resolve(start + map.map[anchorRect.top * map.width]); }
-	      if (headRect.right < map.width)
-	        { $headCell = doc.resolve(start + map.map[map.width * (headRect.top + 1) - 1]); }
-	    } else {
-	      if (headRect.left > 0)
-	        { $headCell = doc.resolve(start + map.map[headRect.top * map.width]); }
-	      if (anchorRect.right < map.width)
-	        { $anchorCell = doc.resolve(start + map.map[map.width * (anchorRect.top + 1) - 1]); }
-	    }
-	    return new CellSelection($anchorCell, $headCell)
-	  };
-
-	  CellSelection.prototype.toJSON = function toJSON () {
-	    return {type: "cell", anchor: this.$anchorCell.pos, head: this.$headCell.pos}
-	  };
-
-	  CellSelection.fromJSON = function fromJSON (doc, json) {
-	    return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head))
-	  };
-
-	  // :: (Node, number, ?number) → CellSelection
-	  CellSelection.create = function create (doc, anchorCell, headCell) {
-	    if ( headCell === void 0 ) { headCell = anchorCell; }
-
-	    return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell))
-	  };
-
-	  CellSelection.prototype.getBookmark = function getBookmark () { return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos) };
-
-	  return CellSelection;
-	}(dist$2.Selection));
-
-	CellSelection.prototype.visible = false;
-
-	dist$2.Selection.jsonID("cell", CellSelection);
-
-	var CellBookmark = function CellBookmark(anchor, head) {
-	  this.anchor = anchor;
-	  this.head = head;
-	};
-	CellBookmark.prototype.map = function map (mapping) {
-	  return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head))
-	};
-	CellBookmark.prototype.resolve = function resolve (doc) {
-	  var $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);
-	  if ($anchorCell.parent.type.spec.tableRole == "row" &&
-	      $headCell.parent.type.spec.tableRole == "row" &&
-	      $anchorCell.index() < $anchorCell.parent.childCount &&
-	      $headCell.index() < $headCell.parent.childCount &&
-	      inSameTable($anchorCell, $headCell))
-	    { return new CellSelection($anchorCell, $headCell) }
-	  else
-	    { return dist$2.Selection.near($headCell, 1) }
-	};
-
-	function drawCellSelection(state) {
-	  if (!(state.selection instanceof CellSelection)) { return null }
-	  var cells = [];
-	  state.selection.forEachCell(function (node, pos) {
-	    cells.push(dist$3.Decoration.node(pos, pos + node.nodeSize, {class: "selectedCell"}));
-	  });
-	  return dist$3.DecorationSet.create(state.doc, cells)
-	}
-
-	function isCellBoundarySelection(ref) {
-	  var $from = ref.$from;
-	  var $to = ref.$to;
-
-	  if ($from.pos == $to.pos || $from.pos < $from.pos - 6) { return false } // Cheap elimination
-	  var afterFrom = $from.pos, beforeTo = $to.pos, depth = $from.depth;
-	  for (; depth >= 0; depth--, afterFrom++)
-	    { if ($from.after(depth + 1) < $from.end(depth)) { break } }
-	  for (var d = $to.depth; d >= 0; d--, beforeTo--)
-	    { if ($to.before(d + 1) > $to.start(d)) { break } }
-	  return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole)
-	}
-
-	function normalizeSelection(state, tr) {
-	  var sel = (tr || state).selection, doc = (tr || state).doc, normalize, role;
-	  if (sel instanceof dist$2.NodeSelection && (role = sel.node.type.spec.tableRole)) {
-	    if (role == "cell" || role == "header_cell") {
-	      normalize = CellSelection.create(doc, sel.from);
-	    } else if (role == "row") {
-	      var $cell = doc.resolve(sel.from + 1);
-	      normalize = CellSelection.rowSelection($cell, $cell);
-	    } else {
-	      var map = TableMap.get(sel.node), start = sel.from + 1;
-	      var lastCell = start + map.map[map.width * map.height - 1];
-	      normalize = CellSelection.create(doc, start + 1, lastCell);
-	    }
-	  } else if (sel instanceof dist$2.TextSelection && isCellBoundarySelection(sel)) {
-	    normalize = dist$2.TextSelection.create(doc, sel.from);
-	  }
-	  if (normalize)
-	    { (tr || (tr = state.tr)).setSelection(normalize); }
-	  return tr
-	}
-
-	// Helper for creating a schema that supports tables.
-
-	function getCellAttrs(dom, extraAttrs) {
-	  var widthAttr = dom.getAttribute("data-colwidth");
-	  var widths = widthAttr && /^\d+(,\d+)*$/.test(widthAttr) ? widthAttr.split(",").map(function (s) { return Number(s); }) : null;
-	  var colspan = Number(dom.getAttribute("colspan") || 1);
-	  var result = {
-	    colspan: colspan,
-	    rowspan: Number(dom.getAttribute("rowspan") || 1),
-	    colwidth: widths && widths.length == colspan ? widths : null
-	  };
-	  for (var prop in extraAttrs) {
-	    var getter = extraAttrs[prop].getFromDOM;
-	    var value = getter && getter(dom);
-	    if (value != null) { result[prop] = value; }
-	  }
-	  return result
-	}
-
-	function setCellAttrs(node, extraAttrs) {
-	  var attrs = {};
-	  if (node.attrs.colspan != 1) { attrs.colspan = node.attrs.colspan; }
-	  if (node.attrs.rowspan != 1) { attrs.rowspan = node.attrs.rowspan; }
-	  if (node.attrs.colwidth)
-	    { attrs["data-colwidth"] = node.attrs.colwidth.join(","); }
-	  for (var prop in extraAttrs) {
-	    var setter = extraAttrs[prop].setDOMAttr;
-	    if (setter) { setter(node.attrs[prop], attrs); }
-	  }
-	  return attrs
-	}
-
-	// :: (Object) → Object
-	//
-	// This function creates a set of [node
-	// specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for
-	// `table`, `table_row`, and `table_cell` nodes types as used by this
-	// module. The result can then be added to the set of nodes when
-	// creating a a schema.
-	//
-	//   options::- The following options are understood:
-	//
-	//     tableGroup:: ?string
-	//     A group name (something like `"block"`) to add to the table
-	//     node type.
-	//
-	//     cellContent:: string
-	//     The content expression for table cells.
-	//
-	//     cellAttributes:: ?Object
-	//     Additional attributes to add to cells. Maps attribute names to
-	//     objects with the following properties:
-	//
-	//       default:: any
-	//       The attribute's default value.
-	//
-	//       getFromDOM:: ?(dom.Node) → any
-	//       A function to read the attribute's value from a DOM node.
-	//
-	//       setDOMAttr:: ?(value: any, attrs: Object)
-	//       A function to add the attribute's value to an attribute
-	//       object that's used to render the cell's DOM.
-	function tableNodes(options) {
-	  var extraAttrs = options.cellAttributes || {};
-	  var cellAttrs = {
-	    colspan: {default: 1},
-	    rowspan: {default: 1},
-	    colwidth: {default: null}
-	  };
-	  for (var prop in extraAttrs)
-	    { cellAttrs[prop] = {default: extraAttrs[prop].default}; }
-
-	  return {
-	    table: {
-	      content: "table_row+",
-	      tableRole: "table",
-	      isolating: true,
-	      group: options.tableGroup,
-	      parseDOM: [{tag: "table"}],
-	      toDOM: function toDOM() { return ["table", ["tbody", 0]] }
-	    },
-	    table_row: {
-	      content: "(table_cell | table_header)*",
-	      tableRole: "row",
-	      parseDOM: [{tag: "tr"}],
-	      toDOM: function toDOM() { return ["tr", 0] }
-	    },
-	    table_cell: {
-	      content: options.cellContent,
-	      attrs: cellAttrs,
-	      tableRole: "cell",
-	      isolating: true,
-	      parseDOM: [{tag: "td", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
-	      toDOM: function toDOM(node) { return ["td", setCellAttrs(node, extraAttrs), 0] }
-	    },
-	    table_header: {
-	      content: options.cellContent,
-	      attrs: cellAttrs,
-	      tableRole: "header_cell",
-	      isolating: true,
-	      parseDOM: [{tag: "th", getAttrs: function (dom) { return getCellAttrs(dom, extraAttrs); }}],
-	      toDOM: function toDOM(node) { return ["th", setCellAttrs(node, extraAttrs), 0] }
-	    }
-	  }
-	}
-
-	function tableNodeTypes(schema) {
-	  var result = schema.cached.tableNodeTypes;
-	  if (!result) {
-	    result = schema.cached.tableNodeTypes = {};
-	    for (var name in schema.nodes) {
-	      var type = schema.nodes[name], role = type.spec.tableRole;
-	      if (role) { result[role] = type; }
-	    }
-	  }
-	  return result
-	}
-
-	// Utilities used for copy/paste handling.
-
-	// Utilities to help with copying and pasting table cells
-
-	// : (Slice) → ?{width: number, height: number, rows: [Fragment]}
-	// Get a rectangular area of cells from a slice, or null if the outer
-	// nodes of the slice aren't table cells or rows.
-	function pastedCells(slice) {
-	  if (!slice.size) { return null }
-	  var content = slice.content;
-	  var openStart = slice.openStart;
-	  var openEnd = slice.openEnd;
-	  while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.firstChild.type.spec.tableRole == "table")) {
-	    openStart--;
-	    openEnd--;
-	    content = content.firstChild.content;
-	  }
-	  var first = content.firstChild, role = first.type.spec.tableRole;
-	  var schema = first.type.schema, rows = [];
-	  if (role == "row") {
-	    for (var i = 0; i < content.childCount; i++) {
-	      var cells = content.child(i).content;
-	      var left = i ? 0 : Math.max(0, openStart - 1);
-	      var right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);
-	      if (left || right) { cells = fitSlice(tableNodeTypes(schema).row, new dist.Slice(cells, left, right)).content; }
-	      rows.push(cells);
-	    }
-	  } else if (role == "cell" || role == "header_cell") {
-	    rows.push(openStart || openEnd ? fitSlice(tableNodeTypes(schema).row, new dist.Slice(content, openStart, openEnd)).content : content);
-	  } else {
-	    return null
-	  }
-	  return ensureRectangular(schema, rows)
-	}
-
-	// : (Schema, [Fragment]) → {width: number, height: number, rows: [Fragment]}
-	// Compute the width and height of a set of cells, and make sure each
-	// row has the same number of cells.
-	function ensureRectangular(schema, rows) {
-	  var widths = [];
-	  for (var i = 0; i < rows.length; i++) {
-	    var row = rows[i];
-	    for (var j = row.childCount - 1; j >= 0; j--) {
-	      var ref = row.child(j).attrs;
-	      var rowspan = ref.rowspan;
-	      var colspan = ref.colspan;
-	      for (var r = i; r < i + rowspan; r++)
-	        { widths[r] = (widths[r] || 0) + colspan; }
-	    }
-	  }
-	  var width = 0;
-	  for (var r$1 = 0; r$1 < widths.length; r$1++) { width = Math.max(width, widths[r$1]); }
-	  for (var r$2 = 0; r$2 < widths.length; r$2++) {
-	    if (r$2 >= rows.length) { rows.push(dist.Fragment.empty); }
-	    if (widths[r$2] < width) {
-	      var empty = tableNodeTypes(schema).cell.createAndFill(), cells = [];
-	      for (var i$1 = widths[r$2]; i$1 < width; i$1++) { cells.push(empty); }
-	      rows[r$2] = rows[r$2].append(dist.Fragment.from(cells));
-	    }
-	  }
-	  return {height: rows.length, width: width, rows: rows}
-	}
-
-	function fitSlice(nodeType, slice) {
-	  var node = nodeType.createAndFill();
-	  var tr = new dist$1.Transform(node).replace(0, node.content.size, slice);
-	  return tr.doc
-	}
-
-	// : ({width: number, height: number, rows: [Fragment]}, number, number) → {width: number, height: number, rows: [Fragment]}
-	// Clip or extend (repeat) the given set of cells to cover the given
-	// width and height. Will clip rowspan/colspan cells at the edges when
-	// they stick out.
-	function clipCells(ref, newWidth, newHeight) {
-	  var width = ref.width;
-	  var height = ref.height;
-	  var rows = ref.rows;
-
-	  if (width != newWidth) {
-	    var added = [], newRows = [];
-	    for (var row = 0; row < rows.length; row++) {
-	      var frag = rows[row], cells = [];
-	      for (var col = added[row] || 0, i = 0; col < newWidth; i++) {
-	        var cell = frag.child(i % frag.childCount);
-	        if (col + cell.attrs.colspan > newWidth)
-	          { cell = cell.type.create(rmColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content); }
-	        cells.push(cell);
-	        col += cell.attrs.colspan;
-	        for (var j = 1; j < cell.attrs.rowspan; j++)
-	          { added[row + j] = (added[row + j] || 0) + cell.attrs.colspan; }
-	      }
-	      newRows.push(dist.Fragment.from(cells));
-	    }
-	    rows = newRows;
-	    width = newWidth;
-	  }
-
-	  if (height != newHeight) {
-	    var newRows$1 = [];
-	    for (var row$1 = 0, i$1 = 0; row$1 < newHeight; row$1++, i$1++) {
-	      var cells$1 = [], source = rows[i$1 % height];
-	      for (var j$1 = 0; j$1 < source.childCount; j$1++) {
-	        var cell$1 = source.child(j$1);
-	        if (row$1 + cell$1.attrs.rowspan > newHeight)
-	          { cell$1 = cell$1.type.create(setAttr(cell$1.attrs, "rowspan", newHeight - cell$1.attrs.rowspan), cell$1.content); }
-	        cells$1.push(cell$1);
-	      }
-	      newRows$1.push(dist.Fragment.from(cells$1));
-	    }
-	    rows = newRows$1;
-	    height = newHeight;
-	  }
-
-	  return {width: width, height: height, rows: rows}
-	}
-
-	// Make sure a table has at least the given width and height. Return
-	// true if something was changed.
-	function growTable(tr, map, table, start, width, height, mapFrom) {
-	  var schema = tr.doc.type.schema, types = tableNodeTypes(schema), empty, emptyHead;
-	  if (width > map.width) {
-	    for (var row = 0, rowEnd = 0; row < map.height; row++) {
-	      var rowNode = table.child(row);
-	      rowEnd += rowNode.nodeSize;
-	      var cells = [], add = (void 0);
-	      if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)
-	        { add = empty || (empty = types.cell.createAndFill()); }
-	      else
-	        { add = emptyHead || (emptyHead = types.header_cell.createAndFill()); }
-	      for (var i = map.width; i < width; i++) { cells.push(add); }
-	      tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);
-	    }
-	  }
-	  if (height > map.height) {
-	    var cells$1 = [];
-	    for (var i$1 = 0, start$1 = (map.height - 1) * map.width; i$1 < Math.max(map.width, width); i$1++) {
-	      var header = i$1 >= map.width ? false :
-	          table.nodeAt(map.map[start$1 + i$1]).type == types.header_cell;
-	      cells$1.push(header
-	                 ? (emptyHead || (emptyHead = types.header_cell.createAndFill()))
-	                 : (empty || (empty = types.cell.createAndFill())));
-	    }
-
-	    var emptyRow = types.row.create(null, dist.Fragment.from(cells$1)), rows = [];
-	    for (var i$2 = map.height; i$2 < height; i$2++) { rows.push(emptyRow); }
-	    tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);
-	  }
-	  return !!(empty || emptyHead)
-	}
-
-	// Make sure the given line (left, top) to (right, top) doesn't cross
-	// any rowspan cells by splitting cells that cross it. Return true if
-	// something changed.
-	function isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {
-	  if (top == 0 || top == map.height) { return false }
-	  var found = false;
-	  for (var col = left; col < right; col++) {
-	    var index = top * map.width + col, pos = map.map[index];
-	    if (map.map[index - map.width] == pos) {
-	      found = true;
-	      var cell = table.nodeAt(pos);
-	      var ref = map.findCell(pos);
-	      var cellTop = ref.top;
-	      var cellLeft = ref.left;
-	      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, setAttr(cell.attrs, "rowspan", top - cellTop));
-	      tr.insert(tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),
-	                cell.type.createAndFill(setAttr(cell.attrs, "rowspan", (cellTop + cell.attrs.rowspan) - top)));
-	      col += cell.attrs.colspan - 1;
-	    }
-	  }
-	  return found
-	}
-
-	// Make sure the given line (left, top) to (left, bottom) doesn't
-	// cross any colspan cells by splitting cells that cross it. Return
-	// true if something changed.
-	function isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {
-	  if (left == 0 || left == map.width) { return false }
-	  var found = false;
-	  for (var row = top; row < bottom; row++) {
-	    var index = row * map.width + left, pos = map.map[index];
-	    if (map.map[index - 1] == pos) {
-	      found = true;
-	      var cell = table.nodeAt(pos), cellLeft = map.colCount(pos);
-	      var updatePos = tr.mapping.slice(mapFrom).map(pos + start);
-	      tr.setNodeMarkup(updatePos, null, rmColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)));
-	      tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(rmColSpan(cell.attrs, 0, left - cellLeft)));
-	      row += cell.attrs.rowspan - 1;
-	    }
-	  }
-	  return found
-	}
-
-	// Insert the given set of cells (as returned by `pastedCells`) into a
-	// table, at the position pointed at by rect.
-	function insertCells(state, dispatch, tableStart, rect, cells) {
-	  var table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc, map = TableMap.get(table);
-	  var top = rect.top;
-	  var left = rect.left;
-	  var right = left + cells.width, bottom = top + cells.height;
-	  var tr = state.tr, mapFrom = 0;
-	  function recomp() {
-	    table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;
-	    map = TableMap.get(table);
-	    mapFrom = tr.mapping.maps.length;
-	  }
-	  // Prepare the table to be large enough and not have any cells
-	  // crossing the boundaries of the rectangle that we want to
-	  // insert into. If anything about it changes, recompute the table
-	  // map so that subsequent operations can see the current shape.
-	  if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) { recomp(); }
-	  if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom)) { recomp(); }
-	  if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)) { recomp(); }
-	  if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom)) { recomp(); }
-	  if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom)) { recomp(); }
-
-	  for (var row = top; row < bottom; row++) {
-	    var from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);
-	    tr.replace(tr.mapping.slice(mapFrom).map(from + tableStart), tr.mapping.slice(mapFrom).map(to + tableStart),
-	               new dist.Slice(cells.rows[row - top], 0, 0));
-	  }
-	  recomp();
-	  tr.setSelection(new CellSelection(tr.doc.resolve(tableStart + map.positionAt(top, left, table)),
-	                                    tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))));
-	  dispatch(tr);
-	}
-
-	// This file defines a number of helpers for wiring up user input to
-
-	var handleKeyDown = keymap_1.keydownHandler({
-	  "ArrowLeft": arrow("horiz", -1),
-	  "ArrowRight": arrow("horiz", 1),
-	  "ArrowUp": arrow("vert", -1),
-	  "ArrowDown": arrow("vert", 1),
-
-	  "Shift-ArrowLeft": shiftArrow("horiz", -1),
-	  "Shift-ArrowRight": shiftArrow("horiz", 1),
-	  "Shift-ArrowUp": shiftArrow("vert", -1),
-	  "Shift-ArrowDown": shiftArrow("vert", 1),
-
-	  "Backspace": deleteCellSelection,
-	  "Mod-Backspace": deleteCellSelection,
-	  "Delete": deleteCellSelection,
-	  "Mod-Delete": deleteCellSelection
-	});
-
-	function maybeSetSelection(state, dispatch, selection) {
-	  if (selection.eq(state.selection)) { return false }
-	  if (dispatch) { dispatch(state.tr.setSelection(selection)); }
-	  return true
-	}
-
-	function arrow(axis, dir) {
-	  return function (state, dispatch, view) {
-	    var sel = state.selection;
-	    if (sel instanceof CellSelection) {
-	      return maybeSetSelection(state, dispatch, dist$2.Selection.near(sel.$headCell, dir))
-	    }
-	    if (axis != "horiz" && !sel.empty) { return false }
-	    var end = atEndOfCell(view, axis, dir);
-	    if (end == null) { return false }
-	    if (axis == "horiz") {
-	      return maybeSetSelection(state, dispatch, dist$2.Selection.near(state.doc.resolve(sel.head + dir), dir))
-	    } else {
-	      var $cell = state.doc.resolve(end), $next = nextCell($cell, axis, dir), newSel;
-	      if ($next) { newSel = dist$2.Selection.near($next, 1); }
-	      else if (dir < 0) { newSel = dist$2.Selection.near(state.doc.resolve($cell.before(-1)), -1); }
-	      else { newSel = dist$2.Selection.near(state.doc.resolve($cell.after(-1)), 1); }
-	      return maybeSetSelection(state, dispatch, newSel)
-	    }
-	  }
-	}
-
-	function shiftArrow(axis, dir) {
-	  return function (state, dispatch, view) {
-	    var sel = state.selection;
-	    if (!(sel instanceof CellSelection)) {
-	      var end = atEndOfCell(view, axis, dir);
-	      if (end == null) { return false }
-	      sel = new CellSelection(state.doc.resolve(end));
-	    }
-	    var $head = nextCell(sel.$headCell, axis, dir);
-	    if (!$head) { return false }
-	    return maybeSetSelection(state, dispatch, new CellSelection(sel.$anchorCell, $head))
-	  }
-	}
-
-	function deleteCellSelection(state, dispatch) {
-	  var sel = state.selection;
-	  if (!(sel instanceof CellSelection)) { return false }
-	  if (dispatch) {
-	    var tr = state.tr, baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;
-	    sel.forEachCell(function (cell, pos) {
-	      if (!cell.content.eq(baseContent))
-	        { tr.replace(tr.mapping.map(pos + 1), tr.mapping.map(pos + cell.nodeSize - 1),
-	                   new dist.Slice(baseContent, 0, 0)); }
-	    });
-	    if (tr.docChanged) { dispatch(tr); }
-	  }
-	  return true
-	}
-
-	function handleTripleClick(view, pos) {
-	  var doc = view.state.doc, $cell = cellAround(doc.resolve(pos));
-	  if (!$cell) { return false }
-	  view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));
-	  return true
-	}
-
-	function handlePaste(view, _, slice) {
-	  if (!isInTable(view.state)) { return false }
-	  var cells = pastedCells(slice), sel = view.state.selection;
-	  if (sel instanceof CellSelection) {
-	    if (!cells) { cells = {width: 1, height: 1, rows: [dist.Fragment.from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]}; }
-	    var table = sel.$anchorCell.node(-1), start = sel.$anchorCell.start(-1);
-	    var rect = TableMap.get(table).rectBetween(sel.$anchorCell.pos - start, sel.$headCell.pos - start);
-	    cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);
-	    insertCells(view.state, view.dispatch, start, rect, cells);
-	    return true
-	  } else if (cells) {
-	    var $cell = selectionCell(view.state), start$1 = $cell.start(-1);
-	    insertCells(view.state, view.dispatch, start$1, TableMap.get($cell.node(-1)).findCell($cell.pos - start$1), cells);
-	    return true
-	  } else {
-	    return false
-	  }
-	}
-
-	function handleMouseDown(view, startEvent) {
-	  if (startEvent.ctrlKey || startEvent.metaKey) { return }
-
-	  var startDOMCell = domInCell(view, startEvent.target), $anchor;
-	  if (startEvent.shiftKey && (view.state.selection instanceof CellSelection)) {
-	    // Adding to an existing cell selection
-	    setCellSelection(view.state.selection.$anchorCell, startEvent);
-	    startEvent.preventDefault();
-	  } else if (startEvent.shiftKey && startDOMCell &&
-	             ($anchor = cellAround(view.state.selection.$anchor)) != null &&
-	             cellUnderMouse(view, startEvent).pos != $anchor.pos) {
-	    // Adding to a selection that starts in another cell (causing a
-	    // cell selection to be created).
-	    setCellSelection($anchor, startEvent);
-	    startEvent.preventDefault();
-	  } else if (!startDOMCell) {
-	    // Not in a cell, let the default behavior happen.
-	    return
-	  }
-
-	  // Create and dispatch a cell selection between the given anchor and
-	  // the position under the mouse.
-	  function setCellSelection($anchor, event) {
-	    var $head = cellUnderMouse(view, event);
-	    var starting = key.getState(view.state) == null;
-	    if (!$head || !inSameTable($anchor, $head)) {
-	      if (starting) { $head = $anchor; }
-	      else { return }
-	    }
-	    var selection = new CellSelection($anchor, $head);
-	    if (starting || !view.state.selection.eq(selection)) {
-	      var tr = view.state.tr.setSelection(selection);
-	      if (starting) { tr.setMeta(key, $anchor.pos); }
-	      view.dispatch(tr);
-	    }
-	  }
-
-	  // Stop listening to mouse motion events.
-	  function stop() {
-	    view.root.removeEventListener("mouseup", stop);
-	    view.root.removeEventListener("dragstart", stop);
-	    view.root.removeEventListener("mousemove", move);
-	    if (key.getState(view.state) != null) { view.dispatch(view.state.tr.setMeta(key, -1)); }
-	  }
-
-	  function move(event) {
-	    var anchor = key.getState(view.state), $anchor;
-	    if (anchor != null) {
-	      // Continuing an existing cross-cell selection
-	      $anchor = view.state.doc.resolve(anchor);
-	    } else if (domInCell(view, event.target) != startDOMCell) {
-	      // Moving out of the initial cell -- start a new cell selection
-	      $anchor = cellUnderMouse(view, startEvent);
-	      if (!$anchor) { return stop() }
-	    }
-	    if ($anchor) { setCellSelection($anchor, event); }
-	  }
-	  view.root.addEventListener("mouseup", stop);
-	  view.root.addEventListener("dragstart", stop);
-	  view.root.addEventListener("mousemove", move);
-	}
-
-	// Check whether the cursor is at the end of a cell (so that further
-	// motion would move out of the cell)
-	function atEndOfCell(view, axis, dir) {
-	  if (!(view.state.selection instanceof dist$2.TextSelection)) { return null }
-	  var ref = view.state.selection;
-	  var $head = ref.$head;
-	  for (var d = $head.depth - 1; d >= 0; d--) {
-	    var parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d);
-	    if (index != (dir < 0 ? 0 : parent.childCount)) { return null }
-	    if (parent.type.spec.tableRole == "cell" || parent.type.spec.tableRole == "header_cell") {
-	      var cellPos = $head.before(d);
-	      var dirStr = axis == "vert" ? (dir > 0 ? "down" : "up") : (dir > 0 ? "right" : "left");
-	      return view.endOfTextblock(dirStr) ? cellPos : null
-	    }
-	  }
-	  return null
-	}
-
-	function domInCell(view, dom) {
-	  for (; dom && dom != view.dom; dom = dom.parentNode)
-	    { if (dom.nodeName == "TD" || dom.nodeName == "TH") { return dom } }
-	}
-
-	function cellUnderMouse(view, event) {
-	  var mousePos = view.posAtCoords({left: event.clientX, top: event.clientY});
-	  if (!mousePos) { return null }
-	  return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null
-	}
-
-	// This file defines helpers for normalizing tables, making sure no
-
-	// Helper for iterating through the nodes in a document that changed
-	// compared to the given previous document. Useful for avoiding
-	// duplicate work on each transaction.
-	function changedDescendants(old, cur, offset, f) {
-	  var oldSize = old.childCount, curSize = cur.childCount;
-	  outer: for (var i = 0, j = 0; i < curSize; i++) {
-	    var child = cur.child(i);
-	    for (var scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {
-	      if (old.child(scan) == child) {
-	        j = scan + 1;
-	        offset += child.nodeSize;
-	        continue outer
-	      }
-	    }
-	    f(child, offset);
-	    if (j < oldSize && old.child(j).sameMarkup(child))
-	      { changedDescendants(old.child(j), child, offset + 1, f); }
-	    else
-	      { child.nodesBetween(0, child.content.size, f, offset + 1); }
-	    offset += child.nodeSize;
-	  }
-	}
-
-	// :: (EditorState, ?EditorState) → ?Transaction
-	// Inspect all tables in the given state's document and return a
-	// transaction that fixes them, if necessary. If `oldState` was
-	// provided, that is assumed to hold a previous, known-good state,
-	// which will be used to avoid re-scanning unchanged parts of the
-	// document.
-	function fixTables(state, oldState) {
-	  var tr, check = function (node, pos) {
-	    if (node.type.spec.tableRole == "table") { tr = fixTable(state, node, pos, tr); }
-	  };
-	  if (!oldState) { state.doc.descendants(check); }
-	  else if (oldState.doc != state.doc) { changedDescendants(oldState.doc, state.doc, 0, check); }
-	  return tr
-	}
-
-	// : (EditorState, Node, number, ?Transaction) → ?Transaction
-	// Fix the given table, if necessary. Will append to the transaction
-	// it was given, if non-null, or create a new one if necessary.
-	function fixTable(state, table, tablePos, tr) {
-	  var map = TableMap.get(table);
-	  if (!map.problems) { return tr }
-	  if (!tr) { tr = state.tr; }
-
-	  // Track which rows we must add cells to, so that we can adjust that
-	  // when fixing collisions.
-	  var mustAdd = [];
-	  for (var i = 0; i < map.height; i++) { mustAdd.push(0); }
-	  for (var i$1 = 0; i$1 < map.problems.length; i$1++) {
-	    var prob = map.problems[i$1];
-	    if (prob.type == "collision") {
-	      var cell = table.nodeAt(prob.pos);
-	      for (var j = 0; j < cell.attrs.rowspan; j++) { mustAdd[prob.row + j] += prob.n; }
-	      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, rmColSpan(cell.attrs, cell.attrs.colspan - prob.n, prob.n));
-	    } else if (prob.type == "missing") {
-	      mustAdd[prob.row] += prob.n;
-	    } else if (prob.type == "overlong_rowspan") {
-	      var cell$1 = table.nodeAt(prob.pos);
-	      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$1.attrs, "rowspan", cell$1.attrs.rowspan - prob.n));
-	    } else if (prob.type == "colwidth mismatch") {
-	      var cell$2 = table.nodeAt(prob.pos);
-	      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, setAttr(cell$2.attrs, "colwidth", prob.colwidth));
-	    }
-	  }
-	  var first, last;
-	  for (var i$2 = 0; i$2 < mustAdd.length; i$2++) { if (mustAdd[i$2]) {
-	    if (first == null) { first = i$2; }
-	    last = i$2;
-	  } }
-	  // Add the necessary cells, using a heuristic for whether to add the
-	  // cells at the start or end of the rows (if it looks like a 'bite'
-	  // was taken out of the table, add cells at the start of the row
-	  // after the bite. Otherwise add them at the end).
-	  for (var i$3 = 0, pos = tablePos + 1; i$3 < map.height; i$3++) {
-	    var end = pos + table.child(i$3).nodeSize;
-	    var add = mustAdd[i$3];
-	    if (add > 0) {
-	      var nodes = [];
-	      for (var j$1 = 0; j$1 < add; j$1++)
-	        { nodes.push(tableNodeTypes(state.schema).cell.createAndFill()); }
-	      var side = (i$3 == 0 || first == i$3 - 1) && last == i$3 ? pos + 1 : end - 1;
-	      tr.insert(tr.mapping.map(side), nodes);
-	    }
-	    pos = end;
-	  }
-	  return tr
-	}
-
-	// This file defines a number of table-related commands.
-
-	// Helper to get the selected rectangle in a table, if any. Adds table
-	// map, table node, and table start offset to the object for
-	// convenience.
-	function selectedRect(state) {
-	  var sel = state.selection, $pos = selectionCell(state);
-	  var table = $pos.node(-1), tableStart = $pos.start(-1), map = TableMap.get(table);
-	  var rect;
-	  if (sel instanceof CellSelection)
-	    { rect = map.rectBetween(sel.$anchorCell.pos - tableStart, sel.$headCell.pos - tableStart); }
-	  else
-	    { rect = map.findCell($pos.pos - tableStart); }
-	  rect.tableStart = tableStart;
-	  rect.map = map;
-	  rect.table = table;
-	  return rect
-	}
-
-	function columnIsHeader(map, table, col) {
-	  var headerCell = tableNodeTypes(table.type.schema).header_cell;
-	  for (var row = 0; row < map.height; row++)
-	    { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
-	      { return false } }
-	  return true
-	}
-
-	// Add a column at the given position in a table.
-	function addColumn(tr, ref, col) {
-	  var map = ref.map;
-	  var tableStart = ref.tableStart;
-	  var table = ref.table;
-
-	  var refColumn = col > 0 ? -1 : 0;
-	  if (columnIsHeader(map, table, col + refColumn))
-	    { refColumn = col == 0 || col == map.width ? null : 0; }
-
-	  for (var row = 0; row < map.height; row++) {
-	    var index = row * map.width + col;
-	    // If this position falls inside a col-spanning cell
-	    if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {
-	      var pos = map.map[index], cell = table.nodeAt(pos);
-	      tr.setNodeMarkup(tr.mapping.map(tableStart + pos), null,
-	                       addColSpan(cell.attrs, col - map.colCount(pos)));
-	      // Skip ahead if rowspan > 1
-	      row += cell.attrs.rowspan - 1;
-	    } else {
-	      var type = refColumn == null ? tableNodeTypes(table.type.schema).cell
-	          : table.nodeAt(map.map[index + refColumn]).type;
-	      var pos$1 = map.positionAt(row, col, table);
-	      tr.insert(tr.mapping.map(tableStart + pos$1), type.createAndFill());
-	    }
-	  }
-	  return tr
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Command to add a column before the column with the selection.
-	function addColumnBefore(state, dispatch) {
-	  if (!isInTable(state)) { return false }
-	  if (dispatch) {
-	    var rect = selectedRect(state);
-	    dispatch(addColumn(state.tr, rect, rect.left));
-	  }
-	  return true
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Command to add a column after the column with the selection.
-	function addColumnAfter(state, dispatch) {
-	  if (!isInTable(state)) { return false }
-	  if (dispatch) {
-	    var rect = selectedRect(state);
-	    dispatch(addColumn(state.tr, rect, rect.right));
-	  }
-	  return true
-	}
-
-	function removeColumn(tr, ref, col) {
-	  var map = ref.map;
-	  var table = ref.table;
-	  var tableStart = ref.tableStart;
-
-	  var mapStart = tr.mapping.maps.length;
-	  for (var row = 0; row < map.height;) {
-	    var index = row * map.width + col, pos = map.map[index], cell = table.nodeAt(pos);
-	    // If this is part of a col-spanning cell
-	    if ((col > 0 && map.map[index - 1] == pos) || (col < map.width - 1 && map.map[index + 1] == pos)) {
-	      tr.setNodeMarkup(tr.mapping.slice(mapStart).map(tableStart + pos), null,
-	                       rmColSpan(cell.attrs, col - map.colCount(pos)));
-	    } else {
-	      var start = tr.mapping.slice(mapStart).map(tableStart + pos);
-	      tr.delete(start, start + cell.nodeSize);
-	    }
-	    row += cell.attrs.rowspan;
-	  }
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Command function that removes the selected columns from a table.
-	function deleteColumn(state, dispatch) {
-	  if (!isInTable(state)) { return false }
-	  if (dispatch) {
-	    var rect = selectedRect(state), tr = state.tr;
-	    if (rect.left == 0 && rect.right == rect.map.width) { return false }
-	    for (var i = rect.right - 1;; i--) {
-	      removeColumn(tr, rect, i);
-	      if (i == rect.left) { break }
-	      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
-	      rect.map = TableMap.get(rect.table);
-	    }
-	    dispatch(tr);
-	  }
-	  return true
-	}
-
-	function rowIsHeader(map, table, row) {
-	  var headerCell = tableNodeTypes(table.type.schema).header_cell;
-	  for (var col = 0; col < map.width; col++)
-	    { if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)
-	      { return false } }
-	  return true
-	}
-
-	function addRow(tr, ref, row) {
-	  var map = ref.map;
-	  var tableStart = ref.tableStart;
-	  var table = ref.table;
-
-	  var rowPos = tableStart;
-	  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
-	  var cells = [], refRow = row > 0 ? -1 : 0;
-	  if (rowIsHeader(map, table, row + refRow))
-	    { refRow = row == 0 || row == map.height ? null : 0; }
-	  for (var col = 0, index = map.width * row; col < map.width; col++, index++) {
-	    // Covered by a rowspan cell
-	    if (row > 0 && row < map.height && map.map[index] == map.map[index - map.width]) {
-	      var pos = map.map[index], attrs = table.nodeAt(pos).attrs;
-	      tr.setNodeMarkup(tableStart + pos, null, setAttr(attrs, "rowspan", attrs.rowspan + 1));
-	      col += attrs.colspan - 1;
-	    } else {
-	      var type = refRow == null ? tableNodeTypes(table.type.schema).cell
-	          : table.nodeAt(map.map[index + refRow * map.width]).type;
-	      cells.push(type.createAndFill());
-	    }
-	  }
-	  tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells));
-	  return tr
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Add a table row before the selection.
-	function addRowBefore(state, dispatch) {
-	  if (!isInTable(state)) { return false }
-	  if (dispatch) {
-	    var rect = selectedRect(state);
-	    dispatch(addRow(state.tr, rect, rect.top));
-	  }
-	  return true
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Add a table row after the selection.
-	function addRowAfter(state, dispatch) {
-	  if (!isInTable(state)) { return false }
-	  if (dispatch) {
-	    var rect = selectedRect(state);
-	    dispatch(addRow(state.tr, rect, rect.bottom));
-	  }
-	  return true
-	}
-
-	function removeRow(tr, ref, row) {
-	  var map = ref.map;
-	  var table = ref.table;
-	  var tableStart = ref.tableStart;
-
-	  var rowPos = 0;
-	  for (var i = 0; i < row; i++) { rowPos += table.child(i).nodeSize; }
-	  var nextRow = rowPos + table.child(row).nodeSize;
-
-	  var mapFrom = tr.mapping.maps.length;
-	  tr.delete(rowPos + tableStart, nextRow + tableStart);
-
-	  for (var col = 0, index = row * map.width; col < map.width; col++, index++) {
-	    var pos = map.map[index];
-	    if (row > 0 && pos == map.map[index - map.width]) {
-	      // If this cell starts in the row above, simply reduce its rowspan
-	      var attrs = table.nodeAt(pos).attrs;
-	      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + tableStart), null, setAttr(attrs, "rowspan", attrs.rowspan - 1));
-	      col += attrs.colspan - 1;
-	    } else if (row < map.width && pos == map.map[index + map.width]) {
-	      // Else, if it continues in the row below, it has to be moved down
-	      var cell = table.nodeAt(pos);
-	      var copy = cell.type.create(setAttr(cell.attrs, "rowspan", cell.attrs.rowspan - 1), cell.content);
-	      var newPos = map.positionAt(row + 1, col, table);
-	      tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy);
-	      col += cell.attrs.colspan - 1;
-	    }
-	  }
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Remove the selected rows from a table.
-	function deleteRow(state, dispatch) {
-	  if (!isInTable(state)) { return false }
-	  if (dispatch) {
-	    var rect = selectedRect(state), tr = state.tr;
-	    if (rect.top == 0 && rect.bottom == rect.map.height) { return false }
-	    for (var i = rect.bottom - 1;; i--) {
-	      removeRow(tr, rect, i);
-	      if (i == rect.top) { break }
-	      rect.table = rect.tableStart ? tr.doc.nodeAt(rect.tableStart - 1) : tr.doc;
-	      rect.map = TableMap.get(rect.table);
-	    }
-	    dispatch(tr);
-	  }
-	  return true
-	}
-
-	function isEmpty(cell) {
-	  var c = cell.content;
-	  return c.childCount == 1 && c.firstChild.isTextblock && c.firstChild.childCount == 0
-	}
-
-	function cellsOverlapRectangle(ref, rect) {
-	  var width = ref.width;
-	  var height = ref.height;
-	  var map = ref.map;
-
-	  var indexTop = rect.top * width + rect.left, indexLeft = indexTop;
-	  var indexBottom = (rect.bottom - 1) * width + rect.left, indexRight = indexTop + (rect.right - rect.left - 1);
-	  for (var i = rect.top; i < rect.bottom; i++) {
-	    if (rect.left > 0 && map[indexLeft] == map[indexLeft - 1] ||
-	        rect.right < width && map[indexRight] == map[indexRight + 1]) { return true }
-	    indexLeft += width; indexRight += width;
-	  }
-	  for (var i$1 = rect.left; i$1 < rect.right; i$1++) {
-	    if (rect.top > 0 && map[indexTop] == map[indexTop - width] ||
-	        rect.bottom < height && map[indexBottom] == map[indexBottom + width]) { return true }
-	    indexTop++; indexBottom++;
-	  }
-	  return false
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Merge the selected cells into a single cell. Only available when
-	// the selected cells' outline forms a rectangle.
-	function mergeCells(state, dispatch) {
-	  var sel = state.selection;
-	  if (!(sel instanceof CellSelection) || sel.$anchorCell.pos == sel.$headCell.pos) { return false }
-	  var rect = selectedRect(state);
-	  var map = rect.map;
-	  if (cellsOverlapRectangle(map, rect)) { return false }
-	  if (dispatch) {
-	    var tr = state.tr, seen = [], content = dist.Fragment.empty, mergedPos, mergedCell;
-	    for (var row = rect.top; row < rect.bottom; row++) {
-	      for (var col = rect.left; col < rect.right; col++) {
-	        var cellPos = map.map[row * map.width + col], cell = rect.table.nodeAt(cellPos);
-	        if (seen.indexOf(cellPos) > -1) { continue }
-	        seen.push(cellPos);
-	        if (mergedPos == null) {
-	          mergedPos = cellPos;
-	          mergedCell = cell;
-	        } else {
-	          if (!isEmpty(cell)) { content = content.append(cell.content); }
-	          var mapped = tr.mapping.map(cellPos + rect.tableStart);
-	          tr.delete(mapped, mapped + cell.nodeSize);
-	        }
-	      }
-	    }
-	    tr.setNodeMarkup(mergedPos + rect.tableStart, null,
-	                     setAttr(addColSpan(mergedCell.attrs, mergedCell.attrs.colspan, (rect.right - rect.left) - mergedCell.attrs.colspan),
-	                             "rowspan", rect.bottom - rect.top));
-	    if (content.size) {
-	      var end = mergedPos + 1 + mergedCell.content.size;
-	      var start = isEmpty(mergedCell) ? mergedPos + 1 : end;
-	      tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content);
-	    }
-	    tr.setSelection(new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart)));
-	    dispatch(tr);
-	  }
-	  return true
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Split a selected cell, whose rowpan or colspan is greater than one,
-	// into smaller cells.
-	function splitCell(state, dispatch) {
-	  var sel = state.selection;
-	  var cellNode, cellPos;
-	  if (!(sel instanceof CellSelection)) {
-	    cellNode = cellWrapping(sel.$from);
-	    if (!cellNode) { return false }
-	    cellPos = cellAround(sel.$from).pos;
-	  } else {
-	    if (sel.$anchorCell.pos != sel.$headCell.pos) { return false }
-	    cellNode = sel.$anchorCell.nodeAfter;
-	    cellPos = sel.$anchorCell.pos;
-	  }
-	  if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {return false}
-	  if (dispatch) {
-	    var baseAttrs = cellNode.attrs, attrs = [], colwidth = baseAttrs.colwidth;
-	    if (baseAttrs.rowspan > 1) { baseAttrs = setAttr(baseAttrs, "rowspan", 1); }
-	    if (baseAttrs.colspan > 1) { baseAttrs = setAttr(baseAttrs, "colspan", 1); }
-	    var rect = selectedRect(state), tr = state.tr;
-	    for (var i = 0; i < rect.right - rect.left; i++)
-	      { attrs.push(colwidth ? setAttr(baseAttrs, "colwidth", colwidth && colwidth[i] ? [colwidth[i]] : null) : baseAttrs); }
-	    var lastCell, cellType = tableNodeTypes(state.schema)[cellNode.type.spec.tableRole];
-	    for (var row = 0; row < rect.bottom; row++) {
-	      if (row >= rect.top) {
-	        var pos = rect.map.positionAt(row, rect.left, rect.table);
-	        if (row == rect.top) { pos += cellNode.nodeSize; }
-	        for (var col = rect.left, i$1 = 0; col < rect.right; col++, i$1++) {
-	          if (col == rect.left && row == rect.top) { continue }
-	          tr.insert(lastCell = tr.mapping.map(pos + rect.tableStart, 1), cellType.createAndFill(attrs[i$1]));
-	        }
-	      }
-	    }
-	    tr.setNodeMarkup(cellPos, null, attrs[0]);
-	    if (sel instanceof CellSelection)
-	      { tr.setSelection(new CellSelection(tr.doc.resolve(sel.$anchorCell.pos),
-	                                        lastCell && tr.doc.resolve(lastCell))); }
-	    dispatch(tr);
-	  }
-	  return true
-	}
-
-	// :: (string, any) → (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Returns a command that sets the given attribute to the given value,
-	// and is only available when the currently selected cell doesn't
-	// already have that attribute set to that value.
-	function setCellAttr(name, value) {
-	  return function(state, dispatch) {
-	    if (!isInTable(state)) { return false }
-	    var $cell = selectionCell(state);
-	    if ($cell.nodeAfter.attrs[name] === value) { return false }
-	    if (dispatch) {
-	      var tr = state.tr;
-	      if (state.selection instanceof CellSelection)
-	        { state.selection.forEachCell(function (node, pos) {
-	          if (node.attrs[name] !== value)
-	            { tr.setNodeMarkup(pos, null, setAttr(node.attrs, name, value)); }
-	        }); }
-	      else
-	        { tr.setNodeMarkup($cell.pos, null, setAttr($cell.nodeAfter.attrs, name, value)); }
-	      dispatch(tr);
-	    }
-	    return true
-	  }
-	}
-
-	function toggleHeader(type) {
-	  return function(state, dispatch) {
-	    if (!isInTable(state)) { return false }
-	    if (dispatch) {
-	      var types = tableNodeTypes(state.schema);
-	      var rect = selectedRect(state), tr = state.tr;
-	      var cells = rect.map.cellsInRect(type == "column" ? new Rect(rect.left, 0, rect.right, rect.map.height) :
-	                                       type == "row" ? new Rect(0, rect.top, rect.map.width, rect.bottom) : rect);
-	      var nodes = cells.map(function (pos) { return rect.table.nodeAt(pos); });
-	      for (var i = 0; i < cells.length; i++) // Remove headers, if any
-	        { if (nodes[i].type == types.header_cell)
-	          { tr.setNodeMarkup(rect.tableStart + cells[i], types.cell, nodes[i].attrs); } }
-	      if (tr.steps.length == 0) { for (var i$1 = 0; i$1 < cells.length; i$1++) // No headers removed, add instead
-	        { tr.setNodeMarkup(rect.tableStart + cells[i$1], types.header_cell, nodes[i$1].attrs); } }
-	      dispatch(tr);
-	    }
-	    return true
-	  }
-	}
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Toggles whether the selected row contains header cells.
-	var toggleHeaderRow = toggleHeader("row");
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Toggles whether the selected column contains header cells.
-	var toggleHeaderColumn = toggleHeader("column");
-
-	// :: (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Toggles whether the selected cells are header cells.
-	var toggleHeaderCell = toggleHeader("cell");
-
-	function findNextCell($cell, dir) {
-	  if (dir < 0) {
-	    var before = $cell.nodeBefore;
-	    if (before) { return $cell.pos - before.nodeSize }
-	    for (var row = $cell.index(-1) - 1, rowEnd = $cell.before(); row >= 0; row--) {
-	      var rowNode = $cell.node(-1).child(row);
-	      if (rowNode.childCount) { return rowEnd - 1 - rowNode.lastChild.nodeSize }
-	      rowEnd -= rowNode.nodeSize;
-	    }
-	  } else {
-	    if ($cell.index() < $cell.parent.childCount - 1) { return $cell.pos + $cell.nodeAfter.nodeSize }
-	    var table = $cell.node(-1);
-	    for (var row$1 = $cell.indexAfter(-1), rowStart = $cell.after(); row$1 < table.childCount; row$1++) {
-	      var rowNode$1 = table.child(row$1);
-	      if (rowNode$1.childCount) { return rowStart + 1 }
-	      rowStart += rowNode$1.nodeSize;
-	    }
-	  }
-	}
-
-	// :: (number) → (EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Returns a command for selecting the next (direction=1) or previous
-	// (direction=-1) cell in a table.
-	function goToNextCell(direction) {
-	  return function(state, dispatch) {
-	    if (!isInTable(state)) { return false }
-	    var cell = findNextCell(selectionCell(state), direction);
-	    if (cell == null) { return }
-	    if (dispatch) {
-	      var $cell = state.doc.resolve(cell);
-	      dispatch(state.tr.setSelection(dist$2.TextSelection.between($cell, moveCellForward($cell))).scrollIntoView());
-	    }
-	    return true
-	  }
-	}
-
-	// :: (EditorState, ?(tr: Transaction)) → bool
-	// Deletes the table around the selection, if any.
-	function deleteTable(state, dispatch) {
-	  var $pos = state.selection.$anchor;
-	  for (var d = $pos.depth; d > 0; d--) {
-	    var node = $pos.node(d);
-	    if (node.type.spec.tableRole == "table") {
-	      if (dispatch) { dispatch(state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView()); }
-	      return true
-	    }
-	  }
-	  return false
-	}
-
-	var TableView = function TableView(node, cellMinWidth) {
-	  this.node = node;
-	  this.cellMinWidth = cellMinWidth;
-	  this.dom = document.createElement("div");
-	  this.dom.className = "tableWrapper";
-	  this.table = this.dom.appendChild(document.createElement("table"));
-	  this.colgroup = this.table.appendChild(document.createElement("colgroup"));
-	  updateColumns(node, this.colgroup, this.table, cellMinWidth);
-	  this.contentDOM = this.table.appendChild(document.createElement("tbody"));
-	};
-
-	TableView.prototype.update = function update (node) {
-	  if (node.type != this.node.type) { return false }
-	  this.node = node;
-	  updateColumns(node, this.colgroup, this.table, this.cellMinWidth);
-	  return true
-	};
-
-	TableView.prototype.ignoreMutation = function ignoreMutation (record) {
-	  return record.type == "attributes" && (record.target == this.table || this.colgroup.contains(record.target))
-	};
-
-	function updateColumns(node, colgroup, table, cellMinWidth, overrideCol, overrideValue) {
-	  var totalWidth = 0, fixedWidth = true;
-	  var nextDOM = colgroup.firstChild, row = node.firstChild;
-	  for (var i = 0, col = 0; i < row.childCount; i++) {
-	    var ref = row.child(i).attrs;
-	    var colspan = ref.colspan;
-	    var colwidth = ref.colwidth;
-	    for (var j = 0; j < colspan; j++, col++) {
-	      var hasWidth = overrideCol == col ? overrideValue : colwidth && colwidth[j];
-	      var cssWidth = hasWidth ? hasWidth + "px" : "";
-	      totalWidth += hasWidth || cellMinWidth;
-	      if (!hasWidth) { fixedWidth = false; }
-	      if (!nextDOM) {
-	        colgroup.appendChild(document.createElement("col")).style.width = cssWidth;
-	      } else {
-	        if (nextDOM.style.width != cssWidth) { nextDOM.style.width = cssWidth; }
-	        nextDOM = nextDOM.nextSibling;
-	      }
-	    }
-	  }
-
-	  while (nextDOM) {
-	    var after = nextDOM.nextSibling;
-	    nextDOM.parentNode.removeChild(nextDOM);
-	    nextDOM = after;
-	  }
-
-	  if (fixedWidth) {
-	    table.style.width = totalWidth + "px";
-	    table.style.minWidth = "";
-	  } else {
-	    table.style.width = "";
-	    table.style.minWidth = totalWidth + "px";
-	  }
-	}
-
-	var key$1 = new dist$2.PluginKey("tableColumnResizing");
-
-	function columnResizing(ref) {
-	  if ( ref === void 0 ) { ref = {}; }
-	  var handleWidth = ref.handleWidth; if ( handleWidth === void 0 ) { handleWidth = 5; }
-	  var cellMinWidth = ref.cellMinWidth; if ( cellMinWidth === void 0 ) { cellMinWidth = 25; }
-	  var View = ref.View; if ( View === void 0 ) { View = TableView; }
-	  var lastColumnResizable = ref.lastColumnResizable; if ( lastColumnResizable === void 0 ) { lastColumnResizable = true; }
-
-	  var plugin = new dist$2.Plugin({
-	    key: key$1,
-	    state: {
-	      init: function init(_, state) {
-	        this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] =
-	          function (node, view) { return new View(node, cellMinWidth, view); };
-	        return new ResizeState(-1, false)
-	      },
-	      apply: function apply(tr, prev) {
-	        return prev.apply(tr)
-	      }
-	    },
-	    props: {
-	      attributes: function attributes(state) {
-	        var pluginState = key$1.getState(state);
-	        return pluginState.activeHandle > -1 ? {class: "resize-cursor"} : null
-	      },
-
-	      handleDOMEvents: {
-	        mousemove: function mousemove(view, event) { handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable); },
-	        mouseleave: function mouseleave(view) { handleMouseLeave(view); },
-	        mousedown: function mousedown(view, event) { handleMouseDown$1(view, event, cellMinWidth); }
-	      },
-
-	      decorations: function decorations(state) {
-	        var pluginState = key$1.getState(state);
-	        if (pluginState.activeHandle > -1) { return handleDecorations(state, pluginState.activeHandle) }
-	      },
-
-	      nodeViews: {}
-	    }
-	  });
-	  return plugin
-	}
-
-	var ResizeState = function ResizeState(activeHandle, dragging) {
-	  this.activeHandle = activeHandle;
-	  this.dragging = dragging;
-	};
-
-	ResizeState.prototype.apply = function apply (tr) {
-	  var state = this, action = tr.getMeta(key$1);
-	  if (action && action.setHandle != null)
-	    { return new ResizeState(action.setHandle, null) }
-	  if (action && action.setDragging !== undefined)
-	    { return new ResizeState(state.activeHandle, action.setDragging) }
-	  if (state.activeHandle > -1 && tr.docChanged) {
-	    var handle = tr.mapping.map(state.activeHandle, -1);
-	    if (!pointsAtCell(tr.doc.resolve(handle))) { handle = null; }
-	    state = new ResizeState(handle, state.dragging);
-	  }
-	  return state
-	};
-
-	function handleMouseMove(view, event, handleWidth, cellMinWidth, lastColumnResizable) {
-	  var pluginState = key$1.getState(view.state);
-
-	  if (!pluginState.dragging) {
-	    var target = domCellAround(event.target), cell = -1;
-	    if (target) {
-	      var ref = target.getBoundingClientRect();
-	      var left = ref.left;
-	      var right = ref.right;
-	      if (event.clientX - left <= handleWidth)
-	        { cell = edgeCell(view, event, "left"); }
-	      else if (right - event.clientX <= handleWidth)
-	        { cell = edgeCell(view, event, "right"); }
-	    }
-
-	    if (cell != pluginState.activeHandle) {
-	      if (!lastColumnResizable && cell !== -1) {
-	        var $cell = view.state.doc.resolve(cell);
-	        var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-	        var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-
-	        if (col == map.width - 1) {
-	          return
-	        }
-	      }
-
-	      updateHandle(view, cell);
-	    }
-	  }
-	}
-
-	function handleMouseLeave(view) {
-	  var pluginState = key$1.getState(view.state);
-	  if (pluginState.activeHandle > -1 && !pluginState.dragging) { updateHandle(view, -1); }
-	}
-
-	function handleMouseDown$1(view, event, cellMinWidth) {
-	  var pluginState = key$1.getState(view.state);
-	  if (pluginState.activeHandle == -1 || pluginState.dragging) { return false }
-
-	  var cell = view.state.doc.nodeAt(pluginState.activeHandle);
-	  var width = currentColWidth(view, pluginState.activeHandle, cell.attrs);
-	  view.dispatch(view.state.tr.setMeta(key$1, {setDragging: {startX: event.clientX, startWidth: width}}));
-
-	  function finish(event) {
-	    window.removeEventListener("mouseup", finish);
-	    window.removeEventListener("mousemove", move);
-	    var pluginState = key$1.getState(view.state);
-	    if (pluginState.dragging) {
-	      updateColumnWidth(view, pluginState.activeHandle, draggedWidth(pluginState.dragging, event, cellMinWidth));
-	      view.dispatch(view.state.tr.setMeta(key$1, {setDragging: null}));
-	    }
-	  }
-	  function move(event) {
-	    if (!event.which) { return finish(event) }
-	    var pluginState = key$1.getState(view.state);
-	    var dragged = draggedWidth(pluginState.dragging, event, cellMinWidth);
-	    displayColumnWidth(view, pluginState.activeHandle, dragged, cellMinWidth);
-	  }
-
-	  window.addEventListener("mouseup", finish);
-	  window.addEventListener("mousemove", move);
-	  event.preventDefault();
-	  return true
-	}
-
-	function currentColWidth(view, cellPos, ref) {
-	  var colspan = ref.colspan;
-	  var colwidth = ref.colwidth;
-
-	  var width = colwidth && colwidth[colwidth.length - 1];
-	  if (width) { return width }
-	  // Not fixed, read current width from DOM
-	  var domWidth = view.domAtPos(cellPos + 1).node.offsetWidth, parts = colspan;
-	  if (colwidth) { for (var i = 0; i < colspan; i++) { if (colwidth[i]) {
-	    domWidth -= colwidth[i];
-	    parts--;
-	  } } }
-	  return domWidth / parts
-	}
-
-	function domCellAround(target) {
-	  while (target && target.nodeName != "TD" && target.nodeName != "TH")
-	    { target = target.classList.contains("ProseMirror") ? null : target.parentNode; }
-	  return target
-	}
-
-	function edgeCell(view, event, side) {
-	  var ref = view.posAtCoords({left: event.clientX, top: event.clientY});
-	  var pos = ref.pos;
-	  var $cell = cellAround(view.state.doc.resolve(pos));
-	  if (!$cell) { return -1 }
-	  if (side == "right") { return $cell.pos }
-	  var map = TableMap.get($cell.node(-1)), start = $cell.start(-1);
-	  var index = map.map.indexOf($cell.pos - start);
-	  return index % map.width == 0 ? -1 : start + map.map[index - 1]
-	}
-
-	function draggedWidth(dragging, event, cellMinWidth) {
-	  var offset = event.clientX - dragging.startX;
-	  return Math.max(cellMinWidth, dragging.startWidth + offset)
-	}
-
-	function updateHandle(view, value) {
-	  view.dispatch(view.state.tr.setMeta(key$1, {setHandle: value}));
-	}
-
-	function updateColumnWidth(view, cell, width) {
-	  var $cell = view.state.doc.resolve(cell);
-	  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-	  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-	  var tr = view.state.tr;
-	  for (var row = 0; row < map.height; row++) {
-	    var mapIndex = row * map.width + col;
-	    // Rowspanning cell that has already been handled
-	    if (row && map.map[mapIndex] == map.map[mapIndex - map.width]) { continue }
-	    var pos = map.map[mapIndex];
-	    var ref = table.nodeAt(pos);
-	    var attrs = ref.attrs;
-	    var index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);
-	    if (attrs.colwidth && attrs.colwidth[index] == width) { continue }
-	    var colwidth = attrs.colwidth ? attrs.colwidth.slice() : zeroes(attrs.colspan);
-	    colwidth[index] = width;
-	    tr.setNodeMarkup(start + pos, null, setAttr(attrs, "colwidth", colwidth));
-	  }
-	  if (tr.docChanged) { view.dispatch(tr); }
-	}
-
-	function displayColumnWidth(view, cell, width, cellMinWidth) {
-	  var $cell = view.state.doc.resolve(cell);
-	  var table = $cell.node(-1), start = $cell.start(-1);
-	  var col = TableMap.get(table).colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;
-	  var dom = view.domAtPos($cell.start(-1)).node;
-	  while (dom.nodeName != "TABLE") { dom = dom.parentNode; }
-	  updateColumns(table, dom.firstChild, dom, cellMinWidth, col, width);
-	}
-
-	function zeroes(n) {
-	  var result = [];
-	  for (var i = 0; i < n; i++) { result.push(0); }
-	  return result
-	}
-
-	function handleDecorations(state, cell) {
-	  var decorations = [];
-	  var $cell = state.doc.resolve(cell);
-	  var table = $cell.node(-1), map = TableMap.get(table), start = $cell.start(-1);
-	  var col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;
-	  for (var row = 0; row < map.height; row++) {
-	    var index = col + row * map.width - 1;
-	    // For positions that are have either a different cell or the end
-	    // of the table to their right, and either the top of the table or
-	    // a different cell above them, add a decoration
-	    if ((col == map.width || map.map[index] != map.map[index + 1]) &&
-	        (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])) {
-	      var cellPos = map.map[index];
-	      var pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;
-	      var dom = document.createElement("div");
-	      dom.className = "column-resize-handle";
-	      decorations.push(dist$3.Decoration.widget(pos, dom));
-	    }
-	  }
-	  return dist$3.DecorationSet.create(state.doc, decorations)
-	}
-
-	// This file defines a plugin that handles the drawing of cell
-
-	// :: () → Plugin
-	//
-	// Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)
-	// that, when added to an editor, enables cell-selection, handles
-	// cell-based copy/paste, and makes sure tables stay well-formed (each
-	// row has the same width, and cells don't overlap).
-	//
-	// You should probably put this plugin near the end of your array of
-	// plugins, since it handles mouse and arrow key events in tables
-	// rather broadly, and other plugins, like the gap cursor or the
-	// column-width dragging plugin, might want to get a turn first to
-	// perform more specific behavior.
-	function tableEditing() {
-	  return new dist$2.Plugin({
-	    key: key,
-
-	    // This piece of state is used to remember when a mouse-drag
-	    // cell-selection is happening, so that it can continue even as
-	    // transactions (which might move its anchor cell) come in.
-	    state: {
-	      init: function init() { return null },
-	      apply: function apply(tr, cur) {
-	        var set = tr.getMeta(key);
-	        if (set != null) { return set == -1 ? null : set }
-	        if (cur == null || !tr.docChanged) { return cur }
-	        var ref = tr.mapping.mapResult(cur);
-	        var deleted = ref.deleted;
-	        var pos = ref.pos;
-	        return deleted ? null : pos
-	      }
-	    },
-
-	    props: {
-	      decorations: drawCellSelection,
-
-	      handleDOMEvents: {
-	        mousedown: handleMouseDown
-	      },
-
-	      createSelectionBetween: function createSelectionBetween(view) {
-	        if (key.getState(view.state) != null) { return view.state.selection }
-	      },
-
-	      handleTripleClick: handleTripleClick,
-
-	      handleKeyDown: handleKeyDown,
-
-	      handlePaste: handlePaste
-	    },
-
-	    appendTransaction: function appendTransaction(_, oldState, state) {
-	      return normalizeSelection(state, fixTables(state, oldState))
-	    }
-	  })
-	}
-
-	exports.tableEditing = tableEditing;
-	exports.fixTables = fixTables;
-	exports.handlePaste = handlePaste;
-	exports.cellAround = cellAround;
-	exports.isInTable = isInTable;
-	exports.selectionCell = selectionCell;
-	exports.moveCellForward = moveCellForward;
-	exports.inSameTable = inSameTable;
-	exports.findCell = findCell;
-	exports.colCount = colCount;
-	exports.nextCell = nextCell;
-	exports.tableNodes = tableNodes;
-	exports.CellSelection = CellSelection;
-	exports.TableMap = TableMap;
-	exports.columnResizing = columnResizing;
-	exports.columnResizingPluginKey = key$1;
-	exports.updateColumnsOnResize = updateColumns;
-	exports.__pastedCells = pastedCells;
-	exports.__insertCells = insertCells;
-	exports.__clipCells = clipCells;
-	exports.addColumn = addColumn;
-	exports.addColumnBefore = addColumnBefore;
-	exports.addColumnAfter = addColumnAfter;
-	exports.removeColumn = removeColumn;
-	exports.deleteColumn = deleteColumn;
-	exports.addRow = addRow;
-	exports.addRowBefore = addRowBefore;
-	exports.addRowAfter = addRowAfter;
-	exports.removeRow = removeRow;
-	exports.deleteRow = deleteRow;
-	exports.mergeCells = mergeCells;
-	exports.splitCell = splitCell;
-	exports.setCellAttr = setCellAttr;
-	exports.toggleHeaderRow = toggleHeaderRow;
-	exports.toggleHeaderColumn = toggleHeaderColumn;
-	exports.toggleHeaderCell = toggleHeaderCell;
-	exports.goToNextCell = goToNextCell;
-	exports.deleteTable = deleteTable;
-
-	});
-
-	unwrapExports(dist$7);
-	var dist_1$6 = dist$7.tableEditing;
-	var dist_2$6 = dist$7.fixTables;
-	var dist_3$5 = dist$7.handlePaste;
-	var dist_4$5 = dist$7.cellAround;
-	var dist_5$5 = dist$7.isInTable;
-	var dist_6$4 = dist$7.selectionCell;
-	var dist_7$4 = dist$7.moveCellForward;
-	var dist_8$4 = dist$7.inSameTable;
-	var dist_9$4 = dist$7.findCell;
-	var dist_10$3 = dist$7.colCount;
-	var dist_11$3 = dist$7.nextCell;
-	var dist_12$3 = dist$7.tableNodes;
-	var dist_13$2 = dist$7.CellSelection;
-	var dist_14$1 = dist$7.TableMap;
-	var dist_15$1 = dist$7.columnResizing;
-	var dist_16$1 = dist$7.columnResizingPluginKey;
-	var dist_17$1 = dist$7.updateColumnsOnResize;
-	var dist_18$1 = dist$7.__pastedCells;
-	var dist_19$1 = dist$7.__insertCells;
-	var dist_20 = dist$7.__clipCells;
-	var dist_21 = dist$7.addColumn;
-	var dist_22 = dist$7.addColumnBefore;
-	var dist_23 = dist$7.addColumnAfter;
-	var dist_24 = dist$7.removeColumn;
-	var dist_25 = dist$7.deleteColumn;
-	var dist_26 = dist$7.addRow;
-	var dist_27 = dist$7.addRowBefore;
-	var dist_28 = dist$7.addRowAfter;
-	var dist_29 = dist$7.removeRow;
-	var dist_30 = dist$7.deleteRow;
-	var dist_31 = dist$7.mergeCells;
-	var dist_32 = dist$7.splitCell;
-	var dist_33 = dist$7.setCellAttr;
-	var dist_34 = dist$7.toggleHeaderRow;
-	var dist_35 = dist$7.toggleHeaderColumn;
-	var dist_36 = dist$7.toggleHeaderCell;
-	var dist_37 = dist$7.goToNextCell;
-	var dist_38 = dist$7.deleteTable;
-
-	var dist$8 = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-
-	// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction
-	// Returns a new transaction that removes a node of a given `nodeType`. It will return an original transaction if parent node hasn't been found.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeParentNodeOfType(schema.nodes.table)(tr)
-	// );
-	// ```
-	var removeParentNodeOfType = function removeParentNodeOfType(nodeType) {
-	  return function (tr) {
-	    var parent = findParentNodeOfType(nodeType)(tr.selection);
-	    if (parent) {
-	      return removeNodeAtPos(parent.pos)(tr);
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction
-	// Returns a new transaction that replaces parent node of a given `nodeType` with the given `content`. It will return an original transaction if either parent node hasn't been found or replacing is not possible.
-	//
-	// ```javascript
-	// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
-	//
-	// dispatch(
-	//  replaceParentNodeOfType(schema.nodes.table, node)(tr)
-	// );
-	// ```
-	var replaceParentNodeOfType = function replaceParentNodeOfType(nodeType, content) {
-	  return function (tr) {
-	    if (!Array.isArray(nodeType)) {
-	      nodeType = [nodeType];
-	    }
-	    for (var i = 0, count = nodeType.length; i < count; i++) {
-	      var parent = findParentNodeOfType(nodeType[i])(tr.selection);
-	      if (parent) {
-	        var newTr = replaceNodeAtPos(parent.pos, content)(tr);
-	        if (newTr !== tr) {
-	          return newTr;
-	        }
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (tr: Transaction) → Transaction
-	// Returns a new transaction that removes selected node. It will return an original transaction if current selection is not a `NodeSelection`.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeSelectedNode(tr)
-	// );
-	// ```
-	var removeSelectedNode = function removeSelectedNode(tr) {
-	  if (isNodeSelection(tr.selection)) {
-	    var from = tr.selection.$from.pos;
-	    var to = tr.selection.$to.pos;
-	    return cloneTr(tr.delete(from, to));
-	  }
-	  return tr;
-	};
-
-	// :: (node: ProseMirrorNode) → (tr: Transaction) → Transaction
-	// Returns a new transaction that replaces selected node with a given `node`.
-	// It will return the original transaction if either current selection is not a NodeSelection or replacing is not possible.
-	//
-	// ```javascript
-	// const node = schema.nodes.paragraph.createChecked({}, schema.text('new'));
-	// dispatch(
-	//   replaceSelectedNode(node)(tr)
-	// );
-	// ```
-	var replaceSelectedNode = function replaceSelectedNode(node) {
-	  return function (tr) {
-	    if (isNodeSelection(tr.selection)) {
-	      var _tr$selection = tr.selection,
-	          $from = _tr$selection.$from,
-	          $to = _tr$selection.$to;
-
-	      if ($from.parent.canReplaceWith($from.index(), $from.indexAfter(), node.type)) {
-	        return cloneTr(tr.replaceWith($from.pos, $to.pos, node));
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (position: number, dir: ?number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that tries to find a valid cursor selection starting at the given `position`
-	// and searching back if `dir` is negative, and forward if positive.
-	// If a valid cursor position hasn't been found, it will return the original transaction.
-	//
-	// ```javascript
-	// dispatch(
-	//   setTextSelection(5)(tr)
-	// );
-	// ```
-	var setTextSelection = function setTextSelection(position) {
-	  var dir = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
-	  return function (tr) {
-	    var nextSelection = dist$2.Selection.findFrom(tr.doc.resolve(position), dir, true);
-	    if (nextSelection) {
-	      return tr.setSelection(nextSelection);
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (content: union<ProseMirrorNode, Fragment>, position: ?number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that inserts a given `content` at the current cursor position, or at a given `position`, if it is allowed by schema. If schema restricts such nesting, it will try to find an appropriate place for a given node in the document, looping through parent nodes up until the root document node.
-	// If cursor is inside of an empty paragraph, it will try to replace that paragraph with the given content. If insertion is successful and inserted node has content, it will set cursor inside of that content.
-	// It will return an original transaction if the place for insertion hasn't been found.
-	//
-	// ```javascript
-	// const node = schema.nodes.extension.createChecked({});
-	// dispatch(
-	//   safeInsert(node)(tr)
-	// );
-	// ```
-	var safeInsert = function safeInsert(content, position) {
-	  return function (tr) {
-	    var hasPosition = typeof position === 'number';
-	    var $from = tr.selection.$from;
-
-	    var $insertPos = hasPosition ? tr.doc.resolve(position) : isNodeSelection(tr.selection) ? tr.doc.resolve($from.pos + 1) : $from;
-	    var parent = $insertPos.parent,
-	        depth = $insertPos.depth;
-
-	    // try to replace an empty paragraph
-
-	    if (isEmptyParagraph(parent)) {
-	      var oldTr = tr;
-	      tr = replaceParentNodeOfType(parent.type, content)(tr);
-	      if (oldTr !== tr) {
-	        return setTextSelection($insertPos.pos)(tr);
-	      }
-	    }
-
-	    // given node is allowed at the current cursor position
-	    if (canInsert($insertPos, content)) {
-	      tr.insert($insertPos.pos, content);
-	      return cloneTr(setTextSelection(hasPosition ? $insertPos.pos : tr.selection.$anchor.pos)(tr));
-	    }
-
-	    // looking for a place in the doc where the node is allowed
-	    for (var i = $insertPos.depth; i > 0; i--) {
-	      var pos = $insertPos.after(i);
-	      var $pos = tr.doc.resolve(pos);
-	      if (canInsert($pos, content)) {
-	        tr.insert(pos, content);
-	        return cloneTr(setTextSelection(pos)(tr));
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>, type: ?union<NodeType, null>, attrs: ?union<Object, null>, marks?: [Mark]) → (tr: Transaction) → Transaction
-	// Returns a transaction that changes the type, attributes, and/or marks of the parent node of a given `nodeType`.
-	//
-	// ```javascript
-	// const node = schema.nodes.extension.createChecked({});
-	// dispatch(
-	//   setParentNodeMarkup(schema.nodes.panel, null, { panelType })(tr);
-	// );
-	// ```
-	var setParentNodeMarkup = function setParentNodeMarkup(nodeType, type, attrs, marks) {
-	  return function (tr) {
-	    var parent = findParentNodeOfType(nodeType)(tr.selection);
-	    if (parent) {
-	      return cloneTr(tr.setNodeMarkup(parent.pos, type, Object.assign({}, parent.node.attrs, attrs), marks));
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>) → (tr: Transaction) → Transaction
-	// Returns a new transaction that sets a `NodeSelection` on a parent node of a `given nodeType`.
-	//
-	// ```javascript
-	// dispatch(
-	//   selectParentNodeOfType([tableCell, tableHeader])(state.tr)
-	// );
-	// ```
-	var selectParentNodeOfType = function selectParentNodeOfType(nodeType) {
-	  return function (tr) {
-	    if (!isNodeSelection(tr.selection)) {
-	      var parent = findParentNodeOfType(nodeType)(tr.selection);
-	      if (parent) {
-	        return cloneTr(tr.setSelection(dist$2.NodeSelection.create(tr.doc, parent.pos)));
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (tr: Transaction) → Transaction
-	// Returns a new transaction that deletes previous node.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeNodeBefore(state.tr)
-	// );
-	// ```
-	var removeNodeBefore = function removeNodeBefore(tr) {
-	  var position = findPositionOfNodeBefore(tr.selection);
-	  if (typeof position === 'number') {
-	    return removeNodeAtPos(position)(tr);
-	  }
-	  return tr;
-	};
-
-	// :: (selection: Selection) → boolean
-	// Checks if current selection is a `NodeSelection`.
-	//
-	// ```javascript
-	// if (isNodeSelection(tr.selection)) {
-	//   // ...
-	// }
-	// ```
-	var isNodeSelection = function isNodeSelection(selection) {
-	  return selection instanceof dist$2.NodeSelection;
-	};
-
-	// (nodeType: union<NodeType, [NodeType]>) → boolean
-	// Checks if the type a given `node` equals to a given `nodeType`.
-	var equalNodeType = function equalNodeType(nodeType, node) {
-	  return Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1 || node.type === nodeType;
-	};
-
-	// (tr: Transaction) → Transaction
-	// Creates a new transaction object from a given transaction
-	var cloneTr = function cloneTr(tr) {
-	  return Object.assign(Object.create(tr), tr).setTime(Date.now());
-	};
-
-	// (position: number, content: union<ProseMirrorNode, Fragment>) → (tr: Transaction) → Transaction
-	// Returns a `replace` transaction that replaces a node at a given position with the given `content`.
-	// It will return the original transaction if replacing is not possible.
-	// `position` should point at the position immediately before the node.
-	var replaceNodeAtPos = function replaceNodeAtPos(position, content) {
-	  return function (tr) {
-	    var node = tr.doc.nodeAt(position);
-	    var $pos = tr.doc.resolve(position);
-	    if (canReplace($pos, content)) {
-	      tr = tr.replaceWith(position, position + node.nodeSize, content);
-	      var start = tr.selection.$from.pos - 1;
-	      // put cursor inside of the inserted node
-	      tr = setTextSelection(Math.max(start, 0), -1)(tr);
-	      // move cursor to the start of the node
-	      tr = setTextSelection(tr.selection.$from.start())(tr);
-	      return cloneTr(tr);
-	    }
-	    return tr;
-	  };
-	};
-
-	// ($pos: ResolvedPos, doc: ProseMirrorNode, content: union<ProseMirrorNode, Fragment>, ) → boolean
-	// Checks if replacing a node at a given `$pos` inside of the `doc` node with the given `content` is possible.
-	var canReplace = function canReplace($pos, content) {
-	  var node = $pos.node($pos.depth);
-	  return node && node.type.validContent(content instanceof dist.Fragment ? content : dist.Fragment.from(content));
-	};
-
-	// (position: number) → (tr: Transaction) → Transaction
-	// Returns a `delete` transaction that removes a node at a given position with the given `node`.
-	// `position` should point at the position immediately before the node.
-	var removeNodeAtPos = function removeNodeAtPos(position) {
-	  return function (tr) {
-	    var node = tr.doc.nodeAt(position);
-	    return cloneTr(tr.delete(position, position + node.nodeSize));
-	  };
-	};
-
-	// (schema: Schema) → {[key: string]: NodeType}
-	// Returns a map where keys are tableRoles and values are NodeTypes.
-	var tableNodeTypes = function tableNodeTypes(schema) {
-	  if (schema.cached.tableNodeTypes) {
-	    return schema.cached.tableNodeTypes;
-	  }
-	  var roles = {};
-	  Object.keys(schema.nodes).forEach(function (type) {
-	    var nodeType = schema.nodes[type];
-	    if (nodeType.spec.tableRole) {
-	      roles[nodeType.spec.tableRole] = nodeType;
-	    }
-	  });
-	  schema.cached.tableNodeTypes = roles;
-	  return roles;
-	};
-
-	// :: ($pos: ResolvedPos, content: union<ProseMirrorNode, Fragment>) → boolean
-	// Checks if a given `content` can be inserted at the given `$pos`
-	//
-	// ```javascript
-	// const { selection: { $from } } = state;
-	// const node = state.schema.nodes.atom.createChecked();
-	// if (canInsert($from, node)) {
-	//   // ...
-	// }
-	// ```
-	var canInsert = function canInsert($pos, content) {
-	  var index = $pos.index();
-
-	  if (content instanceof dist.Fragment) {
-	    return $pos.parent.canReplace(index, index, content);
-	  } else if (content instanceof dist.Node) {
-	    return $pos.parent.canReplaceWith(index, index, content.type);
-	  }
-	  return false;
-	};
-
-	// (node: ProseMirrorNode) → boolean
-	// Checks if a given `node` is an empty paragraph
-	var isEmptyParagraph = function isEmptyParagraph(node) {
-	  return !node || node.type.name === 'paragraph' && node.nodeSize === 2;
-	};
-
-	// ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes, returning a table node closest to a given `$pos`.
-	//
-	// ```javascript
-	// const table = findTableClosestToPos(state.doc.resolve(10));
-	// ```
-	var findTableClosestToPos = function findTableClosestToPos($pos) {
-	  var predicate = function predicate(node) {
-	    return node.type.spec.tableRole && /table/i.test(node.type.spec.tableRole);
-	  };
-	  return findParentNodeClosestToPos($pos, predicate);
-	};
-
-	// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
-	//
-	// ```javascript
-	// const predicate = node => node.type === schema.nodes.blockquote;
-	// const parent = findParentNode(predicate)(selection);
-	// ```
-	var findParentNode = function findParentNode(predicate) {
-	  return function (selection) {
-	    var $from = selection.$from;
-
-	    for (var i = $from.depth; i > 0; i--) {
-	      var node = $from.node(i);
-	      if (predicate(node)) {
-	        return {
-	          pos: i > 0 ? $from.before(i) : 0,
-	          start: $from.start(i),
-	          node: node
-	        };
-	      }
-	    }
-	  };
-	};
-
-	// :: ($pos: ResolvedPos, predicate: (node: ProseMirrorNode) → boolean) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes starting from the given `$pos`, returning the closest node and its start position `predicate` returns truthy for. `start` points to the start position of the node, `pos` points directly before the node.
-	//
-	// ```javascript
-	// const predicate = node => node.type === schema.nodes.blockquote;
-	// const parent = findParentNodeClosestToPos(state.doc.resolve(5), predicate);
-	// ```
-	var findParentNodeClosestToPos = function findParentNodeClosestToPos($pos, predicate) {
-	  for (var i = $pos.depth; i > 0; i--) {
-	    var node = $pos.node(i);
-	    if (predicate(node)) {
-	      return {
-	        pos: i > 0 ? $pos.before(i) : 0,
-	        start: $pos.start(i),
-	        node: node
-	      };
-	    }
-	  }
-	};
-
-	// :: (predicate: (node: ProseMirrorNode) → boolean, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
-	// Iterates over parent nodes, returning DOM reference of the closest node `predicate` returns truthy for.
-	//
-	// ```javascript
-	// const domAtPos = view.domAtPos.bind(view);
-	// const predicate = node => node.type === schema.nodes.table;
-	// const parent = findParentDomRef(predicate, domAtPos)(selection); // <table>
-	// ```
-	var findParentDomRef = function findParentDomRef(predicate, domAtPos) {
-	  return function (selection) {
-	    var parent = findParentNode(predicate)(selection);
-	    if (parent) {
-	      return findDomRefAtPos(parent.pos, domAtPos);
-	    }
-	  };
-	};
-
-	// :: (predicate: (node: ProseMirrorNode) → boolean) → (selection: Selection) → boolean
-	// Checks if there's a parent node `predicate` returns truthy for.
-	//
-	// ```javascript
-	// if (hasParentNode(node => node.type === schema.nodes.table)(selection)) {
-	//   // ....
-	// }
-	// ```
-	var hasParentNode = function hasParentNode(predicate) {
-	  return function (selection) {
-	    return !!findParentNode(predicate)(selection);
-	  };
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.
-	//
-	// ```javascript
-	// const parent = findParentNodeOfType(schema.nodes.paragraph)(selection);
-	// ```
-	var findParentNodeOfType = function findParentNodeOfType(nodeType) {
-	  return function (selection) {
-	    return findParentNode(function (node) {
-	      return equalNodeType(nodeType, node);
-	    })(selection);
-	  };
-	};
-
-	// :: ($pos: ResolvedPos, nodeType: union<NodeType, [NodeType]>) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes starting from the given `$pos`, returning closest node of a given `nodeType`. `start` points to the start position of the node, `pos` points directly before the node.
-	//
-	// ```javascript
-	// const parent = findParentNodeOfTypeClosestToPos(state.doc.resolve(10), schema.nodes.paragraph);
-	// ```
-	var findParentNodeOfTypeClosestToPos = function findParentNodeOfTypeClosestToPos($pos, nodeType) {
-	  return findParentNodeClosestToPos($pos, function (node) {
-	    return equalNodeType(nodeType, node);
-	  });
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → boolean
-	// Checks if there's a parent node of a given `nodeType`.
-	//
-	// ```javascript
-	// if (hasParentNodeOfType(schema.nodes.table)(selection)) {
-	//   // ....
-	// }
-	// ```
-	var hasParentNodeOfType = function hasParentNodeOfType(nodeType) {
-	  return function (selection) {
-	    return hasParentNode(function (node) {
-	      return equalNodeType(nodeType, node);
-	    })(selection);
-	  };
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → (selection: Selection) → ?dom.Node
-	// Iterates over parent nodes, returning DOM reference of the closest node of a given `nodeType`.
-	//
-	// ```javascript
-	// const domAtPos = view.domAtPos.bind(view);
-	// const parent = findParentDomRefOfType(schema.nodes.codeBlock, domAtPos)(selection); // <pre>
-	// ```
-	var findParentDomRefOfType = function findParentDomRefOfType(nodeType, domAtPos) {
-	  return function (selection) {
-	    return findParentDomRef(function (node) {
-	      return equalNodeType(nodeType, node);
-	    }, domAtPos)(selection);
-	  };
-	};
-
-	// :: (nodeType: union<NodeType, [NodeType]>) → (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Returns a node of a given `nodeType` if it is selected. `start` points to the start position of the node, `pos` points directly before the node.
-	//
-	// ```javascript
-	// const { extension, inlineExtension, bodiedExtension } = schema.nodes;
-	// const selectedNode = findSelectedNodeOfType([
-	//   extension,
-	//   inlineExtension,
-	//   bodiedExtension,
-	// ])(selection);
-	// ```
-	var findSelectedNodeOfType = function findSelectedNodeOfType(nodeType) {
-	  return function (selection) {
-	    if (isNodeSelection(selection)) {
-	      var node = selection.node,
-	          $from = selection.$from;
-
-	      if (equalNodeType(nodeType, node)) {
-	        return { node: node, pos: $from.pos };
-	      }
-	    }
-	  };
-	};
-
-	// :: (selection: Selection) → ?number
-	// Returns position of the previous node.
-	//
-	// ```javascript
-	// const pos = findPositionOfNodeBefore(tr.selection);
-	// ```
-	var findPositionOfNodeBefore = function findPositionOfNodeBefore(selection) {
-	  var nodeBefore = selection.$from.nodeBefore;
-
-	  var maybeSelection = dist$2.Selection.findFrom(selection.$from, -1);
-	  if (maybeSelection && nodeBefore) {
-	    // leaf node
-	    var parent = findParentNodeOfType(nodeBefore.type)(maybeSelection);
-	    if (parent) {
-	      return parent.pos;
-	    }
-	    return maybeSelection.$from.pos;
-	  }
-	};
-
-	// :: (position: number, domAtPos: (pos: number) → {node: dom.Node, offset: number}) → dom.Node
-	// Returns DOM reference of a node at a given `position`.
-	//
-	// ```javascript
-	// const domAtPos = view.domAtPos.bind(view);
-	// const ref = findDomRefAtPos($from.pos, domAtPos);
-	// ```
-	var findDomRefAtPos = function findDomRefAtPos(position, domAtPos) {
-	  var dom = domAtPos(position);
-	  var node = dom.node.childNodes[dom.offset];
-	  return node ? node : dom.node;
-	};
-
-	// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Flattens descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const children = flatten(node);
-	// ```
-	var flatten = function flatten(node) {
-	  var descend = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
-
-	  if (!node) {
-	    throw new Error('Invalid "node" parameter');
-	  }
-	  var result = [];
-	  node.descendants(function (child, pos) {
-	    result.push({ node: child, pos: pos });
-	    if (!descend) {
-	      return false;
-	    }
-	  });
-	  return result;
-	};
-
-	// :: (node: ProseMirrorNode, predicate: (node: ProseMirrorNode) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const textNodes = findChildren(node, child => child.isText, false);
-	// ```
-	var findChildren = function findChildren(node, predicate, descend) {
-	  if (!node) {
-	    throw new Error('Invalid "node" parameter');
-	  } else if (!predicate) {
-	    throw new Error('Invalid "predicate" parameter');
-	  }
-	  return flatten(node, descend).filter(function (child) {
-	    return predicate(child.node);
-	  });
-	};
-
-	// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Returns text nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const textNodes = findTextNodes(node);
-	// ```
-	var findTextNodes = function findTextNodes(node, descend) {
-	  return findChildren(node, function (child) {
-	    return child.isText;
-	  }, descend);
-	};
-
-	// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Returns inline nodes of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const inlineNodes = findInlineNodes(node);
-	// ```
-	var findInlineNodes = function findInlineNodes(node, descend) {
-	  return findChildren(node, function (child) {
-	    return child.isInline;
-	  }, descend);
-	};
-
-	// :: (node: ProseMirrorNode, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Returns block descendants of a given `node`. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const blockNodes = findBlockNodes(node);
-	// ```
-	var findBlockNodes = function findBlockNodes(node, descend) {
-	  return findChildren(node, function (child) {
-	    return child.isBlock;
-	  }, descend);
-	};
-
-	// :: (node: ProseMirrorNode, predicate: (attrs: ?Object) → boolean, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Iterates over descendants of a given `node`, returning child nodes predicate returns truthy for. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const mergedCells = findChildrenByAttr(table, attrs => attrs.colspan === 2);
-	// ```
-	var findChildrenByAttr = function findChildrenByAttr(node, predicate, descend) {
-	  return findChildren(node, function (child) {
-	    return !!predicate(child.attrs);
-	  }, descend);
-	};
-
-	// :: (node: ProseMirrorNode, nodeType: NodeType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Iterates over descendants of a given `node`, returning child nodes of a given nodeType. It doesn't descend into a node when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const cells = findChildrenByType(table, schema.nodes.tableCell);
-	// ```
-	var findChildrenByType = function findChildrenByType(node, nodeType, descend) {
-	  return findChildren(node, function (child) {
-	    return child.type === nodeType;
-	  }, descend);
-	};
-
-	// :: (node: ProseMirrorNode, markType: markType, descend: ?boolean) → [{ node: ProseMirrorNode, pos: number }]
-	// Iterates over descendants of a given `node`, returning child nodes that have a mark of a given markType. It doesn't descend into a `node` when descend argument is `false` (defaults to `true`).
-	//
-	// ```javascript
-	// const nodes = findChildrenByMark(state.doc, schema.marks.strong);
-	// ```
-	var findChildrenByMark = function findChildrenByMark(node, markType, descend) {
-	  return findChildren(node, function (child) {
-	    return markType.isInSet(child.marks);
-	  }, descend);
-	};
-
-	// :: (node: ProseMirrorNode, nodeType: NodeType) → boolean
-	// Returns `true` if a given node contains nodes of a given `nodeType`
-	//
-	// ```javascript
-	// if (contains(panel, schema.nodes.listItem)) {
-	//   // ...
-	// }
-	// ```
-	var contains = function contains(node, nodeType) {
-	  return !!findChildrenByType(node, nodeType).length;
-	};
-
-	function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
-
-	// :: (selection: Selection) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes, returning the closest table node.
-	//
-	// ```javascript
-	// const table = findTable(selection);
-	// ```
-	var findTable = function findTable(selection) {
-	  return findParentNode(function (node) {
-	    return node.type.spec.tableRole && node.type.spec.tableRole === 'table';
-	  })(selection);
-	};
-
-	// :: (selection: Selection) → boolean
-	// Checks if current selection is a `CellSelection`.
-	//
-	// ```javascript
-	// if (isCellSelection(selection)) {
-	//   // ...
-	// }
-	// ```
-	var isCellSelection = function isCellSelection(selection) {
-	  return selection instanceof dist$7.CellSelection;
-	};
-
-	// :: (columnIndex: number) → (selection: Selection) → boolean
-	// Checks if entire column at index `columnIndex` is selected.
-	//
-	// ```javascript
-	// const className = isColumnSelected(i)(selection) ? 'selected' : '';
-	// ```
-	var isColumnSelected = function isColumnSelected(columnIndex) {
-	  return function (selection) {
-	    if (isCellSelection(selection)) {
-	      var $anchorCell = selection.$anchorCell,
-	          $headCell = selection.$headCell;
-
-	      var start = $anchorCell.start(-1);
-	      var map = dist$7.TableMap.get($anchorCell.node(-1));
-	      var anchor = map.colCount($anchorCell.pos - start);
-	      var head = map.colCount($headCell.pos - start);
-
-	      return selection.isColSelection() && columnIndex <= Math.max(anchor, head) && columnIndex >= Math.min(anchor, head);
-	    }
-
-	    return false;
-	  };
-	};
-
-	// :: (rowIndex: number) → (selection: Selection) → boolean
-	// Checks if entire row at index `rowIndex` is selected.
-	//
-	// ```javascript
-	// const className = isRowSelected(i)(selection) ? 'selected' : '';
-	// ```
-	var isRowSelected = function isRowSelected(rowIndex) {
-	  return function (selection) {
-	    if (isCellSelection(selection)) {
-	      var $anchorCell = selection.$anchorCell,
-	          $headCell = selection.$headCell;
-
-	      var anchor = $anchorCell.index(-1);
-	      var head = $headCell.index(-1);
-
-	      return selection.isRowSelection() && rowIndex <= Math.max(anchor, head) && rowIndex >= Math.min(anchor, head);
-	    }
-
-	    return false;
-	  };
-	};
-
-	// :: (selection: Selection) → boolean
-	// Checks if entire table is selected
-	//
-	// ```javascript
-	// const className = isTableSelected(selection) ? 'selected' : '';
-	// ```
-	var isTableSelected = function isTableSelected(selection) {
-	  if (isCellSelection(selection)) {
-	    return selection.isColSelection() && selection.isRowSelection();
-	  }
-
-	  return false;
-	};
-
-	// :: (columnIndex: number) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-	// Returns an array of cells in a column at index `columnIndex`.
-	//
-	// ```javascript
-	// const cells = getCellsInColumn(i)(selection); // [{node, pos}, {node, pos}]
-	// ```
-	var getCellsInColumn = function getCellsInColumn(columnIndex) {
-	  return function (selection) {
-	    var table = findTable(selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      if (columnIndex >= 0 && columnIndex <= map.width - 1) {
-	        var cells = map.cellsInRect({
-	          left: columnIndex,
-	          right: columnIndex + 1,
-	          top: 0,
-	          bottom: map.height
-	        });
-	        return cells.map(function (nodePos) {
-	          var node = table.node.nodeAt(nodePos);
-	          var pos = nodePos + table.start;
-	          return { pos: pos, start: pos + 1, node: node };
-	        });
-	      }
-	    }
-	  };
-	};
-
-	// :: (rowIndex: number) → (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-	// Returns an array of cells in a row at index `rowIndex`.
-	//
-	// ```javascript
-	// const cells = getCellsInRow(i)(selection); // [{node, pos}, {node, pos}]
-	// ```
-	var getCellsInRow = function getCellsInRow(rowIndex) {
-	  return function (selection) {
-	    var table = findTable(selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      if (rowIndex >= 0 && rowIndex <= map.height - 1) {
-	        var cells = map.cellsInRect({
-	          left: 0,
-	          right: map.width,
-	          top: rowIndex,
-	          bottom: rowIndex + 1
-	        });
-	        return cells.map(function (nodePos) {
-	          var node = table.node.nodeAt(nodePos);
-	          var pos = nodePos + table.start;
-	          return { pos: pos, start: pos + 1, node: node };
-	        });
-	      }
-	    }
-	  };
-	};
-
-	// :: (selection: Selection) → ?[{pos: number, start: number, node: ProseMirrorNode}]
-	// Returns an array of all cells in a table.
-	//
-	// ```javascript
-	// const cells = getCellsInTable(selection); // [{node, pos}, {node, pos}]
-	// ```
-	var getCellsInTable = function getCellsInTable(selection) {
-	  var table = findTable(selection);
-	  if (table) {
-	    var map = dist$7.TableMap.get(table.node);
-	    var cells = map.cellsInRect({
-	      left: 0,
-	      right: map.width,
-	      top: 0,
-	      bottom: map.height
-	    });
-	    return cells.map(function (nodePos) {
-	      var node = table.node.nodeAt(nodePos);
-	      var pos = nodePos + table.start;
-	      return { pos: pos, start: pos + 1, node: node };
-	    });
-	  }
-	};
-
-	// :: (columnIndex: number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that creates a `CellSelection` on a column at index `columnIndex`.
-	//
-	// ```javascript
-	// dispatch(
-	//   selectColumn(i)(state.tr)
-	// );
-	// ```
-	var selectColumn = function selectColumn(columnIndex) {
-	  return function (tr) {
-	    var cells = getCellsInColumn(columnIndex)(tr.selection);
-	    if (cells) {
-	      var $anchor = tr.doc.resolve(cells[0].pos);
-	      var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-	      return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (rowIndex: number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that creates a `CellSelection` on a column at index `rowIndex`.
-	//
-	// ```javascript
-	// dispatch(
-	//   selectRow(i)(state.tr)
-	// );
-	// ```
-	var selectRow = function selectRow(rowIndex) {
-	  return function (tr) {
-	    var cells = getCellsInRow(rowIndex)(tr.selection);
-	    if (cells) {
-	      var $anchor = tr.doc.resolve(cells[0].pos);
-	      var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-	      return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (selection: Selection) → (tr: Transaction) → Transaction
-	// Returns a new transaction that creates a `CellSelection` on the entire table.
-	//
-	// ```javascript
-	// dispatch(
-	//   selectTable(i)(state.tr)
-	// );
-	// ```
-	var selectTable = function selectTable(tr) {
-	  var cells = getCellsInTable(tr.selection);
-	  if (cells) {
-	    var $anchor = tr.doc.resolve(cells[0].pos);
-	    var $head = tr.doc.resolve(cells[cells.length - 1].pos);
-	    return cloneTr(tr.setSelection(new dist$7.CellSelection($anchor, $head)));
-	  }
-	  return tr;
-	};
-
-	// :: (cell: {pos: number, node: ProseMirrorNode}, schema: Schema) → (tr: Transaction) → Transaction
-	// Returns a new transaction that clears the content of a given `cell`.
-	//
-	// ```javascript
-	// const $pos = state.doc.resolve(13);
-	// dispatch(
-	//   emptyCell(findCellClosestToPos($pos), state.schema)(state.tr)
-	// );
-	// ```
-	var emptyCell = function emptyCell(cell, schema) {
-	  return function (tr) {
-	    if (cell) {
-	      var content = tableNodeTypes(schema).cell.createAndFill().content;
-	      if (!cell.node.content.eq(content)) {
-	        tr.replaceWith(cell.pos, cell.pos + cell.node.nodeSize - 1, new dist.Slice(content, 0, 0));
-	        return cloneTr(tr);
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (columnIndex: number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that adds a new column at index `columnIndex`.
-	//
-	// ```javascript
-	// dispatch(
-	//   addColumnAt(i)(state.tr)
-	// );
-	// ```
-	var addColumnAt = function addColumnAt(columnIndex) {
-	  return function (tr) {
-	    var table = findTable(tr.selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      if (columnIndex >= 0 && columnIndex <= map.width) {
-	        return cloneTr(dist$7.addColumn(tr, {
-	          map: map,
-	          tableStart: table.start,
-	          table: table.node
-	        }, columnIndex));
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (rowIndex: number, clonePreviousRow?: boolean) → (tr: Transaction) → Transaction
-	// Returns a new transaction that adds a new row at index `rowIndex`. Optionally clone the previous row.
-	//
-	// ```javascript
-	// dispatch(
-	//   addRowAt(i)(state.tr)
-	// );
-	// ```
-	//
-	// ```javascript
-	// dispatch(
-	//   addRowAt(i, true)(state.tr)
-	// );
-	// ```
-	var addRowAt = function addRowAt(rowIndex, clonePreviousRow) {
-	  return function (tr) {
-	    var table = findTable(tr.selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      var cloneRowIndex = rowIndex - 1;
-
-	      if (clonePreviousRow && cloneRowIndex >= 0) {
-	        return cloneTr(cloneRowAt(cloneRowIndex)(tr));
-	      }
-
-	      if (rowIndex >= 0 && rowIndex <= map.height) {
-	        return cloneTr(dist$7.addRow(tr, {
-	          map: map,
-	          tableStart: table.start,
-	          table: table.node
-	        }, rowIndex));
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (cloneRowIndex: number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that adds a new row after `cloneRowIndex`, cloning the row attributes at `cloneRowIndex`.
-	//
-	// ```javascript
-	// dispatch(
-	//   cloneRowAt(i)(state.tr)
-	// );
-	// ```
-	var cloneRowAt = function cloneRowAt(rowIndex) {
-	  return function (tr) {
-	    var table = findTable(tr.selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-
-	      if (rowIndex >= 0 && rowIndex <= map.height) {
-	        var tableNode = table.node;
-	        var tableNodes = tableNodeTypes(tableNode.type.schema);
-
-	        var rowPos = table.start;
-	        for (var i = 0; i < rowIndex + 1; i++) {
-	          rowPos += tableNode.child(i).nodeSize;
-	        }
-
-	        var cloneRow = tableNode.child(rowIndex);
-	        // Re-create the same nodes with same attrs, dropping the node content.
-	        var cells = [];
-	        var rowWidth = 0;
-	        cloneRow.forEach(function (cell) {
-	          // If we're copying a row with rowspan somewhere, we dont want to copy that cell
-	          // We'll increment its span below.
-	          if (cell.attrs.rowspan === 1) {
-	            rowWidth += cell.attrs.colspan;
-	            cells.push(tableNodes[cell.type.spec.tableRole].createAndFill(cell.attrs, cell.marks));
-	          }
-	        });
-
-	        // If a higher row spans past our clone row, bump the higher row to cover this new row too.
-	        if (rowWidth < map.width) {
-	          var rowSpanCells = [];
-
-	          var _loop = function _loop(_i) {
-	            var foundCells = filterCellsInRow(_i, function (cell, tr) {
-	              var rowspan = cell.node.attrs.rowspan;
-	              var spanRange = _i + rowspan;
-	              return rowspan > 1 && spanRange > rowIndex;
-	            })(tr);
-	            rowSpanCells.push.apply(rowSpanCells, _toConsumableArray(foundCells));
-	          };
-
-	          for (var _i = rowIndex; _i >= 0; _i--) {
-	            _loop(_i);
-	          }
-
-	          if (rowSpanCells.length) {
-	            rowSpanCells.forEach(function (cell) {
-	              tr = setCellAttrs(cell, {
-	                rowspan: cell.node.attrs.rowspan + 1
-	              })(tr);
-	            });
-	          }
-	        }
-
-	        return safeInsert(tableNodes.row.create(cloneRow.attrs, cells), rowPos)(tr);
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (columnIndex: number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that removes a column at index `columnIndex`. If there is only one column left, it will remove the entire table.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeColumnAt(i)(state.tr)
-	// );
-	// ```
-	var removeColumnAt = function removeColumnAt(columnIndex) {
-	  return function (tr) {
-	    var table = findTable(tr.selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      if (columnIndex === 0 && map.width === 1) {
-	        return removeTable(tr);
-	      } else if (columnIndex >= 0 && columnIndex <= map.width) {
-	        dist$7.removeColumn(tr, {
-	          map: map,
-	          tableStart: table.start,
-	          table: table.node
-	        }, columnIndex);
-	        return cloneTr(tr);
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (rowIndex: number) → (tr: Transaction) → Transaction
-	// Returns a new transaction that removes a row at index `rowIndex`. If there is only one row left, it will remove the entire table.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeRowAt(i)(state.tr)
-	// );
-	// ```
-	var removeRowAt = function removeRowAt(rowIndex) {
-	  return function (tr) {
-	    var table = findTable(tr.selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      if (rowIndex === 0 && map.height === 1) {
-	        return removeTable(tr);
-	      } else if (rowIndex >= 0 && rowIndex <= map.height) {
-	        dist$7.removeRow(tr, {
-	          map: map,
-	          tableStart: table.start,
-	          table: table.node
-	        }, rowIndex);
-	        return cloneTr(tr);
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (tr: Transaction) → Transaction
-	// Returns a new transaction that removes a table node if the cursor is inside of it.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeTable(state.tr)
-	// );
-	// ```
-	var removeTable = function removeTable(tr) {
-	  var $from = tr.selection.$from;
-
-	  for (var depth = $from.depth; depth > 0; depth--) {
-	    var node = $from.node(depth);
-	    if (node.type.spec.tableRole === 'table') {
-	      return cloneTr(tr.delete($from.before(depth), $from.after(depth)));
-	    }
-	  }
-	  return tr;
-	};
-
-	// :: (tr: Transaction) → Transaction
-	// Returns a new transaction that removes selected columns.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeSelectedColumns(state.tr)
-	// );
-	// ```
-	var removeSelectedColumns = function removeSelectedColumns(tr) {
-	  var _tr = tr,
-	      selection = _tr.selection;
-
-	  if (isTableSelected(selection)) {
-	    return removeTable(tr);
-	  }
-	  if (isCellSelection(selection)) {
-	    var table = findTable(selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);
-	      for (var i = rect.right - 1; i >= rect.left; i--) {
-	        tr = removeColumnAt(i)(tr);
-	      }
-	      return tr;
-	    }
-	  }
-	  return tr;
-	};
-
-	// :: (tr: Transaction) → Transaction
-	// Returns a new transaction that removes selected rows.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeSelectedRows(state.tr)
-	// );
-	// ```
-	var removeSelectedRows = function removeSelectedRows(tr) {
-	  var _tr2 = tr,
-	      selection = _tr2.selection;
-
-	  if (isTableSelected(selection)) {
-	    return removeTable(tr);
-	  }
-	  if (isCellSelection(selection)) {
-	    var table = findTable(selection);
-	    if (table) {
-	      var map = dist$7.TableMap.get(table.node);
-	      var rect = map.rectBetween(selection.$anchorCell.pos - table.start, selection.$headCell.pos - table.start);
-	      for (var i = rect.bottom - 1; i >= rect.top; i--) {
-	        tr = removeRowAt(i)(tr);
-	      }
-	      return tr;
-	    }
-	  }
-	  return tr;
-	};
-
-	// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction
-	// Returns a new transaction that removes a column closest to a given `$pos`.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeColumnClosestToPos(state.doc.resolve(3))(state.tr)
-	// );
-	// ```
-	var removeColumnClosestToPos = function removeColumnClosestToPos($pos) {
-	  return function (tr) {
-	    var rect = findCellRectClosestToPos($pos);
-	    if (rect) {
-	      return removeColumnAt(rect.left)(setTextSelection($pos.pos)(tr));
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: ($pos: ResolvedPos) → (tr: Transaction) → Transaction
-	// Returns a new transaction that removes a row closest to a given `$pos`.
-	//
-	// ```javascript
-	// dispatch(
-	//   removeRowClosestToPos(state.doc.resolve(3))(state.tr)
-	// );
-	// ```
-	var removeRowClosestToPos = function removeRowClosestToPos($pos) {
-	  return function (tr) {
-	    var rect = findCellRectClosestToPos($pos);
-	    if (rect) {
-	      return removeRowAt(rect.top)(setTextSelection($pos.pos)(tr));
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (columnIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction
-	// Returns a new transaction that maps a given `cellTransform` function to each cell in a column at a given `columnIndex`.
-	// It will set the selection into the last cell of the column if `setCursorToLastCell` param is set to `true`.
-	//
-	// ```javascript
-	// dispatch(
-	//   forEachCellInColumn(0, (cell, tr) => emptyCell(cell, state.schema)(tr))(state.tr)
-	// );
-	// ```
-	var forEachCellInColumn = function forEachCellInColumn(columnIndex, cellTransform, setCursorToLastCell) {
-	  return function (tr) {
-	    var cells = getCellsInColumn(columnIndex)(tr.selection);
-	    if (cells) {
-	      for (var i = cells.length - 1; i >= 0; i--) {
-	        tr = cellTransform(cells[i], tr);
-	      }
-	      if (setCursorToLastCell) {
-	        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));
-	        tr.setSelection(dist$2.Selection.near($pos));
-	      }
-	      return cloneTr(tr);
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (rowIndex: number, cellTransform: (cell: {pos: number, start: number, node: ProseMirrorNode}, tr: Transaction) → Transaction, setCursorToLastCell: ?boolean) → (tr: Transaction) → Transaction
-	// Returns a new transaction that maps a given `cellTransform` function to each cell in a row at a given `rowIndex`.
-	// It will set the selection into the last cell of the row if `setCursorToLastCell` param is set to `true`.
-	//
-	// ```javascript
-	// dispatch(
-	//   forEachCellInRow(0, (cell, tr) => setCellAttrs(cell, { background: 'red' })(tr))(state.tr)
-	// );
-	// ```
-	var forEachCellInRow = function forEachCellInRow(rowIndex, cellTransform, setCursorToLastCell) {
-	  return function (tr) {
-	    var cells = getCellsInRow(rowIndex)(tr.selection);
-	    if (cells) {
-	      for (var i = cells.length - 1; i >= 0; i--) {
-	        tr = cellTransform(cells[i], tr);
-	      }
-	      if (setCursorToLastCell) {
-	        var $pos = tr.doc.resolve(tr.mapping.map(cells[cells.length - 1].pos));
-	        tr.setSelection(dist$2.Selection.near($pos));
-	      }
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (cell: {pos: number, start: number, node: ProseMirrorNode}, attrs: Object) → (tr: Transaction) → Transaction
-	// Returns a new transaction that sets given `attrs` to a given `cell`.
-	//
-	// ```javascript
-	// dispatch(
-	//   setCellAttrs(findCellClosestToPos($pos), { background: 'blue' })(tr);
-	// );
-	// ```
-	var setCellAttrs = function setCellAttrs(cell, attrs) {
-	  return function (tr) {
-	    if (cell) {
-	      tr.setNodeMarkup(cell.pos, null, Object.assign({}, cell.node.attrs, attrs));
-	      return cloneTr(tr);
-	    }
-	    return tr;
-	  };
-	};
-
-	// :: (schema: Schema, rowsCount: ?number, colsCount: ?number, withHeaderRow: ?boolean) → Node
-	// Returns a table node of a given size.
-	// `withHeaderRow` defines whether the first row of the table will be a header row.
-	//
-	// ```javascript
-	// const table = createTable(state.schema); // 3x3 table node
-	// dispatch(
-	//   tr.replaceSelectionWith(table).scrollIntoView()
-	// );
-	// ```
-	var createTable = function createTable(schema) {
-	  var rowsCount = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 3;
-	  var colsCount = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 3;
-	  var withHeaderRow = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
-
-	  var _tableNodeTypes = tableNodeTypes(schema),
-	      tableCell = _tableNodeTypes.cell,
-	      tableHeader = _tableNodeTypes.header_cell,
-	      tableRow = _tableNodeTypes.row,
-	      table = _tableNodeTypes.table;
-
-	  var cells = [];
-	  for (var i = 0; i < colsCount; i++) {
-	    cells.push(tableCell.createAndFill(null));
-	  }
-
-	  var headerCells = [];
-	  if (withHeaderRow) {
-	    for (var _i2 = 0; _i2 < colsCount; _i2++) {
-	      headerCells.push(tableHeader.createAndFill(null));
-	    }
-	  }
-
-	  var rows = [];
-	  for (var _i3 = 0; _i3 < rowsCount; _i3++) {
-	    rows.push(tableRow.createChecked(null, withHeaderRow && _i3 === 0 ? headerCells : cells));
-	  }
-
-	  return table.createChecked(null, rows);
-	};
-
-	// :: ($pos: ResolvedPos) → ?{pos: number, start: number, node: ProseMirrorNode}
-	// Iterates over parent nodes, returning a table cell or a table header node closest to a given `$pos`.
-	//
-	// ```javascript
-	// const cell = findCellClosestToPos(state.selection.$from);
-	// ```
-	var findCellClosestToPos = function findCellClosestToPos($pos) {
-	  var predicate = function predicate(node) {
-	    return node.type.spec.tableRole && /cell/i.test(node.type.spec.tableRole);
-	  };
-	  return findParentNodeClosestToPos($pos, predicate);
-	};
-
-	// :: ($pos: ResolvedPos) → ?{left: number, top: number, right: number, bottom: number}
-	// Returns the rectangle spanning a cell closest to a given `$pos`.
-	//
-	// ```javascript
-	// dispatch(
-	//   findCellRectClosestToPos(state.selection.$from)
-	// );
-	// ```
-	var findCellRectClosestToPos = function findCellRectClosestToPos($pos) {
-	  var cell = findCellClosestToPos($pos);
-	  if (cell) {
-	    var table = findTableClosestToPos($pos);
-	    var map = dist$7.TableMap.get(table.node);
-	    var cellPos = cell.pos - table.start;
-	    return map.rectBetween(cellPos, cellPos);
-	  }
-	};
-
-	var filterCellsInRow = function filterCellsInRow(rowIndex, predicate) {
-	  return function (tr) {
-	    var foundCells = [];
-	    var cells = getCellsInRow(rowIndex)(tr.selection);
-	    if (cells) {
-	      for (var j = cells.length - 1; j >= 0; j--) {
-	        if (predicate(cells[j], tr)) {
-	          foundCells.push(cells[j]);
-	        }
-	      }
-	    }
-
-	    return foundCells;
-	  };
-	};
-
-	exports.isNodeSelection = isNodeSelection;
-	exports.canInsert = canInsert;
-	exports.findParentNode = findParentNode;
-	exports.findParentNodeClosestToPos = findParentNodeClosestToPos;
-	exports.findParentDomRef = findParentDomRef;
-	exports.hasParentNode = hasParentNode;
-	exports.findParentNodeOfType = findParentNodeOfType;
-	exports.findParentNodeOfTypeClosestToPos = findParentNodeOfTypeClosestToPos;
-	exports.hasParentNodeOfType = hasParentNodeOfType;
-	exports.findParentDomRefOfType = findParentDomRefOfType;
-	exports.findSelectedNodeOfType = findSelectedNodeOfType;
-	exports.findPositionOfNodeBefore = findPositionOfNodeBefore;
-	exports.findDomRefAtPos = findDomRefAtPos;
-	exports.flatten = flatten;
-	exports.findChildren = findChildren;
-	exports.findTextNodes = findTextNodes;
-	exports.findInlineNodes = findInlineNodes;
-	exports.findBlockNodes = findBlockNodes;
-	exports.findChildrenByAttr = findChildrenByAttr;
-	exports.findChildrenByType = findChildrenByType;
-	exports.findChildrenByMark = findChildrenByMark;
-	exports.contains = contains;
-	exports.findTable = findTable;
-	exports.isCellSelection = isCellSelection;
-	exports.isColumnSelected = isColumnSelected;
-	exports.isRowSelected = isRowSelected;
-	exports.isTableSelected = isTableSelected;
-	exports.getCellsInColumn = getCellsInColumn;
-	exports.getCellsInRow = getCellsInRow;
-	exports.getCellsInTable = getCellsInTable;
-	exports.selectColumn = selectColumn;
-	exports.selectRow = selectRow;
-	exports.selectTable = selectTable;
-	exports.emptyCell = emptyCell;
-	exports.addColumnAt = addColumnAt;
-	exports.addRowAt = addRowAt;
-	exports.cloneRowAt = cloneRowAt;
-	exports.removeColumnAt = removeColumnAt;
-	exports.removeRowAt = removeRowAt;
-	exports.removeTable = removeTable;
-	exports.removeSelectedColumns = removeSelectedColumns;
-	exports.removeSelectedRows = removeSelectedRows;
-	exports.removeColumnClosestToPos = removeColumnClosestToPos;
-	exports.removeRowClosestToPos = removeRowClosestToPos;
-	exports.forEachCellInColumn = forEachCellInColumn;
-	exports.forEachCellInRow = forEachCellInRow;
-	exports.setCellAttrs = setCellAttrs;
-	exports.createTable = createTable;
-	exports.findCellClosestToPos = findCellClosestToPos;
-	exports.findCellRectClosestToPos = findCellRectClosestToPos;
-	exports.removeParentNodeOfType = removeParentNodeOfType;
-	exports.replaceParentNodeOfType = replaceParentNodeOfType;
-	exports.removeSelectedNode = removeSelectedNode;
-	exports.replaceSelectedNode = replaceSelectedNode;
-	exports.setTextSelection = setTextSelection;
-	exports.safeInsert = safeInsert;
-	exports.setParentNodeMarkup = setParentNodeMarkup;
-	exports.selectParentNodeOfType = selectParentNodeOfType;
-	exports.removeNodeBefore = removeNodeBefore;
-
-	});
-
-	unwrapExports(dist$8);
-	var dist_1$7 = dist$8.isNodeSelection;
-	var dist_2$7 = dist$8.canInsert;
-	var dist_3$6 = dist$8.findParentNode;
-	var dist_4$6 = dist$8.findParentNodeClosestToPos;
-	var dist_5$6 = dist$8.findParentDomRef;
-	var dist_6$5 = dist$8.hasParentNode;
-	var dist_7$5 = dist$8.findParentNodeOfType;
-	var dist_8$5 = dist$8.findParentNodeOfTypeClosestToPos;
-	var dist_9$5 = dist$8.hasParentNodeOfType;
-	var dist_10$4 = dist$8.findParentDomRefOfType;
-	var dist_11$4 = dist$8.findSelectedNodeOfType;
-	var dist_12$4 = dist$8.findPositionOfNodeBefore;
-	var dist_13$3 = dist$8.findDomRefAtPos;
-	var dist_14$2 = dist$8.flatten;
-	var dist_15$2 = dist$8.findChildren;
-	var dist_16$2 = dist$8.findTextNodes;
-	var dist_17$2 = dist$8.findInlineNodes;
-	var dist_18$2 = dist$8.findBlockNodes;
-	var dist_19$2 = dist$8.findChildrenByAttr;
-	var dist_20$1 = dist$8.findChildrenByType;
-	var dist_21$1 = dist$8.findChildrenByMark;
-	var dist_22$1 = dist$8.contains;
-	var dist_23$1 = dist$8.findTable;
-	var dist_24$1 = dist$8.isCellSelection;
-	var dist_25$1 = dist$8.isColumnSelected;
-	var dist_26$1 = dist$8.isRowSelected;
-	var dist_27$1 = dist$8.isTableSelected;
-	var dist_28$1 = dist$8.getCellsInColumn;
-	var dist_29$1 = dist$8.getCellsInRow;
-	var dist_30$1 = dist$8.getCellsInTable;
-	var dist_31$1 = dist$8.selectColumn;
-	var dist_32$1 = dist$8.selectRow;
-	var dist_33$1 = dist$8.selectTable;
-	var dist_34$1 = dist$8.emptyCell;
-	var dist_35$1 = dist$8.addColumnAt;
-	var dist_36$1 = dist$8.addRowAt;
-	var dist_37$1 = dist$8.cloneRowAt;
-	var dist_38$1 = dist$8.removeColumnAt;
-	var dist_39 = dist$8.removeRowAt;
-	var dist_40 = dist$8.removeTable;
-	var dist_41 = dist$8.removeSelectedColumns;
-	var dist_42 = dist$8.removeSelectedRows;
-	var dist_43 = dist$8.removeColumnClosestToPos;
-	var dist_44 = dist$8.removeRowClosestToPos;
-	var dist_45 = dist$8.forEachCellInColumn;
-	var dist_46 = dist$8.forEachCellInRow;
-	var dist_47 = dist$8.setCellAttrs;
-	var dist_48 = dist$8.createTable;
-	var dist_49 = dist$8.findCellClosestToPos;
-	var dist_50 = dist$8.findCellRectClosestToPos;
-	var dist_51 = dist$8.removeParentNodeOfType;
-	var dist_52 = dist$8.replaceParentNodeOfType;
-	var dist_53 = dist$8.removeSelectedNode;
-	var dist_54 = dist$8.replaceSelectedNode;
-	var dist_55 = dist$8.setTextSelection;
-	var dist_56 = dist$8.safeInsert;
-	var dist_57 = dist$8.setParentNodeMarkup;
-	var dist_58 = dist$8.selectParentNodeOfType;
-	var dist_59 = dist$8.removeNodeBefore;
-
-	function nodeIsActive (state, type, attrs) {
-		var predicate = function (node) { return node.type === type; };
-		var parent = dist_3$6(predicate)(state.selection);
-
-		if (attrs === {} || !parent) {
-			return !!parent
-		}
-
-		return parent.node.hasMarkup(type, attrs)
-	}
-
-	var Toolbar = function Toolbar(ref) {
-		var node = ref.node;
-		var editorView = ref.editorView;
-
-		this.editorView = editorView;
-		this.node = node;
-		this.element = this.node.elm;
-		this.element.style.visibility = 'hidden';
-		this.element.style.opacity = 0;
-
-		this.editorView.dom.addEventListener('blur', this.hide.bind(this));
-	};
-
-	Toolbar.prototype.update = function update (view, lastState) {
-		var state = view.state;
-
-		// Don't do anything if the document/selection didn't change
-		if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {
-			return
-		}
-
-		// Hide the tooltip if the selection is empty
-		if (state.selection.empty) {
-			this.hide();
-			return
-		}
-
-
-		// Otherwise, reposition it and update its content
-		this.show();
-		var ref = state.selection;
-			var from = ref.from;
-			var to = ref.to;
-
-		// These are in screen coordinates
-		var start = view.coordsAtPos(from);
-		var end = view.coordsAtPos(to);
-
-		// The box in which the tooltip is positioned, to use as base
-		var box = this.element.offsetParent.getBoundingClientRect();
-
-		// Find a center-ish x position from the selection endpoints (when
-		// crossing lines, end may be more to the left)
-		var left = Math.max((start.left + end.left) / 2, start.left + 3);
-		this.element.style.left = (left - box.left) + "px";
-		this.element.style.bottom = (box.bottom - start.top) + "px";
-	};
-
-	Toolbar.prototype.show = function show () {
-		this.element.style.visibility = 'visible';
-		this.element.style.opacity = 1;
-	};
-
-	Toolbar.prototype.hide = function hide (event) {
-		if (event && event.relatedTarget) {
-			return
-		}
-		this.element.style.visibility = 'hidden';
-		this.element.style.opacity = 0;
-	};
-
-	Toolbar.prototype.destroy = function destroy () {
-		this.editorView.dom.removeEventListener('blur', this.hide);
-	};
-
-	function menuBubble (node) {
-		return new dist_8$2({
-			view: function view(editorView) {
-				return new Toolbar({ editorView: editorView, node: node })
-			},
-		})
-	}
-
-	var Node = function Node(options) {
-		if ( options === void 0 ) options = {};
-
-		this.options = Object.assign({}, this.defaultOptions,
-			options);
-	};
-
-	var prototypeAccessors = { name: { configurable: true },defaultOptions: { configurable: true },type: { configurable: true },view: { configurable: true },schema: { configurable: true },plugins: { configurable: true } };
-
-	prototypeAccessors.name.get = function () {
-		return null
-	};
-
-	prototypeAccessors.defaultOptions.get = function () {
-		return {}
-	};
-
-	prototypeAccessors.type.get = function () {
-		return 'node'
-	};
-
-	prototypeAccessors.view.get = function () {
-		return null
-	};
-
-	prototypeAccessors.schema.get = function () {
-		return null
-	};
-
-	prototypeAccessors.plugins.get = function () {
-		return []
-	};
-
-	Node.prototype.command = function command () {
-		return function () {}
-	};
-
-	Node.prototype.keys = function keys () {
-		return {}
-	};
-
-	Node.prototype.inputRules = function inputRules () {
-		return []
-	};
-
-	Object.defineProperties( Node.prototype, prototypeAccessors );
-
-	var Mark = function Mark(options) {
-		if ( options === void 0 ) options = {};
-
-		this.options = Object.assign({}, this.defaultOptions,
-			options);
-	};
-
-	var prototypeAccessors$1 = { name: { configurable: true },defaultOptions: { configurable: true },type: { configurable: true },view: { configurable: true },schema: { configurable: true },plugins: { configurable: true } };
-
-	prototypeAccessors$1.name.get = function () {
-		return null
-	};
-
-	prototypeAccessors$1.defaultOptions.get = function () {
-		return {}
-	};
-
-	prototypeAccessors$1.type.get = function () {
-		return 'mark'
-	};
-
-	prototypeAccessors$1.view.get = function () {
-		return null
-	};
-
-	prototypeAccessors$1.schema.get = function () {
-		return null
-	};
-
-	prototypeAccessors$1.plugins.get = function () {
-		return []
-	};
-
-	Mark.prototype.command = function command () {
-		return function () {}
-	};
-
-	Mark.prototype.keys = function keys () {
-		return {}
-	};
-
-	Mark.prototype.inputRules = function inputRules () {
-		return []
-	};
-
-	Object.defineProperties( Mark.prototype, prototypeAccessors$1 );
-
-	var PluginManager = function PluginManager(plugins) {
-		if ( plugins === void 0 ) plugins = [];
-
-		this.plugins = plugins;
-	};
-
-	var prototypeAccessors$2 = { nodes: { configurable: true },marks: { configurable: true },pluginplugins: { configurable: true },views: { configurable: true } };
-
-	prototypeAccessors$2.nodes.get = function () {
-		return this.plugins
-			.filter(function (plugin) { return plugin.type === 'node'; })
-			.reduce(function (nodes, ref) {
-					var obj;
-
-					var name = ref.name;
-					var schema = ref.schema;
-					return (Object.assign({}, nodes,
-				( obj = {}, obj[name] = schema, obj )));
-			}, {})
-	};
-
-	prototypeAccessors$2.marks.get = function () {
-		return this.plugins
-			.filter(function (plugin) { return plugin.type === 'mark'; })
-			.reduce(function (marks, ref) {
-					var obj;
-
-					var name = ref.name;
-					var schema = ref.schema;
-					return (Object.assign({}, marks,
-				( obj = {}, obj[name] = schema, obj )));
-			}, {})
-	};
-
-	prototypeAccessors$2.pluginplugins.get = function () {
-		return this.plugins
-			.filter(function (plugin) { return plugin.plugins; })
-			.reduce(function (allPlugins, ref) {
-					var plugins = ref.plugins;
-
-					return (allPlugins.concat( plugins ));
-			}, [])
-	};
-
-	prototypeAccessors$2.views.get = function () {
-		return this.plugins
-			.filter(function (plugin) { return plugin.view; })
-			.reduce(function (views, ref) {
-					var obj;
-
-					var name = ref.name;
-					var view = ref.view;
-					return (Object.assign({}, views,
-				( obj = {}, obj[name] = view, obj )));
-			}, {})
-	};
-
-	PluginManager.prototype.keymaps = function keymaps (ref) {
-			var schema = ref.schema;
-
-		return this.plugins
-			.filter(function (plugin) { return plugin.keys; })
-			.map(function (plugin) { return plugin.keys({
-				type: schema[((plugin.type) + "s")][plugin.name],
-				schema: schema,
-			}); })
-			.map(function (keys) { return keymap_2(keys); })
-	};
-
-	PluginManager.prototype.inputRules = function inputRules (ref) {
-			var schema = ref.schema;
-
-		return this.plugins
-			.filter(function (plugin) { return plugin.inputRules; })
-			.map(function (plugin) { return plugin.inputRules({
-				type: schema[((plugin.type) + "s")][plugin.name],
-				schema: schema,
-			}); })
-			.reduce(function (allInputRules, inputRules) { return (allInputRules.concat( inputRules )); }, [])
-	};
-
-	PluginManager.prototype.commands = function commands (ref) {
-			var schema = ref.schema;
-			var view = ref.view;
-
-		return this.plugins
-			.filter(function (plugin) { return plugin.command; })
-			.reduce(function (commands, ref) {
-					var obj;
-
-					var name = ref.name;
-					var type = ref.type;
-					var command = ref.command;
-					return (Object.assign({}, commands,
-				( obj = {}, obj[name] = function (attrs) {
-					view.focus();
-					command({
-						type: schema[(type + "s")][name],
-						attrs: attrs,
-						schema: schema,
-					})(view.state, view.dispatch, view);
-				}, obj )));
-			}, {})
-	};
-
-	Object.defineProperties( PluginManager.prototype, prototypeAccessors$2 );
-
-	var schemaList = createCommonjsModule(function (module, exports) {
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-
-
-
-	var olDOM = ["ol", 0];
-	var ulDOM = ["ul", 0];
-	var liDOM = ["li", 0];
-
-	// :: NodeSpec
-	// An ordered list [node spec](#model.NodeSpec). Has a single
-	// attribute, `order`, which determines the number at which the list
-	// starts counting, and defaults to 1. Represented as an `<ol>`
-	// element.
-	var orderedList = {
-	  attrs: {order: {default: 1}},
-	  parseDOM: [{tag: "ol", getAttrs: function getAttrs(dom) {
-	    return {order: dom.hasAttribute("start") ? +dom.getAttribute("start") : 1}
-	  }}],
-	  toDOM: function toDOM(node) {
-	    return node.attrs.order == 1 ? olDOM : ["ol", {start: node.attrs.order}, 0]
-	  }
-	};
-
-	// :: NodeSpec
-	// A bullet list node spec, represented in the DOM as `<ul>`.
-	var bulletList = {
-	  parseDOM: [{tag: "ul"}],
-	  toDOM: function toDOM() { return ulDOM }
-	};
-
-	// :: NodeSpec
-	// A list item (`<li>`) spec.
-	var listItem = {
-	  parseDOM: [{tag: "li"}],
-	  toDOM: function toDOM() { return liDOM },
-	  defining: true
-	};
-
-	function add(obj, props) {
-	  var copy = {};
-	  for (var prop in obj) { copy[prop] = obj[prop]; }
-	  for (var prop$1 in props) { copy[prop$1] = props[prop$1]; }
-	  return copy
-	}
-
-	// :: (OrderedMap<NodeSpec>, string, ?string) → OrderedMap<NodeSpec>
-	// Convenience function for adding list-related node types to a map
-	// specifying the nodes for a schema. Adds
-	// [`orderedList`](#schema-list.orderedList) as `"ordered_list"`,
-	// [`bulletList`](#schema-list.bulletList) as `"bullet_list"`, and
-	// [`listItem`](#schema-list.listItem) as `"list_item"`.
-	//
-	// `itemContent` determines the content expression for the list items.
-	// If you want the commands defined in this module to apply to your
-	// list structure, it should have a shape like `"paragraph block*"` or
-	// `"paragraph (ordered_list | bullet_list)*"`. `listGroup` can be
-	// given to assign a group name to the list node types, for example
-	// `"block"`.
-	function addListNodes(nodes, itemContent, listGroup) {
-	  return nodes.append({
-	    ordered_list: add(orderedList, {content: "list_item+", group: listGroup}),
-	    bullet_list: add(bulletList, {content: "list_item+", group: listGroup}),
-	    list_item: add(listItem, {content: itemContent})
-	  })
-	}
-
-	// :: (NodeType, ?Object) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Returns a command function that wraps the selection in a list with
-	// the given type an attributes. If `dispatch` is null, only return a
-	// value to indicate whether this is possible, but don't actually
-	// perform the change.
-	function wrapInList(listType, attrs) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var $from = ref.$from;
-	    var $to = ref.$to;
-	    var range = $from.blockRange($to), doJoin = false, outerRange = range;
-	    if (!range) { return false }
-	    // This is at the top of an existing list item
-	    if (range.depth >= 2 && $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {
-	      // Don't do anything if this is the top of the list
-	      if ($from.index(range.depth - 1) == 0) { return false }
-	      var $insert = state.doc.resolve(range.start - 2);
-	      outerRange = new dist.NodeRange($insert, $insert, range.depth);
-	      if (range.endIndex < range.parent.childCount)
-	        { range = new dist.NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth); }
-	      doJoin = true;
-	    }
-	    var wrap = dist$1.findWrapping(outerRange, listType, attrs, range);
-	    if (!wrap) { return false }
-	    if (dispatch) { dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView()); }
-	    return true
-	  }
-	}
-
-	function doWrapInList(tr, range, wrappers, joinBefore, listType) {
-	  var content = dist.Fragment.empty;
-	  for (var i = wrappers.length - 1; i >= 0; i--)
-	    { content = dist.Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content)); }
-
-	  tr.step(new dist$1.ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end,
-	                                new dist.Slice(content, 0, 0), wrappers.length, true));
-
-	  var found = 0;
-	  for (var i$1 = 0; i$1 < wrappers.length; i$1++) { if (wrappers[i$1].type == listType) { found = i$1 + 1; } }
-	  var splitDepth = wrappers.length - found;
-
-	  var splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;
-	  for (var i$2 = range.startIndex, e = range.endIndex, first = true; i$2 < e; i$2++, first = false) {
-	    if (!first && dist$1.canSplit(tr.doc, splitPos, splitDepth)) {
-	      tr.split(splitPos, splitDepth);
-	      splitPos += 2 * splitDepth;
-	    }
-	    splitPos += parent.child(i$2).nodeSize;
-	  }
-	  return tr
-	}
-
-	// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Build a command that splits a non-empty textblock at the top level
-	// of a list item by also splitting that list item.
-	function splitListItem(itemType) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var $from = ref.$from;
-	    var $to = ref.$to;
-	    var node = ref.node;
-	    if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to)) { return false }
-	    var grandParent = $from.node(-1);
-	    if (grandParent.type != itemType) { return false }
-	    if ($from.parent.content.size == 0) {
-	      // In an empty block. If this is a nested list, the wrapping
-	      // list item should be split. Otherwise, bail out and let next
-	      // command handle lifting.
-	      if ($from.depth == 2 || $from.node(-3).type != itemType ||
-	          $from.index(-2) != $from.node(-2).childCount - 1) { return false }
-	      if (dispatch) {
-	        var wrap = dist.Fragment.empty, keepItem = $from.index(-1) > 0;
-	        // Build a fragment containing empty versions of the structure
-	        // from the outer list item to the parent node of the cursor
-	        for (var d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--)
-	          { wrap = dist.Fragment.from($from.node(d).copy(wrap)); }
-	        // Add a second list item with an empty default start node
-	        wrap = wrap.append(dist.Fragment.from(itemType.createAndFill()));
-	        var tr$1 = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new dist.Slice(wrap, keepItem ? 3 : 2, 2));
-	        tr$1.setSelection(state.selection.constructor.near(tr$1.doc.resolve($from.pos + (keepItem ? 3 : 2))));
-	        dispatch(tr$1.scrollIntoView());
-	      }
-	      return true
-	    }
-	    var nextType = $to.pos == $from.end() ? grandParent.defaultContentType(0) : null;
-	    var tr = state.tr.delete($from.pos, $to.pos);
-	    var types = nextType && [null, {type: nextType}];
-	    if (!dist$1.canSplit(tr.doc, $from.pos, 2, types)) { return false }
-	    if (dispatch) { dispatch(tr.split($from.pos, 2, types).scrollIntoView()); }
-	    return true
-	  }
-	}
-
-	// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Create a command to lift the list item around the selection up into
-	// a wrapping list.
-	function liftListItem(itemType) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var $from = ref.$from;
-	    var $to = ref.$to;
-	    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });
-	    if (!range) { return false }
-	    if (!dispatch) { return true }
-	    if ($from.node(range.depth - 1).type == itemType) // Inside a parent list
-	      { return liftToOuterList(state, dispatch, itemType, range) }
-	    else // Outer list node
-	      { return liftOutOfList(state, dispatch, range) }
-	  }
-	}
-
-	function liftToOuterList(state, dispatch, itemType, range) {
-	  var tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);
-	  if (end < endOfList) {
-	    // There are siblings after the lifted items, which must become
-	    // children of the last item
-	    tr.step(new dist$1.ReplaceAroundStep(end - 1, endOfList, end, endOfList,
-	                                  new dist.Slice(dist.Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
-	    range = new dist.NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
-	  }
-	  dispatch(tr.lift(range, dist$1.liftTarget(range)).scrollIntoView());
-	  return true
-	}
-
-	function liftOutOfList(state, dispatch, range) {
-	  var tr = state.tr, list = range.parent;
-	  // Merge the list items into a single big item
-	  for (var pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {
-	    pos -= list.child(i).nodeSize;
-	    tr.delete(pos - 1, pos + 1);
-	  }
-	  var $start = tr.doc.resolve(range.start), item = $start.nodeAfter;
-	  var atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;
-	  var parent = $start.node(-1), indexBefore = $start.index(-1);
-	  if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1,
-	                         item.content.append(atEnd ? dist.Fragment.empty : dist.Fragment.from(list))))
-	    { return false }
-	  var start = $start.pos, end = start + item.nodeSize;
-	  // Strip off the surrounding list. At the sides where we're not at
-	  // the end of the list, the existing list is closed. At sides where
-	  // this is the end, it is overwritten to its end.
-	  tr.step(new dist$1.ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1,
-	                                new dist.Slice((atStart ? dist.Fragment.empty : dist.Fragment.from(list.copy(dist.Fragment.empty)))
-	                                          .append(atEnd ? dist.Fragment.empty : dist.Fragment.from(list.copy(dist.Fragment.empty))),
-	                                          atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));
-	  dispatch(tr.scrollIntoView());
-	  return true
-	}
-
-	// :: (NodeType) → (state: EditorState, dispatch: ?(tr: Transaction)) → bool
-	// Create a command to sink the list item around the selection down
-	// into an inner list.
-	function sinkListItem(itemType) {
-	  return function(state, dispatch) {
-	    var ref = state.selection;
-	    var $from = ref.$from;
-	    var $to = ref.$to;
-	    var range = $from.blockRange($to, function (node) { return node.childCount && node.firstChild.type == itemType; });
-	    if (!range) { return false }
-	    var startIndex = range.startIndex;
-	    if (startIndex == 0) { return false }
-	    var parent = range.parent, nodeBefore = parent.child(startIndex - 1);
-	    if (nodeBefore.type != itemType) { return false }
-
-	    if (dispatch) {
-	      var nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;
-	      var inner = dist.Fragment.from(nestedBefore ? itemType.create() : null);
-	      var slice = new dist.Slice(dist.Fragment.from(itemType.create(null, dist.Fragment.from(parent.copy(inner)))),
-	                            nestedBefore ? 3 : 1, 0);
-	      var before = range.start, after = range.end;
-	      dispatch(state.tr.step(new dist$1.ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after,
-	                                                   before, after, slice, 1, true))
-	               .scrollIntoView());
-	    }
-	    return true
-	  }
-	}
-
-	exports.orderedList = orderedList;
-	exports.bulletList = bulletList;
-	exports.listItem = listItem;
-	exports.addListNodes = addListNodes;
-	exports.wrapInList = wrapInList;
-	exports.splitListItem = splitListItem;
-	exports.liftListItem = liftListItem;
-	exports.sinkListItem = sinkListItem;
-
-	});
-
-	unwrapExports(schemaList);
-	var schemaList_1 = schemaList.orderedList;
-	var schemaList_2 = schemaList.bulletList;
-	var schemaList_3 = schemaList.listItem;
-	var schemaList_4 = schemaList.addListNodes;
-	var schemaList_5 = schemaList.wrapInList;
-	var schemaList_6 = schemaList.splitListItem;
-	var schemaList_7 = schemaList.liftListItem;
-	var schemaList_8 = schemaList.sinkListItem;
-
-	function removeMark (type) {
-	  return function (state, dispatch) {
-			var ref = state.selection;
-			var from = ref.from;
-			var to = ref.to;
-			return dispatch(state.tr.removeMark(from, to, type))
-		}
-	}
-
-	function toggleBlockType (type, toggletype, attrs) {
-		if ( attrs === void 0 ) attrs = {};
-
-		return function (state, dispatch, view) {
-			var isActive = nodeIsActive(state, type, attrs);
-
-			if (isActive) {
-				return commands_18(toggletype)(state, dispatch, view)
-			}
-
-			return commands_18(type, attrs)(state, dispatch, view)
-		}
-	}
-
-	function toggleList$$1(type, itemType) {
-	  return function (state, dispatch, view) {
-	    var isActive = nodeIsActive(state, type);
-
-	    if (isActive) {
-	      return schemaList_7(itemType)(state, dispatch, view)
-	    }
-
-	    return schemaList_5(type)(state, dispatch, view)
-	  }
-	}
-
-	// https://discuss.prosemirror.net/t/list-type-toggle/948
-
-	// import { wrapInList, liftListItem } from 'prosemirror-schema-list'
-
-	// function isList(node, schema) {
-	//   return (node.type === schema.nodes.bullet_list || node.type === schema.nodes.ordered_list)
-	// }
-
-	// export default function toggleList(listType, schema) {
-	//   const lift = liftListItem(schema.nodes.list_item)
-	// 	const wrap = wrapInList(listType)
-
-	//   return (state, dispatch) => {
-	//     const { $from, $to } = state.selection
-	//     const range = $from.blockRange($to)
-	//     if (!range) {
-	//       return false
-	// 		}
-
-	//     if (range.depth >= 2 && $from.node(range.depth - 1).type === listType) {
-	//       return lift(state, dispatch)
-	//     } else if (range.depth >= 2 && isList($from.node(range.depth - 1), schema)) {
-	//       const tr = state.tr
-	// 			const node = $from.before(range.depth - 1)
-	// 			console.log({node})
-	//       // TODO: how do I pass the node above to `setNodeType`?
-	//       // tr.setNodeType(range.start, listType);
-	//       if (dispatch) dispatch(tr)
-	//       return false
-	//     } else {
-	//       return wrap(state, dispatch)
-	//     }
-	//   }
-	// }
-
-	function updateMark (type, attrs) {
-	  return function (state, dispatch) {
-			var ref = state.selection;
-			var from = ref.from;
-			var to = ref.to;
-			return dispatch(state.tr.addMark(from, to, type.create(attrs)))
-		}
-	}
-
-	var BlockquoteNode = (function (Node$$1) {
-		function BlockquoteNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) BlockquoteNode.__proto__ = Node$$1;
-		BlockquoteNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		BlockquoteNode.prototype.constructor = BlockquoteNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'blockquote'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				content: 'block+',
-				group: 'block',
-				defining: true,
-				draggable: false,
-				parseDOM: [
-					{ tag: 'blockquote' } ],
-				toDOM: function () { return ['blockquote', 0]; },
-			}
-		};
-
-		BlockquoteNode.prototype.command = function command (ref) {
-			var type = ref.type;
-
-			return commands_18(type)
-		};
-
-		BlockquoteNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Ctrl->': commands_17(type),
-			}
-		};
-
-		BlockquoteNode.prototype.inputRules = function inputRules (ref) {
-			var type = ref.type;
-
-			return [
-				dist_11$2(/^\s*>\s$/, type) ]
-		};
-
-		Object.defineProperties( BlockquoteNode.prototype, prototypeAccessors );
-
-		return BlockquoteNode;
-	}(Node));
-
-	var BulletNode = (function (Node$$1) {
-		function BulletNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) BulletNode.__proto__ = Node$$1;
-		BulletNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		BulletNode.prototype.constructor = BulletNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'bullet_list'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				content: 'list_item+',
-				group: 'block',
-				parseDOM: [
-					{ tag: 'ul' } ],
-				toDOM: function () { return ['ul', 0]; },
-			}
-		};
-
-		BulletNode.prototype.command = function command (ref) {
-			var type = ref.type;
-			var schema = ref.schema;
-
-			return toggleList$$1(type, schema.nodes.list_item)
-		};
-
-		BulletNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Shift-Ctrl-8': schemaList_5(type),
-			}
-		};
-
-		BulletNode.prototype.inputRules = function inputRules (ref) {
-			var type = ref.type;
-
-			return [
-				dist_11$2(/^\s*([-+*])\s$/, type) ]
-		};
-
-		Object.defineProperties( BulletNode.prototype, prototypeAccessors );
-
-		return BulletNode;
-	}(Node));
-
-	var CodeBlockNode = (function (Node$$1) {
-		function CodeBlockNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) CodeBlockNode.__proto__ = Node$$1;
-		CodeBlockNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		CodeBlockNode.prototype.constructor = CodeBlockNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'code_block'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				content: 'text*',
-				marks: '',
-				group: 'block',
-				code: true,
-				defining: true,
-				draggable: false,
-				parseDOM: [
-					{ tag: 'pre', preserveWhitespace: 'full' } ],
-				toDOM: function () { return ['pre', ['code', 0]]; },
-			}
-		};
-
-		CodeBlockNode.prototype.command = function command (ref) {
-			var type = ref.type;
-			var schema = ref.schema;
-
-			return toggleBlockType(type, schema.nodes.paragraph)
-		};
-
-		CodeBlockNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Shift-Ctrl-\\': commands_18(type),
-			}
-		};
-
-		CodeBlockNode.prototype.inputRules = function inputRules (ref) {
-			var type = ref.type;
-
-			return [
-				dist_12$2(/^```$/, type) ]
-		};
-
-		Object.defineProperties( CodeBlockNode.prototype, prototypeAccessors );
-
-		return CodeBlockNode;
-	}(Node));
-
-	var DocNode = (function (Node$$1) {
-		function DocNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) DocNode.__proto__ = Node$$1;
-		DocNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		DocNode.prototype.constructor = DocNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'doc'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				content: 'block+',
-			}
-		};
-
-		Object.defineProperties( DocNode.prototype, prototypeAccessors );
-
-		return DocNode;
-	}(Node));
-
-	var HardBreakNode = (function (Node$$1) {
-		function HardBreakNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) HardBreakNode.__proto__ = Node$$1;
-		HardBreakNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		HardBreakNode.prototype.constructor = HardBreakNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'hard_break'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				inline: true,
-				group: 'inline',
-				selectable: false,
-				parseDOM: [
-					{ tag: 'br' } ],
-				toDOM: function () { return ['br']; },
-			}
-		};
-
-		HardBreakNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			var command = commands_21(commands_10, function (state, dispatch) {
-				dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());
-				return true
-			});
-			return {
-				'Mod-Enter': command,
-				'Shift-Enter': command,
-			}
-		};
-
-		Object.defineProperties( HardBreakNode.prototype, prototypeAccessors );
-
-		return HardBreakNode;
-	}(Node));
-
-	var HeadingNode = (function (Node$$1) {
-		function HeadingNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) HeadingNode.__proto__ = Node$$1;
-		HeadingNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		HeadingNode.prototype.constructor = HeadingNode;
-
-		var prototypeAccessors = { name: { configurable: true },defaultOptions: { configurable: true },levels: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'heading'
-		};
-
-		prototypeAccessors.defaultOptions.get = function () {
-			return {
-				maxLevel: 6,
-			}
-		};
-
-		prototypeAccessors.levels.get = function () {
-			return Array.from(new Array(this.options.maxLevel), function (value, index) { return index + 1; })
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				attrs: {
-					level: {
-						default: 1,
-					},
-				},
-				content: 'inline*',
-				group: 'block',
-				defining: true,
-				draggable: false,
-				parseDOM: this.levels.map(function (level) { return ({ tag: ("h" + level), attrs: { level: level } }); }),
-				toDOM: function (node) { return [("h" + (node.attrs.level)), 0]; },
-			}
-		};
-
-		HeadingNode.prototype.command = function command (ref) {
-			var type = ref.type;
-			var schema = ref.schema;
-			var attrs = ref.attrs;
-
-			return toggleBlockType(type, schema.nodes.paragraph, attrs)
-		};
-
-		HeadingNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return this.levels.reduce(function (items, level) {
-				var obj;
-
-				return (Object.assign({}, items,
-				( obj = {}, obj[("Shift-Ctrl-" + level)] = commands_18(type, { level: level }), obj )));
-			}, {})
-		};
-
-		HeadingNode.prototype.inputRules = function inputRules (ref) {
-			var type = ref.type;
-
-			return [
-				dist_12$2(
-					new RegExp(("^(#{1," + (this.options.maxLevel) + "})\\s$")),
-					type,
-					function (match) { return ({ level: match[1].length }); }
-				) ]
-		};
-
-		Object.defineProperties( HeadingNode.prototype, prototypeAccessors );
-
-		return HeadingNode;
-	}(Node));
-
-	var OrderedListNode = (function (Node$$1) {
-		function OrderedListNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) OrderedListNode.__proto__ = Node$$1;
-		OrderedListNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		OrderedListNode.prototype.constructor = OrderedListNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'list_item'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				content: 'paragraph block*',
-				group: 'block',
-				defining: true,
-				draggable: false,
-				parseDOM: [
-					{ tag: 'li' } ],
-				toDOM: function () { return ['li', 0]; },
-			}
-		};
-
-		OrderedListNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				Enter: schemaList_6(type),
-				Tab: schemaList_8(type),
-				'Shift-Tab': schemaList_7(type),
-			}
-		};
-
-		Object.defineProperties( OrderedListNode.prototype, prototypeAccessors );
-
-		return OrderedListNode;
-	}(Node));
-
-	var OrderedListNode$1 = (function (Node$$1) {
-		function OrderedListNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) OrderedListNode.__proto__ = Node$$1;
-		OrderedListNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		OrderedListNode.prototype.constructor = OrderedListNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'ordered_list'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				attrs: {
-					order: {
-						default: 1,
-					},
-				},
-				content: 'list_item+',
-				group: 'block',
-				parseDOM: [
-					{
-						tag: 'ol',
-						getAttrs: function (dom) { return ({
-							order: dom.hasAttribute('start') ? +dom.getAttribute('start') : 1,
-						}); },
-					} ],
-				toDOM: function (node) { return (node.attrs.order === 1 ? ['ol', 0] : ['ol', { start: node.attrs.order }, 0]); },
-			}
-		};
-
-		OrderedListNode.prototype.command = function command (ref) {
-			var type = ref.type;
-			var schema = ref.schema;
-
-			return toggleList$$1(type, schema.nodes.list_item)
-		};
-
-		OrderedListNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Shift-Ctrl-9': schemaList_5(type),
-			}
-		};
-
-		OrderedListNode.prototype.inputRules = function inputRules (ref) {
-			var type = ref.type;
-
-			return [
-				dist_11$2(
-					/^(\d+)\.\s$/,
-					type,
-					function (match) { return ({ order: +match[1] }); },
-					function (match, node) { return node.childCount + node.attrs.order === +match[1]; }
-				) ]
-		};
-
-		Object.defineProperties( OrderedListNode.prototype, prototypeAccessors );
-
-		return OrderedListNode;
-	}(Node));
-
-	var ParagraphNode = (function (Node$$1) {
-		function ParagraphNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) ParagraphNode.__proto__ = Node$$1;
-		ParagraphNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		ParagraphNode.prototype.constructor = ParagraphNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'paragraph'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				content: 'inline*',
-				group: 'block',
-				draggable: false,
-				parseDOM: [{
-					tag: 'p',
-				}],
-				toDOM: function () { return ['p', 0]; },
-			}
-		};
-
-		ParagraphNode.prototype.command = function command (ref) {
-			var type = ref.type;
-
-			return commands_18(type)
-		};
-
-		ParagraphNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Shift-Ctrl-0': commands_18(type),
-			}
-		};
-
-		Object.defineProperties( ParagraphNode.prototype, prototypeAccessors );
-
-		return ParagraphNode;
-	}(Node));
-
-	var TextNode = (function (Node$$1) {
-		function TextNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) TextNode.__proto__ = Node$$1;
-		TextNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		TextNode.prototype.constructor = TextNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'text'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				group: 'inline',
-			}
-		};
-
-		Object.defineProperties( TextNode.prototype, prototypeAccessors );
-
-		return TextNode;
-	}(Node));
-
-	var BulletNode$1 = (function (Node$$1) {
-		function BulletNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) BulletNode.__proto__ = Node$$1;
-		BulletNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		BulletNode.prototype.constructor = BulletNode;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'todo_list'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				group: 'block',
-				content: 'todo_item+',
-				toDOM: function () { return ['ul', { 'data-type': 'todo_list' }, 0]; },
-				parseDOM: [{
-					priority: 51,
-					tag: '[data-type="todo_list"]',
-				}],
-			}
-		};
-
-		BulletNode.prototype.command = function command (ref) {
-			var type = ref.type;
-
-			return schemaList_5(type)
-		};
-
-		BulletNode.prototype.inputRules = function inputRules (ref) {
-			var type = ref.type;
-
-			return [
-				dist_11$2(/^\s*(\[ \])\s$/, type) ]
-		};
-
-		Object.defineProperties( BulletNode.prototype, prototypeAccessors );
-
-		return BulletNode;
-	}(Node));
-
-	var TodoItemNode = (function (Node$$1) {
-		function TodoItemNode () {
-			Node$$1.apply(this, arguments);
-		}
-
-		if ( Node$$1 ) TodoItemNode.__proto__ = Node$$1;
-		TodoItemNode.prototype = Object.create( Node$$1 && Node$$1.prototype );
-		TodoItemNode.prototype.constructor = TodoItemNode;
-
-		var prototypeAccessors = { name: { configurable: true },view: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'todo_item'
-		};
-
-		prototypeAccessors.view.get = function () {
-			return {
-				props: ['node', 'updateAttrs', 'editable'],
-				methods: {
-					onChange: function onChange() {
-						if (!this.editable) {
-							return
-						}
-						this.updateAttrs({
-							done: !this.node.attrs.done,
-						});
-					},
-				},
-				template: "\n\t\t\t\t<li data-type=\"todo_item\" :data-done=\"node.attrs.done.toString()\">\n\t\t\t\t\t<span class=\"todo-checkbox\" contenteditable=\"false\" @click=\"onChange\"></span>\n\t\t\t\t\t<div class=\"todo-content\" ref=\"content\" :contenteditable=\"editable.toString()\"></div>\n\t\t\t\t</li>\n\t\t\t",
-			}
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				attrs: {
-					done: {
-						default: false,
-					},
-				},
-				draggable: false,
-				content: 'paragraph',
-				toDOM: function toDOM(node) {
-					var ref = node.attrs;
-					var done = ref.done;
-
-					return ['li', {
-							'data-type': 'todo_item',
-							'data-done': done.toString(),
-						},
-						['span', { class: 'todo-checkbox', contenteditable: 'false' }],
-						['div', { class: 'todo-content' }, 0] ]
-				},
-				parseDOM: [{
-					priority: 51,
-					tag: '[data-type="todo_item"]',
-					getAttrs: function (dom) { return ({
-						done: dom.getAttribute('data-done') === 'true',
-					}); },
-				}],
-			}
-		};
-
-		TodoItemNode.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				Enter: schemaList_6(type),
-				'Shift-Tab': schemaList_7(type),
-			}
-		};
-
-		Object.defineProperties( TodoItemNode.prototype, prototypeAccessors );
-
-		return TodoItemNode;
-	}(Node));
-
-	var builtInNodes = [
-		// essentials
-		new DocNode(),
-		new ParagraphNode(),
-		new TextNode(),
-
-		new BlockquoteNode(),
-		new CodeBlockNode(),
-		new HeadingNode({ maxLevel: 3 }),
-		new HardBreakNode(),
-		new OrderedListNode$1(),
-		new BulletNode(),
-		new OrderedListNode(),
-		new BulletNode$1(),
-		new TodoItemNode() ];
-
-	var CodeMark = (function (Mark$$1) {
-		function CodeMark () {
-			Mark$$1.apply(this, arguments);
-		}
-
-		if ( Mark$$1 ) CodeMark.__proto__ = Mark$$1;
-		CodeMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-		CodeMark.prototype.constructor = CodeMark;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'code'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				parseDOM: [
-					{ tag: 'code' } ],
-				toDOM: function () { return ['code', 0]; },
-			}
-		};
-
-		CodeMark.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Mod-`': commands_19(type),
-			}
-		};
-
-		CodeMark.prototype.command = function command (ref) {
-			var type = ref.type;
-
-			return commands_19(type)
-		};
-
-		Object.defineProperties( CodeMark.prototype, prototypeAccessors );
-
-		return CodeMark;
-	}(Mark));
-
-	var ItalicMark = (function (Mark$$1) {
-		function ItalicMark () {
-			Mark$$1.apply(this, arguments);
-		}
-
-		if ( Mark$$1 ) ItalicMark.__proto__ = Mark$$1;
-		ItalicMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-		ItalicMark.prototype.constructor = ItalicMark;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'italic'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				parseDOM: [
-					{ tag: 'i' },
-					{ tag: 'em' },
-					{ style: 'font-style=italic' } ],
-				toDOM: function () { return ['em', 0]; },
-			}
-		};
-
-		ItalicMark.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Mod-i': commands_19(type),
-			}
-		};
-
-		ItalicMark.prototype.command = function command (ref) {
-			var type = ref.type;
-
-			return commands_19(type)
-		};
-
-		Object.defineProperties( ItalicMark.prototype, prototypeAccessors );
-
-		return ItalicMark;
-	}(Mark));
-
-	var LinkMark = (function (Mark$$1) {
-		function LinkMark () {
-			Mark$$1.apply(this, arguments);
-		}
-
-		if ( Mark$$1 ) LinkMark.__proto__ = Mark$$1;
-		LinkMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-		LinkMark.prototype.constructor = LinkMark;
-
-		var prototypeAccessors = { name: { configurable: true },view: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'link'
-		};
-
-		prototypeAccessors.view.get = function () {
-			return {
-				props: ['node'],
-				methods: {
-					onClick: function onClick() {
-						console.log('click on link');
-					},
-				},
-				template: "\n\t\t\t\t<a :href=\"node.attrs.href\" rel=\"noopener noreferrer nofollow\" ref=\"content\" @click=\"onClick\"></a>\n\t\t\t",
-			}
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				attrs: {
-					href: {
-						default: null,
-					},
-				},
-				inclusive: false,
-				parseDOM: [
-					{
-						tag: 'a[href]',
-						getAttrs: function (dom) { return ({
-							href: dom.getAttribute('href'),
-						}); },
-					} ],
-				toDOM: function (node) { return ['a', Object.assign({}, node.attrs,
-					{rel: 'noopener noreferrer nofollow'}), 0]; },
-			}
-		};
-
-		LinkMark.prototype.command = function command (ref) {
-			var type = ref.type;
-			var attrs = ref.attrs;
-
-			if (attrs.href) {
-				return updateMark(type, attrs)
-			}
-
-			return removeMark(type)
-		};
-
-		Object.defineProperties( LinkMark.prototype, prototypeAccessors );
-
-		return LinkMark;
-	}(Mark));
-
-	var BoldMark = (function (Mark$$1) {
-		function BoldMark () {
-			Mark$$1.apply(this, arguments);
-		}
-
-		if ( Mark$$1 ) BoldMark.__proto__ = Mark$$1;
-		BoldMark.prototype = Object.create( Mark$$1 && Mark$$1.prototype );
-		BoldMark.prototype.constructor = BoldMark;
-
-		var prototypeAccessors = { name: { configurable: true },schema: { configurable: true } };
-
-		prototypeAccessors.name.get = function () {
-			return 'bold'
-		};
-
-		prototypeAccessors.schema.get = function () {
-			return {
-				parseDOM: [
-					{
-						tag: 'strong',
-					},
-					{
-						tag: 'b',
-						getAttrs: function (node) { return node.style.fontWeight != 'normal' && null; },
-					},
-					{
-						style: 'font-weight',
-						getAttrs: function (value) { return /^(bold(er)?|[5-9]\d{2,})$/.test(value) && null; },
-					} ],
-				toDOM: function () { return ['strong', 0]; },
-			}
-		};
-
-		BoldMark.prototype.keys = function keys (ref) {
-			var type = ref.type;
-
-			return {
-				'Mod-b': commands_19(type),
-			}
-		};
-
-		BoldMark.prototype.command = function command (ref) {
-			var type = ref.type;
-
-			return commands_19(type)
-		};
-
-		Object.defineProperties( BoldMark.prototype, prototypeAccessors );
-
-		return BoldMark;
-	}(Mark));
-
-	var builtInMarks = [
-		new CodeMark(),
-		new ItalicMark(),
-		new LinkMark(),
-		new BoldMark() ];
-
-	var editor = {
-
-		props: {
-			doc: {
-				type: Object,
-				required: false,
-				default: null,
-			},
-			extensions: {
-				type: Array,
-				required: false,
-				default: function () { return []; },
-			},
-			editable: {
-				type: Boolean,
-				default: true,
-			},
-		},
-
-		data: function data() {
-			var plugins = new PluginManager(builtInNodes.concat( builtInMarks,
-				this.extensions ));
-			var nodes = plugins.nodes;
-			var marks = plugins.marks;
-			var views = plugins.views;
-
-			return {
-				state: null,
-				view: null,
-				pluginplugins: [],
-				plugins: plugins,
-				schema: null,
-				nodes: nodes,
-				marks: marks,
-				views: views,
-				keymaps: [],
-				commands: {},
-				menuActions: null,
-			}
-		},
-
-		render: function render(createElement) {
-			var this$1 = this;
-
-			var slots = [];
-
-			Object
-				.entries(this.$scopedSlots)
-				.forEach(function (ref) {
-					var name = ref[0];
-					var slot = ref[1];
-
-					if (name === 'content') {
-						this$1.contentNode = slot({});
-						slots.push(this$1.contentNode);
-					} else if (name === 'menubar') {
-						this$1.menubarNode = slot({
-							nodes: this$1.menuActions ? this$1.menuActions.nodes : null,
-							marks: this$1.menuActions ? this$1.menuActions.marks : null,
-							focused: this$1.view ? this$1.view.focused : false,
-							focus: function () { return this$1.view.focus(); },
-						});
-						slots.push(this$1.menubarNode);
-					} else if (name === 'menububble') {
-						this$1.menububbleNode = slot({
-							nodes: this$1.menuActions ? this$1.menuActions.nodes : null,
-							marks: this$1.menuActions ? this$1.menuActions.marks : null,
-							focused: this$1.view ? this$1.view.focused : false,
-							focus: function () { return this$1.view.focus(); },
-						});
-						slots.push(this$1.menububbleNode);
-					}
-				});
-
-			return createElement('div', {
-				class: 'vue-editor',
-			}, slots)
-		},
-
-		methods: {
-			initEditor: function initEditor() {
-				this.schema = this.createSchema();
-				this.pluginplugins = this.createPlugins();
-				this.keymaps = this.createKeymaps();
-				this.inputRules = this.createInputRules();
-				this.state = this.createState();
-				this.clearSlot();
-				this.view = this.createView();
-				this.commands = this.createCommands();
-				this.updateMenuActions();
-			},
-
-			createSchema: function createSchema() {
-				return new dist_8({
-					nodes: this.nodes,
-					marks: this.marks,
-				})
-			},
-
-			createPlugins: function createPlugins() {
-				return this.plugins.pluginplugins
-			},
-
-			createKeymaps: function createKeymaps() {
-				return this.plugins.keymaps({
-					schema: this.schema,
-				})
-			},
-
-			createInputRules: function createInputRules() {
-				return this.plugins.inputRules({
-					schema: this.schema,
-				})
-			},
-
-			createCommands: function createCommands() {
-				return this.plugins.commands({
-					schema: this.schema,
-					view: this.view,
-				})
-			},
-
-			createState: function createState() {
-				return dist_7$2.create({
-					schema: this.schema,
-					doc: this.getDocument(),
-					plugins: this.pluginplugins.concat( this.getPlugins() ),
-				})
-			},
-
-			getDocument: function getDocument() {
-				if (this.doc) {
-					return this.schema.nodeFromJSON(this.doc)
-				}
-
-				return dist_12.fromSchema(this.schema).parse(this.contentNode.elm)
-			},
-
-			clearSlot: function clearSlot() {
-				this.contentNode.elm.innerHTML = '';
-			},
-
-			getPlugins: function getPlugins() {
-				var this$1 = this;
-
-				var plugins = [
-					dist_2$5({
-						rules: this.inputRules,
-					}) ].concat( this.keymaps,
-					[keymap_2(keymap$$1)],
-					[keymap_2(commands_24)],
-					[dropcursor_1()],
-					[dist_1$4()],
-					[history_4()],
-					[new dist_8$2({
-						props: {
-							editable: function () { return this$1.editable; },
-						},
-					})] );
-
-				if (this.menububbleNode) {
-					plugins.push(menuBubble(this.menububbleNode));
-				}
-
-				return plugins
-			},
-
-			createView: function createView() {
-				return new dist_1$3(this.contentNode.elm, {
-					state: this.state,
-					dispatchTransaction: this.dispatchTransaction,
-					nodeViews: initNodeViews$$1({
-						nodes: this.views,
-						editable: this.editable,
-					}),
-				})
-			},
-
-			updateMenuActions: function updateMenuActions() {
-				this.menuActions = buildMenuActions({
-					schema: this.schema,
-					state: this.view.state,
-					commands: this.commands,
-				});
-			},
-
-			dispatchTransaction: function dispatchTransaction(transaction) {
-				this.state = this.state.apply(transaction);
-				this.view.updateState(this.state);
-				this.$emit('update', this.state);
-				this.updateMenuActions();
-			},
-		},
-
-		mounted: function mounted() {
-			this.initEditor();
-		},
-
-	};
-
-	exports.Editor = editor;
-
-	Object.defineProperty(exports, '__esModule', { value: true });
-
-})));
diff --git a/packages/tiptap/dist/tiptap.min.js b/packages/tiptap/dist/tiptap.min.js
deleted file mode 100644
index 7f626964..00000000
--- a/packages/tiptap/dist/tiptap.min.js
+++ /dev/null
@@ -1,8 +0,0 @@
-
-	/*!
-  * tiptap vundefined
-  * (c) 2018 Scrumpy UG (limited liability)
-  * @license MIT
-  */
-
-!function(t,e){"object"==typeof exports&&"undefined"!=typeof module?e(exports,require("vue")):"function"==typeof define&&define.amd?define(["exports","vue"],e):e(t.tiptap={},t.Vue)}(this,function(t,n){"use strict";function e(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,"default")?t.default:t}function r(t,e){return t(e={exports:{}},e.exports),e.exports}function s(t){this.content=t}n=n&&n.hasOwnProperty("default")?n.default:n,s.prototype={constructor:s,find:function(t){for(var e=0;e<this.content.length;e+=2)if(this.content[e]===t)return e;return-1},get:function(t){var e=this.find(t);return-1==e?void 0:this.content[e+1]},update:function(t,e,n){var r=n&&n!=t?this.remove(n):this,o=r.find(t),i=r.content.slice();return-1==o?i.push(n||t,e):(i[o+1]=e,n&&(i[o]=n)),new s(i)},remove:function(t){var e=this.find(t);if(-1==e)return this;var n=this.content.slice();return n.splice(e,2),new s(n)},addToStart:function(t,e){return new s([t,e].concat(this.remove(t).content))},addToEnd:function(t,e){var n=this.remove(t).content.slice();return n.push(t,e),new s(n)},addBefore:function(t,e,n){var r=this.remove(e),o=r.content.slice(),i=r.find(t);return o.splice(-1==i?o.length:i,0,e,n),new s(o)},forEach:function(t){for(var e=0;e<this.content.length;e+=2)t(this.content[e],this.content[e+1])},prepend:function(t){return(t=s.from(t)).size?new s(t.content.concat(this.subtract(t).content)):this},append:function(t){return(t=s.from(t)).size?new s(this.subtract(t).content.concat(t.content)):this},subtract:function(t){var e=this;t=s.from(t);for(var n=0;n<t.content.length;n+=2)e=e.remove(t.content[n]);return e},get size(){return this.content.length>>1}},s.from=function(t){if(t instanceof s)return t;var e=[];if(t)for(var n in t)e.push(n,t[n]);return new s(e)};var ut=s,Oe=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var n,u=(n=ut)&&"object"==typeof n&&"default"in n?n.default:n;var h=function(t,e){if(this.content=t,this.size=e||0,null==e)for(var n=0;n<t.length;n++)this.size+=t[n].nodeSize},r={firstChild:{},lastChild:{},childCount:{}};h.prototype.nodesBetween=function(t,e,n,r,o){void 0===r&&(r=0);for(var i=0,s=0;s<e;i++){var a=this.content[i],c=s+a.nodeSize;if(t<c&&!1!==n(a,r+s,o,i)&&a.content.size){var l=s+1;a.nodesBetween(Math.max(0,t-l),Math.min(a.content.size,e-l),n,r+l)}s=c}},h.prototype.descendants=function(t){this.nodesBetween(0,this.size,t)},h.prototype.textBetween=function(n,r,o,i){var s="",a=!0;return this.nodesBetween(n,r,function(t,e){t.isText?(s+=t.text.slice(Math.max(n,e)-e,r-e),a=!o):t.isLeaf&&i?(s+=i,a=!o):!a&&t.isBlock&&(s+=o,a=!0)},0),s},h.prototype.append=function(t){if(!t.size)return this;if(!this.size)return t;var e=this.lastChild,n=t.firstChild,r=this.content.slice(),o=0;for(e.isText&&e.sameMarkup(n)&&(r[r.length-1]=e.withText(e.text+n.text),o=1);o<t.content.length;o++)r.push(t.content[o]);return new h(r,this.size+t.size)},h.prototype.cut=function(t,e){if(null==e&&(e=this.size),0==t&&e==this.size)return this;var n=[],r=0;if(t<e)for(var o=0,i=0;i<e;o++){var s=this.content[o],a=i+s.nodeSize;t<a&&((i<t||e<a)&&(s=s.isText?s.cut(Math.max(0,t-i),Math.min(s.text.length,e-i)):s.cut(Math.max(0,t-i-1),Math.min(s.content.size,e-i-1))),n.push(s),r+=s.nodeSize),i=a}return new h(n,r)},h.prototype.cutByIndex=function(t,e){return t==e?h.empty:0==t&&e==this.content.length?this:new h(this.content.slice(t,e))},h.prototype.replaceChild=function(t,e){var n=this.content[t];if(n==e)return this;var r=this.content.slice(),o=this.size+e.nodeSize-n.nodeSize;return r[t]=e,new h(r,o)},h.prototype.addToStart=function(t){return new h([t].concat(this.content),this.size+t.nodeSize)},h.prototype.addToEnd=function(t){return new h(this.content.concat(t),this.size+t.nodeSize)},h.prototype.eq=function(t){if(this.content.length!=t.content.length)return!1;for(var e=0;e<this.content.length;e++)if(!this.content[e].eq(t.content[e]))return!1;return!0},r.firstChild.get=function(){return this.content.length?this.content[0]:null},r.lastChild.get=function(){return this.content.length?this.content[this.content.length-1]:null},r.childCount.get=function(){return this.content.length},h.prototype.child=function(t){var e=this.content[t];if(!e)throw new RangeError("Index "+t+" out of range for "+this);return e},h.prototype.maybeChild=function(t){return this.content[t]},h.prototype.forEach=function(t){for(var e=0,n=0;e<this.content.length;e++){var r=this.content[e];t(r,n,e),n+=r.nodeSize}},h.prototype.findDiffStart=function(t,e){return void 0===e&&(e=0),function t(e,n,r){for(var o=0;;o++){if(o==e.childCount||o==n.childCount)return e.childCount==n.childCount?null:r;var i=e.child(o),s=n.child(o);if(i!=s){if(!i.sameMarkup(s))return r;if(i.isText&&i.text!=s.text){for(var a=0;i.text[a]==s.text[a];a++)r++;return r}if(i.content.size||s.content.size){var c=t(i.content,s.content,r+1);if(null!=c)return c}r+=i.nodeSize}else r+=i.nodeSize}}(this,t,e)},h.prototype.findDiffEnd=function(t,e,n){return void 0===e&&(e=this.size),void 0===n&&(n=t.size),function t(e,n,r,o){for(var i=e.childCount,s=n.childCount;;){if(0==i||0==s)return i==s?null:{a:r,b:o};var a=e.child(--i),c=n.child(--s),l=a.nodeSize;if(a!=c){if(!a.sameMarkup(c))return{a:r,b:o};if(a.isText&&a.text!=c.text){for(var p=0,u=Math.min(a.text.length,c.text.length);p<u&&a.text[a.text.length-p-1]==c.text[c.text.length-p-1];)p++,r--,o--;return{a:r,b:o}}if(a.content.size||c.content.size){var f=t(a.content,c.content,r-1,o-1);if(f)return f}r-=l,o-=l}else r-=l,o-=l}}(this,t,e,n)},h.prototype.findIndex=function(t,e){if(void 0===e&&(e=-1),0==t)return i(0,t);if(t==this.size)return i(this.content.length,t);if(t>this.size||t<0)throw new RangeError("Position "+t+" outside of fragment ("+this+")");for(var n=0,r=0;;n++){var o=r+this.child(n).nodeSize;if(t<=o)return o==t||0<e?i(n+1,o):i(n,r);r=o}},h.prototype.toString=function(){return"<"+this.toStringInner()+">"},h.prototype.toStringInner=function(){return this.content.join(", ")},h.prototype.toJSON=function(){return this.content.length?this.content.map(function(t){return t.toJSON()}):null},h.fromJSON=function(t,e){if(!e)return h.empty;if(!Array.isArray(e))throw new RangeError("Invalid input for Fragment.fromJSON");return new h(e.map(t.nodeFromJSON))},h.fromArray=function(t){if(!t.length)return h.empty;for(var e,n=0,r=0;r<t.length;r++){var o=t[r];n+=o.nodeSize,r&&o.isText&&t[r-1].sameMarkup(o)?(e||(e=t.slice(0,r)),e[e.length-1]=o.withText(e[e.length-1].text+o.text)):e&&e.push(o)}return new h(e||t,n)},h.from=function(t){return t?t instanceof h?t:Array.isArray(t)?this.fromArray(t):new h([t],t.nodeSize):h.empty},Object.defineProperties(h.prototype,r);var o={index:0,offset:0};function i(t,e){return o.index=t,o.offset=e,o}function s(t,e){if(t===e)return!0;if(!t||"object"!=typeof t||!e||"object"!=typeof e)return!1;var n=Array.isArray(t);if(Array.isArray(e)!=n)return!1;if(n){if(t.length!=e.length)return!1;for(var r=0;r<t.length;r++)if(!s(t[r],e[r]))return!1}else{for(var o in t)if(!(o in e&&s(t[o],e[o])))return!1;for(var i in e)if(!(i in t))return!1}return!0}h.empty=new h([],0);var a=function(t,e){this.type=t,this.attrs=e};function c(t){var e=Error.call(this,t);return e.__proto__=c.prototype,e}a.prototype.addToSet=function(t){for(var e,n=this,r=!1,o=0;o<t.length;o++){var i=t[o];if(n.eq(i))return t;if(n.type.excludes(i.type))e||(e=t.slice(0,o));else{if(i.type.excludes(n.type))return t;!r&&i.type.rank>n.type.rank&&(e||(e=t.slice(0,o)),e.push(n),r=!0),e&&e.push(i)}}return e||(e=t.slice()),r||e.push(this),e},a.prototype.removeFromSet=function(t){for(var e=0;e<t.length;e++)if(this.eq(t[e]))return t.slice(0,e).concat(t.slice(e+1));return t},a.prototype.isInSet=function(t){for(var e=0;e<t.length;e++)if(this.eq(t[e]))return!0;return!1},a.prototype.eq=function(t){return this==t||this.type==t.type&&s(this.attrs,t.attrs)},a.prototype.toJSON=function(){var t={type:this.type.name};for(var e in this.attrs){t.attrs=this.attrs;break}return t},a.fromJSON=function(t,e){if(!e)throw new RangeError("Invalid input for Mark.fromJSON");var n=t.marks[e.type];if(!n)throw new RangeError("There is no mark type "+e.type+" in this schema");return n.create(e.attrs)},a.sameSet=function(t,e){if(t==e)return!0;if(t.length!=e.length)return!1;for(var n=0;n<t.length;n++)if(!t[n].eq(e[n]))return!1;return!0},a.setFrom=function(t){if(!t||0==t.length)return a.none;if(t instanceof a)return[t];var e=t.slice();return e.sort(function(t,e){return t.type.rank-e.type.rank}),e},a.none=[],((c.prototype=Object.create(Error.prototype)).constructor=c).prototype.name="ReplaceError";var l=function(t,e,n){this.content=t,this.openStart=e,this.openEnd=n},p={size:{}};function f(t,e,n){if(n.openStart>t.depth)throw new c("Inserted content deeper than insertion position");if(t.depth-n.openStart!=e.depth-n.openEnd)throw new c("Inconsistent open depths");return function t(e,n,r,o){var i=e.index(o),s=e.node(o);{if(i==n.index(o)&&o<e.depth-r.openStart){var a=t(e,n,r,o+1);return s.copy(s.content.replaceChild(i,a))}if(r.content.size){if(r.openStart||r.openEnd||e.depth!=o||n.depth!=o){var c=function(t,e){for(var n=e.depth-t.openStart,r=e.node(n).copy(t.content),o=n-1;0<=o;o--)r=e.node(o).copy(h.from(r));return{start:r.resolveNoCache(t.openStart+n),end:r.resolveNoCache(r.content.size-t.openEnd-n)}}(r,e),l=c.start,p=c.end;return y(s,function t(e,n,r,o,i){var s=e.depth>i&&m(e,n,i+1);var a=o.depth>i&&m(r,o,i+1);var c=[];g(null,e,i,c);s&&a&&n.index(i)==r.index(i)?(d(s,a),v(y(s,t(e,n,r,o,i+1)),c)):(s&&v(y(s,w(e,n,i+1)),c),g(n,r,i,c),a&&v(y(a,w(r,o,i+1)),c));g(o,null,i,c);return new h(c)}(e,l,p,n,o))}var u=e.parent,f=u.content;return y(u,f.cut(0,e.parentOffset).append(r.content).append(f.cut(n.parentOffset)))}return y(s,w(e,n,o))}}(t,e,n,0)}function d(t,e){if(!e.type.compatibleContent(t.type))throw new c("Cannot join "+e.type.name+" onto "+t.type.name)}function m(t,e,n){var r=t.node(n);return d(r,e.node(n)),r}function v(t,e){var n=e.length-1;0<=n&&t.isText&&t.sameMarkup(e[n])?e[n]=t.withText(e[n].text+t.text):e.push(t)}function g(t,e,n,r){var o=(e||t).node(n),i=0,s=e?e.index(n):o.childCount;t&&(i=t.index(n),t.depth>n?i++:t.textOffset&&(v(t.nodeAfter,r),i++));for(var a=i;a<s;a++)v(o.child(a),r);e&&e.depth==n&&e.textOffset&&v(e.nodeBefore,r)}function y(t,e){if(!t.type.validContent(e))throw new c("Invalid content for node "+t.type.name);return t.copy(e)}function w(t,e,n){var r=[];(g(null,t,n,r),t.depth>n)&&v(y(m(t,e,n+1),w(t,e,n+1)),r);return g(e,null,n,r),new h(r)}p.size.get=function(){return this.content.size-this.openStart-this.openEnd},l.prototype.insertAt=function(t,e){var n=function t(e,n,r,o){var i=e.findIndex(n);var s=i.index;var a=i.offset;var c=e.maybeChild(s);if(a==n||c.isText)return o&&!o.canReplace(s,s,r)?null:e.cut(0,n).append(r).append(e.cut(n));var l=t(c.content,n-a-1,r);return l&&e.replaceChild(s,c.copy(l))}(this.content,t+this.openStart,e,null);return n&&new l(n,this.openStart,this.openEnd)},l.prototype.removeBetween=function(t,e){return new l(function t(e,n,r){var o=e.findIndex(n);var i=o.index;var s=o.offset;var a=e.maybeChild(i);var c=e.findIndex(r);var l=c.index;var p=c.offset;if(s==n||a.isText){if(p!=r&&!e.child(l).isText)throw new RangeError("Removing non-flat range");return e.cut(0,n).append(e.cut(r))}if(i!=l)throw new RangeError("Removing non-flat range");return e.replaceChild(i,a.copy(t(a.content,n-s-1,r-s-1)))}(this.content,t+this.openStart,e+this.openStart),this.openStart,this.openEnd)},l.prototype.eq=function(t){return this.content.eq(t.content)&&this.openStart==t.openStart&&this.openEnd==t.openEnd},l.prototype.toString=function(){return this.content+"("+this.openStart+","+this.openEnd+")"},l.prototype.toJSON=function(){if(!this.content.size)return null;var t={content:this.content.toJSON()};return 0<this.openStart&&(t.openStart=this.openStart),0<this.openEnd&&(t.openEnd=this.openEnd),t},l.fromJSON=function(t,e){if(!e)return l.empty;var n=e.openStart||0,r=e.openEnd||0;if("number"!=typeof n||"number"!=typeof r)throw new RangeError("Invalid input for Slice.fromJSON");return new l(h.fromJSON(t,e.content),e.openStart||0,e.openEnd||0)},l.maxOpen=function(t,e){void 0===e&&(e=!0);for(var n=0,r=0,o=t.firstChild;o&&!o.isLeaf&&(e||!o.type.spec.isolating);o=o.firstChild)n++;for(var i=t.lastChild;i&&!i.isLeaf&&(e||!i.type.spec.isolating);i=i.lastChild)r++;return new l(t,n,r)},Object.defineProperties(l.prototype,p),l.empty=new l(h.empty,0,0);var b=function(t,e,n){this.pos=t,this.path=e,this.depth=e.length/3-1,this.parentOffset=n},S={parent:{},doc:{},textOffset:{},nodeAfter:{},nodeBefore:{}};b.prototype.resolveDepth=function(t){return null==t?this.depth:t<0?this.depth+t:t},S.parent.get=function(){return this.node(this.depth)},S.doc.get=function(){return this.node(0)},b.prototype.node=function(t){return this.path[3*this.resolveDepth(t)]},b.prototype.index=function(t){return this.path[3*this.resolveDepth(t)+1]},b.prototype.indexAfter=function(t){return t=this.resolveDepth(t),this.index(t)+(t!=this.depth||this.textOffset?1:0)},b.prototype.start=function(t){return 0==(t=this.resolveDepth(t))?0:this.path[3*t-1]+1},b.prototype.end=function(t){return t=this.resolveDepth(t),this.start(t)+this.node(t).content.size},b.prototype.before=function(t){if(!(t=this.resolveDepth(t)))throw new RangeError("There is no position before the top-level node");return t==this.depth+1?this.pos:this.path[3*t-1]},b.prototype.after=function(t){if(!(t=this.resolveDepth(t)))throw new RangeError("There is no position after the top-level node");return t==this.depth+1?this.pos:this.path[3*t-1]+this.path[3*t].nodeSize},S.textOffset.get=function(){return this.pos-this.path[this.path.length-1]},S.nodeAfter.get=function(){var t=this.parent,e=this.index(this.depth);if(e==t.childCount)return null;var n=this.pos-this.path[this.path.length-1],r=t.child(e);return n?t.child(e).cut(n):r},S.nodeBefore.get=function(){var t=this.index(this.depth),e=this.pos-this.path[this.path.length-1];return e?this.parent.child(t).cut(0,e):0==t?null:this.parent.child(t-1)},b.prototype.marks=function(){var t=this.parent,e=this.index();if(0==t.content.size)return a.none;if(this.textOffset)return t.child(e).marks;var n=t.maybeChild(e-1),r=t.maybeChild(e);if(!n){var o=n;n=r,r=o}for(var i=n.marks,s=0;s<i.length;s++)!1!==i[s].type.spec.inclusive||r&&i[s].isInSet(r.marks)||(i=i[s--].removeFromSet(i));return i},b.prototype.marksAcross=function(t){var e=this.parent.maybeChild(this.index());if(!e||!e.isInline)return null;for(var n=e.marks,r=t.parent.maybeChild(t.index()),o=0;o<n.length;o++)!1!==n[o].type.spec.inclusive||r&&n[o].isInSet(r.marks)||(n=n[o--].removeFromSet(n));return n},b.prototype.sharedDepth=function(t){for(var e=this.depth;0<e;e--)if(this.start(e)<=t&&this.end(e)>=t)return e;return 0},b.prototype.blockRange=function(t,e){if(void 0===t&&(t=this),t.pos<this.pos)return t.blockRange(this);for(var n=this.depth-(this.parent.inlineContent||this.pos==t.pos?1:0);0<=n;n--)if(t.pos<=this.end(n)&&(!e||e(this.node(n))))return new M(this,t,n)},b.prototype.sameParent=function(t){return this.pos-this.parentOffset==t.pos-t.parentOffset},b.prototype.max=function(t){return t.pos>this.pos?t:this},b.prototype.min=function(t){return t.pos<this.pos?t:this},b.prototype.toString=function(){for(var t="",e=1;e<=this.depth;e++)t+=(t?"/":"")+this.node(e).type.name+"_"+this.index(e-1);return t+":"+this.parentOffset},b.resolve=function(t,e){if(!(0<=e&&e<=t.content.size))throw new RangeError("Position "+e+" out of range");for(var n=[],r=0,o=e,i=t;;){var s=i.content.findIndex(o),a=s.index,c=s.offset,l=o-c;if(n.push(i,a,r+c),!l)break;if((i=i.child(a)).isText)break;o=l-1,r+=c+1}return new b(e,n,o)},b.resolveCached=function(t,e){for(var n=0;n<C.length;n++){var r=C[n];if(r.pos==e&&r.doc==t)return r}var o=C[k]=b.resolve(t,e);return k=(k+1)%x,o},Object.defineProperties(b.prototype,S);var C=[],k=0,x=12,M=function(t,e,n){this.$from=t,this.$to=e,this.depth=n},O={start:{},end:{},parent:{},startIndex:{},endIndex:{}};O.start.get=function(){return this.$from.before(this.depth+1)},O.end.get=function(){return this.$to.after(this.depth+1)},O.parent.get=function(){return this.$from.node(this.depth)},O.startIndex.get=function(){return this.$from.index(this.depth)},O.endIndex.get=function(){return this.$to.indexAfter(this.depth)},Object.defineProperties(M.prototype,O);var T=Object.create(null),A=function(t,e,n,r){this.type=t,this.attrs=e,this.content=n||h.empty,this.marks=r||a.none},N={nodeSize:{},childCount:{},textContent:{},firstChild:{},lastChild:{},isBlock:{},isTextblock:{},inlineContent:{},isInline:{},isText:{},isLeaf:{},isAtom:{}};N.nodeSize.get=function(){return this.isLeaf?1:2+this.content.size},N.childCount.get=function(){return this.content.childCount},A.prototype.child=function(t){return this.content.child(t)},A.prototype.maybeChild=function(t){return this.content.maybeChild(t)},A.prototype.forEach=function(t){this.content.forEach(t)},A.prototype.nodesBetween=function(t,e,n,r){void 0===r&&(r=0),this.content.nodesBetween(t,e,n,r,this)},A.prototype.descendants=function(t){this.nodesBetween(0,this.content.size,t)},N.textContent.get=function(){return this.textBetween(0,this.content.size,"")},A.prototype.textBetween=function(t,e,n,r){return this.content.textBetween(t,e,n,r)},N.firstChild.get=function(){return this.content.firstChild},N.lastChild.get=function(){return this.content.lastChild},A.prototype.eq=function(t){return this==t||this.sameMarkup(t)&&this.content.eq(t.content)},A.prototype.sameMarkup=function(t){return this.hasMarkup(t.type,t.attrs,t.marks)},A.prototype.hasMarkup=function(t,e,n){return this.type==t&&s(this.attrs,e||t.defaultAttrs||T)&&a.sameSet(this.marks,n||a.none)},A.prototype.copy=function(t){return void 0===t&&(t=null),t==this.content?this:new this.constructor(this.type,this.attrs,t,this.marks)},A.prototype.mark=function(t){return t==this.marks?this:new this.constructor(this.type,this.attrs,this.content,t)},A.prototype.cut=function(t,e){return 0==t&&e==this.content.size?this:this.copy(this.content.cut(t,e))},A.prototype.slice=function(t,e,n){if(void 0===e&&(e=this.content.size),void 0===n&&(n=!1),t==e)return l.empty;var r=this.resolve(t),o=this.resolve(e),i=n?0:r.sharedDepth(e),s=r.start(i),a=r.node(i).content.cut(r.pos-s,o.pos-s);return new l(a,r.depth-i,o.depth-i)},A.prototype.replace=function(t,e,n){return f(this.resolve(t),this.resolve(e),n)},A.prototype.nodeAt=function(t){for(var e=this;;){var n=e.content.findIndex(t),r=n.index,o=n.offset;if(!(e=e.maybeChild(r)))return null;if(o==t||e.isText)return e;t-=o+1}},A.prototype.childAfter=function(t){var e=this.content.findIndex(t),n=e.index,r=e.offset;return{node:this.content.maybeChild(n),index:n,offset:r}},A.prototype.childBefore=function(t){if(0==t)return{node:null,index:0,offset:0};var e=this.content.findIndex(t),n=e.index,r=e.offset;if(r<t)return{node:this.content.child(n),index:n,offset:r};var o=this.content.child(n-1);return{node:o,index:n-1,offset:r-o.nodeSize}},A.prototype.resolve=function(t){return b.resolveCached(this,t)},A.prototype.resolveNoCache=function(t){return b.resolve(this,t)},A.prototype.rangeHasMark=function(t,e,n){var r=!1;return t<e&&this.nodesBetween(t,e,function(t){return n.isInSet(t.marks)&&(r=!0),!r}),r},N.isBlock.get=function(){return this.type.isBlock},N.isTextblock.get=function(){return this.type.isTextblock},N.inlineContent.get=function(){return this.type.inlineContent},N.isInline.get=function(){return this.type.isInline},N.isText.get=function(){return this.type.isText},N.isLeaf.get=function(){return this.type.isLeaf},N.isAtom.get=function(){return this.type.isAtom},A.prototype.toString=function(){if(this.type.spec.toDebugString)return this.type.spec.toDebugString(this);var t=this.type.name;return this.content.size&&(t+="("+this.content.toStringInner()+")"),R(this.marks,t)},A.prototype.contentMatchAt=function(t){return this.type.contentMatch.matchFragment(this.content,0,t)},A.prototype.canReplace=function(t,e,n,r,o){void 0===n&&(n=h.empty),void 0===r&&(r=0),void 0===o&&(o=n.childCount);var i=this.contentMatchAt(t).matchFragment(n,r,o),s=i&&i.matchFragment(this.content,e);if(!s||!s.validEnd)return!1;for(var a=r;a<o;a++)if(!this.type.allowsMarks(n.child(a).marks))return!1;return!0},A.prototype.canReplaceWith=function(t,e,n,r){if(r&&!this.type.allowsMarks(r))return!1;var o=this.contentMatchAt(t).matchType(n),i=o&&o.matchFragment(this.content,e);return!!i&&i.validEnd},A.prototype.canAppend=function(t){return t.content.size?this.canReplace(this.childCount,this.childCount,t.content):this.type.compatibleContent(t.type)},A.prototype.defaultContentType=function(t){return this.contentMatchAt(t).defaultType},A.prototype.check=function(){if(!this.type.validContent(this.content))throw new RangeError("Invalid content for node "+this.type.name+": "+this.content.toString().slice(0,50));this.content.forEach(function(t){return t.check()})},A.prototype.toJSON=function(){var t={type:this.type.name};for(var e in this.attrs){t.attrs=this.attrs;break}return this.content.size&&(t.content=this.content.toJSON()),this.marks.length&&(t.marks=this.marks.map(function(t){return t.toJSON()})),t},A.fromJSON=function(t,e){if(!e)throw new RangeError("Invalid input for Node.fromJSON");var n=null;if(e.marks){if(!Array.isArray(e.marks))throw new RangeError("Invalid mark data for Node.fromJSON");n=e.marks.map(t.markFromJSON)}if("text"==e.type){if("string"!=typeof e.text)throw new RangeError("Invalid text node in JSON");return t.text(e.text,n)}var r=h.fromJSON(t,e.content);return t.nodeType(e.type).create(e.attrs,r,n)},Object.defineProperties(A.prototype,N);var D=function(o){function e(t,e,n,r){if(o.call(this,t,e,null,r),!n)throw new RangeError("Empty text nodes are not allowed");this.text=n}o&&(e.__proto__=o);var t={textContent:{},nodeSize:{}};return((e.prototype=Object.create(o&&o.prototype)).constructor=e).prototype.toString=function(){return this.type.spec.toDebugString?this.type.spec.toDebugString(this):R(this.marks,JSON.stringify(this.text))},t.textContent.get=function(){return this.text},e.prototype.textBetween=function(t,e){return this.text.slice(t,e)},t.nodeSize.get=function(){return this.text.length},e.prototype.mark=function(t){return t==this.marks?this:new e(this.type,this.attrs,this.text,t)},e.prototype.withText=function(t){return t==this.text?this:new e(this.type,this.attrs,t,this.marks)},e.prototype.cut=function(t,e){return void 0===t&&(t=0),void 0===e&&(e=this.text.length),0==t&&e==this.text.length?this:this.withText(this.text.slice(t,e))},e.prototype.eq=function(t){return this.sameMarkup(t)&&this.text==t.text},e.prototype.toJSON=function(){var t=o.prototype.toJSON.call(this);return t.text=this.text,t},Object.defineProperties(e.prototype,t),e}(A);function R(t,e){for(var n=t.length-1;0<=n;n--)e=t[n].type.name+"("+e+")";return e}var E=function(t){this.validEnd=t,this.next=[],this.wrapCache=[]},P={inlineContent:{},defaultType:{},edgeCount:{}};E.parse=function(t,e){var n=new _(t,e);if(null==n.next)return E.empty;var r=z(n);n.next&&n.err("Unexpected trailing text");var s,a,o=(s=function(t){var o=[[]];return d(function n(t,r){if("choice"==t.type)return t.exprs.reduce(function(t,e){return t.concat(n(e,r))},[]);if("seq"==t.type)for(var e=0;;e++){var o=n(t.exprs[e],r);if(e==t.exprs.length-1)return o;d(o,r=f())}else{if("star"==t.type){var i=f();return h(r,i),d(n(t.expr,i),i),[h(i)]}if("plus"==t.type){var s=f();return d(n(t.expr,r),s),d(n(t.expr,s),s),[h(s)]}if("opt"==t.type)return[h(r)].concat(n(t.expr,r));if("range"==t.type){for(var a=r,c=0;c<t.min;c++){var l=f();d(n(t.expr,a),l),a=l}if(-1==t.max)d(n(t.expr,a),a);else for(var p=t.min;p<t.max;p++){var u=f();h(a,u),d(n(t.expr,a),u),a=u}return[h(a)]}if("name"==t.type)return[h(r,null,t.value)]}}(t,0),f()),o;function f(){return o.push([])-1}function h(t,e,n){var r={term:n,to:e};return o[t].push(r),r}function d(t,e){t.forEach(function(t){return t.to=e})}}(r),a=Object.create(null),function t(e){var i=[];e.forEach(function(t){s[t].forEach(function(t){var e=t.term,n=t.to;if(e){var r=i.indexOf(e),o=-1<r&&i[r+1];L(s,n).forEach(function(t){o||i.push(e,o=[]),-1==o.indexOf(t)&&o.push(t)})}})});for(var n=a[e.join(",")]=new E(-1<e.indexOf(s.length-1)),r=0;r<i.length;r+=2){var o=i[r+1].sort(V);n.next.push(i[r],a[o.join(",")]||t(o))}return n}(L(s,0)));return function(t,e){for(var n=0,r=[t];n<r.length;n++){for(var o=r[n],i=!o.validEnd,s=[],a=0;a<o.next.length;a+=2){var c=o.next[a],l=o.next[a+1];s.push(c.name),!i||c.isText||c.hasRequiredAttrs()||(i=!1),-1==r.indexOf(l)&&r.push(l)}i&&e.err("Only non-generatable nodes ("+s.join(", ")+") in a required position")}}(o,n),o},E.prototype.matchType=function(t){for(var e=0;e<this.next.length;e+=2)if(this.next[e]==t)return this.next[e+1];return null},E.prototype.matchFragment=function(t,e,n){void 0===e&&(e=0),void 0===n&&(n=t.childCount);for(var r=this,o=e;r&&o<n;o++)r=r.matchType(t.child(o).type);return r},P.inlineContent.get=function(){var t=this.next[0];return!!t&&t.isInline},P.defaultType.get=function(){for(var t=0;t<this.next.length;t+=2){var e=this.next[t];if(!e.isText&&!e.hasRequiredAttrs())return e}},E.prototype.compatible=function(t){for(var e=0;e<this.next.length;e+=2)for(var n=0;n<t.next.length;n+=2)if(this.next[e]==t.next[n])return!0;return!1},E.prototype.fillBefore=function(c,l,p){void 0===l&&(l=!1),void 0===p&&(p=0);var u=[this];return function t(e,n){var r=e.matchFragment(c,p);if(r&&(!l||r.validEnd))return h.from(n.map(function(t){return t.createAndFill()}));for(var o=0;o<e.next.length;o+=2){var i=e.next[o],s=e.next[o+1];if(!i.isText&&!i.hasRequiredAttrs()&&-1==u.indexOf(s)){u.push(s);var a=t(s,n.concat(i));if(a)return a}}}(this,[])},E.prototype.findWrapping=function(t){for(var e=0;e<this.wrapCache.length;e+=2)if(this.wrapCache[e]==t)return this.wrapCache[e+1];var n=this.computeWrapping(t);return this.wrapCache.push(t,n),n},E.prototype.computeWrapping=function(t){for(var e=Object.create(null),n=[{match:this,type:null,via:null}];n.length;){var r=n.shift(),o=r.match;if(o.matchType(t)){for(var i=[],s=r;s.type;s=s.via)i.push(s.type);return i.reverse()}for(var a=0;a<o.next.length;a+=2){var c=o.next[a];c.isLeaf||c.name in e||r.type&&!o.next[a+1].validEnd||(n.push({match:c.contentMatch,type:c,via:r}),e[c.name]=!0)}}},P.edgeCount.get=function(){return this.next.length>>1},E.prototype.edge=function(t){var e=t<<1;if(e>this.next.length)throw new RangeError("There's no "+t+"th edge in this content match");return{type:this.next[e],next:this.next[e+1]}},E.prototype.toString=function(){var o=[];return function t(e){o.push(e);for(var n=1;n<e.next.length;n+=2)-1==o.indexOf(e.next[n])&&t(e.next[n])}(this),o.map(function(t,e){for(var n=e+(t.validEnd?"*":" ")+" ",r=0;r<t.next.length;r+=2)n+=(r?", ":"")+t.next[r].name+"->"+o.indexOf(t.next[r+1]);return n}).join("\n")},Object.defineProperties(E.prototype,P),E.empty=new E(!0);var _=function(t,e){this.string=t,this.nodeTypes=e,this.inline=null,this.pos=0,this.tokens=t.split(/\s*(?=\b|\W|$)/),""==this.tokens[this.tokens.length-1]&&this.tokens.pop(),""==this.tokens[0]&&this.tokens.unshift()},I={next:{}};function z(t){for(var e=[];e.push($(t)),t.eat("|"););return 1==e.length?e[0]:{type:"choice",exprs:e}}function $(t){for(var e=[];e.push(F(t)),t.next&&")"!=t.next&&"|"!=t.next;);return 1==e.length?e[0]:{type:"seq",exprs:e}}function F(t){for(var e=function(e){{if(e.eat("(")){var t=z(e);return e.eat(")")||e.err("Missing closing paren"),t}if(!/\W/.test(e.next)){var n=function(t,e){var n=t.nodeTypes,r=n[e];if(r)return[r];var o=[];for(var i in n){var s=n[i];-1<s.groups.indexOf(e)&&o.push(s)}0==o.length&&t.err("No node type or group '"+e+"' found");return o}(e,e.next).map(function(t){return null==e.inline?e.inline=t.isInline:e.inline!=t.isInline&&e.err("Mixing inline and block content"),{type:"name",value:t}});return e.pos++,1==n.length?n[0]:{type:"choice",exprs:n}}e.err("Unexpected token '"+e.next+"'")}}(t);;)if(t.eat("+"))e={type:"plus",expr:e};else if(t.eat("*"))e={type:"star",expr:e};else if(t.eat("?"))e={type:"opt",expr:e};else{if(!t.eat("{"))break;e=j(t,e)}return e}function B(t){/\D/.test(t.next)&&t.err("Expected number, got '"+t.next+"'");var e=Number(t.next);return t.pos++,e}function j(t,e){var n=B(t),r=n;return t.eat(",")&&(r="}"!=t.next?B(t):-1),t.eat("}")||t.err("Unclosed braced range"),{type:"range",min:n,max:r,expr:e}}function V(t,e){return t-e}function L(a,t){var c=[];return function t(e){var n=a[e];if(1==n.length&&!n[0].term)return t(n[0].to);c.push(e);for(var r=0;r<n.length;r++){var o=n[r],i=o.term,s=o.to;i||-1!=c.indexOf(s)||t(s)}}(t),c.sort(V)}function J(t){var e=Object.create(null);for(var n in t){var r=t[n];if(!r.hasDefault)return null;e[n]=r.default}return e}function W(t,e){var n=Object.create(null);for(var r in t){var o=e&&e[r];if(void 0===o){var i=t[r];if(!i.hasDefault)throw new RangeError("No value supplied for attribute "+r);o=i.default}n[r]=o}return n}function q(t){var e=Object.create(null);if(t)for(var n in t)e[n]=new U(t[n]);return e}I.next.get=function(){return this.tokens[this.pos]},_.prototype.eat=function(t){return this.next==t&&(this.pos++||!0)},_.prototype.err=function(t){throw new SyntaxError(t+" (in content expression '"+this.string+"')")},Object.defineProperties(_.prototype,I);var K=function(t,e,n){this.name=t,this.schema=e,this.spec=n,this.groups=n.group?n.group.split(" "):[],this.attrs=q(n.attrs),this.defaultAttrs=J(this.attrs),this.contentMatch=null,this.markSet=null,this.inlineContent=null,this.isBlock=!(n.inline||"text"==t),this.isText="text"==t},H={isInline:{},isTextblock:{},isLeaf:{},isAtom:{}};H.isInline.get=function(){return!this.isBlock},H.isTextblock.get=function(){return this.isBlock&&this.inlineContent},H.isLeaf.get=function(){return this.contentMatch==E.empty},H.isAtom.get=function(){return this.isLeaf||this.spec.atom},K.prototype.hasRequiredAttrs=function(t){for(var e in this.attrs)if(this.attrs[e].isRequired&&(!t||!(e in t)))return!0;return!1},K.prototype.compatibleContent=function(t){return this==t||this.contentMatch.compatible(t.contentMatch)},K.prototype.computeAttrs=function(t){return!t&&this.defaultAttrs?this.defaultAttrs:W(this.attrs,t)},K.prototype.create=function(t,e,n){if(this.isText)throw new Error("NodeType.create can't construct text nodes");return new A(this,this.computeAttrs(t),h.from(e),a.setFrom(n))},K.prototype.createChecked=function(t,e,n){if(e=h.from(e),!this.validContent(e))throw new RangeError("Invalid content for node "+this.name);return new A(this,this.computeAttrs(t),e,a.setFrom(n))},K.prototype.createAndFill=function(t,e,n){if(t=this.computeAttrs(t),(e=h.from(e)).size){var r=this.contentMatch.fillBefore(e);if(!r)return null;e=r.append(e)}var o=this.contentMatch.matchFragment(e).fillBefore(h.empty,!0);return o?new A(this,t,e.append(o),a.setFrom(n)):null},K.prototype.validContent=function(t){var e=this.contentMatch.matchFragment(t);if(!e||!e.validEnd)return!1;for(var n=0;n<t.childCount;n++)if(!this.allowsMarks(t.child(n).marks))return!1;return!0},K.prototype.allowsMarkType=function(t){return null==this.markSet||-1<this.markSet.indexOf(t)},K.prototype.allowsMarks=function(t){if(null==this.markSet)return!0;for(var e=0;e<t.length;e++)if(!this.allowsMarkType(t[e].type))return!1;return!0},K.prototype.allowedMarks=function(t){var e;if(null==this.markSet)return t;for(var n=0;n<t.length;n++)this.allowsMarkType(t[n].type)?e&&e.push(t[n]):e||(e=t.slice(0,n));return e?e.length?e:a.empty:t},K.compile=function(t,n){var r=Object.create(null);t.forEach(function(t,e){return r[t]=new K(t,n,e)});var e=n.spec.topNode||"doc";if(!r[e])throw new RangeError("Schema is missing its top node type ('"+e+"')");if(!r.text)throw new RangeError("Every schema needs a 'text' type");for(var o in r.text.attrs)throw new RangeError("The text node type should not have attributes");return r},Object.defineProperties(K.prototype,H);var U=function(t){this.hasDefault=Object.prototype.hasOwnProperty.call(t,"default"),this.default=t.default},G={isRequired:{}};G.isRequired.get=function(){return!this.hasDefault},Object.defineProperties(U.prototype,G);var X=function(t,e,n,r){this.name=t,this.schema=n,this.spec=r,this.attrs=q(r.attrs),this.rank=e,this.excluded=null;var o=J(this.attrs);this.instance=o&&new a(this,o)};X.prototype.create=function(t){return!t&&this.instance?this.instance:new a(this,W(this.attrs,t))},X.compile=function(t,n){var r=Object.create(null),o=0;return t.forEach(function(t,e){return r[t]=new X(t,o++,n,e)}),r},X.prototype.removeFromSet=function(t){for(var e=0;e<t.length;e++)if(t[e].type==this)return t.slice(0,e).concat(t.slice(e+1));return t},X.prototype.isInSet=function(t){for(var e=0;e<t.length;e++)if(t[e].type==this)return t[e]},X.prototype.excludes=function(t){return-1<this.excluded.indexOf(t)};var Q=function(t){var e=this;for(var n in this.spec={},t)e.spec[n]=t[n];this.spec.nodes=u.from(t.nodes),this.spec.marks=u.from(t.marks),this.nodes=K.compile(this.spec.nodes,this),this.marks=X.compile(this.spec.marks,this);var r=Object.create(null);for(var o in e.nodes){if(o in e.marks)throw new RangeError(o+" can not be both a node and a mark");var i=e.nodes[o],s=i.spec.content||"",a=i.spec.marks;i.contentMatch=r[s]||(r[s]=E.parse(s,e.nodes)),i.inlineContent=i.contentMatch.inlineContent,i.markSet="_"==a?null:a?Y(e,a.split(" ")):""!=a&&i.inlineContent?null:[]}for(var c in e.marks){var l=e.marks[c],p=l.spec.excludes;l.excluded=null==p?[l]:""==p?[]:Y(e,p.split(" "))}this.nodeFromJSON=this.nodeFromJSON.bind(this),this.markFromJSON=this.markFromJSON.bind(this),this.topNodeType=this.nodes[this.spec.topNode||"doc"],this.cached=Object.create(null),this.cached.wrappings=Object.create(null)};function Y(t,e){for(var n=[],r=0;r<e.length;r++){var o=e[r],i=t.marks[o],s=i;if(i)n.push(i);else for(var a in t.marks){var c=t.marks[a];("_"==o||c.spec.group&&-1<c.spec.group.split(" ").indexOf(o))&&n.push(s=c)}if(!s)throw new SyntaxError("Unknown mark type: '"+e[r]+"'")}return n}Q.prototype.node=function(t,e,n,r){if("string"==typeof t)t=this.nodeType(t);else{if(!(t instanceof K))throw new RangeError("Invalid node type: "+t);if(t.schema!=this)throw new RangeError("Node type from different schema used ("+t.name+")")}return t.createChecked(e,n,r)},Q.prototype.text=function(t,e){var n=this.nodes.text;return new D(n,n.defaultAttrs,t,a.setFrom(e))},Q.prototype.mark=function(t,e){return"string"==typeof t&&(t=this.marks[t]),t.create(e)},Q.prototype.nodeFromJSON=function(t){return A.fromJSON(this,t)},Q.prototype.markFromJSON=function(t){return a.fromJSON(this,t)},Q.prototype.nodeType=function(t){var e=this.nodes[t];if(!e)throw new RangeError("Unknown node type: "+t);return e};var Z=function(t,e){var n=this;this.schema=t,this.rules=e,this.tags=[],this.styles=[],e.forEach(function(t){t.tag?n.tags.push(t):t.style&&n.styles.push(t)})};Z.prototype.parse=function(t,e){void 0===e&&(e={});var n=new it(this,e,!1);return n.addAll(t,null,e.from,e.to),n.finish()},Z.prototype.parseSlice=function(t,e){void 0===e&&(e={});var n=new it(this,e,!0);return n.addAll(t,null,e.from,e.to),l.maxOpen(n.finish())},Z.prototype.matchTag=function(t,e){for(var n,r,o=0;o<this.tags.length;o++){var i=this.tags[o];if(n=t,r=i.tag,(n.matches||n.msMatchesSelector||n.webkitMatchesSelector||n.mozMatchesSelector).call(n,r)&&(void 0===i.namespace||t.namespaceURI==i.namespace)&&(!i.context||e.matchesContext(i.context))){if(i.getAttrs){var s=i.getAttrs(t);if(!1===s)continue;i.attrs=s}return i}}},Z.prototype.matchStyle=function(t,e,n){for(var r=0;r<this.styles.length;r++){var o=this.styles[r];if(!(0!=o.style.indexOf(t)||o.context&&!n.matchesContext(o.context)||o.style.length>t.length&&(61!=o.style.charCodeAt(t.length)||o.style.slice(t.length+1)!=e))){if(o.getAttrs){var i=o.getAttrs(e);if(!1===i)continue;o.attrs=i}return o}}},Z.schemaRules=function(n){var o=[];function r(t){for(var e=null==t.priority?50:t.priority,n=0;n<o.length;n++){var r=o[n];if((null==r.priority?50:r.priority)<e)break}o.splice(n,0,t)}var t=function(e){var t=n.marks[e].spec.parseDOM;t&&t.forEach(function(t){r(t=at(t)),t.mark=e})};for(var e in n.marks)t(e);var i;for(var s in n.nodes)i=void 0,(i=n.nodes[s].spec.parseDOM)&&i.forEach(function(t){r(t=at(t)),t.node=s});return o},Z.fromSchema=function(t){return t.cached.domParser||(t.cached.domParser=new Z(t,Z.schemaRules(t)))};var tt={address:!0,article:!0,aside:!0,blockquote:!0,canvas:!0,dd:!0,div:!0,dl:!0,fieldset:!0,figcaption:!0,figure:!0,footer:!0,form:!0,h1:!0,h2:!0,h3:!0,h4:!0,h5:!0,h6:!0,header:!0,hgroup:!0,hr:!0,li:!0,noscript:!0,ol:!0,output:!0,p:!0,pre:!0,section:!0,table:!0,tfoot:!0,ul:!0},et={head:!0,noscript:!0,object:!0,script:!0,style:!0,title:!0},nt={ol:!0,ul:!0};function rt(t){return(t?1:0)|("full"===t?2:0)}var ot=function(t,e,n,r,o,i){this.type=t,this.attrs=e,this.solid=r,this.match=o||(4&i?null:t.contentMatch),this.options=i,this.content=[],this.marks=n,this.activeMarks=a.none};ot.prototype.findWrapping=function(t){if(!this.match){if(!this.type)return[];var e=this.type.contentMatch.fillBefore(h.from(t));if(!e){var n,r=this.type.contentMatch;return(n=r.findWrapping(t.type))?(this.match=r,n):null}this.match=this.type.contentMatch.matchFragment(e)}return this.match.findWrapping(t.type)},ot.prototype.finish=function(t){if(!(1&this.options)){var e,n=this.content[this.content.length-1];n&&n.isText&&(e=/\s+$/.exec(n.text))&&(n.text.length==e[0].length?this.content.pop():this.content[this.content.length-1]=n.withText(n.text.slice(0,n.text.length-e[0].length)))}var r=h.from(this.content);return!t&&this.match&&(r=r.append(this.match.fillBefore(h.empty,!0))),this.type?this.type.create(this.attrs,r,this.marks):r};var it=function(t,e,n){this.parser=t,this.options=e,this.isOpen=n,this.pendingMarks=[];var r,o=e.topNode,i=rt(e.preserveWhitespace)|(n?4:0);r=o?new ot(o.type,o.attrs,a.none,!0,e.topMatch||o.type.contentMatch,i):new ot(n?null:t.schema.topNodeType,null,a.none,!0,null,i),this.nodes=[r],this.open=0,this.find=e.findPositions,this.needsBlock=!1},st={top:{},currentPos:{}};function at(t){var e={};for(var n in t)e[n]=t[n];return e}st.top.get=function(){return this.nodes[this.open]},it.prototype.addDOM=function(t){if(3==t.nodeType)this.addTextNode(t);else if(1==t.nodeType){var e=t.getAttribute("style"),n=e?this.readStyles(function(t){var e,n=/\s*([\w-]+)\s*:\s*([^;]+)/g,r=[];for(;e=n.exec(t);)r.push(e[1],e[2].trim());return r}(e)):null;if(null!=n)for(var r=0;r<n.length;r++)this.addPendingMark(n[r]);if(this.addElement(t),null!=n)for(var o=0;o<n.length;o++)this.removePendingMark(n[o])}},it.prototype.addTextNode=function(t){var e=t.nodeValue,n=this.top;if((n.type?n.type.inlineContent:n.content.length&&n.content[0].isInline)||/\S/.test(e)){if(1&n.options)2&n.options||(e=e.replace(/\r?\n|\r/g," "));else if(e=e.replace(/\s+/g," "),/^\s/.test(e)&&this.open==this.nodes.length-1){var r=n.content[n.content.length-1];(!r||r.isText&&/\s$/.test(r.text))&&(e=e.slice(1))}e&&this.insertNode(this.parser.schema.text(e)),this.findInText(t)}else this.findInside(t)},it.prototype.addElement=function(t){var e=t.nodeName.toLowerCase();nt.hasOwnProperty(e)&&function(t){for(var e=t.firstChild,n=null;e;e=e.nextSibling){var r=1==e.nodeType?e.nodeName.toLowerCase():null;r&&nt.hasOwnProperty(r)&&n?(n.appendChild(e),e=n):"li"==r?n=e:r&&(n=null)}}(t);var n=this.options.ruleFromNode&&this.options.ruleFromNode(t)||this.parser.matchTag(t,this);if(n?n.ignore:et.hasOwnProperty(e))this.findInside(t);else if(!n||n.skip){n&&n.skip.nodeType&&(t=n.skip);var r,o=this.top,i=this.needsBlock;tt.hasOwnProperty(e)&&(r=!0,o.type||(this.needsBlock=!0)),this.addAll(t),r&&this.sync(o),this.needsBlock=i}else this.addElementByRule(t,n)},it.prototype.readStyles=function(t){for(var e=a.none,n=0;n<t.length;n+=2){var r=this.parser.matchStyle(t[n],t[n+1],this);if(r){if(r.ignore)return null;e=this.parser.schema.marks[r.mark].create(r.attrs).addToSet(e)}}return e},it.prototype.addElementByRule=function(t,e){var n,r,o,i=this;e.node?(r=this.parser.schema.nodes[e.node]).isLeaf?this.insertNode(r.create(e.attrs)):n=this.enter(r,e.attrs,e.preserveWhitespace):(o=this.parser.schema.marks[e.mark].create(e.attrs),this.addPendingMark(o));var s=this.top;if(r&&r.isLeaf)this.findInside(t);else if(e.getContent)this.findInside(t),e.getContent(t,this.parser.schema).forEach(function(t){return i.insertNode(t)});else{var a=e.contentElement;"string"==typeof a?a=t.querySelector(a):"function"==typeof a&&(a=a(t)),a||(a=t),this.findAround(t,a,!0),this.addAll(a,n)}return n&&(this.sync(s),this.open--),o&&this.removePendingMark(o),!0},it.prototype.addAll=function(t,e,n,r){for(var o=n||0,i=n?t.childNodes[n]:t.firstChild,s=null==r?null:t.childNodes[r];i!=s;i=i.nextSibling,++o)this.findAtPoint(t,o),this.addDOM(i),e&&tt.hasOwnProperty(i.nodeName.toLowerCase())&&this.sync(e);this.findAtPoint(t,o)},it.prototype.findPlace=function(t){for(var e,n,r=this.open;0<=r;r--){var o=this.nodes[r],i=o.findWrapping(t);if(i&&(!e||e.length>i.length)&&(n=o,!(e=i).length))break;if(o.solid)break}if(!e)return!1;this.sync(n);for(var s=0;s<e.length;s++)this.enterInner(e[s],null,!1);return!0},it.prototype.insertNode=function(t){if(t.isInline&&this.needsBlock&&!this.top.type){var e=this.textblockFromContext();e&&this.enterInner(e)}if(this.findPlace(t)){this.closeExtra();var n=this.top;this.applyPendingMarks(n),n.match&&(n.match=n.match.matchType(t.type));for(var r=n.activeMarks,o=0;o<t.marks.length;o++)n.type&&!n.type.allowsMarkType(t.marks[o].type)||(r=t.marks[o].addToSet(r));n.content.push(t.mark(r))}},it.prototype.applyPendingMarks=function(t){for(var e=0;e<this.pendingMarks.length;e++){var n=this.pendingMarks[e];t.type&&!t.type.allowsMarkType(n.type)||n.type.isInSet(t.activeMarks)||(t.activeMarks=n.addToSet(t.activeMarks),this.pendingMarks.splice(e--,1))}},it.prototype.enter=function(t,e,n){var r=this.findPlace(t.create(e));return r&&(this.applyPendingMarks(this.top),this.enterInner(t,e,!0,n)),r},it.prototype.enterInner=function(t,e,n,r){this.closeExtra();var o=this.top;o.match=o.match&&o.match.matchType(t,e);var i=null==r?-5&o.options:rt(r);4&o.options&&0==o.content.length&&(i|=4),this.nodes.push(new ot(t,e,o.activeMarks,n,null,i)),this.open++},it.prototype.closeExtra=function(t){var e=this.nodes.length-1;if(e>this.open){for(;e>this.open;e--)this.nodes[e-1].content.push(this.nodes[e].finish(t));this.nodes.length=this.open+1}},it.prototype.finish=function(){return this.open=0,this.closeExtra(this.isOpen),this.nodes[0].finish(this.isOpen||this.options.topOpen)},it.prototype.sync=function(t){for(var e=this.open;0<=e;e--)if(this.nodes[e]==t)return void(this.open=e)},it.prototype.addPendingMark=function(t){this.pendingMarks.push(t)},it.prototype.removePendingMark=function(t){var e=this.pendingMarks.lastIndexOf(t);if(-1<e)this.pendingMarks.splice(e,1);else{var n=this.top;n.activeMarks=t.removeFromSet(n.activeMarks)}},st.currentPos.get=function(){this.closeExtra();for(var t=0,e=this.open;0<=e;e--){for(var n=this.nodes[e].content,r=n.length-1;0<=r;r--)t+=n[r].nodeSize;e&&t++}return t},it.prototype.findAtPoint=function(t,e){if(this.find)for(var n=0;n<this.find.length;n++)this.find[n].node==t&&this.find[n].offset==e&&(this.find[n].pos=this.currentPos)},it.prototype.findInside=function(t){if(this.find)for(var e=0;e<this.find.length;e++)null==this.find[e].pos&&1==t.nodeType&&t.contains(this.find[e].node)&&(this.find[e].pos=this.currentPos)},it.prototype.findAround=function(t,e,n){var r=this;if(t!=e&&this.find)for(var o=0;o<this.find.length;o++){if(null==r.find[o].pos&&1==t.nodeType&&t.contains(r.find[o].node))e.compareDocumentPosition(r.find[o].node)&(n?2:4)&&(r.find[o].pos=r.currentPos)}},it.prototype.findInText=function(t){if(this.find)for(var e=0;e<this.find.length;e++)this.find[e].node==t&&(this.find[e].pos=this.currentPos-(t.nodeValue.length-this.find[e].offset))},it.prototype.matchesContext=function(t){var o=this;if(-1<t.indexOf("|"))return t.split(/\s*\|\s*/).some(this.matchesContext,this);var i=t.split("/"),s=this.options.context,a=!(this.isOpen||s&&s.parent.type!=this.nodes[0].type),c=-(s?s.depth+1:0)+(a?0:1),l=function(t,e){for(;0<=t;t--){var n=i[t];if(""==n){if(t==i.length-1||0==t)continue;for(;c<=e;e--)if(l(t-1,e))return!0;return!1}var r=0<e||0==e&&a?o.nodes[e].type:s&&c<=e?s.node(e-c).type:null;if(!r||r.name!=n&&-1==r.groups.indexOf(n))return!1;e--}return!0};return l(i.length-1,this.open)},it.prototype.textblockFromContext=function(){var t=this.options.context;if(t)for(var e=t.depth;0<=e;e--){var n=t.node(e).contentMatchAt(t.indexAfter(e)).defaultType;if(n&&n.isTextblock&&n.defaultAttrs)return n}for(var r in this.parser.schema.nodes){var o=this.parser.schema.nodes[r];if(o.isTextblock&&o.defaultAttrs)return o}},Object.defineProperties(it.prototype,st);var ct=function(t,e){this.nodes=t||{},this.marks=e||{}};function lt(t){var e={};for(var n in t){var r=t[n].spec.toDOM;r&&(e[n]=r)}return e}function pt(t){return t.document||window.document}ct.prototype.serializeFragment=function(t,s,e){var a=this;void 0===s&&(s={}),e||(e=pt(s).createDocumentFragment());var c=e,l=null;return t.forEach(function(t){if(l||t.marks.length){l||(l=[]);for(var e=0,n=0;e<l.length&&n<t.marks.length;){var r=t.marks[n];if(a.marks[r.type.name]){if(!r.eq(l[e]))break;e+=2,n++}else n++}for(;e<l.length;)c=l.pop(),l.pop();for(;n<t.marks.length;){var o=t.marks[n++],i=a.serializeMark(o,t.isInline,s);i&&(l.push(o,c),c.appendChild(i.dom),c=i.contentDOM||i.dom)}}c.appendChild(a.serializeNode(t,s))}),e},ct.prototype.serializeNode=function(t,e){void 0===e&&(e={});var n=ct.renderSpec(pt(e),this.nodes[t.type.name](t)),r=n.dom,o=n.contentDOM;if(o){if(t.isLeaf)throw new RangeError("Content hole not allowed in a leaf node spec");e.onContent?e.onContent(t,o,e):this.serializeFragment(t.content,e,o)}return r},ct.prototype.serializeNodeAndMarks=function(t,e){void 0===e&&(e={});for(var n=this.serializeNode(t,e),r=t.marks.length-1;0<=r;r--){var o=this.serializeMark(t.marks[r],t.isInline,e);o&&((o.contentDOM||o.dom).appendChild(n),n=o.dom)}return n},ct.prototype.serializeMark=function(t,e,n){void 0===n&&(n={});var r=this.marks[t.type.name];return r&&ct.renderSpec(pt(n),r(t,e))},ct.renderSpec=function(t,e){if("string"==typeof e)return{dom:t.createTextNode(e)};if(null!=e.nodeType)return{dom:e};var n=t.createElement(e[0]),r=null,o=e[1],i=1;if(o&&"object"==typeof o&&null==o.nodeType&&!Array.isArray(o))for(var s in i=2,o)"style"==s?n.style.cssText=o[s]:null!=o[s]&&n.setAttribute(s,o[s]);for(var a=i;a<e.length;a++){var c=e[a];if(0===c){if(a<e.length-1||i<a)throw new RangeError("Content hole must be the only child of its parent node");return{dom:n,contentDOM:n}}var l=ct.renderSpec(t,c),p=l.dom,u=l.contentDOM;if(n.appendChild(p),u){if(r)throw new RangeError("Multiple content holes");r=u}}return{dom:n,contentDOM:r}},ct.fromSchema=function(t){return t.cached.domSerializer||(t.cached.domSerializer=new ct(this.nodesFromSchema(t),this.marksFromSchema(t)))},ct.nodesFromSchema=function(t){var e=lt(t.nodes);return e.text||(e.text=function(t){return t.text}),e},ct.marksFromSchema=function(t){return lt(t.marks)},e.Node=A,e.ResolvedPos=b,e.NodeRange=M,e.Fragment=h,e.Slice=l,e.ReplaceError=c,e.Mark=a,e.Schema=Q,e.NodeType=K,e.MarkType=X,e.ContentMatch=E,e.DOMParser=Z,e.DOMSerializer=ct});e(Oe);Oe.Node,Oe.ResolvedPos,Oe.NodeRange,Oe.Fragment,Oe.Slice,Oe.ReplaceError,Oe.Mark;var o=Oe.Schema,i=(Oe.NodeType,Oe.MarkType,Oe.ContentMatch,Oe.DOMParser),Te=(Oe.DOMSerializer,r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var h=Math.pow(2,16);function l(t){return 65535&t}var d=function(t,e,n){void 0===e&&(e=!1),void 0===n&&(n=null),this.pos=t,this.deleted=e,this.recover=n},n=function(t,e){void 0===e&&(e=!1),this.ranges=t,this.inverted=e};n.prototype.recover=function(t){var e,n=0,r=l(t);if(!this.inverted)for(var o=0;o<r;o++)n+=this.ranges[3*o+2]-this.ranges[3*o+1];return this.ranges[3*r]+n+((e=t)-(65535&e))/h},n.prototype.mapResult=function(t,e){return void 0===e&&(e=1),this._map(t,e,!1)},n.prototype.map=function(t,e){return void 0===e&&(e=1),this._map(t,e,!0)},n.prototype._map=function(t,e,n){for(var r=0,o=this.inverted?2:1,i=this.inverted?1:2,s=0;s<this.ranges.length;s+=3){var a=this.ranges[s]-(this.inverted?r:0);if(t<a)break;var c=this.ranges[s+o],l=this.ranges[s+i],p=a+c;if(t<=p){var u=a+r+((c?t==a?-1:t==p?1:e:e)<0?0:l);if(n)return u;var f=s/3+(t-a)*h;return new d(u,e<0?t!=a:t!=p,f)}r+=l-c}return n?t+r:new d(t+r)},n.prototype.touches=function(t,e){for(var n=0,r=l(e),o=this.inverted?2:1,i=this.inverted?1:2,s=0;s<this.ranges.length;s+=3){var a=this.ranges[s]-(this.inverted?n:0);if(t<a)break;var c=this.ranges[s+o];if(t<=a+c&&s==3*r)return!0;n+=this.ranges[s+i]-c}return!1},n.prototype.forEach=function(t){for(var e=this,n=this.inverted?2:1,r=this.inverted?1:2,o=0,i=0;o<this.ranges.length;o+=3){var s=e.ranges[o],a=s-(e.inverted?i:0),c=s+(e.inverted?0:i),l=e.ranges[o+n],p=e.ranges[o+r];t(a,a+l,c,c+p),i+=p-l}},n.prototype.invert=function(){return new n(this.ranges,!this.inverted)},n.prototype.toString=function(){return(this.inverted?"-":"")+JSON.stringify(this.ranges)},n.offset=function(t){return 0==t?n.empty:new n(t<0?[0,-t,0]:[0,0,t])},n.empty=new n([]);var r=function(t,e,n,r){this.maps=t||[],this.from=n||0,this.to=null==r?this.maps.length:r,this.mirror=e};function o(t){var e=Error.call(this,t);return e.__proto__=o.prototype,e}r.prototype.slice=function(t,e){return void 0===t&&(t=0),void 0===e&&(e=this.maps.length),new r(this.maps,this.mirror,t,e)},r.prototype.copy=function(){return new r(this.maps.slice(),this.mirror&&this.mirror.slice(),this.from,this.to)},r.prototype.appendMap=function(t,e){this.to=this.maps.push(t),null!=e&&this.setMirror(this.maps.length-1,e)},r.prototype.appendMapping=function(t){for(var e=0,n=this.maps.length;e<t.maps.length;e++){var r=t.getMirror(e);this.appendMap(t.maps[e],null!=r&&r<e?n+r:null)}},r.prototype.getMirror=function(t){if(this.mirror)for(var e=0;e<this.mirror.length;e++)if(this.mirror[e]==t)return this.mirror[e+(e%2?-1:1)]},r.prototype.setMirror=function(t,e){this.mirror||(this.mirror=[]),this.mirror.push(t,e)},r.prototype.appendMappingInverted=function(t){for(var e=t.maps.length-1,n=this.maps.length+t.maps.length;0<=e;e--){var r=t.getMirror(e);this.appendMap(t.maps[e].invert(),null!=r&&e<r?n-r-1:null)}},r.prototype.invert=function(){var t=new r;return t.appendMappingInverted(this),t},r.prototype.map=function(t,e){if(void 0===e&&(e=1),this.mirror)return this._map(t,e,!0);for(var n=this.from;n<this.to;n++)t=this.maps[n].map(t,e);return t},r.prototype.mapResult=function(t,e){return void 0===e&&(e=1),this._map(t,e,!1)},r.prototype._map=function(t,e,n){for(var r=!1,o=null,i=this.from;i<this.to;i++){var s=this.maps[i],a=o&&o[i];if(null!=a&&s.touches(t,a))t=s.recover(a);else{var c=s.mapResult(t,e);if(null!=c.recover){var l=this.getMirror(i);if(null!=l&&i<l&&l<this.to){if(c.deleted){i=l,t=this.maps[l].recover(c.recover);continue}(o||(o=Object.create(null)))[l]=c.recover}}c.deleted&&(r=!0),t=c.pos}}return n?t:new d(t,r)},((o.prototype=Object.create(Error.prototype)).constructor=o).prototype.name="TransformError";var i=function(t){this.doc=t,this.steps=[],this.docs=[],this.mapping=new r},s={before:{},docChanged:{}};function a(){throw new Error("Override me")}s.before.get=function(){return this.docs.length?this.docs[0]:this.doc},i.prototype.step=function(t){var e=this.maybeStep(t);if(e.failed)throw new o(e.failed);return this},i.prototype.maybeStep=function(t){var e=t.apply(this.doc);return e.failed||this.addStep(t,e.doc),e},s.docChanged.get=function(){return 0<this.steps.length},i.prototype.addStep=function(t,e){this.docs.push(this.doc),this.steps.push(t),this.mapping.appendMap(t.getMap()),this.doc=e},Object.defineProperties(i.prototype,s);var c=Object.create(null),p=function(){};p.prototype.apply=function(t){return a()},p.prototype.getMap=function(){return n.empty},p.prototype.invert=function(t){return a()},p.prototype.map=function(t){return a()},p.prototype.merge=function(t){return null},p.prototype.toJSON=function(){return a()},p.fromJSON=function(t,e){if(!e||!e.stepType)throw new RangeError("Invalid input for Step.fromJSON");var n=c[e.stepType];if(!n)throw new RangeError("No step type "+e.stepType+" defined");return n.fromJSON(t,e)},p.jsonID=function(t,e){if(t in c)throw new RangeError("Duplicate use of step JSON ID "+t);return(c[t]=e).prototype.jsonID=t,e};var u=function(t,e){this.doc=t,this.failed=e};u.ok=function(t){return new u(t,null)},u.fail=function(t){return new u(null,t)},u.fromReplace=function(t,e,n,r){try{return u.ok(t.replace(e,n,r))}catch(t){if(t instanceof Oe.ReplaceError)return u.fail(t.message);throw t}};var x=function(o){function r(t,e,n,r){o.call(this),this.from=t,this.to=e,this.slice=n,this.structure=!!r}return o&&(r.__proto__=o),((r.prototype=Object.create(o&&o.prototype)).constructor=r).prototype.apply=function(t){return this.structure&&f(t,this.from,this.to)?u.fail("Structure replace would overwrite content"):u.fromReplace(t,this.from,this.to,this.slice)},r.prototype.getMap=function(){return new n([this.from,this.to-this.from,this.slice.size])},r.prototype.invert=function(t){return new r(this.from,this.from+this.slice.size,t.slice(this.from,this.to))},r.prototype.map=function(t){var e=t.mapResult(this.from,1),n=t.mapResult(this.to,-1);return e.deleted&&n.deleted?null:new r(e.pos,Math.max(e.pos,n.pos),this.slice)},r.prototype.merge=function(t){if(!(t instanceof r)||t.structure!=this.structure)return null;if(this.from+this.slice.size!=t.from||this.slice.openEnd||t.slice.openStart){if(t.to!=this.from||this.slice.openStart||t.slice.openEnd)return null;var e=this.slice.size+t.slice.size==0?Oe.Slice.empty:new Oe.Slice(t.slice.content.append(this.slice.content),t.slice.openStart,this.slice.openEnd);return new r(t.from,this.to,e,this.structure)}var n=this.slice.size+t.slice.size==0?Oe.Slice.empty:new Oe.Slice(this.slice.content.append(t.slice.content),this.slice.openStart,t.slice.openEnd);return new r(this.from,this.to+(t.to-t.from),n,this.structure)},r.prototype.toJSON=function(){var t={stepType:"replace",from:this.from,to:this.to};return this.slice.size&&(t.slice=this.slice.toJSON()),this.structure&&(t.structure=!0),t},r.fromJSON=function(t,e){if("number"!=typeof e.from||"number"!=typeof e.to)throw new RangeError("Invalid input for ReplaceStep.fromJSON");return new r(e.from,e.to,Oe.Slice.fromJSON(t,e.slice),!!e.structure)},r}(p);p.jsonID("replace",x);var g=function(a){function i(t,e,n,r,o,i,s){a.call(this),this.from=t,this.to=e,this.gapFrom=n,this.gapTo=r,this.slice=o,this.insert=i,this.structure=!!s}return a&&(i.__proto__=a),((i.prototype=Object.create(a&&a.prototype)).constructor=i).prototype.apply=function(t){if(this.structure&&(f(t,this.from,this.gapFrom)||f(t,this.gapTo,this.to)))return u.fail("Structure gap-replace would overwrite content");var e=t.slice(this.gapFrom,this.gapTo);if(e.openStart||e.openEnd)return u.fail("Gap is not a flat range");var n=this.slice.insertAt(this.insert,e.content);return n?u.fromReplace(t,this.from,this.to,n):u.fail("Content does not fit in gap")},i.prototype.getMap=function(){return new n([this.from,this.gapFrom-this.from,this.insert,this.gapTo,this.to-this.gapTo,this.slice.size-this.insert])},i.prototype.invert=function(t){var e=this.gapTo-this.gapFrom;return new i(this.from,this.from+this.slice.size+e,this.from+this.insert,this.from+this.insert+e,t.slice(this.from,this.to).removeBetween(this.gapFrom-this.from,this.gapTo-this.from),this.gapFrom-this.from,this.structure)},i.prototype.map=function(t){var e=t.mapResult(this.from,1),n=t.mapResult(this.to,-1),r=t.map(this.gapFrom,-1),o=t.map(this.gapTo,1);return e.deleted&&n.deleted||r<e.pos||o>n.pos?null:new i(e.pos,n.pos,r,o,this.slice,this.insert,this.structure)},i.prototype.toJSON=function(){var t={stepType:"replaceAround",from:this.from,to:this.to,gapFrom:this.gapFrom,gapTo:this.gapTo,insert:this.insert};return this.slice.size&&(t.slice=this.slice.toJSON()),this.structure&&(t.structure=!0),t},i.fromJSON=function(t,e){if("number"!=typeof e.from||"number"!=typeof e.to||"number"!=typeof e.gapFrom||"number"!=typeof e.gapTo||"number"!=typeof e.insert)throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");return new i(e.from,e.to,e.gapFrom,e.gapTo,Oe.Slice.fromJSON(t,e.slice),e.insert,!!e.structure)},i}(p);function f(t,e,n){for(var r=t.resolve(e),o=n-e,i=r.depth;0<o&&0<i&&r.indexAfter(i)==r.node(i).childCount;)i--,o--;if(0<o)for(var s=r.node(i).maybeChild(r.indexAfter(i));0<o;){if(!s||s.isLeaf)return!0;s=s.firstChild,o--}return!1}function m(t){return{type:t,attrs:null}}function v(t,e){return t&&e&&!t.isLeaf&&t.canAppend(e)}function y(t,e,n){var r=t.resolve(e);if(r.parent.canReplaceWith(r.index(),r.index(),n))return e;if(0==r.parentOffset)for(var o=r.depth-1;0<=o;o--){var i=r.index(o);if(r.node(o).canReplaceWith(i,i,n))return r.before(o+1);if(0<i)return null}if(r.parentOffset==r.parent.content.size)for(var s=r.depth-1;0<=s;s--){var a=r.indexAfter(s);if(r.node(s).canReplaceWith(a,a,n))return r.after(s+1);if(a<r.node(s).childCount)return null}}function w(t,e,n){for(var r=[],o=0;o<t.childCount;o++){var i=t.child(o);i.content.size&&(i=i.copy(w(i.content,e,i))),i.isInline&&(i=e(i,n,o)),r.push(i)}return Oe.Fragment.fromArray(r)}p.jsonID("replaceAround",g),i.prototype.lift=function(t,e){for(var n=t.$from,r=t.$to,o=t.depth,i=n.before(o+1),s=r.after(o+1),a=i,c=s,l=Oe.Fragment.empty,p=0,u=o,f=!1;e<u;u--)f||0<n.index(u)?(f=!0,l=Oe.Fragment.from(n.node(u).copy(l)),p++):a--;for(var h=Oe.Fragment.empty,d=0,m=o,v=!1;e<m;m--)v||r.after(m+1)<r.end(m)?(v=!0,h=Oe.Fragment.from(r.node(m).copy(h)),d++):c++;return this.step(new g(a,c,i,s,new Oe.Slice(l.append(h),p,d),l.size-p,!0))},i.prototype.wrap=function(t,e){for(var n=Oe.Fragment.empty,r=e.length-1;0<=r;r--)n=Oe.Fragment.from(e[r].type.create(e[r].attrs,n));var o=t.start,i=t.end;return this.step(new g(o,i,o,i,new Oe.Slice(n,0,0),e.length,!0))},i.prototype.setBlockType=function(t,e,p,u){var f=this;if(void 0===e&&(e=t),!p.isTextblock)throw new RangeError("Type given to setBlockType should be a textblock");var h=this.steps.length;return this.doc.nodesBetween(t,e,function(t,e){if(t.isTextblock&&!t.hasMarkup(p,u)&&(i=f.doc,s=f.mapping.slice(h).map(e),a=p,c=i.resolve(s),l=c.index(),c.parent.canReplaceWith(l,l+1,a))){f.clearIncompatible(f.mapping.slice(h).map(e,1),p);var n=f.mapping.slice(h),r=n.map(e,1),o=n.map(e+t.nodeSize,1);return f.step(new g(r,o,r+1,o-1,new Oe.Slice(Oe.Fragment.from(p.create(u,null,t.marks)),0,0),1,!0)),!1}var i,s,a,c,l}),this},i.prototype.setNodeMarkup=function(t,e,n,r){var o=this.doc.nodeAt(t);if(!o)throw new RangeError("No node at given position");e||(e=o.type);var i=e.create(n,null,r||o.marks);if(o.isLeaf)return this.replaceWith(t,t+o.nodeSize,i);if(!e.validContent(o.content))throw new RangeError("Invalid content for node type "+e.name);return this.step(new g(t,t+o.nodeSize,t+1,t+o.nodeSize-1,new Oe.Slice(Oe.Fragment.from(i),0,0),1,!0))},i.prototype.split=function(t,e,n){void 0===e&&(e=1);for(var r=this.doc.resolve(t),o=Oe.Fragment.empty,i=Oe.Fragment.empty,s=r.depth,a=r.depth-e,c=e-1;a<s;s--,c--){o=Oe.Fragment.from(r.node(s).copy(o));var l=n&&n[c];i=Oe.Fragment.from(l?l.type.create(l.attrs,i):r.node(s).copy(i))}return this.step(new x(t,t,new Oe.Slice(o.append(i),e,e,!0)))},i.prototype.join=function(t,e){void 0===e&&(e=1);var n=new x(t-e,t+e,Oe.Slice.empty,!0);return this.step(n)};var b=function(r){function o(t,e,n){r.call(this),this.from=t,this.to=e,this.mark=n}return r&&(o.__proto__=r),((o.prototype=Object.create(r&&r.prototype)).constructor=o).prototype.apply=function(t){var n=this,e=t.slice(this.from,this.to),r=t.resolve(this.from),o=r.node(r.sharedDepth(this.to)),i=new Oe.Slice(w(e.content,function(t,e){return e.type.allowsMarkType(n.mark.type)?t.mark(n.mark.addToSet(t.marks)):t},o),e.openStart,e.openEnd);return u.fromReplace(t,this.from,this.to,i)},o.prototype.invert=function(){return new S(this.from,this.to,this.mark)},o.prototype.map=function(t){var e=t.mapResult(this.from,1),n=t.mapResult(this.to,-1);return e.deleted&&n.deleted||e.pos>=n.pos?null:new o(e.pos,n.pos,this.mark)},o.prototype.merge=function(t){if(t instanceof o&&t.mark.eq(this.mark)&&this.from<=t.to&&this.to>=t.from)return new o(Math.min(this.from,t.from),Math.max(this.to,t.to),this.mark)},o.prototype.toJSON=function(){return{stepType:"addMark",mark:this.mark.toJSON(),from:this.from,to:this.to}},o.fromJSON=function(t,e){if("number"!=typeof e.from||"number"!=typeof e.to)throw new RangeError("Invalid input for AddMarkStep.fromJSON");return new o(e.from,e.to,t.markFromJSON(e.mark))},o}(p);p.jsonID("addMark",b);var S=function(r){function o(t,e,n){r.call(this),this.from=t,this.to=e,this.mark=n}return r&&(o.__proto__=r),((o.prototype=Object.create(r&&r.prototype)).constructor=o).prototype.apply=function(t){var e=this,n=t.slice(this.from,this.to),r=new Oe.Slice(w(n.content,function(t){return t.mark(e.mark.removeFromSet(t.marks))}),n.openStart,n.openEnd);return u.fromReplace(t,this.from,this.to,r)},o.prototype.invert=function(){return new b(this.from,this.to,this.mark)},o.prototype.map=function(t){var e=t.mapResult(this.from,1),n=t.mapResult(this.to,-1);return e.deleted&&n.deleted||e.pos>=n.pos?null:new o(e.pos,n.pos,this.mark)},o.prototype.merge=function(t){if(t instanceof o&&t.mark.eq(this.mark)&&this.from<=t.to&&this.to>=t.from)return new o(Math.min(this.from,t.from),Math.max(this.to,t.to),this.mark)},o.prototype.toJSON=function(){return{stepType:"removeMark",mark:this.mark.toJSON(),from:this.from,to:this.to}},o.fromJSON=function(t,e){if("number"!=typeof e.from||"number"!=typeof e.to)throw new RangeError("Invalid input for RemoveMarkStep.fromJSON");return new o(e.from,e.to,t.markFromJSON(e.mark))},o}(p);function C(t,e,n,r){if(void 0===n&&(n=e),void 0===r&&(r=Oe.Slice.empty),e==n&&!r.size)return null;var o=t.resolve(e),i=t.resolve(n);if(O(o,i,r))return new x(e,n,r);var s,a,c,l,p=function(t,e){for(var n=new T(t),r=1;e.size&&r<=3;r++)e=n.placeSlice(e.content,e.openStart,e.openEnd,r);for(;n.open.length;)n.closeNode();return n.placed}(o,r),u=(a=function t(e,n,r,o){var i=Oe.Fragment.empty,s=0,a=r[n];if(e.depth>n){var c=t(e,n+1,r,o||a);s=c.openEnd+1,i=Oe.Fragment.from(e.node(n+1).copy(c.content))}a&&(i=i.append(a.content),s=a.openEnd);o&&(i=i.append(e.node(n).contentMatchAt(e.indexAfter(n)).fillBefore(Oe.Fragment.empty,!0)),s=0);return{content:i,openEnd:s}}(s=o,0,p,!1),c=a.content,l=a.openEnd,new Oe.Slice(c,s.depth,l||0)),f=M(o,i,u);if(!f)return null;if(u.size!=f.size&&function(t,e,n){if(!e.parent.isTextblock)return!1;var r,o=n.openEnd?function(t,e){for(var n=1;n<e;n++)t=t.lastChild.content;return t.lastChild}(n.content,n.openEnd):t.node(t.depth-(n.openStart-n.openEnd));if(!o.isTextblock)return!1;for(var i=e.index();i<e.parent.childCount;i++)if(!o.type.allowsMarks(e.parent.child(i).marks))return!1;n.openEnd?r=o.contentMatchAt(o.childCount):(r=o.contentMatchAt(o.childCount),n.size&&(r=r.matchFragment(n.content,n.openStart?1:0)));return(r=r.matchFragment(e.parent.content,e.index()))&&r.validEnd}(o,i,u)){for(var h=i.depth,d=i.after(h);1<h&&d==i.end(--h);)++d;var m=M(o,t.resolve(d),u);if(m)return new g(e,d,n,i.end(),m,u.size)}return f.size||e!=n?new x(e,n,f):null}function k(t,e,n,r,o,i,s){var a,c=t.childCount,l=c-(0<s?1:0),p=i<0?e:n.node(o);a=i<0?p.contentMatchAt(l):1==c&&0<s?p.contentMatchAt(i?n.index(o):n.indexAfter(o)):p.contentMatchAt(n.indexAfter(o)).matchFragment(t,0<c&&i?1:0,l);var u=r.node(o);if(0<s&&o<r.depth){var f=u.content.cutByIndex(r.indexAfter(o)).addToStart(t.lastChild),h=a.fillBefore(f,!0);if(h&&h.size&&0<i&&1==c&&(h=null),h){var d=k(t.lastChild.content,t.lastChild,n,r,o+1,1==c?i-1:-1,s-1);if(d){var m=t.lastChild.copy(d);return h.size?t.cutByIndex(0,c-1).append(h).addToEnd(m):t.replaceChild(c-1,m)}}}0<s&&(a=a.matchType((1==c&&0<i?n.node(o+1):t.lastChild).type));var v=r.index(o);if(v==u.childCount&&!u.type.compatibleContent(e.type))return null;for(var g=a.fillBefore(u.content,!0,v),y=v;g&&y<u.content.childCount;y++)p.type.allowsMarks(u.content.child(y).marks)||(g=null);if(!g)return null;if(0<s){var w=function t(e,n,r,o,i){var s,a=e.content,c=a.childCount;s=0<=i?r.node(o).contentMatchAt(r.indexAfter(o)).matchFragment(a,0<i?1:0,c):e.contentMatchAt(c);if(0<n){var l=t(a.lastChild,n-1,r,o+1,1==c?i-1:-1);a=a.replaceChild(c-1,l)}return e.copy(a.append(s.fillBefore(Oe.Fragment.empty,!0)))}(t.lastChild,s-1,n,o+1,1==c?i-1:-1);t=t.replaceChild(c-1,w)}return t=t.append(g),r.depth>o&&(t=t.addToEnd(function t(e,n){var r=e.node(n);var o=r.contentMatchAt(0).fillBefore(r.content,!0,e.index(n));e.depth>n&&(o=o.addToEnd(t(e,n+1)));return r.copy(o)}(r,o+1))),t}function M(t,e,n){var r=k(n.content,t.node(0),t,e,0,n.openStart,n.openEnd);return r?function(t,e,n){for(;0<e&&0<n&&1==t.childCount;)t=t.firstChild.content,e--,n--;return new Oe.Slice(t,e,n)}(r,n.openStart,e.depth):null}function O(t,e,n){return!n.openStart&&!n.openEnd&&t.start()==e.start()&&t.parent.canReplace(t.index(),e.index(),n.content)}p.jsonID("removeMark",S),i.prototype.addMark=function(c,l,p){var e=this,u=[],f=[],h=null,d=null;return this.doc.nodesBetween(c,l,function(t,e,n){if(t.isInline){var r=t.marks;if(!p.isInSet(r)&&n.type.allowsMarkType(p.type)){for(var o=Math.max(e,c),i=Math.min(e+t.nodeSize,l),s=p.addToSet(r),a=0;a<r.length;a++)r[a].isInSet(s)||(h&&h.to==o&&h.mark.eq(r[a])?h.to=i:u.push(h=new S(o,i,r[a])));d&&d.to==o?d.to=i:f.push(d=new b(o,i,p))}}}),u.forEach(function(t){return e.step(t)}),f.forEach(function(t){return e.step(t)}),this},i.prototype.removeMark=function(p,u,f){var e=this;void 0===f&&(f=null);var h=[],d=0;return this.doc.nodesBetween(p,u,function(t,e){if(t.isInline){d++;var n=null;if(f instanceof Oe.MarkType){var r=f.isInSet(t.marks);r&&(n=[r])}else f?f.isInSet(t.marks)&&(n=[f]):n=t.marks;if(n&&n.length)for(var o=Math.min(e+t.nodeSize,u),i=0;i<n.length;i++){for(var s=n[i],a=void 0,c=0;c<h.length;c++){var l=h[c];l.step==d-1&&s.eq(h[c].style)&&(a=l)}a?(a.to=o,a.step=d):h.push({style:s,from:Math.max(e,p),to:o,step:d})}}}),h.forEach(function(t){return e.step(new S(t.from,t.to,t.style))}),this},i.prototype.clearIncompatible=function(t,e,n){void 0===n&&(n=e.contentMatch);for(var r=this.doc.nodeAt(t),o=[],i=t+1,s=0;s<r.childCount;s++){var a=r.child(s),c=i+a.nodeSize,l=n.matchType(a.type,a.attrs);if(l){n=l;for(var p=0;p<a.marks.length;p++)e.allowsMarkType(a.marks[p].type)||this.step(new S(i,c,a.marks[p]))}else o.push(new x(i,c,Oe.Slice.empty));i=c}if(!n.validEnd){var u=n.fillBefore(Oe.Fragment.empty,!0);this.replace(i,i,new Oe.Slice(u,0,0))}for(var f=o.length-1;0<=f;f--)this.step(o[f]);return this},i.prototype.replace=function(t,e,n){void 0===e&&(e=t),void 0===n&&(n=Oe.Slice.empty);var r=C(this.doc,t,e,n);return r&&this.step(r),this},i.prototype.replaceWith=function(t,e,n){return this.replace(t,e,new Oe.Slice(Oe.Fragment.from(n),0,0))},i.prototype.delete=function(t,e){return this.replace(t,e,Oe.Slice.empty)},i.prototype.insert=function(t,e){return this.replaceWith(t,t,e)};var T=function(t){this.open=[];for(var e=0;e<=t.depth;e++){var n=t.node(e),r=n.contentMatchAt(t.indexAfter(e));this.open.push({parent:n,match:r,content:Oe.Fragment.empty,wrapper:!1,openEnd:0,depth:e})}this.placed=[]};function A(t,e,n){var r=t.content;if(1<e){var o=A(t.firstChild,e-1,1==t.childCount?n-1:0);r=t.content.replaceChild(0,o)}var i=t.type.contentMatch.fillBefore(r,0==n);return t.copy(i.append(r))}function N(t,e,n,r,o){if(e<n){var i=t.firstChild;t=t.replaceChild(0,i.copy(N(i.content,e+1,n,r,i)))}return r<e&&(t=o.contentMatchAt(0).fillBefore(t,!0).append(t)),t}function D(t,e){for(var n=[],r=Math.min(t.depth,e.depth);0<=r;r--){var o=t.start(r);if(o<t.pos-(t.depth-r)||e.end(r)>e.pos+(e.depth-r)||t.node(r).type.spec.isolating||e.node(r).type.spec.isolating)break;o==e.start(r)&&n.push(r)}return n}T.prototype.placeSlice=function(t,e,n,r,o){if(0<e){var i=t.firstChild,s=this.placeSlice(i.content,Math.max(0,e-1),n&&1==t.childCount?n-1:0,r,i);s.content!=i.content&&(s.content.size?(t=t.replaceChild(0,i.copy(s.content)),e=s.openStart+1):(1==t.childCount&&(n=0),t=t.cutByIndex(1),e=0))}var a=this.placeContent(t,e,n,r,o);if(2<r&&a.size&&0==e){for(var c=0;c<a.content.childCount;c++){var l=a.content.child(c);this.placeContent(l.content,0,n&&c==a.content.childCount.length-1?n-1:0,r,l)}a=Oe.Fragment.empty}return a},T.prototype.placeContent=function(t,e,n,r,o){for(var i=this,s=0;s<t.childCount;s++){for(var a=t.child(s),c=!1,l=s==t.childCount-1,p=this.open.length-1;0<=p;p--){var u=i.open[p],f=void 0;if(1<r&&(f=u.match.findWrapping(a.type))&&(!o||!f.length||f[f.length-1]!=o.type)){for(;this.open.length-1>p;)i.closeNode();for(var h=0;h<f.length;h++)u.match=u.match.matchType(f[h]),p++,u={parent:f[h].create(),match:f[h].contentMatch,content:Oe.Fragment.empty,wrapper:!0,openEnd:0,depth:p+h},i.open.push(u)}var d=u.match.matchType(a.type);if(!d){var m=u.match.fillBefore(Oe.Fragment.from(a));if(!m){if(o&&u.match.matchType(o.type))break;continue}for(var v=0;v<m.childCount;v++){var g=m.child(v);i.addNode(u,g,0),d=u.match.matchFragment(g)}}for(;this.open.length-1>p;)i.closeNode();a=a.mark(u.parent.type.allowedMarks(a.marks)),e&&(a=A(a,e,l?n:0),e=0),i.addNode(u,a,l?n:0),u.match=d,l&&(n=0),c=!0;break}if(!c)break}return 1<this.open.length&&(0<s&&s==t.childCount||o&&this.open[this.open.length-1].parent.type==o.type)&&this.closeNode(),new Oe.Slice(t.cutByIndex(s),e,n)},T.prototype.addNode=function(t,e,n){var r,o;t.content=(r=t.content,o=t.openEnd,o?r.replaceChild(r.childCount-1,function t(e,n){var r=e.content;if(1<n){var o=t(e.lastChild,n-1);r=e.content.replaceChild(e.childCount-1,o)}var i=e.contentMatchAt(e.childCount).fillBefore(Oe.Fragment.empty,!0);return e.copy(r.append(i))}(r.lastChild,o)):r).addToEnd(e),t.openEnd=n},T.prototype.closeNode=function(){var t=this.open.pop();0==t.content.size||(t.wrapper?this.addNode(this.open[this.open.length-1],t.parent.copy(t.content),t.openEnd+1):this.placed[t.depth]={depth:t.depth,content:t.content,openEnd:t.openEnd})},i.prototype.replaceRange=function(t,e,n){if(!n.size)return this.deleteRange(t,e);var r=this.doc.resolve(t),o=this.doc.resolve(e);if(O(r,o,n))return this.step(new x(t,e,n));var i=D(r,this.doc.resolve(e));0==i[i.length-1]&&i.pop();var s=-(r.depth+1);i.unshift(s);for(var a=r.depth,c=r.pos-1;0<a;a--,c--){var l=r.node(a).type.spec;if(l.defining||l.isolating)break;-1<i.indexOf(a)?s=a:r.before(a)==c&&i.splice(1,0,-a)}for(var p=i.indexOf(s),u=[],f=n.openStart,h=n.content,d=0;;d++){var m=h.firstChild;if(u.push(m),d==n.openStart)break;h=m.content}0<f&&u[f-1].type.spec.defining&&r.node(p).type!=u[f-1].type?f-=1:2<=f&&u[f-1].isTextblock&&u[f-2].type.spec.defining&&r.node(p).type!=u[f-2].type&&(f-=2);for(var v=n.openStart;0<=v;v--){var g=(v+f+1)%(n.openStart+1),y=u[g];if(y)for(var w=0;w<i.length;w++){var b=i[(w+p)%i.length],S=!0;b<0&&(S=!1,b=-b);var C=r.node(b-1),k=r.index(b-1);if(C.canReplaceWith(k,k,y.type,y.marks))return this.replace(r.before(b),S?o.after(b):e,new Oe.Slice(N(n.content,0,n.openStart,g),g,n.openEnd))}}return this.replace(t,e,n)},i.prototype.replaceRangeWith=function(t,e,n){if(!n.isInline&&t==e&&this.doc.resolve(t).parent.content.size){var r=y(this.doc,t,n.type);null!=r&&(t=e=r)}return this.replaceRange(t,e,new Oe.Slice(Oe.Fragment.from(n),0,0))},i.prototype.deleteRange=function(t,e){for(var n=this.doc.resolve(t),r=this.doc.resolve(e),o=D(n,r),i=0;i<o.length;i++){var s=o[i],a=i==o.length-1;if(a&&0==s||n.node(s).type.contentMatch.validEnd)return this.delete(n.start(s),r.end(s));if(0<s&&(a||n.node(s-1).canReplace(n.index(s-1),r.indexAfter(s-1))))return this.delete(n.before(s),r.after(s))}for(var c=1;c<=n.depth;c++)if(t-n.start(c)==n.depth-c&&e>n.end(c))return this.delete(n.before(c),e);return this.delete(t,e)},e.Transform=i,e.TransformError=o,e.Step=p,e.StepResult=u,e.joinPoint=function(t,e,n){void 0===n&&(n=-1);for(var r=t.resolve(e),o=r.depth;;o--){var i=void 0,s=void 0;if(o==r.depth?(i=r.nodeBefore,s=r.nodeAfter):0<n?(i=r.node(o+1),s=r.node(o).maybeChild(r.index(o)+1)):(i=r.node(o).maybeChild(r.index(o)-1),s=r.node(o+1)),i&&!i.isTextblock&&v(i,s))return e;if(0==o)break;e=n<0?r.before(o):r.after(o)}},e.canJoin=function(t,e){var n=t.resolve(e),r=n.index();return v(n.nodeBefore,n.nodeAfter)&&n.parent.canReplace(r,r+1)},e.canSplit=function(t,e,n,r){void 0===n&&(n=1);var o=t.resolve(e),i=o.depth-n,s=r&&r[r.length-1]||o.parent;if(i<0||o.parent.type.spec.isolating||!o.parent.canReplace(o.index(),o.parent.childCount)||!s.type.validContent(o.parent.content.cutByIndex(o.index(),o.parent.childCount)))return!1;for(var a=o.depth-1,c=n-2;i<a;a--,c--){var l=o.node(a),p=o.index(a);if(l.type.spec.isolating)return!1;var u=l.content.cutByIndex(p,l.childCount),f=r&&r[c]||l;if(f!=l&&(u=u.replaceChild(0,f.type.create(f.attrs))),!l.canReplace(p+1,l.childCount)||!f.type.validContent(u))return!1}var h=o.indexAfter(i),d=r&&r[0];return o.node(i).canReplaceWith(h,h,d?d.type:o.node(i+1).type)},e.insertPoint=y,e.dropPoint=function(t,e,n){var r=t.resolve(e);if(!n.content.size)return e;for(var o=n.content,i=0;i<n.openStart;i++)o=o.firstChild.content;for(var s=1;s<=(0==n.openStart&&n.size?2:1);s++)for(var a=r.depth;0<=a;a--){var c=a==r.depth?0:r.pos<=(r.start(a+1)+r.end(a+1))/2?-1:1,l=r.index(a)+(0<c?1:0);if(1==s?r.node(a).canReplace(l,l,o):r.node(a).contentMatchAt(l).findWrapping(o.firstChild.type))return 0==c?r.pos:c<0?r.before(a+1):r.after(a+1)}return null},e.liftTarget=function(t){for(var e,n,r,o=t.parent.content.cutByIndex(t.startIndex,t.endIndex),i=t.depth;;--i){var s=t.$from.node(i),a=t.$from.index(i),c=t.$to.indexAfter(i);if(i<t.depth&&s.canReplace(a,c,o))return i;if(0==i||s.type.spec.isolating||(e=s,r=c,0!=(n=a)&&!e.canReplace(n,e.childCount)||r!=e.childCount&&!e.canReplace(0,r)))break}},e.findWrapping=function(t,e,n,r){void 0===r&&(r=t);var o=function(t,e){var n=t.parent,r=t.startIndex,o=t.endIndex,i=n.contentMatchAt(r).findWrapping(e);if(!i)return null;var s=i.length?i[0]:e;return n.canReplaceWith(r,o,s)?i:null}(t,e),i=o&&function(t,e){var n=t.parent,r=t.startIndex,o=t.endIndex,i=n.child(r),s=e.contentMatch.findWrapping(i.type);if(!s)return null;for(var a=(s.length?s[s.length-1]:e).contentMatch,c=r;a&&c<o;c++)a=a.matchType(n.child(c).type);return a&&a.validEnd?s:null}(r,e);return i?o.map(m).concat({type:e,attrs:n}).concat(i.map(m)):null},e.StepMap=n,e.MapResult=d,e.Mapping=r,e.AddMarkStep=b,e.RemoveMarkStep=S,e.ReplaceStep=x,e.ReplaceAroundStep=g,e.replaceStep=C}));e(Te);Te.Transform,Te.TransformError,Te.Step,Te.StepResult,Te.joinPoint,Te.canJoin,Te.canSplit,Te.insertPoint,Te.dropPoint,Te.liftTarget,Te.findWrapping,Te.StepMap,Te.MapResult,Te.Mapping,Te.AddMarkStep,Te.RemoveMarkStep,Te.ReplaceStep,Te.ReplaceAroundStep,Te.replaceStep;var Ae=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var r=Object.create(null),c=function(t,e,n){this.ranges=n||[new o(t.min(e),t.max(e))],this.$anchor=t,this.$head=e},n={anchor:{},head:{},from:{},to:{},$from:{},$to:{},empty:{}};n.anchor.get=function(){return this.$anchor.pos},n.head.get=function(){return this.$head.pos},n.from.get=function(){return this.$from.pos},n.to.get=function(){return this.$to.pos},n.$from.get=function(){return this.ranges[0].$from},n.$to.get=function(){return this.ranges[0].$to},n.empty.get=function(){for(var t=this.ranges,e=0;e<t.length;e++)if(t[e].$from.pos!=t[e].$to.pos)return!1;return!0},c.prototype.content=function(){return this.$from.node(0).slice(this.from,this.to,!0)},c.prototype.replace=function(t,e){void 0===e&&(e=Oe.Slice.empty);for(var n=e.content.lastChild,r=null,o=0;o<e.openEnd;o++)n=(r=n).lastChild;for(var i=t.steps.length,s=this.ranges,a=0;a<s.length;a++){var c=s[a],l=c.$from,p=c.$to,u=t.mapping.slice(i);t.replaceRange(u.map(l.pos),u.map(p.pos),a?Oe.Slice.empty:e),0==a&&h(t,i,(n?n.isInline:r&&r.isTextblock)?-1:1)}},c.prototype.replaceWith=function(t,e){for(var n=t.steps.length,r=this.ranges,o=0;o<r.length;o++){var i=r[o],s=i.$from,a=i.$to,c=t.mapping.slice(n),l=c.map(s.pos),p=c.map(a.pos);o?t.deleteRange(l,p):(t.replaceRangeWith(l,p,e),h(t,n,e.isInline?-1:1))}},c.findFrom=function(t,e,n){var r=t.parent.inlineContent?new l(t):f(t.node(0),t.parent,t.pos,t.index(),e,n);if(r)return r;for(var o=t.depth-1;0<=o;o--){var i=e<0?f(t.node(0),t.node(o),t.before(o+1),t.index(o),e,n):f(t.node(0),t.node(o),t.after(o+1),t.index(o)+1,e,n);if(i)return i}},c.near=function(t,e){return void 0===e&&(e=1),this.findFrom(t,e)||this.findFrom(t,-e)||new s(t.node(0))},c.atStart=function(t){return f(t,t,0,0,1)||new s(t)},c.atEnd=function(t){return f(t,t,t.content.size,t.childCount,-1)||new s(t)},c.fromJSON=function(t,e){if(!e||!e.type)throw new RangeError("Invalid input for Selection.fromJSON");var n=r[e.type];if(!n)throw new RangeError("No selection type "+e.type+" defined");return n.fromJSON(t,e)},c.jsonID=function(t,e){if(t in r)throw new RangeError("Duplicate use of selection JSON ID "+t);return(r[t]=e).prototype.jsonID=t,e},c.prototype.getBookmark=function(){return l.between(this.$anchor,this.$head).getBookmark()},Object.defineProperties(c.prototype,n),c.prototype.visible=!0;var o=function(t,e){this.$from=t,this.$to=e},l=function(i){function s(t,e){void 0===e&&(e=t),i.call(this,t,e)}i&&(s.__proto__=i),(s.prototype=Object.create(i&&i.prototype)).constructor=s;var t={$cursor:{}};return t.$cursor.get=function(){return this.$anchor.pos==this.$head.pos?this.$head:null},s.prototype.map=function(t,e){var n=t.resolve(e.map(this.head));if(!n.parent.inlineContent)return i.near(n);var r=t.resolve(e.map(this.anchor));return new s(r.parent.inlineContent?r:n,n)},s.prototype.replace=function(t,e){if(void 0===e&&(e=Oe.Slice.empty),i.prototype.replace.call(this,t,e),e==Oe.Slice.empty){var n=this.$from.marksAcross(this.$to);n&&t.ensureMarks(n)}},s.prototype.eq=function(t){return t instanceof s&&t.anchor==this.anchor&&t.head==this.head},s.prototype.getBookmark=function(){return new a(this.anchor,this.head)},s.prototype.toJSON=function(){return{type:"text",anchor:this.anchor,head:this.head}},s.fromJSON=function(t,e){if("number"!=typeof e.anchor||"number"!=typeof e.head)throw new RangeError("Invalid input for TextSelection.fromJSON");return new s(t.resolve(e.anchor),t.resolve(e.head))},s.create=function(t,e,n){void 0===n&&(n=e);var r=t.resolve(e);return new this(r,n==e?r:t.resolve(n))},s.between=function(t,e,n){var r=t.pos-e.pos;if(n&&!r||(n=0<=r?1:-1),!e.parent.inlineContent){var o=i.findFrom(e,n,!0)||i.findFrom(e,-n,!0);if(!o)return i.near(e,n);e=o.$head}return t.parent.inlineContent||(0==r?t=e:(t=(i.findFrom(t,-n,!0)||i.findFrom(t,n,!0)).$anchor).pos<e.pos!=r<0&&(t=e)),new s(t,e)},Object.defineProperties(s.prototype,t),s}(c);c.jsonID("text",l);var a=function(t,e){this.anchor=t,this.head=e};a.prototype.map=function(t){return new a(t.map(this.anchor),t.map(this.head))},a.prototype.resolve=function(t){return l.between(t.resolve(this.anchor),t.resolve(this.head))};var p=function(s){function a(t){var e=t.nodeAfter,n=t.node(0).resolve(t.pos+e.nodeSize);s.call(this,t,n),this.node=e}return s&&(a.__proto__=s),((a.prototype=Object.create(s&&s.prototype)).constructor=a).prototype.map=function(t,e){var n=e.mapResult(this.anchor),r=n.deleted,o=n.pos,i=t.resolve(o);return r?s.near(i):new a(i)},a.prototype.content=function(){return new Oe.Slice(Oe.Fragment.from(this.node),0,0)},a.prototype.eq=function(t){return t instanceof a&&t.anchor==this.anchor},a.prototype.toJSON=function(){return{type:"node",anchor:this.anchor}},a.prototype.getBookmark=function(){return new i(this.anchor)},a.fromJSON=function(t,e){if("number"!=typeof e.anchor)throw new RangeError("Invalid input for NodeSelection.fromJSON");return new a(t.resolve(e.anchor))},a.create=function(t,e){return new this(t.resolve(e))},a.isSelectable=function(t){return!t.isText&&!1!==t.type.spec.selectable},a}(c);p.prototype.visible=!1,c.jsonID("node",p);var i=function(t){this.anchor=t};i.prototype.map=function(t){var e=t.mapResult(this.anchor),n=e.deleted,r=e.pos;return n?new a(r,r):new i(r)},i.prototype.resolve=function(t){var e=t.resolve(this.anchor),n=e.nodeAfter;return n&&p.isSelectable(n)?new p(e):c.near(e)};var s=function(e){function n(t){e.call(this,t.resolve(0),t.resolve(t.content.size))}return e&&(n.__proto__=e),((n.prototype=Object.create(e&&e.prototype)).constructor=n).prototype.toJSON=function(){return{type:"all"}},n.fromJSON=function(t){return new n(t)},n.prototype.map=function(t){return new n(t)},n.prototype.eq=function(t){return t instanceof n},n.prototype.getBookmark=function(){return u},n}(c);c.jsonID("all",s);var u={map:function(){return this},resolve:function(t){return new s(t)}};function f(t,e,n,r,o,i){if(e.inlineContent)return l.create(t,n);for(var s=r-(0<o?0:1);0<o?s<e.childCount:0<=s;s+=o){var a=e.child(s);if(a.isAtom){if(!i&&p.isSelectable(a))return p.create(t,n-(o<0?a.nodeSize:0))}else{var c=f(t,a,n+o,o<0?a.childCount:0,o,i);if(c)return c}n+=a.nodeSize*o}}function h(t,e,n){var r=t.steps.length-1;if(!(r<e)){var o,i=t.steps[r];if(i instanceof Te.ReplaceStep||i instanceof Te.ReplaceAroundStep)t.mapping.maps[r].forEach(function(t,e,n,r){null==o&&(o=r)}),t.setSelection(c.near(t.doc.resolve(o),n))}}var d=function(n){function t(t){n.call(this,t.doc),this.time=Date.now(),this.curSelection=t.selection,this.curSelectionFor=0,this.storedMarks=t.storedMarks,this.updated=0,this.meta=Object.create(null)}n&&(t.__proto__=n),(t.prototype=Object.create(n&&n.prototype)).constructor=t;var e={selection:{},selectionSet:{},storedMarksSet:{},isGeneric:{},scrolledIntoView:{}};return e.selection.get=function(){return this.curSelectionFor<this.steps.length&&(this.curSelection=this.curSelection.map(this.doc,this.mapping.slice(this.curSelectionFor)),this.curSelectionFor=this.steps.length),this.curSelection},t.prototype.setSelection=function(t){return this.curSelection=t,this.curSelectionFor=this.steps.length,this.updated=-3&(1|this.updated),this.storedMarks=null,this},e.selectionSet.get=function(){return 0<(1&this.updated)},t.prototype.setStoredMarks=function(t){return this.storedMarks=t,this.updated|=2,this},t.prototype.ensureMarks=function(t){return Oe.Mark.sameSet(this.storedMarks||this.selection.$from.marks(),t)||this.setStoredMarks(t),this},t.prototype.addStoredMark=function(t){return this.ensureMarks(t.addToSet(this.storedMarks||this.selection.$head.marks()))},t.prototype.removeStoredMark=function(t){return this.ensureMarks(t.removeFromSet(this.storedMarks||this.selection.$head.marks()))},e.storedMarksSet.get=function(){return 0<(2&this.updated)},t.prototype.addStep=function(t,e){n.prototype.addStep.call(this,t,e),this.updated=-3&this.updated,this.storedMarks=null},t.prototype.setTime=function(t){return this.time=t,this},t.prototype.replaceSelection=function(t){return this.selection.replace(this,t),this},t.prototype.replaceSelectionWith=function(t,e){var n=this.selection;return!1!==e&&(t=t.mark(this.storedMarks||(n.empty?n.$from.marks():n.$from.marksAcross(n.$to)||Oe.Mark.none))),n.replaceWith(this,t),this},t.prototype.deleteSelection=function(){return this.selection.replace(this),this},t.prototype.insertText=function(t,e,n){void 0===n&&(n=e);var r=this.doc.type.schema;if(null==e)return t?this.replaceSelectionWith(r.text(t),!0):this.deleteSelection();if(!t)return this.deleteRange(e,n);var o=this.storedMarks;if(!o){var i=this.doc.resolve(e);o=n==e?i.marks():i.marksAcross(this.doc.resolve(n))}return this.replaceRangeWith(e,n,r.text(t,o))},t.prototype.setMeta=function(t,e){return this.meta["string"==typeof t?t:t.key]=e,this},t.prototype.getMeta=function(t){return this.meta["string"==typeof t?t:t.key]},e.isGeneric.get=function(){for(var t in this.meta)return!1;return!0},t.prototype.scrollIntoView=function(){return this.updated|=4,this},e.scrolledIntoView.get=function(){return 0<(4&this.updated)},Object.defineProperties(t.prototype,e),t}(Te.Transform);function m(t,e){return e&&t?t.bind(e):t}var v=function(t,e,n){this.name=t,this.init=m(e.init,n),this.apply=m(e.apply,n)},g=[new v("doc",{init:function(t){return t.doc||t.schema.topNodeType.createAndFill()},apply:function(t){return t.doc}}),new v("selection",{init:function(t,e){return t.selection||c.atStart(e.doc)},apply:function(t){return t.selection}}),new v("storedMarks",{init:function(t){return t.storedMarks||null},apply:function(t,e,n,r){return r.selection.$cursor?t.storedMarks:null}}),new v("scrollToSelection",{init:function(){return 0},apply:function(t,e){return t.scrolledIntoView?e+1:e}})],y=function(t,e){var n=this;this.schema=t,this.fields=g.concat(),this.plugins=[],this.pluginsByKey=Object.create(null),e&&e.forEach(function(t){if(n.pluginsByKey[t.key])throw new RangeError("Adding different instances of a keyed plugin ("+t.key+")");n.plugins.push(t),(n.pluginsByKey[t.key]=t).spec.state&&n.fields.push(new v(t.key,t.spec.state,t))})},w=function(t){this.config=t},b={schema:{},plugins:{},tr:{}};b.schema.get=function(){return this.config.schema},b.plugins.get=function(){return this.config.plugins},w.prototype.apply=function(t){return this.applyTransaction(t).state},w.prototype.filterTransaction=function(t,e){void 0===e&&(e=-1);for(var n=0;n<this.config.plugins.length;n++)if(n!=e){var r=this.config.plugins[n];if(r.spec.filterTransaction&&!r.spec.filterTransaction.call(r,t,this))return!1}return!0},w.prototype.applyTransaction=function(t){if(!this.filterTransaction(t))return{state:this,transactions:[]};for(var e=[t],n=this.applyInner(t),r=null;;){for(var o=!1,i=0;i<this.config.plugins.length;i++){var s=this.config.plugins[i];if(s.spec.appendTransaction){var a=r?r[i].n:0,c=r?r[i].state:this,l=a<e.length&&s.spec.appendTransaction.call(s,a?e.slice(a):e,c,n);if(l&&n.filterTransaction(l,i)){if(l.setMeta("appendedTransaction",t),!r){r=[];for(var p=0;p<this.config.plugins.length;p++)r.push(p<i?{state:n,n:e.length}:{state:this,n:0})}e.push(l),n=n.applyInner(l),o=!0}r&&(r[i]={state:n,n:e.length})}}if(!o)return{state:n,transactions:e}}},w.prototype.applyInner=function(t){if(!t.before.eq(this.doc))throw new RangeError("Applying a mismatched transaction");for(var e=new w(this.config),n=this.config.fields,r=0;r<n.length;r++){var o=n[r];e[o.name]=o.apply(t,this[o.name],this,e)}for(var i=0;i<S.length;i++)S[i](this,t,e);return e},b.tr.get=function(){return new d(this)},w.create=function(t){for(var e=new y(t.schema||t.doc.type.schema,t.plugins),n=new w(e),r=0;r<e.fields.length;r++)n[e.fields[r].name]=e.fields[r].init(t,n);return n},w.prototype.reconfigure=function(t){for(var e=new y(t.schema||this.schema,t.plugins),n=e.fields,r=new w(e),o=0;o<n.length;o++){var i=n[o].name;r[i]=this.hasOwnProperty(i)?this[i]:n[o].init(t,r)}return r},w.prototype.toJSON=function(t){var e={doc:this.doc.toJSON(),selection:this.selection.toJSON()};if(this.storedMarks&&(e.storedMarks=this.storedMarks.map(function(t){return t.toJSON()})),t&&"object"==typeof t)for(var n in t){if("doc"==n||"selection"==n)throw new RangeError("The JSON fields `doc` and `selection` are reserved");var r=t[n],o=r.spec.state;o&&o.toJSON&&(e[n]=o.toJSON.call(r,this[r.key]))}return e},w.fromJSON=function(o,i,s){if(!i)throw new RangeError("Invalid input for EditorState.fromJSON");if(!o.schema)throw new RangeError("Required config field 'schema' missing");var t=new y(o.schema,o.plugins),a=new w(t);return t.fields.forEach(function(t){if("doc"==t.name)a.doc=Oe.Node.fromJSON(o.schema,i.doc);else if("selection"==t.name)a.selection=c.fromJSON(a.doc,i.selection);else if("storedMarks"==t.name)i.storedMarks&&(a.storedMarks=i.storedMarks.map(o.schema.markFromJSON));else{if(s)for(var e in s){var n=s[e],r=n.spec.state;if(n.key==t.name&&r&&r.fromJSON&&Object.prototype.hasOwnProperty.call(i,e))return void(a[t.name]=r.fromJSON.call(n,o,i[e],a))}a[t.name]=t.init(o,a)}}),a},w.addApplyListener=function(t){S.push(t)},w.removeApplyListener=function(t){var e=S.indexOf(t);-1<e&&S.splice(e,1)},Object.defineProperties(w.prototype,b);var S=[];var C=function(t){this.props={},t.props&&function t(e,n,r){for(var o in e){var i=e[o];i instanceof Function?i=i.bind(n):"handleDOMEvents"==o&&(i=t(i,n,{})),r[o]=i}return r}(t.props,this,this.props),this.spec=t,this.key=t.key?t.key.key:x("plugin")};C.prototype.getState=function(t){return t[this.key]};var k=Object.create(null);function x(t){return t in k?t+"$"+ ++k[t]:(k[t]=0,t+"$")}var M=function(t){void 0===t&&(t="key"),this.key=x(t)};M.prototype.get=function(t){return t.config.pluginsByKey[this.key]},M.prototype.getState=function(t){return t[this.key]},e.Selection=c,e.SelectionRange=o,e.TextSelection=l,e.NodeSelection=p,e.AllSelection=s,e.Transaction=d,e.EditorState=w,e.Plugin=C,e.PluginKey=M});e(Ae);Ae.Selection,Ae.SelectionRange,Ae.TextSelection,Ae.NodeSelection,Ae.AllSelection,Ae.Transaction;var a=Ae.EditorState,c=Ae.Plugin,lt=(Ae.PluginKey,r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var M={};if("undefined"!=typeof navigator&&"undefined"!=typeof document){var n=/Edge\/(\d+)/.exec(navigator.userAgent),r=/MSIE \d/.test(navigator.userAgent),o=/Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);M.mac=/Mac/.test(navigator.platform);var i=M.ie=!!(r||o||n);M.ie_version=r?document.documentMode||6:o?+o[1]:n?+n[1]:null,M.gecko=!i&&/gecko\/(\d+)/i.test(navigator.userAgent),M.gecko_version=M.gecko&&+(/Firefox\/(\d+)/.exec(navigator.userAgent)||[0,0])[1];var s=!i&&/Chrome\/(\d+)/.exec(navigator.userAgent);M.chrome=!!s,M.chrome_version=s&&+s[1],M.ios=!i&&/AppleWebKit/.test(navigator.userAgent)&&/Mobile\/\w+/.test(navigator.userAgent),M.android=/Android \d/.test(navigator.userAgent),M.webkit=!i&&"WebkitAppearance"in document.documentElement.style,M.safari=/Apple Computer/.test(navigator.vendor),M.webkit_version=M.webkit&&+(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent)||[0,0])[1]}var m=function(t){for(var e=0;;e++)if(!(t=t.previousSibling))return e},f=function(t){var e=t.parentNode;return e&&11==e.nodeType?e.host:e},d=function(t,e,n){var r=document.createRange();return r.setEnd(t,null==n?t.nodeValue.length:n),r.setStart(t,e||0),r},v=function(t,e,n,r){return n&&(c(t,e,n,r,-1)||c(t,e,n,r,1))},a=/^(img|br|input|textarea|hr)$/i;function c(t,e,n,r,o){for(;;){if(t==n&&e==r)return!0;if(e==(o<0?0:l(t))||3==t.nodeType&&"\ufeff"==t.nodeValue){var i=t.parentNode;if(1!=i.nodeType||(void 0,(s=t.pmViewDesc)&&s.node&&s.node.isBlock)||a.test(t.nodeName))return!1;e=m(t)+(o<0?0:1),t=i}else{if(1!=t.nodeType)return!1;t=t.childNodes[e+(o<0?-1:0)],e=o<0?l(t):0}}var s}function l(t){return 3==t.nodeType?t.nodeValue.length:t.childNodes.length}var O=function(t){var e=t.isCollapsed;return e&&M.chrome&&t.rangeCount&&!t.getRangeAt(0).collapsed&&(e=!1),e};function p(t,e){var n,r=t.someProp("scrollThreshold")||0,o=t.someProp("scrollMargin"),i=t.dom.ownerDocument,s=i.defaultView;null==o&&(o=5);for(var a=t.dom;a;a=f(a)){var c=a==i.body||1!=a.nodeType,l=c?{left:0,right:(n=s).innerWidth,top:0,bottom:n.innerHeight}:a.getBoundingClientRect(),p=0,u=0;if(e.top<l.top+r?u=-(l.top-e.top+o):e.bottom>l.bottom-r&&(u=e.bottom-l.bottom+o),e.left<l.left+r?p=-(l.left-e.left+o):e.right>l.right-r&&(p=e.right-l.right+o),(p||u)&&(c?s.scrollBy(p,u):(u&&(a.scrollTop+=u),p&&(a.scrollLeft+=p))),c)break}}function g(t,e){for(var n,r,o=2e8,i=0,s=e.top,a=e.top,c=t.firstChild,l=0;c;c=c.nextSibling,l++){var p=void 0;if(1==c.nodeType)p=c.getClientRects();else{if(3!=c.nodeType)continue;p=d(c).getClientRects()}for(var u=0;u<p.length;u++){var f=p[u];if(f.top<=s&&f.bottom>=a){s=Math.max(f.bottom,s),a=Math.min(f.top,a);var h=f.left>e.left?f.left-e.left:f.right<e.left?e.left-f.right:0;if(h<o){n=c,r=(o=h)&&3==n.nodeType?{left:f.right<e.left?f.right:f.left,top:e.top}:e,1==c.nodeType&&h&&(i=l+(e.left>=(f.left+f.right)/2?1:0));continue}}!n&&(e.left>=f.right&&e.top>=f.top||e.left>=f.left&&e.top>=f.bottom)&&(i=l+1)}}return n&&3==n.nodeType?function(t,e){for(var n=t.nodeValue.length,r=document.createRange(),o=0;o<n;o++){r.setEnd(t,o+1),r.setStart(t,o);var i=y(r,1);if(i.top!=i.bottom&&(i.left-1<=e.left&&i.right+1>=e.left&&i.top-1<=e.top&&i.bottom+1>=e.top))return{node:t,offset:o+(e.left>=(i.left+i.right)/2?1:0)}}return{node:t,offset:0}}(n,r):!n||o&&1==n.nodeType?{node:t,offset:i}:g(n,r)}function u(t,e){var n,r,o=t.root;if(o.caretPositionFromPoint){var i,s=o.caretPositionFromPoint(e.left,e.top);if(s)n=(i=s).offsetNode,r=i.offset}if(!n&&o.caretRangeFromPoint){var a,c=o.caretRangeFromPoint(e.left,e.top);if(c)n=(a=c).startContainer,r=a.startOffset}var l,p,u,f,h=o.elementFromPoint(e.left,e.top+1);if(!h)return null;if(u=e,h=(f=(p=h).parentNode)&&/^li$/i.test(f.nodeName)&&u.left<p.getBoundingClientRect().left?f:p,n&&(n==t.dom&&r==n.childNodes.length-1&&1==n.lastChild.nodeType&&e.top>n.lastChild.getBoundingClientRect().bottom?l=t.state.doc.content.size:0!=r&&1==n.nodeType&&"BR"==n.childNodes[r-1].nodeName||(l=function(t,e,n,r){for(var o=-1,i=e;i!=t.dom;){var s=t.docView.nearestDesc(i,!0);if(!s)return null;if(s.node.isBlock&&s.parent){var a=s.dom.getBoundingClientRect();if(a.left>r.left||a.top>r.top)o=s.posBefore;else{if(!(a.right<r.left||a.bottom<r.top))break;o=s.posAfter}}i=s.dom.parentNode}return-1<o?o:t.docView.posFromDOM(e,n)}(t,n,r,e))),null==l&&null==(l=function(t,e,n){if(!t.dom.contains(1!=e.nodeType?e.parentNode:e))return null;var r=g(e,n),o=r.node,i=r.offset,s=-1;if(1==o.nodeType&&!o.firstChild){var a=o.getBoundingClientRect();s=a.left!=a.right&&n.left>(a.left+a.right)/2?1:-1}return t.docView.posFromDOM(o,i,s)}(t,h,e)))return null;var d=t.docView.nearestDesc(h,!0);return{pos:l,inside:d?d.posAtStart-d.border:-1}}function y(t,e){var n=t.getClientRects();return n.length?n[e<0?0:n.length-1]:t.getBoundingClientRect()}function h(t,e){var n,r,o=t.docView.domFromPos(e),i=o.node,s=o.offset;if(3==i.nodeType)s<i.nodeValue.length&&(r=y(d(i,s,s+1),-1),n="left"),r&&r.left!=r.right||!s||(r=y(d(i,s-1,s),1),n="right");else if(i.firstChild){if(s<i.childNodes.length){var a=i.childNodes[s];r=y(3==a.nodeType?d(a):a,-1),n="left"}if((!r||r.top==r.bottom)&&s){var c=i.childNodes[s-1];r=y(3==c.nodeType?d(c):c,1),n="right"}}else r=i.getBoundingClientRect(),n="left";var l=r[n];return{top:r.top,bottom:r.bottom,left:l,right:l}}function w(t,e,n){var r=t.state,o=t.root.activeElement;r==e&&t.inDOMChange||t.updateState(e),o!=t.dom&&t.focus();try{return n()}finally{r!=e&&t.updateState(r),o!=t.dom&&o.focus()}}var b=/[\u0590-\u08ac]/;var S=null,C=null,k=!1;function x(t,e,n){return S==e&&C==n?k:(S=e,k="up"==(C=n)||"down"==n?(s=t,a=n,o=(r=e).selection,!!(c="up"==a?o.$anchor.min(o.$head):o.$anchor.max(o.$head)).depth&&w(s,r,function(){for(var t=s.docView.domAfterPos(c.before()),e=h(s,c.pos),n=t.firstChild;n;n=n.nextSibling){var r=void 0;if(1==n.nodeType)r=n.getClientRects();else{if(3!=n.nodeType)continue;r=d(n,0,n.nodeValue.length).getClientRects()}for(var o=0;o<r.length;o++){var i=r[o];if(i.bottom>i.top&&("up"==a?i.bottom<e.top+1:i.top>e.bottom-1))return!1}}return!0})):function(o,t,i){var s=t.selection.$head;if(!s.parent.isTextblock||!s.depth)return!1;var e=s.parentOffset,n=!e,r=e==s.parent.content.size,a=getSelection();return b.test(s.parent.textContent)&&a.modify?w(o,t,function(){var t=a.getRangeAt(0),e=a.focusNode,n=a.focusOffset;a.modify("move",i,"character");var r=!o.docView.domAfterPos(s.before()).contains(1==a.focusNode.nodeType?a.focusNode:a.focusNode.parentNode)||e==a.focusNode&&n==a.focusOffset;return a.removeAllRanges(),a.addRange(t),r}):"left"==i||"backward"==i?n:r}(t,e,n));var s,r,a,o,c}var T=function(t,e,n,r){this.parent=t,this.children=e,((this.dom=n).pmViewDesc=this).contentDOM=r,this.dirty=0},A={beforePosition:{},size:{},border:{},posBefore:{},posAtStart:{},posAfter:{},posAtEnd:{},contentLost:{}};T.prototype.matchesWidget=function(){return!1},T.prototype.matchesMark=function(){return!1},T.prototype.matchesNode=function(){return!1},T.prototype.matchesHack=function(){return!1},A.beforePosition.get=function(){return!1},T.prototype.parseRule=function(){return null},T.prototype.stopEvent=function(){return!1},A.size.get=function(){for(var t=0,e=0;e<this.children.length;e++)t+=this.children[e].size;return t},A.border.get=function(){return 0},T.prototype.destroy=function(){this.parent=null,this.dom.pmViewDesc==this&&(this.dom.pmViewDesc=null);for(var t=0;t<this.children.length;t++)this.children[t].destroy()},T.prototype.posBeforeChild=function(t){for(var e=0,n=this.posAtStart;e<this.children.length;e++){var r=this.children[e];if(r==t)return n;n+=r.size}},A.posBefore.get=function(){return this.parent.posBeforeChild(this)},A.posAtStart.get=function(){return this.parent?this.parent.posBeforeChild(this)+this.border:0},A.posAfter.get=function(){return this.posBefore+this.size},A.posAtEnd.get=function(){return this.posAtStart+this.size-2*this.border},T.prototype.localPosFromDOM=function(t,e,n){var r;if(this.contentDOM&&this.contentDOM.contains(1==t.nodeType?t:t.parentNode)){if(n<0){var o,i;if(t==this.contentDOM)o=t.childNodes[e-1];else{for(;t.parentNode!=this.contentDOM;)t=t.parentNode;o=t.previousSibling}for(;o&&(!(i=o.pmViewDesc)||i.parent!=this);)o=o.previousSibling;return o?this.posBeforeChild(i)+i.size:this.posAtStart}var s,a;if(t==this.contentDOM)s=t.childNodes[e];else{for(;t.parentNode!=this.contentDOM;)t=t.parentNode;s=t.nextSibling}for(;s&&(!(a=s.pmViewDesc)||a.parent!=this);)s=s.nextSibling;return s?this.posBeforeChild(a):this.posAtEnd}if(this.contentDOM&&this.contentDOM!=this.dom&&this.dom.contains(this.contentDOM))r=2&t.compareDocumentPosition(this.contentDOM);else if(this.dom.firstChild){if(0==e)for(var c=t;;c=c.parentNode){if(c==this.dom){r=!1;break}if(c.parentNode.firstChild!=c)break}if(null==r&&e==t.childNodes.length)for(var l=t;;l=l.parentNode){if(l==this.dom){r=!0;break}if(l.parentNode.lastChild!=l)break}}return(null==r?0<n:r)?this.posAtEnd:this.posAtStart},T.prototype.nearestDesc=function(t,e){for(var n=!0,r=t;r;r=r.parentNode){var o=this.getDesc(r);if(o&&(!e||o.node)){if(!n||!o.nodeDOM||(1==o.nodeDOM.nodeType?o.nodeDOM.contains(t):o.nodeDOM==t))return o;n=!1}}},T.prototype.getDesc=function(t){for(var e=t.pmViewDesc,n=e;n;n=n.parent)if(n==this)return e},T.prototype.posFromDOM=function(t,e,n){for(var r=t;;r=r.parentNode){var o=this.getDesc(r);if(o)return o.localPosFromDOM(t,e,n)}},T.prototype.descAt=function(t){for(var e=0,n=0;e<this.children.length;e++){var r=this.children[e],o=n+r.size;if(n==t&&o!=n){for(;!r.border&&r.children.length;)r=r.children[0];return r}if(t<o)return r.descAt(t-n-r.border);n=o}},T.prototype.domFromPos=function(t){if(!this.contentDOM)return{node:this.dom,offset:0};for(var e=0,n=0;;n++){if(e==t){for(;n<this.children.length&&this.children[n].beforePosition;)n++;return{node:this.contentDOM,offset:n}}if(n==this.children.length)throw new Error("Invalid position "+t);var r=this.children[n],o=e+r.size;if(t<o)return r.domFromPos(t-e-r.border);e=o}},T.prototype.parseRange=function(t,e,n){var r=this;if(void 0===n&&(n=0),0==this.children.length)return{node:this.contentDOM,from:t,to:e,fromOffset:0,toOffset:this.contentDOM.childNodes.length};for(var o=-1,i=-1,s=0,a=0;;a++){var c=r.children[a],l=s+c.size;if(-1==o&&t<=l){var p=s+c.border;if(p<=t&&e<=l-c.border&&c.node&&c.contentDOM&&r.contentDOM.contains(c.contentDOM))return c.parseRange(t-p,e-p,n+p);t=n+s;for(var u=a;0<u;u--){var f=r.children[u-1];if(f.size&&f.dom.parentNode==r.contentDOM&&!f.emptyChildAt(1)){o=m(f.dom)+1;break}t-=f.size}-1==o&&(o=0)}if(-1<o&&e<=l){e=n+l;for(var h=a+1;h<this.children.length;h++){var d=r.children[h];if(d.size&&d.dom.parentNode==r.contentDOM&&!d.emptyChildAt(-1)){i=m(d.dom);break}e+=d.size}-1==i&&(i=r.contentDOM.childNodes.length);break}s=l}return{node:this.contentDOM,from:t,to:e,fromOffset:o,toOffset:i}},T.prototype.emptyChildAt=function(t){if(this.border||!this.contentDOM||!this.children.length)return!1;var e=this.children[t<0?0:this.children.length-1];return 0==e.size||e.emptyChildAt(t)},T.prototype.domAfterPos=function(t){var e=this.domFromPos(t),n=e.node,r=e.offset;if(1!=n.nodeType||r==n.childNodes.length)throw new RangeError("No node after pos "+t);return n.childNodes[r]},T.prototype.setSelection=function(t,e,n){for(var r=Math.min(t,e),o=Math.max(t,e),i=0,s=0;i<this.children.length;i++){var a=this.children[i],c=s+a.size;if(s<r&&o<c)return a.setSelection(t-s-a.border,e-s-a.border,n);s=c}var l=this.domFromPos(t),p=this.domFromPos(e),u=n.getSelection(),f=document.createRange();if(!v(l.node,l.offset,u.anchorNode,u.anchorOffset)||!v(p.node,p.offset,u.focusNode,u.focusOffset)){if(u.extend)f.setEnd(l.node,l.offset),f.collapse(!1);else{if(e<t){var h=l;l=p,p=h}f.setEnd(p.node,p.offset),f.setStart(l.node,l.offset)}u.removeAllRanges(),u.addRange(f),u.extend&&u.extend(p.node,p.offset)}},T.prototype.ignoreMutation=function(t){return!this.contentDOM},A.contentLost.get=function(){return this.contentDOM&&this.contentDOM!=this.dom&&!this.dom.contains(this.contentDOM)},T.prototype.markDirty=function(t,e){for(var n=0,r=0;r<this.children.length;r++){var o=this.children[r],i=n+o.size;if(n==i?t<=i&&n<=e:t<i&&n<e){var s=n+o.border,a=i-o.border;if(s<=t&&e<=a)return this.dirty=t==n||e==i?2:1,void(t==s&&e==a&&o.contentLost?o.dirty=3:o.markDirty(t-s,e-s));o.dirty=3}n=i}this.dirty=2},Object.defineProperties(T.prototype,A);var N=[],D=function(a){function t(t,e,n,r){var o,i=e.type.toDOM;if("function"==typeof i&&(i=i(n,function(){return o?o.parent?o.parent.posBeforeChild(o):void 0:r})),!e.type.spec.raw){if(1!=i.nodeType){var s=document.createElement("span");s.appendChild(i),i=s}i.contentEditable=!1,i.classList.add("ProseMirror-widget")}a.call(this,t,N,i,null),this.widget=e,o=this}a&&(t.__proto__=a),(t.prototype=Object.create(a&&a.prototype)).constructor=t;var e={beforePosition:{}};return e.beforePosition.get=function(){return this.widget.type.side<0},t.prototype.matchesWidget=function(t){return 0==this.dirty&&t.type.eq(this.widget.type)},t.prototype.parseRule=function(){return{ignore:!0}},t.prototype.stopEvent=function(t){var e=this.widget.spec.stopEvent;return!!e&&e(t)},Object.defineProperties(t.prototype,e),t}(T),R=function(o){function t(){o.apply(this,arguments)}return o&&(t.__proto__=o),((t.prototype=Object.create(o&&o.prototype)).constructor=t).prototype.parseRule=function(){for(var t,e=this.dom.firstChild;e;e=e.nextSibling){var n=void 0;if(3==e.nodeType){var r=e.nodeValue.replace(/\ufeff/g,"");if(!r)continue;n=document.createTextNode(r)}else{if("\ufeff"==e.textContent)continue;n=e.cloneNode(!0)}t||(t=document.createDocumentFragment()),t.appendChild(n)}return t?{skip:t}:o.prototype.parseRule.call(this)},t.prototype.ignoreMutation=function(){return!1},t}(D),E=function(o){function s(t,e,n,r){o.call(this,t,[],n,r),this.mark=e}return o&&(s.__proto__=o),((s.prototype=Object.create(o&&o.prototype)).constructor=s).create=function(t,e,n,r){var o=X(r)[e.type.name],i=o&&o(e,r);return i&&i.dom||(i=Oe.DOMSerializer.renderSpec(document,e.type.spec.toDOM(e,n))),new s(t,e,i.dom,i.contentDOM||i.dom)},s.prototype.parseRule=function(){return{mark:this.mark.type.name,attrs:this.mark.attrs,contentElement:this.contentDOM}},s.prototype.matchesMark=function(t){return 3!=this.dirty&&this.mark.eq(t)},s.prototype.markDirty=function(t,e){if(o.prototype.markDirty.call(this,t,e),0!=this.dirty){for(var n=this.parent;!n.node;)n=n.parent;n.dirty<this.dirty&&(n.dirty=this.dirty),this.dirty=0}},s}(T),P=function(l){function h(t,e,n,r,o,i,s,a,c){l.call(this,t,e.isLeaf?N:[],o,i),this.nodeDOM=s,this.node=e,this.outerDeco=n,this.innerDeco=r,i&&this.updateChildren(a,c)}l&&(h.__proto__=l);var t={size:{},border:{}};return((h.prototype=Object.create(l&&l.prototype)).constructor=h).create=function(t,e,n,r,o,i){var s,a=X(o)[e.type.name],c=a&&a(e,o,function(){return s?s.parent?s.parent.posBeforeChild(s):void 0:i},n),l=c&&c.dom,p=c&&c.contentDOM;if(e.isText)if(l){if(3!=l.nodeType)throw new RangeError("Text must be rendered as a DOM text node")}else l=document.createTextNode(e.text);else if(!l){var u;l=(u=Oe.DOMSerializer.renderSpec(document,e.type.spec.toDOM(e))).dom,p=u.contentDOM}p||e.isText||"BR"==l.nodeName||(l.contentEditable=!1,e.type.spec.draggable&&(l.draggable=!0));var f=l;return l=J(l,n,e),c?s=new $(t,e,n,r,l,p,f,c,o):e.isText?new I(t,e,n,r,l,f,o):new h(t,e,n,r,l,p,f,o,i+1)},h.prototype.parseRule=function(){var t=this;if(this.node.type.spec.reparseInView)return null;var e={node:this.node.type.name,attrs:this.node.attrs};return this.node.type.spec.code&&(e.preserveWhitespace="full"),this.contentDOM&&!this.contentLost?e.contentElement=this.contentDOM:e.getContent=function(){return t.contentDOM?Oe.Fragment.empty:t.node.content},e},h.prototype.matchesNode=function(t,e,n){return 0==this.dirty&&t.eq(this.node)&&W(e,this.outerDeco)&&n.eq(this.innerDeco)},t.size.get=function(){return this.node.nodeSize},t.border.get=function(){return this.node.isLeaf?0:1},h.prototype.updateChildren=function(o,i){var n=this,s=new U(this),a=this.node.inlineContent;!function(t,e,n,r){var o=e.locals(t),i=0;if(0==o.length){for(var s=0;s<t.childCount;s++){var a=t.child(s);r(a,o,e.forChild(i,a),s),i+=a.nodeSize}return}for(var c=0,l=[],p=null,u=0;;){if(c<o.length&&o[c].to==i){for(var f=o[c++],h=void 0;c<o.length&&o[c].to==i;)(h||(h=[f])).push(o[c++]);if(h){h.sort(G);for(var d=0;d<h.length;d++)n(h[d],u)}else n(f,u)}var m=void 0;if(p)m=p,p=null;else{if(!(u<t.childCount))break;m=t.child(u++)}for(var v=0;v<l.length;v++)l[v].to<=i&&l.splice(v--,1);for(;c<o.length&&o[c].from==i;)l.push(o[c++]);var g=i+m.nodeSize;if(m.isText){var y=g;c<o.length&&o[c].from<y&&(y=o[c].from);for(var w=0;w<l.length;w++)l[w].to<y&&(y=l[w].to);y<g&&(p=m.cut(y-i),m=m.cut(0,y-i),g=y)}r(m,l.length?l.slice():N,e.forChild(i,m),u-1),i=g}}(this.node,this.innerDeco,function(t,e){t.spec.marks?s.syncToMarks(t.spec.marks,a,o):0<=t.type.side&&s.syncToMarks(e==n.node.childCount?Oe.Mark.none:n.node.child(e).marks,a,o),s.placeWidget(t,o,i)},function(t,e,n,r){s.syncToMarks(t.marks,a,o),s.findNodeMatch(t,e,n,r)||s.updateNextNode(t,e,n,o,r)||s.addNode(t,e,n,o,i),i+=t.nodeSize}),s.syncToMarks(N,a,o),this.node.isTextblock&&s.addTextblockHacks(),s.destroyRest(),(s.changed||2==this.dirty)&&this.renderChildren()},h.prototype.renderChildren=function(){!function t(e,n){var r=e.firstChild;for(var o=0;o<n.length;o++){var i=n[o],s=i.dom;if(s.parentNode==e){for(;s!=r;)r=q(r);r=r.nextSibling}else e.insertBefore(s,r);if(i instanceof E){var a=r?r.previousSibling:e.lastChild;t(i.contentDOM,i.children),r=a?a.nextSibling:e.firstChild}}for(;r;)r=q(r)}(this.contentDOM,this.children),M.ios&&function(t){if("UL"==t.nodeName||"OL"==t.nodeName){var e=t.style.cssText;t.style.cssText=e+"; list-style: square !important",window.getComputedStyle(t).listStyle,t.style.cssText=e}}(this.dom)},h.prototype.update=function(t,e,n,r){return!(3==this.dirty||!t.sameMarkup(this.node))&&(this.updateInner(t,e,n,r),!0)},h.prototype.updateInner=function(t,e,n,r){this.updateOuterDeco(e),this.node=t,this.innerDeco=n,this.contentDOM&&this.updateChildren(r,this.posAtStart),this.dirty=0},h.prototype.updateOuterDeco=function(t){if(!W(t,this.outerDeco)){var e=1!=this.nodeDOM.nodeType,n=this.dom;this.dom=V(this.dom,this.nodeDOM,j(this.outerDeco,this.node,e),j(t,this.node,e)),this.dom!=n&&(n.pmViewDesc=null,this.dom.pmViewDesc=this),this.outerDeco=t}},h.prototype.selectNode=function(){this.nodeDOM.classList.add("ProseMirror-selectednode")},h.prototype.deselectNode=function(){this.nodeDOM.classList.remove("ProseMirror-selectednode")},Object.defineProperties(h.prototype,t),h}(T);function _(t,e,n,r,o){return J(r,e,t),new P(null,t,e,n,r,r,r,o,0)}var I=function(a){function t(t,e,n,r,o,i,s){a.call(this,t,e,n,r,o,null,i,s)}return a&&(t.__proto__=a),((t.prototype=Object.create(a&&a.prototype)).constructor=t).prototype.parseRule=function(){var t=this.nodeDOM.parentNode;return t?{skip:t}:{ignore:!0}},t.prototype.update=function(t,e){return!(3==this.dirty||0!=this.dirty&&!this.inParent()||!t.sameMarkup(this.node))&&(this.updateOuterDeco(e),0==this.dirty&&t.text==this.node.text||t.text==this.nodeDOM.nodeValue||(this.nodeDOM.nodeValue=t.text),this.node=t,!(this.dirty=0))},t.prototype.inParent=function(){for(var t=this.parent.contentDOM,e=this.nodeDOM;e;e=e.parentNode)if(e==t)return!0;return!1},t.prototype.domFromPos=function(t){return{node:this.nodeDOM,offset:t}},t.prototype.localPosFromDOM=function(t,e,n){return t==this.nodeDOM?this.posAtStart+Math.min(e,this.node.text.length):a.prototype.localPosFromDOM.call(this,t,e,n)},t.prototype.ignoreMutation=function(t){return"characterData"!=t.type},t}(P),z=function(t){function e(){t.apply(this,arguments)}return t&&(e.__proto__=t),((e.prototype=Object.create(t&&t.prototype)).constructor=e).prototype.parseRule=function(){return{ignore:!0}},e.prototype.matchesHack=function(){return 0==this.dirty},e}(T),$=function(l){function t(t,e,n,r,o,i,s,a,c){l.call(this,t,e,n,r,o,i,s,c),this.spec=a}return l&&(t.__proto__=l),((t.prototype=Object.create(l&&l.prototype)).constructor=t).prototype.update=function(t,e,n,r){if(3==this.dirty)return!1;if(this.spec.update){var o=this.spec.update(t,e);return o&&this.updateInner(t,e,n,r),o}return!(!this.contentDOM&&!t.isLeaf)&&l.prototype.update.call(this,t,e,n,r)},t.prototype.selectNode=function(){this.spec.selectNode?this.spec.selectNode():l.prototype.selectNode.call(this)},t.prototype.deselectNode=function(){this.spec.deselectNode?this.spec.deselectNode():l.prototype.deselectNode.call(this)},t.prototype.setSelection=function(t,e,n){this.spec.setSelection?this.spec.setSelection(t,e,n):l.prototype.setSelection.call(this,t,e,n)},t.prototype.destroy=function(){this.spec.destroy&&this.spec.destroy(),l.prototype.destroy.call(this)},t.prototype.stopEvent=function(t){return!!this.spec.stopEvent&&this.spec.stopEvent(t)},t.prototype.ignoreMutation=function(t){return this.spec.ignoreMutation?this.spec.ignoreMutation(t):l.prototype.ignoreMutation.call(this,t)},t}(P);function F(t){t&&(this.nodeName=t)}F.prototype=Object.create(null);var B=[new F];function j(t,e,n){if(0==t.length)return B;for(var r=n?B[0]:new F,o=[r],i=0;i<t.length;i++){var s=t[i].type.attrs,a=r;if(s)for(var c in s.nodeName&&o.push(a=new F(s.nodeName)),s){var l=s[c];null!=l&&(n&&1==o.length&&o.push(a=r=new F(e.isInline?"span":"div")),"class"==c?a.class=(a.class?a.class+" ":"")+l:"style"==c?a.style=(a.style?a.style+";":"")+l:"nodeName"!=c&&(a[c]=l))}}return o}function V(t,e,n,r){if(n==B&&r==B)return e;for(var o=e,i=0;i<r.length;i++){var s=r[i],a=n[i];if(i){var c=void 0;a&&a.nodeName==s.nodeName&&o!=t&&(c=e.parentNode)&&c.tagName.toLowerCase()==s.nodeName||(c=document.createElement(s.nodeName)).appendChild(o),o=c}L(o,a||B[0],s)}return o}function L(t,e,n){for(var r in e)"class"==r||"style"==r||"nodeName"==r||r in n||t.removeAttribute(r);for(var o in n)"class"!=o&&"style"!=o&&"nodeName"!=o&&n[o]!=e[o]&&t.setAttribute(o,n[o]);if(e.class!=n.class){for(var i=e.class?e.class.split(" "):N,s=n.class?n.class.split(" "):N,a=0;a<i.length;a++)-1==s.indexOf(i[a])&&t.classList.remove(i[a]);for(var c=0;c<s.length;c++)-1==i.indexOf(s[c])&&t.classList.add(s[c])}if(e.style!=n.style){if(e.style)for(var l,p=/\s*([\w\-\xa1-\uffff]+)\s*:(?:"(?:\\.|[^"])*"|'(?:\\.|[^'])*'|\(.*?\)|[^;])*/g;l=p.exec(e.style);)t.style[l[1].toLowerCase()]="";n.style&&(t.style.cssText+=n.style)}}function J(t,e,n){return V(t,t,B,j(e,n,1!=t.nodeType))}function W(t,e){if(t.length!=e.length)return!1;for(var n=0;n<t.length;n++)if(!t[n].type.eq(e[n].type))return!1;return!0}function q(t){var e=t.nextSibling;return t.parentNode.removeChild(t),e}var K,H,U=function(t){this.top=t,this.index=0,this.stack=[],this.changed=!1,this.preMatched=function(t,e){for(var n=[],r=t.childCount,o=e.length-1;0<r&&0<=o;o--){var i=e[o],s=i.node;if(s){if(s!=t.child(r-1))break;n[--r]=i}}return n}(t.node.content,t.children)};function G(t,e){return t.type.side-e.type.side}function X(t){return H==t._props?K:(H=t._props,n={},t.someProp("nodeViews",function(t){for(var e in t)Object.prototype.hasOwnProperty.call(n,e)||(n[e]=t[e])}),K=n);var n}function Q(t,e){var n=t.selection,r=n.$anchor,o=n.$head,i=0<e?r.max(o):r.min(o),s=i.parent.inlineContent?i.depth?t.doc.resolve(0<e?i.after():i.before()):null:i;return s&&Ae.Selection.findFrom(s,e)}function Y(t,e){return t.dispatch(t.state.tr.setSelection(e).scrollIntoView()),!0}function Z(t,e){var n=t.state.selection;if(n instanceof Ae.TextSelection){if(n.empty){if(t.endOfTextblock(0<e?"right":"left")){var r=Q(t.state,e);return!!(r&&r instanceof Ae.NodeSelection)&&Y(t,r)}var o,i=n.$head,s=i.textOffset?null:e<0?i.nodeBefore:i.nodeAfter;if(s&&Ae.NodeSelection.isSelectable(s)){var a=e<0?i.pos-s.nodeSize:i.pos;if(s.isAtom||(o=t.docView.descAt(a))&&!o.contentDOM)return Y(t,new Ae.NodeSelection(e<0?t.state.doc.resolve(i.pos-s.nodeSize):i))}return!1}return!1}if(n instanceof Ae.NodeSelection&&n.node.isInline)return Y(t,new Ae.TextSelection(0<e?n.$to:n.$from));var c=Q(t.state,e);return!!c&&Y(t,c)}function tt(t){return 3==t.nodeType?t.nodeValue.length:t.childNodes.length}function et(t){var e=t.pmViewDesc;return e&&0==e.size&&(t.nextSibling||"BR"!=t.nodeName)}function nt(t){var e=t.root.getSelection(),n=e.focusNode,r=e.focusOffset;if(n){var o,i,s=!1;for(M.gecko&&1==n.nodeType&&r<tt(n)&&et(n.childNodes[r])&&(s=!0);;)if(0<r)if(1!=n.nodeType){if(3!=n.nodeType||"\ufeff"!=n.nodeValue.charAt(r-1))break;M.ie&&M.ie_version<=11&&(s=!0),o=n,i=--r}else{var a=n.childNodes[r-1];if(et(a))o=n,i=--r;else{if(3!=a.nodeType)break;r=(n=a).nodeValue.length}}else{if(ot(n))break;for(var c=n.previousSibling;c&&et(c);)o=n.parentNode,i=m(c),c=c.previousSibling;if(c)r=tt(n=c);else{if((n=n.parentNode)==t.dom)break;r=0}}s?it(t,e,n,r):o&&it(t,e,o,i)}}function rt(t){var e=t.root.getSelection(),n=e.focusNode,r=e.focusOffset;if(n){for(var o,i,s=tt(n);;)if(r<s){if(1!=n.nodeType)break;if(!et(n.childNodes[r]))break;o=n,i=++r}else{if(ot(n))break;for(var a=n.nextSibling;a&&et(a);)o=a.parentNode,i=m(a)+1,a=a.nextSibling;if(a)r=0,s=tt(n=a);else{if((n=n.parentNode)==t.dom)break;r=s=0}}o&&it(t,e,o,i)}}function ot(t){var e=t.pmViewDesc;return e&&e.node&&e.node.isBlock}function it(t,e,n,r){if(O(e)){var o=document.createRange();o.setEnd(n,r),o.setStart(n,r),e.removeAllRanges(),e.addRange(o)}else e.extend&&e.extend(n,r);t.selectionReader.storeDOMState(t.selection)}function st(t,e){var n=t.state.selection;if(n instanceof Ae.TextSelection&&!n.empty)return!1;var r=n.$from,o=n.$to;if(!r.parent.inlineContent||t.endOfTextblock(e<0?"up":"down")){var i=Q(t.state,e);if(i&&i instanceof Ae.NodeSelection)return Y(t,i)}if(!r.parent.inlineContent){var s=Ae.Selection.findFrom(e<0?r:o,e);return!s||Y(t,s)}return!1}function at(t,e){if(!(t.state.selection instanceof Ae.TextSelection))return!0;var n=t.state.selection,r=n.$head,o=n.$anchor,i=n.empty;if(!r.sameParent(o))return!0;if(!i)return!1;if(t.endOfTextblock(0<e?"forward":"backward"))return!0;var s=!r.textOffset&&(e<0?r.nodeBefore:r.nodeAfter);if(s&&!s.isText){var a=t.state.tr;return e<0?a.delete(r.pos-s.nodeSize,r.pos):a.delete(r.pos,r.pos+s.nodeSize),t.dispatch(a),!0}return!1}U.prototype.destroyBetween=function(t,e){if(t!=e){for(var n=t;n<e;n++)this.top.children[n].destroy();this.top.children.splice(t,e-t),this.changed=!0}},U.prototype.destroyRest=function(){this.destroyBetween(this.index,this.top.children.length)},U.prototype.syncToMarks=function(t,e,n){for(var r,o=this,i=0,s=this.stack.length>>1,a=Math.min(s,t.length);i<a&&(i==s-1?this.top:this.stack[i+1<<1]).matchesMark(t[i]);)i++;for(;i<s;)o.destroyRest(),o.top.dirty=0,o.index=o.stack.pop(),o.top=o.stack.pop(),s--;for(;s<t.length;){if(o.stack.push(o.top,o.index+1),o.index<o.top.children.length&&(r=o.top.children[o.index]).matchesMark(t[s]))o.top=r;else{var c=E.create(o.top,t[s],e,n);o.top.children.splice(o.index,0,c),o.top=c,o.changed=!0}o.index=0,s++}},U.prototype.findNodeMatch=function(t,e,n,r){for(var o=this.index,i=this.top.children,s=Math.min(i.length,o+5);o<s;o++){var a=i[o],c=void 0;if(a.matchesNode(t,e,n)&&(-1==(c=this.preMatched.indexOf(a))||c==r))return this.destroyBetween(this.index,o),this.index++,!0}return!1},U.prototype.updateNextNode=function(t,e,n,r,o){if(this.index==this.top.children.length)return!1;var i=this.top.children[this.index];if(i instanceof P){var s=this.preMatched.indexOf(i);if(-1<s&&s!=o)return!1;var a=i.dom;if(i.update(t,e,n,r))return i.dom!=a&&(this.changed=!0),this.index++,!0}return!1},U.prototype.addNode=function(t,e,n,r,o){this.top.children.splice(this.index++,0,P.create(this.top,t,e,n,r,o)),this.changed=!0},U.prototype.placeWidget=function(t,e,n){if(this.index<this.top.children.length&&this.top.children[this.index].matchesWidget(t))this.index++;else{var r=new(t.spec.isCursorWrapper?R:D)(this.top,t,e,n);this.top.children.splice(this.index++,0,r),this.changed=!0}},U.prototype.addTextblockHacks=function(){for(var t=this.top.children[this.index-1];t instanceof E;)t=t.children[t.children.length-1];if(!t||!(t instanceof I)||/\n$/.test(t.node.text))if(this.index<this.top.children.length&&this.top.children[this.index].matchesHack())this.index++;else{var e=document.createElement("br");this.top.children.splice(this.index++,0,new z(this.top,N,e,null)),this.changed=!0}};var ct=function(t,e,n){this.prev=t,this.mapping=e,this.state=n},lt=function(t){this.seen=[new ct(null,null,t)],Ae.EditorState.addApplyListener(this.track=this.track.bind(this))};lt.prototype.destroy=function(){Ae.EditorState.removeApplyListener(this.track)},lt.prototype.find=function(t){for(var e=this.seen.length-1;0<=e;e--){var n=this.seen[e];if(n.state==t)return n}},lt.prototype.track=function(t,e,n){var r=this.seen.length<200?this.find(t):null;r&&this.seen.push(new ct(r,e.docChanged?e.mapping:null,n))},lt.prototype.getMapping=function(t,e){var n=this.find(t);if(!n)return null;for(var r=[],o=n;o;o=o.prev)o.mapping&&r.push(o.mapping);for(var i=e||new Te.Mapping,s=r.length-1;0<=s;s--)i.appendMapping(r[s]);return i};var pt=function(t){var e=this;this.view=t,this.lastAnchorNode=this.lastHeadNode=this.lastAnchorOffset=this.lastHeadOffset=null,this.lastSelection=t.state.selection,this.ignoreUpdates=!1,this.suppressUpdates=!1,this.poller=new("onselectionchange"in document?ut:ft)(this),t.dom.addEventListener("focus",function(){return e.poller.start(yt(e.view))}),t.dom.addEventListener("blur",function(){return e.poller.stop()}),t.editable||this.poller.start(!1)};pt.prototype.destroy=function(){this.poller.stop()},pt.prototype.poll=function(t){this.poller.poll(t)},pt.prototype.editableChanged=function(){this.view.editable?yt(this.view)||this.poller.stop():this.poller.start()},pt.prototype.domChanged=function(){var t=this.view.root.getSelection();return t.anchorNode!=this.lastAnchorNode||t.anchorOffset!=this.lastAnchorOffset||t.focusNode!=this.lastHeadNode||t.focusOffset!=this.lastHeadOffset},pt.prototype.storeDOMState=function(t){var e=this.view.root.getSelection();this.lastAnchorNode=e.anchorNode,this.lastAnchorOffset=e.anchorOffset,this.lastHeadNode=e.focusNode,this.lastHeadOffset=e.focusOffset,this.lastSelection=t},pt.prototype.clearDOMState=function(){this.lastAnchorNode=this.lastSelection=null},pt.prototype.readFromDOM=function(t){if(!this.ignoreUpdates&&this.domChanged()&&yt(this.view)){if(this.suppressUpdates)return ht(this.view);if(this.view.inDOMChange||this.view.domObserver.flush(),!this.view.inDOMChange){var e,n,r=this.view.root.getSelection(),o=this.view.state.doc,i=this.view.docView.nearestDesc(r.focusNode),s=i&&0==i.size,a=this.view.docView.posFromDOM(r.focusNode,r.focusOffset),c=o.resolve(a);if(O(r)){for(e=c;i&&!i.node;)i=i.parent;if(i&&i.node.isAtom&&Ae.NodeSelection.isSelectable(i.node)&&i.parent){var l=i.posBefore;n=new Ae.NodeSelection(a==l?c:o.resolve(l))}}else e=o.resolve(this.view.docView.posFromDOM(r.anchorNode,r.anchorOffset));if(!n){var p="pointer"==t||this.view.state.selection.head<c.pos&&!s?1:-1;n=gt(this.view,e,c,p)}if(this.view.state.selection.eq(n))ht(this.view);else{var u=this.view.state.tr.setSelection(n);"pointer"==t&&u.setMeta("pointer",!0),this.view.dispatch(u)}}}};var ut=function(t){var e=this;this.listening=!1,this.curOrigin=null,this.originTime=0,this.reader=t,this.readFunc=function(){return t.readFromDOM(e.originTime>Date.now()-50?e.curOrigin:null)}};ut.prototype.poll=function(t){this.curOrigin=t,this.originTime=Date.now()},ut.prototype.start=function(t){this.listening||(this.reader.view.dom.ownerDocument.addEventListener("selectionchange",this.readFunc),this.listening=!0,t&&this.readFunc())},ut.prototype.stop=function(){this.listening&&(this.reader.view.dom.ownerDocument.removeEventListener("selectionchange",this.readFunc),this.listening=!1)};var ft=function(t){this.polling=null,this.reader=t,this.pollFunc=this.doPoll.bind(this,null)};function ht(t,e){var n=t.state.selection;if(function(t,e){if(e instanceof Ae.NodeSelection){var n=t.docView.descAt(e.from);n!=t.lastSelectedViewDesc&&(vt(t),n&&n.selectNode(),t.lastSelectedViewDesc=n)}else vt(t)}(t,n),t.editable&&!t.hasFocus()){if(!e)return;M.gecko&&M.gecko_version<=55&&(t.selectionReader.ignoreUpdates=!0,t.dom.focus(),t.selectionReader.ignoreUpdates=!1)}else if(!t.editable&&!wt(t)&&!e)return;var r=t.selectionReader;if(!r.lastSelection||!r.lastSelection.eq(n)||r.domChanged()){if(r.ignoreUpdates=!0,t.cursorWrapper)l=(c=t).root.getSelection(),p=document.createRange(),u=c.cursorWrapper.dom,p.setEnd(u,u.childNodes.length),p.collapse(!1),l.removeAllRanges(),l.addRange(p),!c.state.selection.visible&&M.ie&&M.ie_version<=11&&(u.disabled=!0,u.disabled=!1);else{var o,i,s=n.anchor,a=n.head;!dt||n instanceof Ae.TextSelection||(n.$from.parent.inlineContent||(o=mt(t,n.from)),n.empty||n.$from.parent.inlineContent||(i=mt(t,n.to))),t.docView.setSelection(s,a,t.root),dt&&(o&&(o.contentEditable="false"),i&&(i.contentEditable="false")),n.visible?t.dom.classList.remove("ProseMirror-hideselection"):s!=a&&(t.dom.classList.add("ProseMirror-hideselection"),"onselectionchange"in document&&function(t){var e=t.dom.ownerDocument;e.removeEventListener("selectionchange",t.hideSelectionGuard);var n=t.root.getSelection(),r=n.anchorNode,o=n.anchorOffset;e.addEventListener("selectionchange",t.hideSelectionGuard=function(){n.anchorNode==r&&n.anchorOffset==o||(e.removeEventListener("selectionchange",t.hideSelectionGuard),t.dom.classList.remove("ProseMirror-hideselection"))})}(t))}var c,l,p,u;r.storeDOMState(n),r.ignoreUpdates=!1}}ft.prototype.doPoll=function(t){var e=this.reader.view;e.focused||!e.editable?(this.reader.readFromDOM(t),this.polling=setTimeout(this.pollFunc,100)):this.polling=null},ft.prototype.poll=function(t){clearTimeout(this.polling),this.polling=setTimeout(t?this.doPoll.bind(this,t):this.pollFunc,0)},ft.prototype.start=function(){null==this.polling&&this.poll()},ft.prototype.stop=function(){clearTimeout(this.polling),this.polling=null};var dt=M.safari||M.chrome&&M.chrome_version<63;function mt(t,e){var n=t.docView.domFromPos(e),r=n.node,o=n.offset,i=o<r.childNodes.length?r.childNodes[o]:null,s=o?r.childNodes[o-1]:null;if(!(i&&"false"!=i.contentEditable||s&&"false"!=s.contentEditable)){if(i)return i.contentEditable="true",i;if(s)return s.contentEditable="true",s}}function vt(t){t.lastSelectedViewDesc&&(t.lastSelectedViewDesc.deselectNode(),t.lastSelectedViewDesc=null)}function gt(e,n,r,t){return e.someProp("createSelectionBetween",function(t){return t(e,n,r)})||Ae.TextSelection.between(n,r,t)}function yt(t){return(!t.editable||t.root.activeElement==t.dom)&&wt(t)}function wt(t){var e=t.root.getSelection();if(!e.anchorNode)return!1;try{return t.dom.contains(3==e.anchorNode.nodeType?e.anchorNode.parentNode:e.anchorNode)}catch(t){return!1}}function bt(t){return!1===t.type.spec.inclusive}function St(t){var e=t.selection,n=e.$head,r=e.$anchor,o=e.visible,i=n.pos!=r.pos||o&&!n.parent.inlineContent?null:n;return i&&(!o||t.storedMarks||0==i.parent.content.length||i.parentOffset&&!i.textOffset&&i.nodeBefore.marks.some(bt))?i:null}var Ct=function t(e,n){var r=this;this.view=e,this.state=e.state,this.composing=n,this.from=this.to=null,this.typeOver=!1,this.timeout=n?null:setTimeout(function(){return r.finish()},t.commitTimeout),this.trackMappings=new lt(e.state),this.mapping=new Te.Mapping,this.mappingTo=e.state};function kt(t,e){for(var n=e||0;n<t.depth;n++)if(t.index(n)+1<t.node(n).childCount)return!1;return t.parentOffset==t.parent.content.size}function xt(t,e){for(var n=e||0;n<t.depth;n++)if(0<t.index(0))return!1;return 0==t.parentOffset}function Mt(t,e){var n=document.createEvent("Event");return n.initEvent("keydown",!0,!0),n.keyCode=t,n.key=n.code=e,n}function Ot(t,e,n,r){return Math.max(r.anchor,r.head)>e.content.size?null:gt(t,e.resolve(n.map(r.anchor)),e.resolve(n.map(r.head)))}function Tt(t,e,n){for(var r=t.depth,o=e?t.end():t.pos;0<r&&(e||t.indexAfter(r)==t.node(r).childCount);)r--,o++,e=!1;if(n)for(var i=t.node(r).maybeChild(t.indexAfter(r));i&&!i.isLeaf;)i=i.firstChild,o++;return o}function At(t,e){for(var n=[],r=e.content,o=e.openStart,i=e.openEnd;1<o&&1<i&&1==r.childCount&&1==r.firstChild.childCount;){o--,i--;var s=r.firstChild;n.push(s.type.name,s.type.hasRequiredAttrs()?s.attrs:null),r=s.content}var a=t.someProp("clipboardSerializer")||Oe.DOMSerializer.fromSchema(t.state.schema),c=document.createElement("div");c.appendChild(a.serializeFragment(r));for(var l,p=c.firstChild;p&&1==p.nodeType&&(l=Rt[p.nodeName.toLowerCase()]);){for(var u=l.length-1;0<=u;u--){for(var f=document.createElement(l[u]);c.firstChild;)f.appendChild(c.firstChild);c.appendChild(f)}p=c.firstChild}return p&&1==p.nodeType&&p.setAttribute("data-pm-slice",o+" "+i+" "+JSON.stringify(n)),{dom:c,text:t.someProp("clipboardTextSerializer",function(t){return t(e)})||e.content.textBetween(0,e.content.size,"\n\n")}}function Nt(t,e,n,r,o){var i,s,a=o.parent.type.spec.code;if(!n&&!e)return null;if((r||a||!n)&&e){if(t.someProp("transformPastedText",function(t){e=t(e)}),a)return new Oe.Slice(Oe.Fragment.from(t.state.schema.text(e)),0,0);var c=t.someProp("clipboardTextParser",function(t){return t(e,o)});c?s=c:(i=document.createElement("div"),e.trim().split(/(?:\r\n?|\n)+/).forEach(function(t){i.appendChild(document.createElement("p")).textContent=t}))}else t.someProp("transformPastedHTML",function(t){return n=t(n)}),i=function(t){var e=/(\s*<meta [^>]*>)*/.exec(t);e&&(t=t.slice(e[0].length));var n,r=(Et||(Et=document.implementation.createHTMLDocument("title"))).createElement("div"),o=/(?:<meta [^>]*>)*<([a-z][^>\s]+)/i.exec(t),i=0;(n=o&&Rt[o[1].toLowerCase()])&&(t=n.map(function(t){return"<"+t+">"}).join("")+t+n.map(function(t){return"</"+t+">"}).reverse().join(""),i=n.length);r.innerHTML=t;for(var s=0;s<i;s++)r=r.firstChild;return r}(n);if(!s){var l=t.someProp("clipboardParser")||t.someProp("domParser")||Oe.DOMParser.fromSchema(t.state.schema);s=l.parseSlice(i,{preserveWhitespace:!0,context:o})}var p=i&&i.querySelector("[data-pm-slice]"),u=p&&/^(\d+) (\d+) (.*)/.exec(p.getAttribute("data-pm-slice"));return s=u?function(e,t){if(!e.size)return e;var n,r=e.content.firstChild.type.schema;try{n=JSON.parse(t)}catch(t){return e}for(var o=e.content,i=e.openStart,s=e.openEnd,a=n.length-2;0<=a;a-=2){var c=r.nodes[n[a]];if(!c||c.hasRequiredAttrs())break;o=Oe.Fragment.from(c.create(n[a+1],o)),i++,s++}return new Oe.Slice(o,i,s)}(new Oe.Slice(s.content,Math.min(s.openStart,+u[1]),Math.min(s.openEnd,+u[2])),u[3]):Oe.Slice.maxOpen(function(n,r){if(n.childCount<2)return n;for(var t=function(t){var e=r.node(t),o=e.contentMatchAt(r.index(t)),i=void 0,s=[];if(n.forEach(function(t){if(s){var e,n=o.findWrapping(t.type);if(!n)return s=null;if(e=s.length&&i.length&&function t(e,n,r,o,i){if(i<e.length&&i<n.length&&e[i]==n[i]){var s=t(e,n,r,o.lastChild,i+1);if(s)return o.copy(o.content.replaceChild(o.childCount-1,s));var a=o.contentMatchAt(o.childCount);if(a.matchType(i==e.length-1?r.type:e[i+1]))return o.copy(o.content.append(Oe.Fragment.from(Dt(r,e,i+1))))}}(n,i,t,s[s.length-1],0))s[s.length-1]=e;else{s.length&&(s[s.length-1]=function t(e,n){if(0==n)return e;var r=e.content.replaceChild(e.childCount-1,t(e.lastChild,n-1));var o=e.contentMatchAt(e.childCount).fillBefore(Oe.Fragment.empty,!0);return e.copy(r.append(o))}(s[s.length-1],i.length));var r=Dt(t,n);s.push(r),o=o.matchType(r.type,r.attrs),i=n}}}),s)return{v:Oe.Fragment.from(s)}},e=r.depth;0<=e;e--){var o=t(e);if(o)return o.v}return n}(s.content,o),!1),t.someProp("transformPasted",function(t){s=t(s)}),s}function Dt(t,e,n){void 0===n&&(n=0);for(var r=e.length-1;n<=r;r--)t=e[r].create(null,Oe.Fragment.from(t));return t}Ct.prototype.addRange=function(t,e){null==this.from?(this.from=t,this.to=e):(this.from=Math.min(t,this.from),this.to=Math.max(e,this.to))},Ct.prototype.changedRange=function(){if(null==this.from)return function(t){var e=t.$anchor.min(t.$head),n=t.$anchor.max(t.$head);{if(e.sameParent(n)&&e.parent.inlineContent&&e.parentOffset&&n.parentOffset<n.parent.content.size){var r=Math.max(0,e.parentOffset),o=e.parent.content.size,i=Math.min(o,n.parentOffset);if(0<r&&(r=e.parent.childBefore(r).offset),i<o){var s=e.parent.childAfter(i);i=s.offset+s.node.nodeSize}var a=e.start();return{from:a+r,to:a+i}}for(var c=0;;c++){var l=xt(e,c+1),p=kt(n,c+1);if(l||p||e.index(c)!=n.index(c)||n.node(c).isTextblock){var u=e.before(c+1),f=n.after(c+1);return l&&0<e.index(c)&&(u-=e.node(c).child(e.index(c)-1).nodeSize),p&&n.index(c)+1<n.node(c).childCount&&(f+=n.node(c).child(n.index(c)+1).nodeSize),{from:u,to:f}}}}}(this.state.selection);var t=this.state.doc.resolve(Math.min(this.from,this.state.selection.from)),e=this.state.doc.resolve(this.to),n=t.sharedDepth(this.to);return{from:t.before(n+1),to:e.after(n+1)}},Ct.prototype.markDirty=function(t){null==this.from?this.view.docView.markDirty((t=t||this.changedRange()).from,t.to):this.view.docView.markDirty(this.from,this.to)},Ct.prototype.stateUpdated=function(t){return this.trackMappings.getMapping(t,this.mapping)?(this.trackMappings.destroy(),this.trackMappings=new lt(t),this.mappingTo=t,!0):(this.markDirty(),this.destroy(),!1)},Ct.prototype.finish=function(t){if(clearTimeout(this.timeout),!this.composing||t){this.view.domObserver.flush();var e=this.changedRange();this.markDirty(e),this.destroy();var n=this.state.selection,r=this.typeOver&&n instanceof Ae.TextSelection&&!n.empty&&n.$head.sameParent(n.$anchor);!function(e,t,n,r,o){var i,s,a=function(t,e,n){var r=t.docView.parseRange(n.from,n.to),o=r.node,i=r.fromOffset,s=r.toOffset,a=r.from,c=r.to,l=t.root.getSelection(),p=null,u=l.anchorNode;u&&t.dom.contains(1==u.nodeType?u:u.parentNode)&&(p=[{node:u,offset:l.anchorOffset}],O(l)||p.push({node:l.focusNode,offset:l.focusOffset}));if(M.chrome&&8===t.lastKeyCode)for(var f=s;i<f;f--){var h=o.childNodes[f-1],d=h.pmViewDesc;if("BR"==h.nodeType&&!d){s=f;break}if(!d||d.size)break}var m=e.doc,v=t.someProp("domParser")||Oe.DOMParser.fromSchema(t.state.schema),g=m.resolve(a),y=null,w=v.parse(o,{topNode:g.parent,topMatch:g.parent.contentMatchAt(g.index()),topOpen:!0,from:i,to:s,preserveWhitespace:!g.parent.type.spec.code||"full",editableContent:!0,findPositions:p,ruleFromNode:(b=v,S=g,function(t){var e=t.pmViewDesc;if(e)return e.parseRule();if("BR"==t.nodeName&&t.parentNode){if(M.safari&&/^(ul|ol)$/i.test(t.parentNode.nodeName))return b.matchTag(document.createElement("li"),S);if(t.parentNode.lastChild==t)return{ignore:!0}}}),context:g});var b,S;if(p&&null!=p[0].pos){var C=p[0].pos,k=p[1]&&p[1].pos;null==k&&(k=C),y={anchor:C+a,head:k+a}}return{doc:w,sel:y,from:a,to:c}}(e,n,r),c=n.doc,l=c.slice(a.from,a.to);8===e.lastKeyCode&&Date.now()-100<e.lastKeyCodeTime?(i=n.selection.to,s="end"):(i=n.selection.from,s="start");e.lastKeyCode=null;var p=function(t,e,n,r,o){var i=t.findDiffStart(e,n);if(null==i)return null;var s=t.findDiffEnd(e,n+t.size,n+e.size),a=s.a,c=s.b;if("end"==o){var l=Math.max(0,i-Math.min(a,c));r-=a+l-i}if(a<i&&t.size<e.size){var p=r<=i&&a<=r?i-r:0;c=(i-=p)+(c-a),a=i}else if(c<i){var u=r<=i&&c<=r?i-r:0;a=(i-=u)+(a-c),c=i}return{start:i,endA:a,endB:c}}(l.content,a.doc.content,a.from,i,s);if(!p){if(o){var u=e.state,f=u.selection;e.dispatch(u.tr.replaceSelectionWith(u.schema.text(u.doc.textBetween(f.from,f.to)),!0).scrollIntoView())}else if(a.sel){var h=Ot(e,e.state.doc,t,a.sel);h&&!h.eq(e.state.selection)&&e.dispatch(e.state.tr.setSelection(h))}return}var d,m=a.doc.resolveNoCache(p.start-a.from),v=a.doc.resolveNoCache(p.endB-a.from);if(!m.sameParent(v)&&m.pos<a.doc.content.size&&(d=Ae.Selection.findFrom(a.doc.resolve(m.pos+1),1,!0))&&d.head==v.pos&&e.someProp("handleKeyDown",function(t){return t(e,Mt(13,"Enter"))}))return;if(n.selection.anchor>p.start&&function(t,e,n,r,o){if(!r.parent.isTextblock||n-e<=o.pos-r.pos||Tt(r,!0,!1)<o.pos)return!1;var i=t.resolve(e);if(i.parentOffset<i.parent.content.size||!i.parent.isTextblock)return!1;var s=t.resolve(Tt(i,!0,!0));if(!s.parent.isTextblock||s.pos>n||Tt(s,!0,!1)<n)return!1;return r.parent.content.cut(r.parentOffset).eq(s.parent.content)}(c,p.start,p.endA,m,v)&&e.someProp("handleKeyDown",function(t){return t(e,Mt(8,"Backspace"))}))return M.android&&M.chrome&&(e.selectionReader.suppressUpdates=!0,setTimeout(function(){return e.selectionReader.suppressUpdates=!1},50));var g,y,w,b,S=t.map(p.start),C=t.map(p.endA,-1);if(m.sameParent(v)&&m.parent.inlineContent)if(m.pos==v.pos)g=e.state.tr.delete(S,C),y=c.resolve(p.start).marksAcross(c.resolve(p.endA));else if(p.endA==p.endB&&(b=c.resolve(p.start))&&(w=function(t,e){for(var n,r,o,i=t.firstChild.marks,s=e.firstChild.marks,a=i,c=s,l=0;l<s.length;l++)a=s[l].removeFromSet(a);for(var p=0;p<i.length;p++)c=i[p].removeFromSet(c);if(1==a.length&&0==c.length)r=a[0],n="add",o=function(t){return t.mark(r.addToSet(t.marks))};else{if(0!=a.length||1!=c.length)return null;r=c[0],n="remove",o=function(t){return t.mark(r.removeFromSet(t.marks))}}for(var u=[],f=0;f<e.childCount;f++)u.push(o(e.child(f)));if(Oe.Fragment.from(u).eq(t))return{mark:r,type:n}}(m.parent.content.cut(m.parentOffset,v.parentOffset),b.parent.content.cut(b.parentOffset,p.endA-b.start()))))g=e.state.tr,"add"==w.type?g.addMark(S,C,w.mark):g.removeMark(S,C,w.mark);else if(m.parent.child(m.index()).isText&&m.index()==v.index()-(v.textOffset?0:1)){var k=m.parent.textBetween(m.parentOffset,v.parentOffset);if(e.someProp("handleTextInput",function(t){return t(e,S,C,k)}))return;g=e.state.tr.insertText(k,S,C)}g||(g=e.state.tr.replace(S,C,a.doc.slice(p.start-a.from,p.endB-a.from)));if(a.sel){var x=Ot(e,g.doc,t,a.sel);x&&g.setSelection(x)}y&&g.ensureMarks(y);e.dispatch(g.scrollIntoView())}(this.view,this.mapping,this.state,e,r),this.view.docView.dirty&&this.view.updateState(this.view.state)}},Ct.prototype.destroy=function(){clearTimeout(this.timeout),this.trackMappings.destroy(),this.view.inDOMChange=null},Ct.prototype.compositionEnd=function(){var t=this;this.composing&&(this.composing=!1,this.timeout=setTimeout(function(){return t.finish()},50))},Ct.start=function(t,e){return t.inDOMChange?e&&(clearTimeout(t.inDOMChange.timeout),t.inDOMChange.composing=!0):t.inDOMChange=new Ct(t,e),t.inDOMChange},Ct.commitTimeout=20;var Rt={thead:["table"],colgroup:["table"],col:["table","colgroup"],tr:["table","tbody"],td:["table","tbody","tr"],th:["table","tbody","tr"]},Et=null;var Pt={childList:!0,characterData:!0,attributes:!0,subtree:!0,characterDataOldValue:!0},_t=M.ie&&M.ie_version<=11,It=function(t){var e=this;this.view=t,this.observer=window.MutationObserver&&new window.MutationObserver(function(t){return e.registerMutations(t)}),_t&&(this.onCharData=function(t){return e.registerMutation({target:t.target,type:"characterData",oldValue:t.prevValue})})};It.prototype.start=function(){this.observer&&this.observer.observe(this.view.dom,Pt),_t&&this.view.dom.addEventListener("DOMCharacterDataModified",this.onCharData)},It.prototype.stop=function(){this.observer&&(this.flush(),this.observer.disconnect()),_t&&this.view.dom.removeEventListener("DOMCharacterDataModified",this.onCharData)},It.prototype.flush=function(){this.observer&&this.registerMutations(this.observer.takeRecords())},It.prototype.registerMutations=function(t){for(var e=0;e<t.length;e++)this.registerMutation(t[e])},It.prototype.registerMutation=function(t){if(this.view.editable){var e=this.view.docView.nearestDesc(t.target);if(("attributes"!=t.type||e!=this.view.docView&&"contenteditable"!=t.attributeName)&&e&&!e.ignoreMutation(t)){var n,r;if("childList"==t.type){var o=t.previousSibling&&t.previousSibling.parentNode==t.target?m(t.previousSibling)+1:0;if(-1==o)return;n=e.localPosFromDOM(t.target,o,-1);var i=t.nextSibling&&t.nextSibling.parentNode==t.target?m(t.nextSibling):t.target.childNodes.length;if(-1==i)return;r=e.localPosFromDOM(t.target,i,1)}else"attributes"==t.type?(n=e.posAtStart-e.border,r=e.posAtEnd+e.border):(n=e.posAtStart,r=e.posAtEnd,t.target.nodeValue==t.oldValue&&(Ct.start(this.view).typeOver=!0));Ct.start(this.view).addRange(n,r)}}};var zt={},$t={};function Ft(n){n.someProp("handleDOMEvents",function(t){for(var e in t)n.eventHandlers[e]||n.dom.addEventListener(e,n.eventHandlers[e]=function(t){return Bt(n,t)})})}function Bt(n,r){return n.someProp("handleDOMEvents",function(t){var e=t[r.type];return!!e&&(e(n,r)||r.defaultPrevented)})}function jt(t){return{left:t.clientX,top:t.clientY}}$t.keydown=function(e,n){if(e.shiftKey=16==n.keyCode||n.shiftKey,e.inDOMChange){if(e.inDOMChange.composing)return;e.inDOMChange.finish()}var t,r,o,i,s,a;e.lastKeyCode=n.keyCode,e.lastKeyCodeTime=Date.now(),e.someProp("handleKeyDown",function(t){return t(e,n)})||(t=e,s=(r=n).keyCode,i="",(o=r).ctrlKey&&(i+="c"),o.metaKey&&(i+="m"),o.altKey&&(i+="a"),o.shiftKey&&(i+="s"),a=i,8==s||M.mac&&72==s&&"c"==a?at(t,-1)||nt(t):46==s||M.mac&&68==s&&"c"==a?at(t,1)||rt(t):13==s||27==s||(37==s?Z(t,-1)||nt(t):39==s?Z(t,1)||rt(t):38==s?st(t,-1)||nt(t):40==s?st(t,1)||rt(t):a==(M.mac?"m":"c")&&(66==s||73==s||89==s||90==s)))?n.preventDefault():e.selectionReader.poll()},$t.keyup=function(t,e){16==e.keyCode&&(t.shiftKey=!1)},$t.keypress=function(e,n){if(!(e.inDOMChange||!n.charCode||n.ctrlKey&&!n.altKey||M.mac&&n.metaKey))if(e.someProp("handleKeyPress",function(t){return t(e,n)}))n.preventDefault();else{var r=e.state.selection;if(!(r instanceof Ae.TextSelection&&r.$from.sameParent(r.$to))){var o=String.fromCharCode(n.charCode);e.someProp("handleTextInput",function(t){return t(e,r.$from.pos,r.$to.pos,o)})||e.dispatch(e.state.tr.insertText(o).scrollIntoView()),n.preventDefault()}}};var Vt={time:0,x:0,y:0},Lt=Vt;function Jt(t,e){var n=e.x-t.clientX,r=e.y-t.clientY;return n*n+r*r<100}function Wt(n,t,r,e,o){if(-1==e)return!1;for(var i=n.state.doc.resolve(e),s=function(e){if(n.someProp(t,function(t){return e>i.depth?t(n,r,i.nodeAfter,i.before(e),o,!0):t(n,r,i.node(e),i.before(e),o,!1)}))return{v:!0}},a=i.depth+1;0<a;a--){var c=s(a);if(c)return c.v}return!1}function qt(t,e,n){t.focused||t.focus();var r=t.state.tr.setSelection(e);"pointer"==n&&r.setMeta("pointer",!0),t.dispatch(r)}function Kt(e,n,t,r,o){return Wt(e,"handleClickOn",n,t,r)||e.someProp("handleClick",function(t){return t(e,n,r)})||(o?function(t,e){if(-1==e)return!1;var n,r,o=t.state.selection;o instanceof Ae.NodeSelection&&(n=o.node);for(var i=t.state.doc.resolve(e),s=i.depth+1;0<s;s--){var a=s>i.depth?i.nodeAfter:i.node(s);if(Ae.NodeSelection.isSelectable(a)){r=n&&0<o.$from.depth&&s>=o.$from.depth&&i.before(o.$from.depth+1)==o.$from.pos?i.before(o.$from.depth):i.before(s);break}}return null!=r&&(qt(t,Ae.NodeSelection.create(t.state.doc,r),"pointer"),!0)}(e,t):function(t,e){if(-1==e)return!1;var n=t.state.doc.resolve(e),r=n.nodeAfter;return!!(r&&r.isAtom&&Ae.NodeSelection.isSelectable(r))&&(qt(t,new Ae.NodeSelection(n),"pointer"),!0)}(e,t))}function Ht(e,n,t,r){return Wt(e,"handleTripleClickOn",n,t,r)||e.someProp("handleTripleClick",function(t){return t(e,n,r)})||function(t,e){var n=t.state.doc;if(-1==e)return!!n.inlineContent&&(qt(t,Ae.TextSelection.create(n,0,n.content.size),"pointer"),!0);for(var r=n.resolve(e),o=r.depth+1;0<o;o--){var i=o>r.depth?r.nodeAfter:r.node(o),s=r.before(o);if(i.inlineContent)qt(t,Ae.TextSelection.create(n,s+1,s+1+i.content.size),"pointer");else{if(!Ae.NodeSelection.isSelectable(i))continue;qt(t,Ae.NodeSelection.create(n,s),"pointer")}return!0}}(e,t)}function Ut(t){return!!t.inDOMChange&&(t.inDOMChange.finish(!0),!0)}var Gt=M.mac?"metaKey":"ctrlKey";zt.mousedown=function(t,e){t.shiftKey=e.shiftKey;var n,r=Ut(t),o=Date.now();n=500<=o-Vt.time||!Jt(e,Vt)||e[Gt]?"singleClick":600<=o-Lt.time||!Jt(e,Lt)?"doubleClick":"tripleClick",Lt=Vt,Vt={time:o,x:e.clientX,y:e.clientY};var i=t.posAtCoords(jt(e));i&&("singleClick"==n?t.mouseDown=new Xt(t,i,e,r):("doubleClick"==n?function(e,n,t,r){return Wt(e,"handleDoubleClickOn",n,t,r)||e.someProp("handleDoubleClick",function(t){return t(e,n,r)})}:Ht)(t,i.pos,i.inside,e)?e.preventDefault():t.selectionReader.poll("pointer"))};var Xt=function(t,e,n,r){var o,i,s=this;if(this.view=t,this.pos=e,this.event=n,this.flushed=r,this.selectNode=n[Gt],this.allowDefault=n.shiftKey,-1<e.inside)o=t.state.doc.nodeAt(e.inside),i=e.inside;else{var a=t.state.doc.resolve(e.pos);o=a.parent,i=a.depth?a.before():0}this.mightDrag=null,this.target=r?null:n.target,(o.type.spec.draggable&&!1!==o.type.spec.selectable||t.state.selection instanceof Ae.NodeSelection&&i==t.state.selection.from)&&(this.mightDrag={node:o,pos:i,addAttr:this.target&&!this.target.draggable,setUneditable:this.target&&M.gecko&&!this.target.hasAttribute("contentEditable")}),this.target&&this.mightDrag&&(this.mightDrag.addAttr||this.mightDrag.setUneditable)&&(this.view.domObserver.stop(),this.mightDrag.addAttr&&(this.target.draggable=!0),this.mightDrag.setUneditable&&setTimeout(function(){return s.target.setAttribute("contentEditable","false")},20),this.view.domObserver.start()),t.root.addEventListener("mouseup",this.up=this.up.bind(this)),t.root.addEventListener("mousemove",this.move=this.move.bind(this)),t.selectionReader.poll("pointer")};Xt.prototype.done=function(){this.view.root.removeEventListener("mouseup",this.up),this.view.root.removeEventListener("mousemove",this.move),this.mightDrag&&this.target&&(this.view.domObserver.stop(),this.mightDrag.addAttr&&(this.target.draggable=!1),this.mightDrag.setUneditable&&this.target.removeAttribute("contentEditable"),this.view.domObserver.start()),this.view.mouseDown=null},Xt.prototype.up=function(t){this.done(),this.view.dom.contains(3==t.target.nodeType?t.target.parentNode:t.target)&&(this.allowDefault?(M.ie&&St(this.view.state)&&this.view.updateState(this.view.state),this.view.selectionReader.poll("pointer")):Kt(this.view,this.pos.pos,this.pos.inside,t,this.selectNode)?t.preventDefault():this.flushed?(qt(this.view,Ae.Selection.near(this.view.state.doc.resolve(this.pos.pos)),"pointer"),t.preventDefault()):this.view.selectionReader.poll("pointer"))},Xt.prototype.move=function(t){!this.allowDefault&&(4<Math.abs(this.event.x-t.clientX)||4<Math.abs(this.event.y-t.clientY))&&(this.allowDefault=!0),this.view.selectionReader.poll("pointer")},zt.touchdown=function(t){Ut(t),t.selectionReader.poll("pointer")},zt.contextmenu=function(t){return Ut(t)},$t.compositionstart=$t.compositionupdate=function(t){Ct.start(t,!0)},$t.compositionend=function(t,e){if(!t.inDOMChange){if(!e.data)return;Ct.start(t,!0)}t.inDOMChange.compositionEnd()},$t.input=function(t){var e=Ct.start(t);e.composing||e.finish()};var Qt=M.ie&&M.ie_version<15||M.ios&&M.webkit_version<604;function Yt(e,t,n,r){var o=Nt(e,t,n,e.shiftKey,e.state.selection.$from);if(!o)return!1;if(e.someProp("handlePaste",function(t){return t(e,r,o)}))return!0;var i,s=0==(i=o).openStart&&0==i.openEnd&&1==i.content.childCount?i.content.firstChild:null,a=s?e.state.tr.replaceSelectionWith(s,e.shiftKey):e.state.tr.replaceSelection(o);return e.dispatch(a.scrollIntoView().setMeta("paste",!0).setMeta("uiEvent","paste")),!0}zt.copy=$t.cut=function(t,e){var n=t.state.selection,r="cut"==e.type;if(!n.empty){var o=Qt?null:e.clipboardData,i=At(t,n.content()),s=i.dom,a=i.text;o?(e.preventDefault(),o.clearData(),o.setData("text/html",s.innerHTML),o.setData("text/plain",a)):function(t,e){var n=e.ownerDocument,r=n.body.appendChild(n.createElement("div"));r.appendChild(e),r.style.cssText="position: fixed; left: -10000px; top: 10px";var o=getSelection(),i=n.createRange();i.selectNodeContents(e),t.dom.blur(),o.removeAllRanges(),o.addRange(i),setTimeout(function(){n.body.removeChild(r),t.focus()},50)}(t,s),r&&t.dispatch(t.state.tr.deleteSelection().scrollIntoView().setMeta("uiEvent","cut"))}},$t.paste=function(t,e){var n,r,o,i,s,a=Qt?null:e.clipboardData;a&&Yt(t,a.getData("text/plain"),a.getData("text/html"),e)?e.preventDefault():(r=e,o=(n=t).dom.ownerDocument,i=n.shiftKey||n.state.selection.$from.parent.type.spec.code,s=o.body.appendChild(o.createElement(i?"textarea":"div")),i||(s.contentEditable="true"),s.style.cssText="position: fixed; left: -10000px; top: 10px",s.focus(),setTimeout(function(){n.focus(),o.body.removeChild(s),i?Yt(n,s.value,null,r):Yt(n,s.textContent,s.innerHTML,r)},50))};var Zt=function(t,e){this.slice=t,this.move=e},te=M.mac?"altKey":"ctrlKey";for(var ee in zt.dragstart=function(t,e){var n=t.mouseDown;if(n&&n.done(),e.dataTransfer){var r=t.state.selection,o=r.empty?null:t.posAtCoords(jt(e));if(o&&o.pos>=r.from&&o.pos<=(r instanceof Ae.NodeSelection?r.to-1:r.to));else if(n&&n.mightDrag)t.dispatch(t.state.tr.setSelection(Ae.NodeSelection.create(t.state.doc,n.mightDrag.pos)));else if(e.target&&1==e.target.nodeType){var i=t.docView.nearestDesc(e.target,!0);if(!i||!i.node.type.spec.draggable||i==t.docView)return;t.dispatch(t.state.tr.setSelection(Ae.NodeSelection.create(t.state.doc,i.posBefore)))}var s=t.state.selection.content(),a=At(t,s),c=a.dom,l=a.text;e.dataTransfer.clearData(),e.dataTransfer.setData(Qt?"Text":"text/html",c.innerHTML),Qt||e.dataTransfer.setData("text/plain",l),t.dragging=new Zt(s,!e[te])}},zt.dragend=function(t){window.setTimeout(function(){return t.dragging=null},50)},$t.dragover=$t.dragenter=function(t,e){return e.preventDefault()},$t.drop=function(e,n){var r=e.dragging;if(e.dragging=null,n.dataTransfer){var t=e.posAtCoords(jt(n));if(t){var o=e.state.doc.resolve(t.pos);if(o){var i=r&&r.slice||Nt(e,n.dataTransfer.getData(Qt?"Text":"text/plain"),Qt?null:n.dataTransfer.getData("text/html"),!1,o);if(i&&(n.preventDefault(),!e.someProp("handleDrop",function(t){return t(e,n,i,r&&r.move)}))){var s=i?Te.dropPoint(e.state.doc,o.pos,i):o.pos;null==s&&(s=o.pos);var a=e.state.tr;r&&r.move&&a.deleteSelection();var c=a.mapping.map(s),l=0==i.openStart&&0==i.openEnd&&1==i.content.childCount,p=a.doc;if(l?a.replaceRangeWith(c,c,i.content.firstChild):a.replaceRange(c,c,i),!a.doc.eq(p)){var u=a.doc.resolve(c);l&&Ae.NodeSelection.isSelectable(i.content.firstChild)&&u.nodeAfter&&u.nodeAfter.sameMarkup(i.content.firstChild)?a.setSelection(new Ae.NodeSelection(u)):a.setSelection(gt(e,u,a.doc.resolve(a.mapping.map(s)))),e.focus(),e.dispatch(a.setMeta("uiEvent","drop"))}}}}}},zt.focus=function(t){t.focused||(t.dom.classList.add("ProseMirror-focused"),t.focused=!0)},zt.blur=function(t){t.focused&&(t.dom.classList.remove("ProseMirror-focused"),t.focused=!1)},$t)zt[ee]=$t[ee];function ne(t,e){if(t==e)return!0;for(var n in t)if(t[n]!==e[n])return!1;for(var r in e)if(!(r in t))return!1;return!0}var re=function(t,e){this.spec=e||le,this.side=this.spec.side||0,this.toDOM=t};re.prototype.map=function(t,e,n,r){var o=t.mapResult(e.from+r,this.side<0?-1:1),i=o.pos;return o.deleted?null:new se(i-n,i-n,this)},re.prototype.valid=function(){return!0},re.prototype.eq=function(t){return this==t||t instanceof re&&(this.spec.key&&this.spec.key==t.spec.key||this.toDOM==t.toDOM&&ne(this.spec,t.spec))};var oe=function(t,e){this.spec=e||le,this.attrs=t};oe.prototype.map=function(t,e,n,r){var o=t.map(e.from+r,this.spec.inclusiveStart?-1:1)-n,i=t.map(e.to+r,this.spec.inclusiveEnd?1:-1)-n;return i<=o?null:new se(o,i,this)},oe.prototype.valid=function(t,e){return e.from<e.to},oe.prototype.eq=function(t){return this==t||t instanceof oe&&ne(this.attrs,t.attrs)&&ne(this.spec,t.spec)},oe.is=function(t){return t.type instanceof oe};var ie=function(t,e){this.spec=e||le,this.attrs=t};ie.prototype.map=function(t,e,n,r){var o=t.mapResult(e.from+r,1);if(o.deleted)return null;var i=t.mapResult(e.to+r,-1);return i.deleted||i.pos<=o.pos?null:new se(o.pos-n,i.pos-n,this)},ie.prototype.valid=function(t,e){var n=t.content.findIndex(e.from),r=n.index,o=n.offset;return o==e.from&&o+t.child(r).nodeSize==e.to},ie.prototype.eq=function(t){return this==t||t instanceof ie&&ne(this.attrs,t.attrs)&&ne(this.spec,t.spec)};var se=function(t,e,n){this.from=t,this.to=e,this.type=n},ae={spec:{}};se.prototype.copy=function(t,e){return new se(t,e,this.type)},se.prototype.eq=function(t){return this.type.eq(t.type)&&this.from==t.from&&this.to==t.to},se.prototype.map=function(t,e,n){return this.type.map(t,this,e,n)},se.widget=function(t,e,n){return new se(t,t,new re(e,n))},se.inline=function(t,e,n,r){return new se(t,e,new oe(n,r))},se.node=function(t,e,n,r){return new se(t,e,new ie(n,r))},ae.spec.get=function(){return this.type.spec},Object.defineProperties(se.prototype,ae);var ce=[],le={},pe=function(t,e){this.local=t&&t.length?t:ce,this.children=e&&e.length?e:ce};pe.create=function(t,e){return e.length?ve(e,t,0,le):ue},pe.prototype.find=function(t,e,n){var r=[];return this.findInner(null==t?0:t,null==e?1e9:e,r,0,n),r},pe.prototype.findInner=function(t,e,n,r,o){for(var i=0;i<this.local.length;i++){var s=this.local[i];s.from<=e&&s.to>=t&&(!o||o(s.spec))&&n.push(s.copy(s.from+r,s.to+r))}for(var a=0;a<this.children.length;a+=3)if(this.children[a]<e&&this.children[a+1]>t){var c=this.children[a]+1;this.children[a+2].findInner(t-c,e-c,n,r+c,o)}},pe.prototype.map=function(t,e,n){return this==ue||0==t.maps.length?this:this.mapInner(t,e,0,0,n||le)},pe.prototype.mapInner=function(t,e,n,r,o){for(var i,s=0;s<this.local.length;s++){var a=this.local[s].map(t,n,r);a&&a.type.valid(e,a)?(i||(i=[])).push(a):o.onRemove&&o.onRemove(this.local[s].spec)}return this.children.length?function(t,e,n,r,a,c,o){for(var l=t.slice(),i=function(t,e,n,r){for(var o=0;o<l.length;o+=3){var i=l[o+1],s=void 0;-1==i||i+c<t||(e>=l[o]+c?l[o+1]=-1:(s=r-n-(e-t)+(c-a))&&(l[o]+=s,l[o+1]+=s))}},s=0;s<n.maps.length;s++)n.maps[s].forEach(i);for(var p=!1,u=0;u<l.length;u+=3)if(-1==l[u+1]){var f=n.map(l[u]+c),h=f-a;if(h<0||h>=r.content.size){p=!0;continue}var d=n.map(t[u+1]+c,-1),m=d-a,v=r.content.findIndex(h),g=v.index,y=v.offset,w=r.maybeChild(g);if(w&&y==h&&y+w.nodeSize==m){var b=l[u+2].mapInner(n,w,f+1,l[u]+c+1,o);b!=ue?(l[u]=h,l[u+1]=m,l[u+2]=b):(l.splice(u,3),u-=3)}else p=!0}if(p){var S=function(t,i,s,a,e,c){function l(t,e){for(var n=0;n<t.local.length;n++){var r=t.local[n].map(s,a,e);r?i.push(r):c.onRemove&&c.onRemove(t.local[n].spec)}for(var o=0;o<t.children.length;o+=3)l(t.children[o+2],t.children[o]+e+1)}for(var n=0;n<t.length;n+=3)-1==t[n+1]&&l(t[n+2],t[n]+e+1);return i}(l,e?he(e,a):[],n,a,c,o),C=ve(S,r,0,o);e=C.local;for(var k=0;k<l.length;k+=3)-1==l[k+1]&&(l.splice(k,3),k-=3);for(var x=0,M=0;x<C.children.length;x+=3){for(var O=C.children[x];M<l.length&&l[M]<O;)M+=3;l.splice(M,0,C.children[x],C.children[x+1],C.children[x+2])}}return new pe(e&&e.sort(ge),l)}(this.children,i,t,e,n,r,o):i?new pe(i.sort(ge)):ue},pe.prototype.add=function(t,e){return e.length?this==ue?pe.create(t,e):this.addInner(t,e,0):this},pe.prototype.addInner=function(t,o,i){var s,a=this,c=0;t.forEach(function(t,e){var n,r=e+i;if(n=de(o,t,r)){for(s||(s=a.children.slice());c<s.length&&s[c]<e;)c+=3;s[c]==e?s[c+2]=s[c+2].addInner(t,n,r+1):s.splice(c,0,e,e+t.nodeSize,ve(n,t,r+1,le)),c+=3}});var e=he(c?me(o):o,-i);return new pe(e.length?this.local.concat(e).sort(ge):this.local,s||this.children)},pe.prototype.remove=function(t){return 0==t.length||this==ue?this:this.removeInner(t,0)},pe.prototype.removeInner=function(t,e){for(var n=this.children,r=this.local,o=0;o<n.length;o+=3){for(var i=void 0,s=n[o]+e,a=n[o+1]+e,c=0,l=void 0;c<t.length;c++)(l=t[c])&&l.from>s&&l.to<a&&(t[c]=null,(i||(i=[])).push(l));if(i){n==this.children&&(n=this.children.slice());var p=n[o+2].removeInner(i,s+1);p!=ue?n[o+2]=p:(n.splice(o,3),o-=3)}}if(r.length)for(var u=0,f=void 0;u<t.length;u++)if(f=t[u])for(var h=0;h<r.length;h++)r[h].type.eq(f.type)&&(r==this.local&&(r=this.local.slice()),r.splice(h--,1));return n==this.children&&r==this.local?this:r.length||n.length?new pe(r,n):ue},pe.prototype.forChild=function(t,e){var n,r;if(this==ue)return this;if(e.isLeaf)return pe.empty;for(var o=0;o<this.children.length;o+=3)if(this.children[o]>=t){this.children[o]==t&&(n=this.children[o+2]);break}for(var i=t+1,s=i+e.content.size,a=0;a<this.local.length;a++){var c=this.local[a];if(c.from<s&&c.to>i&&c.type instanceof oe){var l=Math.max(i,c.from)-i,p=Math.min(s,c.to)-i;l<p&&(r||(r=[])).push(c.copy(l,p))}}if(r){var u=new pe(r.sort(ge));return n?new fe([u,n]):u}return n||ue},pe.prototype.eq=function(t){if(this==t)return!0;if(!(t instanceof pe)||this.local.length!=t.local.length||this.children.length!=t.children.length)return!1;for(var e=0;e<this.local.length;e++)if(!this.local[e].eq(t.local[e]))return!1;for(var n=0;n<this.children.length;n+=3)if(this.children[n]!=t.children[n]||this.children[n+1]!=t.children[n+1]||!this.children[n+2].eq(t.children[n+2]))return!1;return!1},pe.prototype.locals=function(t){return ye(this.localsInner(t))},pe.prototype.localsInner=function(t){if(this==ue)return ce;if(t.inlineContent||!this.local.some(oe.is))return this.local;for(var e=[],n=0;n<this.local.length;n++)this.local[n].type instanceof oe||e.push(this.local[n]);return e};var ue=new pe;pe.empty=ue,pe.removeOverlap=ye;var fe=function(t){this.members=t};function he(t,e){if(!e||!t.length)return t;for(var n=[],r=0;r<t.length;r++){var o=t[r];n.push(new se(o.from+e,o.to+e,o.type))}return n}function de(t,e,n){if(e.isLeaf)return null;for(var r=n+e.nodeSize,o=null,i=0,s=void 0;i<t.length;i++)(s=t[i])&&s.from>n&&s.to<r&&((o||(o=[])).push(s),t[i]=null);return o}function me(t){for(var e=[],n=0;n<t.length;n++)null!=t[n]&&e.push(t[n]);return e}function ve(o,t,i,s){var a=[],c=!1;t.forEach(function(t,e){var n=de(o,t,e+i);if(n){c=!0;var r=ve(n,t,i+e+1,s);r!=ue&&a.push(e,e+t.nodeSize,r)}});for(var e=he(c?me(o):o,-i).sort(ge),n=0;n<e.length;n++)e[n].type.valid(t,e[n])||(s.onRemove&&s.onRemove(e[n].spec),e.splice(n--,1));return e.length||a.length?new pe(e,a):ue}function ge(t,e){return t.from-e.from||t.to-e.to}function ye(t){for(var e=t,n=0;n<e.length-1;n++){var r=e[n];if(r.from!=r.to)for(var o=n+1;o<e.length;o++){var i=e[o];if(i.from!=r.from){i.from<r.to&&(e==t&&(e=t.slice()),e[n]=r.copy(r.from,i.from),we(e,o,r.copy(i.from,r.to)));break}i.to!=r.to&&(e==t&&(e=t.slice()),e[o]=i.copy(i.from,r.to),we(e,o+1,i.copy(r.to,i.to)))}}return e}function we(t,e,n){for(;e<t.length&&0<ge(n,t[e]);)e++;t.splice(e,0,n)}function be(n){var r=[];return n.someProp("decorations",function(t){var e=t(n.state);e&&e!=ue&&r.push(e)}),n.cursorWrapper&&r.push(pe.create(n.state.doc,[n.cursorWrapper.deco])),fe.from(r)}fe.prototype.forChild=function(t,e){if(e.isLeaf)return pe.empty;for(var n=[],r=0;r<this.members.length;r++){var o=this.members[r].forChild(t,e);o!=ue&&(o instanceof fe?n=n.concat(o.members):n.push(o))}return fe.from(n)},fe.prototype.eq=function(t){if(!(t instanceof fe)||t.members.length!=this.members.length)return!1;for(var e=0;e<this.members.length;e++)if(!this.members[e].eq(t.members[e]))return!1;return!0},fe.prototype.locals=function(t){for(var e,n=!0,r=0;r<this.members.length;r++){var o=this.members[r].localsInner(t);if(o.length)if(e){n&&(e=e.slice(),n=!1);for(var i=0;i<o.length;i++)e.push(o[i])}else e=o}return e?ye(n?e:e.sort(ge)):ce},fe.from=function(t){switch(t.length){case 0:return ue;case 1:return t[0];default:return new fe(t)}};var Se=function(t,e){this._props=e,this.state=e.state,this.dispatch=this.dispatch.bind(this),this._root=null,this.focused=!1,this.dom=t&&t.mount||document.createElement("div"),t&&(t.appendChild?t.appendChild(this.dom):t.apply?t(this.dom):t.mount&&(this.mounted=!0)),this.editable=Me(this),this.cursorWrapper=null,xe(this),this.docView=_(this.state.doc,ke(this),be(this),this.dom,this),this.lastSelectedViewDesc=null,this.dragging=null,function(n){n.shiftKey=!1,n.mouseDown=null,n.inDOMChange=null,n.lastKeyCode=null,n.lastKeyCodeTime=0,n.domObserver=new It(n),n.domObserver.start(),n.eventHandlers=Object.create(null);var t=function(t){var e=zt[t];n.dom.addEventListener(t,n.eventHandlers[t]=function(t){!function(t,e){if(!e.bubbles)return!0;if(e.defaultPrevented)return!1;for(var n=e.target;n!=t.dom;n=n.parentNode)if(!n||11==n.nodeType||n.pmViewDesc&&n.pmViewDesc.stopEvent(e))return!1;return!0}(n,t)||Bt(n,t)||!n.editable&&t.type in $t||e(n,t)})};for(var e in zt)t(e);Ft(n)}(this),this.selectionReader=new pt(this),this.pluginViews=[],this.updatePluginViews()},Ce={props:{},root:{}};function ke(n){var r=Object.create(null);return r.class="ProseMirror"+(n.focused?" ProseMirror-focused":""),r.contenteditable=String(n.editable),n.someProp("attributes",function(t){if("function"==typeof t&&(t=t(n.state)),t)for(var e in t)"class"==e?r.class+=" "+t[e]:r[e]||"contenteditable"==e||"nodeName"==e||(r[e]=String(t[e]))}),[se.node(0,n.state.doc.content.size,r)]}function xe(t){var e,n,r=St(t.state);if(!r||M.ie&&t.mouseDown)t.cursorWrapper=null;else{var o,i=t.state.selection.visible,s=t.state.storedMarks||r.marks();t.cursorWrapper&&Oe.Mark.sameSet(t.cursorWrapper.deco.spec.marks,s)&&"\ufeff"==t.cursorWrapper.dom.textContent&&t.cursorWrapper.deco.spec.visible==i?t.cursorWrapper.deco.pos!=r.pos&&(o=t.cursorWrapper.dom):(e=i,(n=document.createElement("span")).textContent="\ufeff",e||(n.style.position="absolute",n.style.left="-100000px"),o=n),o&&(t.cursorWrapper={dom:o,deco:se.widget(r.pos,o,{isCursorWrapper:!0,marks:s,raw:!0,visible:i})})}}function Me(e){return!e.someProp("editable",function(t){return!1===t(e.state)})}Ce.props.get=function(){if(this._props.state!=this.state){var t=this._props;for(var e in this._props={},t)this._props[e]=t[e];this._props.state=this.state}return this._props},Se.prototype.update=function(t){t.handleDOMEvents!=this._props.handleDOMEvents&&Ft(this),this._props=t,this.updateState(t.state)},Se.prototype.setProps=function(t){var e={};for(var n in this._props)e[n]=this._props[n];for(var r in e.state=this.state,t)e[r]=t[r];this.update(e)},Se.prototype.updateState=function(t){var e=this,n=this.state;if(this.state=t,n.plugins!=t.plugins&&Ft(this),this.domObserver.flush(),!this.inDOMChange||!this.inDOMChange.stateUpdated(t)){var r=this.editable;this.editable=Me(this),xe(this);var o=be(this),i=ke(this),s=n.config!=t.config?"reset":t.scrollToSelection>n.scrollToSelection?"to selection":"preserve",a=!this.docView.matchesNode(t.doc,i,o),c=a||!t.selection.eq(n.selection)||this.selectionReader.domChanged(),l="preserve"==s&&c&&function(t){for(var e,n,r=t.dom.getBoundingClientRect(),o=Math.max(0,r.top),i=t.dom.ownerDocument,s=(r.left+r.right)/2,a=o+1;a<Math.min(innerHeight,r.bottom);a+=5){var c=t.root.elementFromPoint(s,a);if(c!=t.dom&&t.dom.contains(c)){var l=c.getBoundingClientRect();if(l.top>=o-20){e=c,n=l.top;break}}}for(var p=[],u=t.dom;u&&(p.push({dom:u,top:u.scrollTop,left:u.scrollLeft}),u!=i.body);u=f(u));return{refDOM:e,refTop:n,stack:p}}(this);c&&(this.domObserver.stop(),a&&(this.docView.update(t.doc,i,o,this)||(this.docView.destroy(),this.docView=_(t.doc,i,o,this.dom,this)),this.selectionReader.clearDOMState()),ht(this),this.domObserver.start()),r!=this.editable&&this.selectionReader.editableChanged(),this.updatePluginViews(n),"reset"==s?this.dom.scrollTop=0:"to selection"==s?this.someProp("handleScrollToSelection",function(t){return t(e)})||(t.selection instanceof Ae.NodeSelection?p(this,this.docView.domAfterPos(t.selection.from).getBoundingClientRect()):p(this,this.coordsAtPos(t.selection.head))):l&&function(t){for(var e=t.refDOM,n=t.refTop,r=t.stack,o=e?e.getBoundingClientRect().top:0,i=0==o?0:o-n,s=0;s<r.length;s++){var a=r[s],c=a.dom,l=a.top,p=a.left;c.scrollTop!=l+i&&(c.scrollTop=l+i),c.scrollLeft!=p&&(c.scrollLeft=p)}}(l)}},Se.prototype.destroyPluginViews=function(){for(var t;t=this.pluginViews.pop();)t.destroy&&t.destroy()},Se.prototype.updatePluginViews=function(t){var e=this.state.plugins;if(t&&t.plugins==e)for(var n=0;n<this.pluginViews.length;n++){var r=this.pluginViews[n];r.update&&r.update(this,t)}else{this.destroyPluginViews();for(var o=0;o<e.length;o++){var i=e[o];i.spec.view&&this.pluginViews.push(i.spec.view(this))}}},Se.prototype.someProp=function(t,e){var n,r=this._props&&this._props[t];if(null!=r&&(n=e?e(r):r))return n;var o=this.state.plugins;if(o)for(var i=0;i<o.length;i++){var s=o[i].props[t];if(null!=s&&(n=e?e(s):s))return n}},Se.prototype.hasFocus=function(){return this.root.activeElement==this.dom},Se.prototype.focus=function(){this.domObserver.stop(),ht(this,!0),this.domObserver.start(),this.editable&&this.dom.focus()},Ce.root.get=function(){var t=this._root;if(null==t)for(var e=this.dom.parentNode;e;e=e.parentNode)if(9==e.nodeType||11==e.nodeType&&e.host)return this._root=e;return t||document},Se.prototype.posAtCoords=function(t){var e=u(this,t);return this.inDOMChange&&e&&(e.pos=this.inDOMChange.mapping.map(e.pos),-1!=e.inside&&(e.inside=this.inDOMChange.mapping.map(e.inside))),e},Se.prototype.coordsAtPos=function(t){return this.inDOMChange&&(t=this.inDOMChange.mapping.invert().map(t)),h(this,t)},Se.prototype.domAtPos=function(t){return this.inDOMChange&&(t=this.inDOMChange.mapping.invert().map(t)),this.docView.domFromPos(t)},Se.prototype.nodeDOM=function(t){this.inDOMChange&&(t=this.inDOMChange.mapping.invert().map(t));var e=this.docView.descAt(t);return e?e.nodeDOM:null},Se.prototype.posAtDOM=function(t,e,n){void 0===n&&(n=-1);var r=this.docView.posFromDOM(t,e,n);if(null==r)throw new RangeError("DOM position not inside the editor");return this.inDOMChange&&(r=this.inDOMChange.mapping.map(r)),r},Se.prototype.endOfTextblock=function(t,e){return x(this,e||this.state,t)},Se.prototype.destroy=function(){this.docView&&(!function(t){for(var e in t.domObserver.stop(),t.inDOMChange&&t.inDOMChange.destroy(),t.eventHandlers)t.dom.removeEventListener(e,t.eventHandlers[e])}(this),this.destroyPluginViews(),this.selectionReader.destroy(),this.mounted?(this.docView.update(this.state.doc,[],be(this),this),this.dom.textContent=""):this.dom.parentNode&&this.dom.parentNode.removeChild(this.dom),this.docView.destroy(),this.docView=null)},Se.prototype.dispatchEvent=function(t){var e,n;Bt(e=this,n=t)||!zt[n.type]||!e.editable&&n.type in $t||zt[n.type](e,n)},Se.prototype.dispatch=function(t){var e=this._props.dispatchTransaction;e?e.call(this,t):this.updateState(this.state.apply(t))},Object.defineProperties(Se.prototype,Ce),e.EditorView=Se,e.Decoration=se,e.DecorationSet=pe,e.__serializeForClipboard=At,e.__parseFromClipboard=Nt}));e(lt);var l=lt.EditorView,p=(lt.Decoration,lt.DecorationSet,lt.__serializeForClipboard,lt.__parseFromClipboard,r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var c="undefined"!=typeof navigator&&/gecko\/\d/i.test(navigator.userAgent),l="undefined"!=typeof navigator&&/linux/i.test(navigator.platform);function p(t,e){var n=t&&t.width||1;return"border-"+e+": "+n+"px solid "+(t&&t.color||"black")+"; margin-"+e+": -"+n+"px"}e.dropCursor=function(o){function i(t,e){t.dispatch(t.state.tr.setMeta(a,e))}var n=null;function s(t,e){clearTimeout(n),n=setTimeout(function(){a.getState(t.state)&&i(t,{type:"remove"})},e)}var a=new Ae.Plugin({state:{init:function(){return null},apply:function(t,e,n){if(c&&l)return null;var r="drop"==t.getMeta("uiEvent")?{type:"remove"}:t.getMeta(a);return r?"set"==r.type?function(t,e,n){var r,o,i,s=t.doc.resolve(e);if(s.parent.inlineContent||((o=s.nodeBefore)?r=lt.Decoration.node(e-o.nodeSize,e,{nodeName:"div",style:p(n,"right")}):(i=s.nodeAfter)&&(r=lt.Decoration.node(e,e+i.nodeSize,{nodeName:"div",style:p(n,"left")}))),!r){var a=document.createElement("span");a.textContent="\u200b",a.style.cssText=p(n,"left")+"; display: inline-block; pointer-events: none",r=lt.Decoration.widget(e,a)}return{pos:e,deco:lt.DecorationSet.create(t.doc,[r])}}(n,r.pos,o):null:e}},props:{handleDOMEvents:{dragover:function(t,e){var n=a.getState(t.state),r=t.posAtCoords({left:e.clientX,top:e.clientY});if(r){var o=r.pos;t.dragging&&t.dragging.slice&&null==(o=Te.dropPoint(t.state.doc,o,t.dragging.slice))&&(o=r.pos),n&&n.pos==o||i(t,{type:"set",pos:o})}return s(t,5e3),!1},dragend:function(t){return s(t,20),!1},drop:function(t){return s(t,20),!1},dragleave:function(t,e){return e.target!=t.dom&&t.dom.contains(e.relatedTarget)||i(t,{type:"remove"}),!1}},decorations:function(t){var e=a.getState(t);return e&&e.deco}}});return a}}));e(p);for(var u=p.dropCursor,f={8:"Backspace",9:"Tab",10:"Enter",12:"NumLock",13:"Enter",16:"Shift",17:"Control",18:"Alt",20:"CapsLock",27:"Escape",32:" ",33:"PageUp",34:"PageDown",35:"End",36:"Home",37:"ArrowLeft",38:"ArrowUp",39:"ArrowRight",40:"ArrowDown",44:"PrintScreen",45:"Insert",46:"Delete",59:";",61:"=",91:"Meta",92:"Meta",106:"*",107:"+",108:",",109:"-",110:".",111:"/",144:"NumLock",145:"ScrollLock",160:"Shift",161:"Shift",162:"Control",163:"Control",164:"Alt",165:"Alt",173:"-",186:";",187:"=",188:",",189:"-",190:".",191:"/",192:"`",219:"[",220:"\\",221:"]",222:"'",229:"q"},h={48:")",49:"!",50:"@",51:"#",52:"$",53:"%",54:"^",55:"&",56:"*",57:"(",59:";",61:"+",173:"_",186:":",187:"+",188:"<",189:"_",190:">",191:"?",192:"~",219:"{",220:"|",221:"}",222:'"',229:"Q"},d="undefined"!=typeof navigator&&/Chrome\/(\d+)/.exec(navigator.userAgent),m="undefined"!=typeof navigator&&/Apple Computer/.test(navigator.vendor),v="undefined"!=typeof navigator&&/Gecko\/\d+/.test(navigator.userAgent),g="undefined"!=typeof navigator&&/Mac/.test(navigator.platform),y=d&&(g||+d[1]<57)||v&&g,w=0;w<10;w++)f[48+w]=f[96+w]=String(w);for(w=1;w<=24;w++)f[w+111]="F"+w;for(w=65;w<=90;w++)f[w]=String.fromCharCode(w+32),h[w]=String.fromCharCode(w);for(var b in f)h.hasOwnProperty(b)||(h[b]=f[b]);function S(t){var e=!(y&&(t.ctrlKey||t.altKey||t.metaKey)||m&&t.shiftKey&&t.key&&1==t.key.length)&&t.key||(t.shiftKey?h:f)[t.keyCode]||t.key||"Unidentified";return"Esc"==e&&(e="Escape"),"Del"==e&&(e="Delete"),"Left"==e&&(e="ArrowLeft"),"Up"==e&&(e="ArrowUp"),"Right"==e&&(e="ArrowRight"),"Down"==e&&(e="ArrowDown"),e}var C=S;S.base=f,S.shift=h;var pt=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var n,c=(n=C)&&"object"==typeof n&&"default"in n?n.default:n,l="undefined"!=typeof navigator&&/Mac/.test(navigator.platform);function r(t){var e,n,r,o,i=t.split(/-(?!$)/),s=i[i.length-1];"Space"==s&&(s=" ");for(var a=0;a<i.length-1;a++){var c=i[a];if(/^(cmd|meta|m)$/i.test(c))o=!0;else if(/^a(lt)?$/i.test(c))e=!0;else if(/^(c|ctrl|control)$/i.test(c))n=!0;else if(/^s(hift)?$/i.test(c))r=!0;else{if(!/^mod$/i.test(c))throw new Error("Unrecognized modifier name: "+c);l?o=!0:n=!0}}return e&&(s="Alt-"+s),n&&(s="Ctrl-"+s),o&&(s="Meta-"+s),r&&(s="Shift-"+s),s}function p(t,e,n){return e.altKey&&(t="Alt-"+t),e.ctrlKey&&(t="Ctrl-"+t),e.metaKey&&(t="Meta-"+t),!1!==n&&e.shiftKey&&(t="Shift-"+t),t}function o(t){var a=function(t){var e=Object.create(null);for(var n in t)e[r(n)]=t[n];return e}(t);return function(t,e){var n,r=c(e),o=1==r.length&&" "!=r,i=a[p(r,e,!o)];if(i&&i(t.state,t.dispatch,t))return!0;if(o&&(e.shiftKey||e.altKey||e.metaKey)&&(n=c.base[e.keyCode])&&n!=r){var s=a[p(n,e,!0)];if(s&&s(t.state,t.dispatch,t))return!0}return!1}}e.keymap=function(t){return new Ae.Plugin({props:{handleKeyDown:o(t)}})},e.keydownHandler=o});e(pt);var k=pt.keymap,x=(pt.keydownHandler,r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var l=function(r){function l(t){r.call(this,t,t)}return r&&(l.__proto__=r),((l.prototype=Object.create(r&&r.prototype)).constructor=l).prototype.map=function(t,e){var n=t.resolve(e.map(this.head));return l.valid(n)?new l(n):r.near(n)},l.prototype.content=function(){return Oe.Slice.empty},l.prototype.eq=function(t){return t instanceof l&&t.head==this.head},l.prototype.toJSON=function(){return{type:"gapcursor",pos:this.head}},l.fromJSON=function(t,e){if("number"!=typeof e.pos)throw new RangeError("Invalid input for GapCursor.fromJSON");return new l(t.resolve(e.pos))},l.prototype.getBookmark=function(){return new n(this.anchor)},l.valid=function(t){var e=t.parent;if(e.isTextblock||!function(t){for(var e=t.depth;0<=e;e--){var n=t.index(e);if(0!=n)for(var r=t.node(e).child(n-1);;r=r.lastChild){if(r.isTextblock)return!1;if(0==r.childCount||r.isAtom||r.type.spec.isolating)return!0}}return!0}(t)||!function(t){for(var e=t.depth;0<=e;e--){var n=t.indexAfter(e),r=t.node(e);if(n!=r.childCount)for(var o=r.child(n);;o=o.firstChild){if(o.isTextblock)return!1;if(0==o.childCount||o.isAtom||o.type.spec.isolating)return!0}}return!0}(t))return!1;var n=e.type.spec.allowGapCursor;if(null!=n)return n;var r=e.contentMatchAt(t.index()).defaultType;return r&&r.isTextblock},l.findFrom=function(t,e,n){if(!n&&l.valid(t))return t;for(var r=t.pos,o=null,i=t.depth;;i--){var s=t.node(i);if(0<e?t.indexAfter(i)<s.childCount:0<t.index(i)){o=s.maybeChild(0<e?t.indexAfter(i):t.index(i)-1);break}if(0==i)return null;r+=e;var a=t.doc.resolve(r);if(l.valid(a))return a}for(;o=0<e?o.firstChild:o.lastChild;){r+=e;var c=t.doc.resolve(r);if(l.valid(c))return c}return null},l}(Ae.Selection);l.prototype.visible=!1,Ae.Selection.jsonID("gapcursor",l);var n=function(t){this.pos=t};n.prototype.map=function(t){return new n(t.map(this.pos))},n.prototype.resolve=function(t){var e=t.resolve(this.pos);return l.valid(e)?new l(e):Ae.Selection.near(e)};var r=pt.keydownHandler({ArrowLeft:o("horiz",-1),ArrowRight:o("horiz",1),ArrowUp:o("vert",-1),ArrowDown:o("vert",1)});function o(t,a){var c="vert"==t?0<a?"down":"up":0<a?"right":"left";return function(t,e,n){var r=t.selection,o=0<a?r.$to:r.$from,i=r.empty;if(r instanceof Ae.TextSelection){if(!n.endOfTextblock(c))return!1;i=!1,o=t.doc.resolve(0<a?o.after():o.before())}var s=l.findFrom(o,a,i);return!!s&&(e&&e(t.tr.setSelection(new l(s))),!0)}}function i(t,e,n){var r=t.state.doc.resolve(e);if(!l.valid(r))return!1;var o=t.posAtCoords({left:n.clientX,top:n.clientY}).inside;return!(-1<o&&Ae.NodeSelection.isSelectable(t.state.doc.nodeAt(o)))&&(t.dispatch(t.state.tr.setSelection(new l(r))),!0)}function s(t){if(!(t.selection instanceof l))return null;var e=document.createElement("div");return e.className="ProseMirror-gapcursor",lt.DecorationSet.create(t.doc,[lt.Decoration.widget(t.selection.head,e,{key:"gapcursor"})])}e.gapCursor=function(){return new Ae.Plugin({props:{decorations:s,createSelectionBetween:function(t,e,n){if(e.pos==n.pos&&l.valid(n))return new l(n)},handleClick:i,handleKeyDown:r}})},e.GapCursor=l}));e(x);var M=x.gapCursor,O=(x.GapCursor,function(){});O.prototype.append=function(t){return t.length?(t=O.from(t),!this.length&&t||t.length<200&&this.leafAppend(t)||this.length<200&&t.leafPrepend(this)||this.appendInner(t)):this},O.prototype.prepend=function(t){return t.length?O.from(t).append(this):this},O.prototype.appendInner=function(t){return new A(this,t)},O.prototype.slice=function(t,e){return void 0===t&&(t=0),void 0===e&&(e=this.length),e<=t?O.empty:this.sliceInner(Math.max(0,t),Math.min(this.length,e))},O.prototype.get=function(t){if(!(t<0||t>=this.length))return this.getInner(t)},O.prototype.forEach=function(t,e,n){void 0===e&&(e=0),void 0===n&&(n=this.length),e<=n?this.forEachInner(t,e,n,0):this.forEachInvertedInner(t,e,n,0)},O.prototype.map=function(n,t,e){void 0===t&&(t=0),void 0===e&&(e=this.length);var r=[];return this.forEach(function(t,e){return r.push(n(t,e))},t,e),r},O.from=function(t){return t instanceof O?t:t&&t.length?new T(t):O.empty};var T=function(e){function n(t){e.call(this),this.values=t}e&&(n.__proto__=e);var t={length:{},depth:{}};return((n.prototype=Object.create(e&&e.prototype)).constructor=n).prototype.flatten=function(){return this.values},n.prototype.sliceInner=function(t,e){return 0==t&&e==this.length?this:new n(this.values.slice(t,e))},n.prototype.getInner=function(t){return this.values[t]},n.prototype.forEachInner=function(t,e,n,r){for(var o=e;o<n;o++)if(!1===t(this.values[o],r+o))return!1},n.prototype.forEachInvertedInner=function(t,e,n,r){for(var o=e-1;n<=o;o--)if(!1===t(this.values[o],r+o))return!1},n.prototype.leafAppend=function(t){if(this.length+t.length<=200)return new n(this.values.concat(t.flatten()))},n.prototype.leafPrepend=function(t){if(this.length+t.length<=200)return new n(t.flatten().concat(this.values))},t.length.get=function(){return this.values.length},t.depth.get=function(){return 0},Object.defineProperties(n.prototype,t),n}(O);O.empty=new T([]);var A=function(n){function r(t,e){n.call(this),this.left=t,this.right=e,this.length=t.length+e.length,this.depth=Math.max(t.depth,e.depth)+1}return n&&(r.__proto__=n),((r.prototype=Object.create(n&&n.prototype)).constructor=r).prototype.flatten=function(){return this.left.flatten().concat(this.right.flatten())},r.prototype.getInner=function(t){return t<this.left.length?this.left.get(t):this.right.get(t-this.left.length)},r.prototype.forEachInner=function(t,e,n,r){var o=this.left.length;return!(e<o&&!1===this.left.forEachInner(t,e,Math.min(n,o),r))&&(!(o<n&&!1===this.right.forEachInner(t,Math.max(e-o,0),Math.min(this.length,n)-o,r+o))&&void 0)},r.prototype.forEachInvertedInner=function(t,e,n,r){var o=this.left.length;return!(o<e&&!1===this.right.forEachInvertedInner(t,e-o,Math.max(n,o)-o,r+o))&&(!(n<o&&!1===this.left.forEachInvertedInner(t,Math.min(e,o),n,r))&&void 0)},r.prototype.sliceInner=function(t,e){if(0==t&&e==this.length)return this;var n=this.left.length;return e<=n?this.left.slice(t,e):n<=t?this.right.slice(t-n,e-n):this.left.slice(t,n).append(this.right.slice(0,e-n))},r.prototype.leafAppend=function(t){var e=this.right.leafAppend(t);if(e)return new r(this.left,e)},r.prototype.leafPrepend=function(t){var e=this.left.leafPrepend(t);if(e)return new r(e,this.right)},r.prototype.appendInner=function(t){return this.left.depth>=Math.max(this.right.depth,t.depth)+1?new r(this.left,new r(this.right,t)):new r(this,t)},r}(O),N=O,D=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var n,r=(n=N)&&"object"==typeof n&&"default"in n?n.default:n,v=function(t,e){this.items=t,this.eventCount=e};v.prototype.popEvent=function(t,e){var o=this;if(0==this.eventCount)return null;for(var i,s,a=this.items.length;;a--){if(o.items.get(a-1).selection){--a;break}}e&&(i=this.remapping(a,this.items.length),s=i.maps.length);var c,l,p=t.tr,u=[],f=[];return this.items.forEach(function(t,e){if(!t.step)return i||(i=o.remapping(a,e+1),s=i.maps.length),s--,void f.push(t);if(i){f.push(new g(t.map));var n,r=t.step.map(i.slice(s));r&&p.maybeStep(r).doc&&(n=p.mapping.maps[p.mapping.maps.length-1],u.push(new g(n,null,null,u.length+f.length))),s--,n&&i.appendMap(n,s)}else p.maybeStep(t.step);return t.selection?(c=i?t.selection.map(i.slice(s)):t.selection,l=new v(o.items.slice(0,a).append(f.reverse().concat(u)),o.eventCount-1),!1):void 0},this.items.length,0),{remaining:l,transform:p,selection:c}},v.prototype.addTransform=function(t,e,n,r){for(var o=[],i=this.eventCount,s=this.items,a=!r&&s.length?s.get(s.length-1):null,c=0;c<t.steps.length;c++){var l,p=t.steps[c].invert(t.docs[c]),u=new g(t.mapping.maps[c],p,e);(l=a&&a.merge(u))&&(u=l,c?o.pop():s=s.slice(0,s.length-1)),o.push(u),e&&(i++,e=null),r||(a=u)}var f,h,d,m=i-n.depth;return y<m&&(h=m,(f=s).forEach(function(t,e){if(t.selection&&0==h--)return d=e,!1}),s=f.slice(d),i-=m),new v(s.append(o),i)},v.prototype.remapping=function(r,t){var o=[],i=[];return this.items.forEach(function(t,e){if(null!=t.mirrorOffset){var n=e-t.mirrorOffset;r<=n&&i.push(o.length-t.mirrorOffset,o.length)}o.push(t.map)},r,t),new Te.Mapping(o,i)},v.prototype.addMaps=function(t){return 0==this.eventCount?this:new v(this.items.append(t.map(function(t){return new g(t)})),this.eventCount)},v.prototype.rebased=function(i,t){if(!this.eventCount)return this;var s=[],e=Math.max(0,this.items.length-t),a=i.mapping,c=i.steps.length,l=this.eventCount;this.items.forEach(function(t){t.selection&&l--},this.items.length-t);var p=t;this.items.forEach(function(t){var e=a.getMirror(--p);if(null!=e){c=Math.min(c,e);var n=a.maps[e];if(t.step){var r=i.steps[e].invert(i.docs[e]),o=t.selection&&t.selection.map(a.slice(p,e));o&&l++,s.push(new g(n,r,o))}else s.push(new g(n))}},e);for(var n=[],r=t;r<c;r++)n.push(new g(a.maps[r]));var o=this.items.slice(0,e).append(n).append(s),u=new v(o,l);return 500<u.emptyItemCount()&&(u=u.compress(this.items.length-s.length)),u},v.prototype.emptyItemCount=function(){var e=0;return this.items.forEach(function(t){t.step||e++}),e},v.prototype.compress=function(c){void 0===c&&(c=this.items.length);var l=this.remapping(0,c),p=l.maps.length,u=[],f=0;return this.items.forEach(function(t,e){if(c<=e)u.push(t),t.selection&&f++;else if(t.step){var n=t.step.map(l.slice(p)),r=n&&n.getMap();if(p--,r&&l.appendMap(r,p),n){var o=t.selection&&t.selection.map(l.slice(p));o&&f++;var i,s=new g(r.invert(),n,o),a=u.length-1;(i=u.length&&u[a].merge(s))?u[a]=i:u.push(s)}}else t.map&&p--},this.items.length,0),new v(r.from(u.reverse()),f)},v.empty=new v(r.empty,0);var g=function(t,e,n,r){this.map=t,this.step=e,this.selection=n,this.mirrorOffset=r};g.prototype.merge=function(t){if(this.step&&t.step&&!t.selection){var e=t.step.merge(this.step);if(e)return new g(e.getMap().invert(),e,this.selection)}};var p=function(t,e,n,r){this.done=t,this.undone=e,this.prevMap=n,this.prevTime=r},y=20;function o(t,e,n,r){var o=u(e),i=f.get(e).spec.config,s=(r?t.undone:t.done).popEvent(e,o);if(s){var a=s.selection.resolve(s.transform.doc),c=(r?t.done:t.undone).addTransform(s.transform,e.selection.getBookmark(),i,o),l=new p(r?c:s.remaining,r?s.remaining:c,null,0);n(s.transform.setSelection(a).setMeta(f,l).scrollIntoView())}}var i=!1,s=null;function u(t){var e=t.plugins;if(s!=e){i=!1,s=e;for(var n=0;n<e.length;n++)if(e[n].spec.historyPreserveItems){i=!0;break}}return i}var f=new Ae.PluginKey("history"),c=new Ae.PluginKey("closeHistory");e.HistoryState=p,e.closeHistory=function(t){return t.setMeta(c,!0)},e.history=function(r){return r={depth:r&&r.depth||100,newGroupDelay:r&&r.newGroupDelay||500},new Ae.Plugin({key:f,state:{init:function(){return new p(v.empty,v.empty,null,0)},apply:function(t,e,n){return function(t,e,n,r){var o,i=n.getMeta(f);if(i)return i;n.getMeta(c)&&(t=new p(t.done,t.undone,null,0));var s=n.getMeta("appendedTransaction");if(0==n.steps.length)return t;if(!1!==(s||n).getMeta("addToHistory")){var a=t.prevTime<(n.time||0)-r.newGroupDelay||!s&&!function(t,e,n){if(!e)return!1;var r=t.mapping.maps[0],s=!1;return!r||(r.forEach(function(o,i){n.items.forEach(function(t){if(t.step)return e.forEach(function(t,e,n,r){o<=r&&n<=i&&(s=!0)}),!1;o=t.map.invert().map(o,-1),i=t.map.invert().map(i,1)},n.items.length,0)}),s)}(n,t.prevMap,t.done);return new p(t.done.addTransform(n,a?e.selection.getBookmark():null,r,u(e)),v.empty,n.mapping.maps[n.steps.length-1],n.time)}return(o=n.getMeta("rebased"))?new p(t.done.rebased(n,o),t.undone.rebased(n,o),t.prevMap&&n.mapping.maps[n.steps.length-1],t.prevTime):new p(t.done.addMaps(n.mapping.maps),t.undone.addMaps(n.mapping.maps),t.prevMap,t.prevTime)}(e,n,t,r)}},config:r})},e.undo=function(t,e){var n=f.getState(t);return!(!n||0==n.done.eventCount||(e&&o(n,t,e,!1),0))},e.redo=function(t,e){var n=f.getState(t);return!(!n||0==n.undone.eventCount||(e&&o(n,t,e,!0),0))},e.undoDepth=function(t){var e=f.getState(t);return e?e.done.eventCount:0},e.redoDepth=function(t){var e=f.getState(t);return e?e.undone.eventCount:0}});e(D);D.HistoryState,D.closeHistory;var R=D.history,E=D.undo,P=D.redo,_=(D.undoDepth,D.redoDepth,r(function(t,e){function n(t,e){return!t.selection.empty&&(e&&e(t.tr.deleteSelection().scrollIntoView()),!0)}function r(t,e,n){var r=t.selection.$cursor;if(!r||(n?!n.endOfTextblock("backward",t):0<r.parentOffset))return!1;var o=p(r);if(!o){var i=r.blockRange(),s=i&&Te.liftTarget(i);return null!=s&&(e&&e(t.tr.lift(i,s).scrollIntoView()),!0)}var a=o.nodeBefore;if(!a.type.spec.isolating&&v(t,o,e))return!0;if(0==r.parent.content.size&&(l(a,"end")||Ae.NodeSelection.isSelectable(a))){if(e){var c=t.tr.deleteRange(r.before(),r.after());c.setSelection(l(a,"end")?Ae.Selection.findFrom(c.doc.resolve(c.mapping.map(o.pos,-1)),-1):Ae.NodeSelection.create(c.doc,o.pos-a.nodeSize)),e(c.scrollIntoView())}return!0}return!(!a.isAtom||o.depth!=r.depth-1)&&(e&&e(t.tr.delete(o.pos-a.nodeSize,o.pos).scrollIntoView()),!0)}function l(t,e){for(;t;t="start"==e?t.firstChild:t.lastChild)if(t.isTextblock)return!0;return!1}function o(t,e,n){var r=t.selection.$cursor;if(!r||(n?!n.endOfTextblock("backward",t):0<r.parentOffset))return!1;var o=p(r),i=o&&o.nodeBefore;return!(!i||!Ae.NodeSelection.isSelectable(i))&&(e&&e(t.tr.setSelection(Ae.NodeSelection.create(t.doc,o.pos-i.nodeSize)).scrollIntoView()),!0)}function p(t){if(!t.parent.type.spec.isolating)for(var e=t.depth-1;0<=e;e--){if(0<t.index(e))return t.doc.resolve(t.before(e+1));if(t.node(e).type.spec.isolating)break}return null}function i(t,e,n){var r=t.selection.$cursor;if(!r||(n?!n.endOfTextblock("forward",t):r.parentOffset<r.parent.content.size))return!1;var o=a(r);if(!o)return!1;var i=o.nodeAfter;if(v(t,o,e))return!0;if(0==r.parent.content.size&&(l(i,"start")||Ae.NodeSelection.isSelectable(i))){if(e){var s=t.tr.deleteRange(r.before(),r.after());s.setSelection(l(i,"start")?Ae.Selection.findFrom(s.doc.resolve(s.mapping.map(o.pos)),1):Ae.NodeSelection.create(s.doc,s.mapping.map(o.pos))),e(s.scrollIntoView())}return!0}return!(!i.isAtom||o.depth!=r.depth-1)&&(e&&e(t.tr.delete(o.pos,o.pos+i.nodeSize).scrollIntoView()),!0)}function s(t,e,n){var r=t.selection.$cursor;if(!r||(n?!n.endOfTextblock("forward",t):r.parentOffset<r.parent.content.size))return!1;var o=a(r),i=o&&o.nodeAfter;return!(!i||!Ae.NodeSelection.isSelectable(i))&&(e&&e(t.tr.setSelection(Ae.NodeSelection.create(t.doc,o.pos)).scrollIntoView()),!0)}function a(t){if(!t.parent.type.spec.isolating)for(var e=t.depth-1;0<=e;e--){var n=t.node(e);if(t.index(e)+1<n.childCount)return t.doc.resolve(t.after(e+1));if(n.type.spec.isolating)break}return null}function c(t,e){var n=t.selection,r=n.$head,o=n.$anchor;return!(!r.parent.type.spec.code||!r.sameParent(o))&&(e&&e(t.tr.insertText("\n").scrollIntoView()),!0)}function u(t,e){var n=t.selection,r=n.$head,o=n.$anchor;if(!r.parent.type.spec.code||!r.sameParent(o))return!1;var i=r.node(-1),s=r.indexAfter(-1),a=i.contentMatchAt(s).defaultType;if(!i.canReplaceWith(s,s,a))return!1;if(e){var c=r.after(),l=t.tr.replaceWith(c,c,a.createAndFill());l.setSelection(Ae.Selection.near(l.doc.resolve(c),1)),e(l.scrollIntoView())}return!0}function f(t,e){var n=t.selection,r=n.$from,o=n.$to;if(r.parent.inlineContent||o.parent.inlineContent)return!1;var i=r.parent.contentMatchAt(o.indexAfter()).defaultType;if(!i||!i.isTextblock)return!1;if(e){var s=(!r.parentOffset&&o.index()<o.parent.childCount?r:o).pos,a=t.tr.insert(s,i.createAndFill());a.setSelection(Ae.TextSelection.create(a.doc,s+1)),e(a.scrollIntoView())}return!0}function h(t,e){var n=t.selection.$cursor;if(!n||n.parent.content.size)return!1;if(1<n.depth&&n.after()!=n.end(-1)){var r=n.before();if(Te.canSplit(t.doc,r))return e&&e(t.tr.split(r).scrollIntoView()),!0}var o=n.blockRange(),i=o&&Te.liftTarget(o);return null!=i&&(e&&e(t.tr.lift(o,i).scrollIntoView()),!0)}function d(t,e){var n=t.selection,r=n.$from,o=n.$to;if(t.selection instanceof Ae.NodeSelection&&t.selection.node.isBlock)return!(!r.parentOffset||!Te.canSplit(t.doc,r.pos))&&(e&&e(t.tr.split(r.pos).scrollIntoView()),!0);if(!r.parent.isBlock)return!1;if(e){var i=o.parentOffset==o.parent.content.size,s=t.tr;t.selection instanceof Ae.TextSelection&&s.deleteSelection();var a=0==r.depth?null:r.node(-1).contentMatchAt(r.indexAfter(-1)).defaultType,c=i&&a?[{type:a}]:null,l=Te.canSplit(s.doc,r.pos,1,c);c||l||!Te.canSplit(s.doc,s.mapping.map(r.pos),1,a&&[{type:a}])||(c=[{type:a}],l=!0),l&&(s.split(s.mapping.map(r.pos),1,c),i||r.parentOffset||r.parent.type==a||!r.node(-1).canReplace(r.index(-1),r.indexAfter(-1),Oe.Fragment.from(a.create(),r.parent))||s.setNodeMarkup(s.mapping.map(r.before()),a)),e(s.scrollIntoView())}return!0}function m(t,e){return e&&e(t.tr.setSelection(new Ae.AllSelection(t.doc))),!0}function v(t,e,n){var r,o,i,s,a,c,l,p,u=e.nodeBefore,f=e.nodeAfter;if(u.type.spec.isolating||f.type.spec.isolating)return!1;if(i=t,a=n,c=(s=e).nodeBefore,l=s.nodeAfter,p=s.index(),c&&l&&c.type.compatibleContent(l.type)&&(!c.content.size&&s.parent.canReplace(p-1,p)?(a&&a(i.tr.delete(s.pos-c.nodeSize,s.pos).scrollIntoView()),1):s.parent.canReplace(p,p+1)&&(l.isTextblock||Te.canJoin(i.doc,s.pos))&&(a&&a(i.tr.clearIncompatible(s.pos,c.type,c.contentMatchAt(c.childCount)).join(s.pos).scrollIntoView()),1)))return!0;if(e.parent.canReplace(e.index(),e.index()+1)&&(r=(o=u.contentMatchAt(u.childCount)).findWrapping(f.type))&&o.matchType(r[0]||f.type).validEnd){if(n){for(var h=e.pos+f.nodeSize,d=Oe.Fragment.empty,m=r.length-1;0<=m;m--)d=Oe.Fragment.from(r[m].create(null,d));d=Oe.Fragment.from(u.copy(d));var v=t.tr.step(new Te.ReplaceAroundStep(e.pos-1,h,e.pos,h,new Oe.Slice(d,1,0),r.length,!0)),g=h+2*r.length;Te.canJoin(v.doc,g)&&v.join(g),n(v.scrollIntoView())}return!0}var y=Ae.Selection.findFrom(e,1),w=y&&y.$from.blockRange(y.$to),b=w&&Te.liftTarget(w);return null!=b&&b>=e.depth&&(n&&n(t.tr.lift(w,b).scrollIntoView()),!0)}function g(){for(var t=arguments,o=[],e=arguments.length;e--;)o[e]=t[e];return function(t,e,n){for(var r=0;r<o.length;r++)if(o[r](t,e,n))return!0;return!1}}Object.defineProperty(e,"__esModule",{value:!0});var y=g(n,r,o),w=g(n,i,s),b={Enter:g(c,f,h,d),"Mod-Enter":u,Backspace:y,"Mod-Backspace":y,Delete:w,"Mod-Delete":w,"Mod-a":m},S={"Ctrl-h":b.Backspace,"Alt-Backspace":b["Mod-Backspace"],"Ctrl-d":b.Delete,"Ctrl-Alt-Backspace":b["Mod-Delete"],"Alt-Delete":b["Mod-Delete"],"Alt-d":b["Mod-Delete"]};for(var C in b)S[C]=b[C];var k=("undefined"!=typeof navigator?/Mac/.test(navigator.platform):"undefined"!=typeof os&&"darwin"==os.platform())?S:b;e.deleteSelection=n,e.joinBackward=r,e.selectNodeBackward=o,e.joinForward=i,e.selectNodeForward=s,e.joinUp=function(t,e){var n,r=t.selection,o=r instanceof Ae.NodeSelection;if(o){if(r.node.isTextblock||!Te.canJoin(t.doc,r.from))return!1;n=r.from}else if(null==(n=Te.joinPoint(t.doc,r.from,-1)))return!1;if(e){var i=t.tr.join(n);o&&i.setSelection(Ae.NodeSelection.create(i.doc,n-t.doc.resolve(n).nodeBefore.nodeSize)),e(i.scrollIntoView())}return!0},e.joinDown=function(t,e){var n,r=t.selection;if(r instanceof Ae.NodeSelection){if(r.node.isTextblock||!Te.canJoin(t.doc,r.to))return!1;n=r.to}else if(null==(n=Te.joinPoint(t.doc,r.to,1)))return!1;return e&&e(t.tr.join(n).scrollIntoView()),!0},e.lift=function(t,e){var n=t.selection,r=n.$from,o=n.$to,i=r.blockRange(o),s=i&&Te.liftTarget(i);return null!=s&&(e&&e(t.tr.lift(i,s).scrollIntoView()),!0)},e.newlineInCode=c,e.exitCode=u,e.createParagraphNear=f,e.liftEmptyBlock=h,e.splitBlock=d,e.splitBlockKeepMarks=function(n,r){return d(n,r&&function(t){var e=n.storedMarks||n.selection.$to.parentOffset&&n.selection.$from.marks();e&&t.ensureMarks(e),r(t)})},e.selectParentNode=function(t,e){var n,r=t.selection,o=r.$from,i=r.to,s=o.sharedDepth(i);return 0!=s&&(n=o.before(s),e&&e(t.tr.setSelection(Ae.NodeSelection.create(t.doc,n))),!0)},e.selectAll=m,e.wrapIn=function(a,c){return function(t,e){var n=t.selection,r=n.$from,o=n.$to,i=r.blockRange(o),s=i&&Te.findWrapping(i,a,c);return!!s&&(e&&e(t.tr.wrap(i,s).scrollIntoView()),!0)}},e.setBlockType=function(s,a){return function(o,t){var e=o.selection,n=e.from,r=e.to,i=!1;return o.doc.nodesBetween(n,r,function(t,e){if(i)return!1;if(t.isTextblock&&!t.hasMarkup(s,a))if(t.type==s)i=!0;else{var n=o.doc.resolve(e),r=n.index();i=n.parent.canReplaceWith(r,r+1,s)}}),!!i&&(t&&t(o.tr.setBlockType(n,r,s,a).scrollIntoView()),!0)}},e.toggleMark=function(v,g){return function(t,e){var n=t.selection,r=n.empty,o=n.$cursor,i=n.ranges;if(r&&!o||!function(i,s,a){for(var t=function(t){var e=s[t],n=e.$from,r=e.$to,o=0==n.depth&&i.type.allowsMarkType(a);if(i.nodesBetween(n.pos,r.pos,function(t){if(o)return!1;o=t.inlineContent&&t.type.allowsMarkType(a)}),o)return{v:!0}},e=0;e<s.length;e++){var n=t(e);if(n)return n.v}return!1}(t.doc,i,v))return!1;if(e)if(o)v.isInSet(t.storedMarks||o.marks())?e(t.tr.removeStoredMark(v)):e(t.tr.addStoredMark(v.create(g)));else{for(var s=!1,a=t.tr,c=0;!s&&c<i.length;c++){var l=i[c],p=l.$from,u=l.$to;s=t.doc.rangeHasMark(p.pos,u.pos,v)}for(var f=0;f<i.length;f++){var h=i[f],d=h.$from,m=h.$to;s?a.removeMark(d.pos,m.pos,v):a.addMark(d.pos,m.pos,v.create(g))}e(a.scrollIntoView())}return!0}},e.autoJoin=function(n,r){if(Array.isArray(r)){var e=r;r=function(t){return-1<e.indexOf(t.type.name)}}return function(t,e){return n(t,e&&(g=e,y=r,function(t){if(!t.isGeneric)return g(t);for(var o=[],e=0;e<t.mapping.maps.length;e++){for(var n=t.mapping.maps[e],r=0;r<o.length;r++)o[r]=n.map(o[r]);n.forEach(function(t,e,n,r){return o.push(n,r)})}for(var i=[],s=0;s<o.length;s+=2)for(var a=o[s],c=o[s+1],l=t.doc.resolve(a),p=l.sharedDepth(c),u=l.node(p),f=l.indexAfter(p),h=l.after(p+1);h<=c;++f){var d=u.maybeChild(f);if(!d)break;if(f&&-1==i.indexOf(h)){var m=u.child(f-1);m.type==d.type&&y(m,d)&&i.push(h)}h+=d.nodeSize}i.sort(function(t,e){return t-e});for(var v=i.length-1;0<=v;v--)Te.canJoin(t.doc,i[v])&&t.join(i[v]);g(t)}));var g,y}},e.chainCommands=g,e.pcBaseKeymap=b,e.macBaseKeymap=S,e.baseKeymap=k}));e(_);_.deleteSelection,_.joinBackward,_.selectNodeBackward,_.joinForward,_.selectNodeForward,_.joinUp,_.joinDown;var I=_.lift,z=(_.newlineInCode,_.exitCode),$=(_.createParagraphNear,_.liftEmptyBlock,_.splitBlock,_.splitBlockKeepMarks,_.selectParentNode),F=(_.selectAll,_.wrapIn),B=_.setBlockType,j=_.toggleMark,V=(_.autoJoin,_.chainCommands),L=(_.pcBaseKeymap,_.macBaseKeymap,_.baseKeymap),J=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var n=function(t,e){var c;this.match=t,this.handler="string"==typeof e?(c=e,function(t,e,n,r){var o=c;if(e[1]){var i=e[0].lastIndexOf(e[1]);o+=e[0].slice(i+e[1].length);var s=(n+=i)-r;0<s&&(o=e[0].slice(i-s,i)+o,n=r)}var a=t.doc.resolve(n).marks();return t.tr.replaceWith(n,r,t.schema.text(o,a))}):e};var r=new n(/--$/,"\u2014"),o=new n(/\.\.\.$/,"\u2026"),i=new n(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(")$/,"\u201c"),s=new n(/"$/,"\u201d"),a=new n(/(?:^|[\s\{\[\(\<'"\u2018\u201C])(')$/,"\u2018"),c=new n(/'$/,"\u2019"),l=[i,s,a,c];e.InputRule=n,e.inputRules=function(t){var p=t.rules;return new Ae.Plugin({state:{init:function(){return null},apply:function(t,e){var n=t.getMeta(this);return n||(t.selectionSet||t.docChanged?null:e)}},props:{handleTextInput:function(t,e,n,r){var o=t.state,i=o.doc.resolve(e);if(i.parent.type.spec.code)return!1;for(var s=i.parent.textBetween(Math.max(0,i.parentOffset-500),i.parentOffset,null,"\ufffc")+r,a=0;a<p.length;a++){var c=p[a].match.exec(s),l=c&&p[a].handler(o,c,e-(c[0].length-r.length),n);if(l)return t.dispatch(l.setMeta(this,{transform:l,from:e,to:n,text:r})),!0}return!1}},isInputRules:!0})},e.undoInputRule=function(t,e){for(var n=t.plugins,r=0;r<n.length;r++){var o=n[r],i=void 0;if(o.spec.isInputRules&&(i=o.getState(t))){if(e){for(var s=t.tr,a=i.transform,c=a.steps.length-1;0<=c;c--)s.step(a.steps[c].invert(a.docs[c]));var l=s.doc.resolve(i.from).marks();e(s.replaceWith(i.from,i.to,t.schema.text(i.text,l)))}return!0}}return!1},e.emDash=r,e.ellipsis=o,e.openDoubleQuote=i,e.closeDoubleQuote=s,e.openSingleQuote=a,e.closeSingleQuote=c,e.smartQuotes=l,e.wrappingInputRule=function(t,l,p,u){return new n(t,function(t,e,n,r){var o=p instanceof Function?p(e):p,i=t.tr.delete(n,r),s=i.doc.resolve(n).blockRange(),a=s&&Te.findWrapping(s,l,o);if(!a)return null;i.wrap(s,a);var c=i.doc.resolve(n-1).nodeBefore;return c&&c.type==l&&Te.canJoin(i.doc,n-1)&&(!u||u(e,c))&&i.join(n-1),i})},e.textblockTypeInputRule=function(t,s,a){return new n(t,function(t,e,n,r){var o=t.doc.resolve(n),i=a instanceof Function?a(e):a;return o.node(-1).canReplaceWith(o.index(-1),o.indexAfter(-1),s)?t.tr.delete(n,r).setBlockType(n,n,s,i):null})}});e(J);J.InputRule;var W=J.inputRules,q=J.undoInputRule,K=(J.emDash,J.ellipsis,J.openDoubleQuote,J.closeDoubleQuote,J.openSingleQuote,J.closeSingleQuote,J.smartQuotes,J.wrappingInputRule),H=J.textblockTypeInputRule;var U={"Mod-z":E,"Shift-Mod-z":E,"Mod-BracketLeft":I,Backspace:q,Escape:$};X||(U["Mod-y"]=P);var G=function(t,e){var n=e.node,r=e.view,o=e.getPos,i=e.decorations,s=e.editable;this.component=t,this.node=n,this.view=r,this.getPos=o,this.decorations=i,this.editable=s,this.dom=this.createDOM(),this.contentDOM=this._vm.$refs.content};G.prototype.createDOM=function(){var e=this,t=n.extend(this.component);return this._vm=new t({propsData:{node:this.node,view:this.view,getPos:this.getPos,decorations:this.decorations,editable:this.editable,updateAttrs:function(t){return e.updateAttrs(t)},updateContent:function(t){return e.updateContent(t)}}}).$mount(),this._vm.$el},G.prototype.updateAttrs=function(t){var e=this.view.state.tr.setNodeMarkup(this.getPos(),null,Object.assign({},this.node.attrs,t));this.view.dispatch(e)},G.prototype.updateContent=function(t){var e=this.view.state.tr.setNodeMarkup(this.getPos(),this.node.type,{content:t});this.view.dispatch(e)},G.prototype.ignoreMutation=function(){return!0},G.prototype.stopEvent=function(){return!0},G.prototype.update=function(t,e){return t.type===this.node.type&&(t===this.node&&this.decorations===e||(this.node=t,this.decorations=e,this._vm._props.node=t,this._vm._props.decorations=e),!0)},G.prototype.destroy=function(){this._vm.$destroy()};var X="undefined"!=typeof navigator&&/Mac/.test(navigator.platform);var Q=r(function(t,e){var n,r;if(Object.defineProperty(e,"__esModule",{value:!0}),"undefined"!=typeof WeakMap){var o=new WeakMap;n=function(t){return o.get(t)},r=function(t,e){return o.set(t,e),e}}else{var i=[],s=0;n=function(t){for(var e=0;e<i.length;e+=2)if(i[e]==t)return i[e+1]},r=function(t,e){return 10==s&&(s=0),i[s++]=t,i[s++]=e}}var f=function(t,e,n,r){this.left=t,this.top=e,this.right=n,this.bottom=r},N=function(t,e,n,r){this.width=t,this.height=e,this.map=n,this.problems=r};function D(t){if(t.colwidth)return t.colwidth.slice();for(var e=[],n=0;n<t.colspan;n++)e.push(0);return e}N.prototype.findCell=function(t){for(var e=0;e<this.map.length;e++){var n=this.map[e];if(n==t){for(var r=e%this.width,o=e/this.width|0,i=r+1,s=o+1,a=1;i<this.width&&this.map[e+a]==n;a++)i++;for(var c=1;s<this.height&&this.map[e+this.width*c]==n;c++)s++;return new f(r,o,i,s)}}throw new RangeError("No cell with offset "+t+" found")},N.prototype.colCount=function(t){for(var e=0;e<this.map.length;e++)if(this.map[e]==t)return e%this.width;throw new RangeError("No cell with offset "+t+" found")},N.prototype.nextCell=function(t,e,n){var r=this.findCell(t),o=r.left,i=r.right,s=r.top,a=r.bottom;return"horiz"==e?(n<0?0==o:i==this.width)?null:this.map[s*this.width+(n<0?o-1:i)]:(n<0?0==s:a==this.height)?null:this.map[o+this.width*(n<0?s-1:a)]},N.prototype.rectBetween=function(t,e){var n=this.findCell(t),r=n.left,o=n.right,i=n.top,s=n.bottom,a=this.findCell(e),c=a.left,l=a.right,p=a.top,u=a.bottom;return new f(Math.min(r,c),Math.min(i,p),Math.max(o,l),Math.max(s,u))},N.prototype.cellsInRect=function(t){for(var e=[],n=[],r=t.top;r<t.bottom;r++)for(var o=t.left;o<t.right;o++){var i=r*this.width+o,s=this.map[i];-1<n.indexOf(s)||(n.push(s),o==t.left&&o&&this.map[i-1]==s||r==t.top&&r&&this.map[i-this.width]==s||e.push(s))}return e},N.prototype.positionAt=function(t,e,n){for(var r=0,o=0;;r++){var i=o+n.child(r).nodeSize;if(r==t){for(var s=e+t*this.width,a=(t+1)*this.width;s<a&&this.map[s]<o;)s++;return s==a?i-1:this.map[s]}o=i}},N.get=function(t){return n(t)||r(t,function(t){if("table"!=t.type.spec.tableRole)throw new RangeError("Not a table node: "+t.type.name);for(var e=function(t){for(var e=-1,n=!1,r=0;r<t.childCount;r++){var o=t.child(r),i=0;if(n)for(var s=0;s<r;s++)for(var a=t.child(s),c=0;c<a.childCount;c++){var l=a.child(c);s+l.attrs.rowspan>r&&(i+=l.attrs.colspan)}for(var p=0;p<o.childCount;p++){var u=o.child(p);i+=u.attrs.colspan,1<u.attrs.rowspan&&(n=!0)}-1==e?e=i:e!=i&&(e=Math.max(e,i))}return e}(t),n=t.childCount,r=[],o=0,i=null,s=[],a=0,c=e*n;a<c;a++)r[a]=0;for(var l=0,p=0;l<n;l++){var u=t.child(l);p++;for(var f=0;;f++){for(;o<r.length&&0!=r[o];)o++;if(f==u.childCount)break;for(var h=u.child(f),d=h.attrs,m=d.colspan,v=d.rowspan,g=d.colwidth,y=0;y<v;y++){if(n<=y+l){(i||(i=[])).push({type:"overlong_rowspan",pos:p,n:v-y});break}for(var w=o+y*e,b=0;b<m;b++){0==r[w+b]?r[w+b]=p:(i||(i=[])).push({type:"collision",row:l,pos:p,n:m-b});var S=g&&g[b];if(S){var C=(w+b)%e*2,k=s[C];null==k||k!=S&&1==s[C+1]?(s[C]=S,s[C+1]=1):k==S&&s[C+1]++}}}o+=m,p+=h.nodeSize}for(var x=(l+1)*e,M=0;o<x;)0==r[o++]&&M++;M&&(i||(i=[])).push({type:"missing",row:l,n:M}),p++}for(var O=new N(e,n,r,i),T=!1,A=0;!T&&A<s.length;A+=2)null!=s[A]&&s[A+1]<n&&(T=!0);T&&function(t,e,n){t.problems||(t.problems=[]);for(var r=0,o=[];r<t.map.length;r++){var i=t.map[r];if(!(-1<o.indexOf(i))){o.push(i);for(var s=n.nodeAt(i),a=null,c=0;c<s.attrs.colspan;c++){var l=(r+c)%t.width,p=e[2*l];null==p||s.attrs.colwidth&&s.attrs.colwidth[c]==p||((a||(a=D(s.attrs)))[c]=p)}a&&t.problems.unshift({type:"colwidth mismatch",pos:i,colwidth:a})}}}(O,s,t);return O}(t))};var c=new Ae.PluginKey("selectingCells");function g(t){for(var e=t.depth-1;0<e;e--)if("row"==t.node(e).type.spec.tableRole)return t.node(0).resolve(t.before(e+1));return null}function p(t){for(var e=t.selection.$head,n=e.depth;0<n;n--)if("row"==e.node(n).type.spec.tableRole)return!0;return!1}function u(t){var e=t.selection;return e.$anchorCell?e.$anchorCell.pos>e.$headCell.pos?e.$anchorCell:e.$headCell:e.node&&"cell"==e.node.type.spec.tableRole?e.$anchor:g(e.$head)||function(t){for(var e=t.nodeAfter,n=t.pos;e;e=e.firstChild,n++){var r=e.type.spec.tableRole;if("cell"==r||"header_cell"==r)return t.doc.resolve(n)}for(var o=t.nodeBefore,i=t.pos;o;o=o.lastChild,i--){var s=o.type.spec.tableRole;if("cell"==s||"header_cell"==s)return t.doc.resolve(i-o.nodeSize)}}(e.$head)}function l(t){return"row"==t.parent.type.spec.tableRole&&t.nodeAfter}function a(t){return t.node(0).resolve(t.pos+t.nodeAfter.nodeSize)}function h(t,e){return t.depth==e.depth&&t.pos>=e.start(-1)&&t.pos<=e.end(-1)}function d(t,e,n){var r=t.start(-1),o=N.get(t.node(-1)).nextCell(t.pos-r,e,n);return null==o?null:t.node(0).resolve(r+o)}function k(t,e,n){var r={};for(var o in t)r[o]=t[o];return r[e]=n,r}function x(t,e,n){void 0===n&&(n=1);var r=k(t,"colspan",t.colspan-n);return r.colwidth&&(r.colwidth=r.colwidth.slice(),r.colwidth.splice(e,n),r.colwidth.some(function(t){return 0<t})||(r.colwidth=null)),r}function y(t,e,n){void 0===n&&(n=1);var r=k(t,"colspan",t.colspan+n);if(r.colwidth){r.colwidth=r.colwidth.slice();for(var o=0;o<n;o++)r.colwidth.splice(e,0,0)}return r}var w=function(p){function a(t,e){void 0===e&&(e=t);var r=t.node(-1),n=N.get(r),o=t.start(-1),i=n.rectBetween(t.pos-o,e.pos-o),s=t.node(0),a=n.cellsInRect(i).filter(function(t){return t!=e.pos-o});a.unshift(e.pos-o);var c=a.map(function(t){var e=r.nodeAt(t),n=t+o+1;return new Ae.SelectionRange(s.resolve(n),s.resolve(n+e.content.size))});p.call(this,c[0].$from,c[0].$to,c),this.$anchorCell=t,this.$headCell=e}return p&&(a.__proto__=p),((a.prototype=Object.create(p&&p.prototype)).constructor=a).prototype.map=function(t,e){var n=t.resolve(e.map(this.$anchorCell.pos)),r=t.resolve(e.map(this.$headCell.pos));if(l(n)&&l(r)&&h(n,r)){var o=this.$anchorCell.node(-1)!=n.node(-1);return o&&this.isRowSelection()?a.rowSelection(n,r):o&&this.isColSelection()?a.colSelection(n,r):new a(n,r)}return Ae.TextSelection.between(n,r)},a.prototype.content=function(){for(var t=this.$anchorCell.node(-1),e=N.get(t),n=this.$anchorCell.start(-1),r=e.rectBetween(this.$anchorCell.pos-n,this.$headCell.pos-n),o=[],i=[],s=r.top;s<r.bottom;s++){for(var a=[],c=s*e.width+r.left,l=r.left;l<r.right;l++,c++){var p=e.map[c];if(-1==o.indexOf(p)){o.push(p);var u=e.findCell(p),f=t.nodeAt(p),h=r.left-u.left,d=u.right-r.right;if(0<h||0<d){var m=f.attrs;0<h&&(m=x(m,0,h)),0<d&&(m=x(m,m.colspan-d,d)),f=u.left<r.left?f.type.createAndFill(m):f.type.create(m,f.content)}if(u.top<r.top||u.bottom>r.bottom){var v=k(f.attrs,"rowspan",Math.min(u.bottom,r.bottom)-Math.max(u.top,r.top));f=u.top<r.top?f.type.createAndFill(v):f.type.create(v,f.content)}a.push(f)}}i.push(t.child(s).copy(Oe.Fragment.from(a)))}var g=this.isColSelection()&&this.isRowSelection()?t:i;return new Oe.Slice(Oe.Fragment.from(g),1,1)},a.prototype.replace=function(t,e){void 0===e&&(e=Oe.Slice.empty);for(var n=t.steps.length,r=this.ranges,o=0;o<r.length;o++){var i=r[o],s=i.$from,a=i.$to,c=t.mapping.slice(n);t.replace(c.map(s.pos),c.map(a.pos),o?Oe.Slice.empty:e)}var l=p.findFrom(t.doc.resolve(t.mapping.slice(n).map(this.to)),-1);l&&t.setSelection(l)},a.prototype.replaceWith=function(t,e){this.replace(t,new Oe.Slice(Oe.Fragment.from(e),0,0))},a.prototype.forEachCell=function(t){for(var e=this.$anchorCell.node(-1),n=N.get(e),r=this.$anchorCell.start(-1),o=n.cellsInRect(n.rectBetween(this.$anchorCell.pos-r,this.$headCell.pos-r)),i=0;i<o.length;i++)t(e.nodeAt(o[i]),r+o[i])},a.prototype.isColSelection=function(){var t=this.$anchorCell.index(-1),e=this.$headCell.index(-1);if(0<Math.min(t,e))return!1;var n=t+this.$anchorCell.nodeAfter.attrs.rowspan,r=e+this.$headCell.nodeAfter.attrs.rowspan;return Math.max(n,r)==this.$headCell.node(-1).childCount},a.colSelection=function(t,e){void 0===e&&(e=t);var n=N.get(t.node(-1)),r=t.start(-1),o=n.findCell(t.pos-r),i=n.findCell(e.pos-r),s=t.node(0);return o.top<=i.top?(0<o.top&&(t=s.resolve(r+n.map[o.left])),i.bottom<n.height&&(e=s.resolve(r+n.map[n.width*(n.height-1)+i.right-1]))):(0<i.top&&(e=s.resolve(r+n.map[i.left])),o.bottom<n.height&&(t=s.resolve(r+n.map[n.width*(n.height-1)+o.right-1]))),new a(t,e)},a.prototype.isRowSelection=function(){var t=N.get(this.$anchorCell.node(-1)),e=this.$anchorCell.start(-1),n=t.colCount(this.$anchorCell.pos-e),r=t.colCount(this.$headCell.pos-e);if(0<Math.min(n,r))return!1;var o=n+this.$anchorCell.nodeAfter.attrs.colspan,i=r+this.$headCell.nodeAfter.attrs.colspan;return Math.max(o,i)==t.width},a.prototype.eq=function(t){return t instanceof a&&t.$anchorCell.pos==this.$anchorCell.pos&&t.$headCell.pos==this.$headCell.pos},a.rowSelection=function(t,e){void 0===e&&(e=t);var n=N.get(t.node(-1)),r=t.start(-1),o=n.findCell(t.pos-r),i=n.findCell(e.pos-r),s=t.node(0);return o.left<=i.left?(0<o.left&&(t=s.resolve(r+n.map[o.top*n.width])),i.right<n.width&&(e=s.resolve(r+n.map[n.width*(i.top+1)-1]))):(0<i.left&&(e=s.resolve(r+n.map[i.top*n.width])),o.right<n.width&&(t=s.resolve(r+n.map[n.width*(o.top+1)-1]))),new a(t,e)},a.prototype.toJSON=function(){return{type:"cell",anchor:this.$anchorCell.pos,head:this.$headCell.pos}},a.fromJSON=function(t,e){return new a(t.resolve(e.anchor),t.resolve(e.head))},a.create=function(t,e,n){return void 0===n&&(n=e),new a(t.resolve(e),t.resolve(n))},a.prototype.getBookmark=function(){return new m(this.$anchorCell.pos,this.$headCell.pos)},a}(Ae.Selection);w.prototype.visible=!1,Ae.Selection.jsonID("cell",w);var m=function(t,e){this.anchor=t,this.head=e};function v(t){if(!(t.selection instanceof w))return null;var n=[];return t.selection.forEachCell(function(t,e){n.push(lt.Decoration.node(e,e+t.nodeSize,{class:"selectedCell"}))}),lt.DecorationSet.create(t.doc,n)}function b(t,e){var n=t.getAttribute("data-colwidth"),r=n&&/^\d+(,\d+)*$/.test(n)?n.split(",").map(function(t){return Number(t)}):null,o=Number(t.getAttribute("colspan")||1),i={colspan:o,rowspan:Number(t.getAttribute("rowspan")||1),colwidth:r&&r.length==o?r:null};for(var s in e){var a=e[s].getFromDOM,c=a&&a(t);null!=c&&(i[s]=c)}return i}function S(t,e){var n={};for(var r in 1!=t.attrs.colspan&&(n.colspan=t.attrs.colspan),1!=t.attrs.rowspan&&(n.rowspan=t.attrs.rowspan),t.attrs.colwidth&&(n["data-colwidth"]=t.attrs.colwidth.join(",")),e){var o=e[r].setDOMAttr;o&&o(t.attrs[r],n)}return n}function M(t){var e=t.cached.tableNodeTypes;if(!e)for(var n in e=t.cached.tableNodeTypes={},t.nodes){var r=t.nodes[n],o=r.spec.tableRole;o&&(e[o]=r)}return e}function C(t){if(!t.size)return null;for(var e=t.content,n=t.openStart,r=t.openEnd;1==e.childCount&&(0<n&&0<r||"table"==e.firstChild.type.spec.tableRole);)n--,r--,e=e.firstChild.content;var o=e.firstChild,i=o.type.spec.tableRole,s=o.type.schema,a=[];if("row"==i)for(var c=0;c<e.childCount;c++){var l=e.child(c).content,p=c?0:Math.max(0,n-1),u=c<e.childCount-1?0:Math.max(0,r-1);(p||u)&&(l=O(M(s).row,new Oe.Slice(l,p,u)).content),a.push(l)}else{if("cell"!=i&&"header_cell"!=i)return null;a.push(n||r?O(M(s).row,new Oe.Slice(e,n,r)).content:e)}return function(t,e){for(var n=[],r=0;r<e.length;r++)for(var o=e[r],i=o.childCount-1;0<=i;i--)for(var s=o.child(i).attrs,a=s.rowspan,c=s.colspan,l=r;l<r+a;l++)n[l]=(n[l]||0)+c;for(var p=0,u=0;u<n.length;u++)p=Math.max(p,n[u]);for(var f=0;f<n.length;f++)if(f>=e.length&&e.push(Oe.Fragment.empty),n[f]<p){for(var h=M(t).cell.createAndFill(),d=[],m=n[f];m<p;m++)d.push(h);e[f]=e[f].append(Oe.Fragment.from(d))}return{height:e.length,width:p,rows:e}}(s,a)}function O(t,e){var n=t.createAndFill();return new Te.Transform(n).replace(0,n.content.size,e).doc}function T(t,e,n){var r=t.width,o=t.height,i=t.rows;if(r!=e){for(var s=[],a=[],c=0;c<i.length;c++){for(var l=i[c],p=[],u=s[c]||0,f=0;u<e;f++){var h=l.child(f%l.childCount);u+h.attrs.colspan>e&&(h=h.type.create(x(h.attrs,h.attrs.colspan,u+h.attrs.colspan-e),h.content)),p.push(h),u+=h.attrs.colspan;for(var d=1;d<h.attrs.rowspan;d++)s[c+d]=(s[c+d]||0)+h.attrs.colspan}a.push(Oe.Fragment.from(p))}i=a,r=e}if(o!=n){for(var m=[],v=0,g=0;v<n;v++,g++){for(var y=[],w=i[g%o],b=0;b<w.childCount;b++){var S=w.child(b);v+S.attrs.rowspan>n&&(S=S.type.create(k(S.attrs,"rowspan",n-S.attrs.rowspan),S.content)),y.push(S)}m.push(Oe.Fragment.from(y))}i=m,o=n}return{width:r,height:o,rows:i}}function A(t,e,n,r,o,i,s,a){if(0==s||s==e.height)return!1;for(var c=!1,l=o;l<i;l++){var p=s*e.width+l,u=e.map[p];if(e.map[p-e.width]==u){c=!0;var f=n.nodeAt(u),h=e.findCell(u),d=h.top,m=h.left;t.setNodeMarkup(t.mapping.slice(a).map(u+r),null,k(f.attrs,"rowspan",s-d)),t.insert(t.mapping.slice(a).map(e.positionAt(s,m,n)),f.type.createAndFill(k(f.attrs,"rowspan",d+f.attrs.rowspan-s))),l+=f.attrs.colspan-1}}return c}function R(t,e,n,r,o,i,s,a){if(0==s||s==e.width)return!1;for(var c=!1,l=o;l<i;l++){var p=l*e.width+s,u=e.map[p];if(e.map[p-1]==u){c=!0;var f=n.nodeAt(u),h=e.colCount(u),d=t.mapping.slice(a).map(u+r);t.setNodeMarkup(d,null,x(f.attrs,s-h,f.attrs.colspan-(s-h))),t.insert(d+f.nodeSize,f.type.createAndFill(x(f.attrs,0,s-h))),l+=f.attrs.rowspan-1}}return c}function E(t,e,n,r,o){var i=n?t.doc.nodeAt(n-1):t.doc,s=N.get(i),a=r.top,c=r.left,l=c+o.width,p=a+o.height,u=t.tr,f=0;function h(){i=n?u.doc.nodeAt(n-1):u.doc,s=N.get(i),f=u.mapping.maps.length}(function(t,e,n,r,o,i,s){var a,c,l=M(t.doc.type.schema);if(o>e.width)for(var p=0,u=0;p<e.height;p++){var f=n.child(p);u+=f.nodeSize;var h=[],d=void 0;d=null==f.lastChild||f.lastChild.type==l.cell?a||(a=l.cell.createAndFill()):c||(c=l.header_cell.createAndFill());for(var m=e.width;m<o;m++)h.push(d);t.insert(t.mapping.slice(s).map(u-1+r),h)}if(i>e.height){for(var v=[],g=0,y=(e.height-1)*e.width;g<Math.max(e.width,o);g++){var w=!(g>=e.width)&&n.nodeAt(e.map[y+g]).type==l.header_cell;v.push(w?c||(c=l.header_cell.createAndFill()):a||(a=l.cell.createAndFill()))}for(var b=l.row.create(null,Oe.Fragment.from(v)),S=[],C=e.height;C<i;C++)S.push(b);t.insert(t.mapping.slice(s).map(r+n.nodeSize-2),S)}return!(!a&&!c)})(u,s,i,n,l,p,f)&&h(),A(u,s,i,n,c,l,a,f)&&h(),A(u,s,i,n,c,l,p,f)&&h(),R(u,s,i,n,a,p,c,f)&&h(),R(u,s,i,n,a,p,l,f)&&h();for(var d=a;d<p;d++){var m=s.positionAt(d,c,i),v=s.positionAt(d,l,i);u.replace(u.mapping.slice(f).map(m+n),u.mapping.slice(f).map(v+n),new Oe.Slice(o.rows[d-a],0,0))}h(),u.setSelection(new w(u.doc.resolve(n+s.positionAt(a,c,i)),u.doc.resolve(n+s.positionAt(p-1,l-1,i)))),e(u)}m.prototype.map=function(t){return new m(t.map(this.anchor),t.map(this.head))},m.prototype.resolve=function(t){var e=t.resolve(this.anchor),n=t.resolve(this.head);return"row"==e.parent.type.spec.tableRole&&"row"==n.parent.type.spec.tableRole&&e.index()<e.parent.childCount&&n.index()<n.parent.childCount&&h(e,n)?new w(e,n):Ae.Selection.near(n,1)};var P=pt.keydownHandler({ArrowLeft:I("horiz",-1),ArrowRight:I("horiz",1),ArrowUp:I("vert",-1),ArrowDown:I("vert",1),"Shift-ArrowLeft":z("horiz",-1),"Shift-ArrowRight":z("horiz",1),"Shift-ArrowUp":z("vert",-1),"Shift-ArrowDown":z("vert",1),Backspace:$,"Mod-Backspace":$,Delete:$,"Mod-Delete":$});function _(t,e,n){return!n.eq(t.selection)&&(e&&e(t.tr.setSelection(n)),!0)}function I(a,c){return function(t,e,n){var r=t.selection;if(r instanceof w)return _(t,e,Ae.Selection.near(r.$headCell,c));if("horiz"!=a&&!r.empty)return!1;var o=V(n,a,c);if(null==o)return!1;if("horiz"==a)return _(t,e,Ae.Selection.near(t.doc.resolve(r.head+c),c));var i=t.doc.resolve(o),s=d(i,a,c);return _(t,e,s?Ae.Selection.near(s,1):c<0?Ae.Selection.near(t.doc.resolve(i.before(-1)),-1):Ae.Selection.near(t.doc.resolve(i.after(-1)),1))}}function z(s,a){return function(t,e,n){var r=t.selection;if(!(r instanceof w)){var o=V(n,s,a);if(null==o)return!1;r=new w(t.doc.resolve(o))}var i=d(r.$headCell,s,a);return!!i&&_(t,e,new w(r.$anchorCell,i))}}function $(t,e){var n=t.selection;if(!(n instanceof w))return!1;if(e){var r=t.tr,o=M(t.schema).cell.createAndFill().content;n.forEachCell(function(t,e){t.content.eq(o)||r.replace(r.mapping.map(e+1),r.mapping.map(e+t.nodeSize-1),new Oe.Slice(o,0,0))}),r.docChanged&&e(r)}return!0}function F(t,e){var n=g(t.state.doc.resolve(e));return!!n&&(t.dispatch(t.state.tr.setSelection(new w(n))),!0)}function B(t,e,n){if(!p(t.state))return!1;var r=C(n),o=t.state.selection;if(o instanceof w){r||(r={width:1,height:1,rows:[Oe.Fragment.from(O(M(t.state.schema).cell,n))]});var i=o.$anchorCell.node(-1),s=o.$anchorCell.start(-1),a=N.get(i).rectBetween(o.$anchorCell.pos-s,o.$headCell.pos-s);return r=T(r,a.right-a.left,a.bottom-a.top),E(t.state,t.dispatch,s,a,r),!0}if(r){var c=u(t.state),l=c.start(-1);return E(t.state,t.dispatch,l,N.get(c.node(-1)).findCell(c.pos-l),r),!0}return!1}function j(s,r){if(!r.ctrlKey&&!r.metaKey){var t,o=L(s,r.target);if(r.shiftKey&&s.state.selection instanceof w)i(s.state.selection.$anchorCell,r),r.preventDefault();else if(r.shiftKey&&o&&null!=(t=g(s.state.selection.$anchor))&&J(s,r).pos!=t.pos)i(t,r),r.preventDefault();else if(!o)return;s.root.addEventListener("mouseup",a),s.root.addEventListener("dragstart",a),s.root.addEventListener("mousemove",e)}function i(t,e){var n=J(s,e),r=null==c.getState(s.state);if(!n||!h(t,n)){if(!r)return;n=t}var o=new w(t,n);if(r||!s.state.selection.eq(o)){var i=s.state.tr.setSelection(o);r&&i.setMeta(c,t.pos),s.dispatch(i)}}function a(){s.root.removeEventListener("mouseup",a),s.root.removeEventListener("dragstart",a),s.root.removeEventListener("mousemove",e),null!=c.getState(s.state)&&s.dispatch(s.state.tr.setMeta(c,-1))}function e(t){var e,n=c.getState(s.state);if(null!=n)e=s.state.doc.resolve(n);else if(L(s,t.target)!=o&&!(e=J(s,r)))return a();e&&i(e,t)}}function V(t,e,n){if(!(t.state.selection instanceof Ae.TextSelection))return null;for(var r=t.state.selection.$head,o=r.depth-1;0<=o;o--){var i=r.node(o);if((n<0?r.index(o):r.indexAfter(o))!=(n<0?0:i.childCount))return null;if("cell"==i.type.spec.tableRole||"header_cell"==i.type.spec.tableRole){var s=r.before(o),a="vert"==e?0<n?"down":"up":0<n?"right":"left";return t.endOfTextblock(a)?s:null}}return null}function L(t,e){for(;e&&e!=t.dom;e=e.parentNode)if("TD"==e.nodeName||"TH"==e.nodeName)return e}function J(t,e){var n=t.posAtCoords({left:e.clientX,top:e.clientY});return n&&n?g(t.state.doc.resolve(n.pos)):null}function W(n,t){var r,e=function(t,e){"table"==t.type.spec.tableRole&&(r=function(t,e,n,r){var o=N.get(e);if(!o.problems)return r;r||(r=t.tr);for(var i,s,a=[],c=0;c<o.height;c++)a.push(0);for(var l=0;l<o.problems.length;l++){var p=o.problems[l];if("collision"==p.type){for(var u=e.nodeAt(p.pos),f=0;f<u.attrs.rowspan;f++)a[p.row+f]+=p.n;r.setNodeMarkup(r.mapping.map(n+1+p.pos),null,x(u.attrs,u.attrs.colspan-p.n,p.n))}else if("missing"==p.type)a[p.row]+=p.n;else if("overlong_rowspan"==p.type){var h=e.nodeAt(p.pos);r.setNodeMarkup(r.mapping.map(n+1+p.pos),null,k(h.attrs,"rowspan",h.attrs.rowspan-p.n))}else if("colwidth mismatch"==p.type){var d=e.nodeAt(p.pos);r.setNodeMarkup(r.mapping.map(n+1+p.pos),null,k(d.attrs,"colwidth",p.colwidth))}}for(var m=0;m<a.length;m++)a[m]&&(null==i&&(i=m),s=m);for(var v=0,g=n+1;v<o.height;v++){var y=g+e.child(v).nodeSize,w=a[v];if(0<w){for(var b=[],S=0;S<w;S++)b.push(M(t.schema).cell.createAndFill());var C=0!=v&&i!=v-1||s!=v?y-1:g+1;r.insert(r.mapping.map(C),b)}g=y}return r}(n,t,e,r))};return t?t.doc!=n.doc&&function t(e,n,r,o){var i=e.childCount,s=n.childCount;t:for(var a=0,c=0;a<s;a++){for(var l=n.child(a),p=c,u=Math.min(i,a+3);p<u;p++)if(e.child(p)==l){c=p+1,r+=l.nodeSize;continue t}o(l,r),c<i&&e.child(c).sameMarkup(l)?t(e.child(c),l,r+1,o):l.nodesBetween(0,l.content.size,o,r+1),r+=l.nodeSize}}(t.doc,n.doc,0,e):n.doc.descendants(e),r}function q(t){var e,n=t.selection,r=u(t),o=r.node(-1),i=r.start(-1),s=N.get(o);return(e=n instanceof w?s.rectBetween(n.$anchorCell.pos-i,n.$headCell.pos-i):s.findCell(r.pos-i)).tableStart=i,e.map=s,e.table=o,e}function K(t,e,n){var r=e.map,o=e.tableStart,i=e.table,s=0<n?-1:0;(function(t,e,n){for(var r=M(e.type.schema).header_cell,o=0;o<t.height;o++)if(e.nodeAt(t.map[n+o*t.width]).type!=r)return!1;return!0})(r,i,n+s)&&(s=0==n||n==r.width?null:0);for(var a=0;a<r.height;a++){var c=a*r.width+n;if(0<n&&n<r.width&&r.map[c-1]==r.map[c]){var l=r.map[c],p=i.nodeAt(l);t.setNodeMarkup(t.mapping.map(o+l),null,y(p.attrs,n-r.colCount(l))),a+=p.attrs.rowspan-1}else{var u=null==s?M(i.type.schema).cell:i.nodeAt(r.map[c+s]).type,f=r.positionAt(a,n,i);t.insert(t.mapping.map(o+f),u.createAndFill())}}return t}function H(t,e,n){for(var r=e.map,o=e.table,i=e.tableStart,s=t.mapping.maps.length,a=0;a<r.height;){var c=a*r.width+n,l=r.map[c],p=o.nodeAt(l);if(0<n&&r.map[c-1]==l||n<r.width-1&&r.map[c+1]==l)t.setNodeMarkup(t.mapping.slice(s).map(i+l),null,x(p.attrs,n-r.colCount(l)));else{var u=t.mapping.slice(s).map(i+l);t.delete(u,u+p.nodeSize)}a+=p.attrs.rowspan}}function U(t,e,n){for(var r=e.map,o=e.tableStart,i=e.table,s=o,a=0;a<n;a++)s+=i.child(a).nodeSize;var c=[],l=0<n?-1:0;(function(t,e,n){for(var r=M(e.type.schema).header_cell,o=0;o<t.width;o++)if(e.nodeAt(t.map[o+n*t.width]).type!=r)return!1;return!0})(r,i,n+l)&&(l=0==n||n==r.height?null:0);for(var p=0,u=r.width*n;p<r.width;p++,u++)if(0<n&&n<r.height&&r.map[u]==r.map[u-r.width]){var f=r.map[u],h=i.nodeAt(f).attrs;t.setNodeMarkup(o+f,null,k(h,"rowspan",h.rowspan+1)),p+=h.colspan-1}else{var d=null==l?M(i.type.schema).cell:i.nodeAt(r.map[u+l*r.width]).type;c.push(d.createAndFill())}return t.insert(s,M(i.type.schema).row.create(null,c)),t}function G(t,e,n){for(var r=e.map,o=e.table,i=e.tableStart,s=0,a=0;a<n;a++)s+=o.child(a).nodeSize;var c=s+o.child(n).nodeSize,l=t.mapping.maps.length;t.delete(s+i,c+i);for(var p=0,u=n*r.width;p<r.width;p++,u++){var f=r.map[u];if(0<n&&f==r.map[u-r.width]){var h=o.nodeAt(f).attrs;t.setNodeMarkup(t.mapping.slice(l).map(f+i),null,k(h,"rowspan",h.rowspan-1)),p+=h.colspan-1}else if(n<r.width&&f==r.map[u+r.width]){var d=o.nodeAt(f),m=d.type.create(k(d.attrs,"rowspan",d.attrs.rowspan-1),d.content),v=r.positionAt(n+1,p,o);t.insert(t.mapping.slice(l).map(i+v),m),p+=d.attrs.colspan-1}}}function X(t){var e=t.content;return 1==e.childCount&&e.firstChild.isTextblock&&0==e.firstChild.childCount}function Q(l){return function(t,e){if(!p(t))return!1;if(e){for(var n=M(t.schema),r=q(t),o=t.tr,i=r.map.cellsInRect("column"==l?new f(r.left,0,r.right,r.map.height):"row"==l?new f(0,r.top,r.map.width,r.bottom):r),s=i.map(function(t){return r.table.nodeAt(t)}),a=0;a<i.length;a++)s[a].type==n.header_cell&&o.setNodeMarkup(r.tableStart+i[a],n.cell,s[a].attrs);if(0==o.steps.length)for(var c=0;c<i.length;c++)o.setNodeMarkup(r.tableStart+i[c],n.header_cell,s[c].attrs);e(o)}return!0}}var Y=Q("row"),Z=Q("column"),tt=Q("cell");var et=function(t,e){this.node=t,this.cellMinWidth=e,this.dom=document.createElement("div"),this.dom.className="tableWrapper",this.table=this.dom.appendChild(document.createElement("table")),this.colgroup=this.table.appendChild(document.createElement("colgroup")),nt(t,this.colgroup,this.table,e),this.contentDOM=this.table.appendChild(document.createElement("tbody"))};function nt(t,e,n,r,o,i){for(var s=0,a=!0,c=e.firstChild,l=t.firstChild,p=0,u=0;p<l.childCount;p++)for(var f=l.child(p).attrs,h=f.colspan,d=f.colwidth,m=0;m<h;m++,u++){var v=o==u?i:d&&d[m],g=v?v+"px":"";s+=v||r,v||(a=!1),c?(c.style.width!=g&&(c.style.width=g),c=c.nextSibling):e.appendChild(document.createElement("col")).style.width=g}for(;c;){var y=c.nextSibling;c.parentNode.removeChild(c),c=y}a?(n.style.width=s+"px",n.style.minWidth=""):(n.style.width="",n.style.minWidth=s+"px")}et.prototype.update=function(t){return t.type==this.node.type&&(nt(this.node=t,this.colgroup,this.table,this.cellMinWidth),!0)},et.prototype.ignoreMutation=function(t){return"attributes"==t.type&&(t.target==this.table||this.colgroup.contains(t.target))};var rt=new Ae.PluginKey("tableColumnResizing");var ot=function(t,e){this.activeHandle=t,this.dragging=e};function it(t,e,n){var r=t.posAtCoords({left:e.clientX,top:e.clientY}).pos,o=g(t.state.doc.resolve(r));if(!o)return-1;if("right"==n)return o.pos;var i=N.get(o.node(-1)),s=o.start(-1),a=i.map.indexOf(o.pos-s);return a%i.width==0?-1:s+i.map[a-1]}function st(t,e,n){var r=e.clientX-t.startX;return Math.max(n,t.startWidth+r)}function at(t,e){t.dispatch(t.state.tr.setMeta(rt,{setHandle:e}))}function ct(t){for(var e=[],n=0;n<t;n++)e.push(0);return e}ot.prototype.apply=function(t){var e=this,n=t.getMeta(rt);if(n&&null!=n.setHandle)return new ot(n.setHandle,null);if(n&&void 0!==n.setDragging)return new ot(e.activeHandle,n.setDragging);if(-1<e.activeHandle&&t.docChanged){var r=t.mapping.map(e.activeHandle,-1);l(t.doc.resolve(r))||(r=null),e=new ot(r,e.dragging)}return e},e.tableEditing=function(){return new Ae.Plugin({key:c,state:{init:function(){return null},apply:function(t,e){var n=t.getMeta(c);if(null!=n)return-1==n?null:n;if(null==e||!t.docChanged)return e;var r=t.mapping.mapResult(e),o=r.deleted,i=r.pos;return o?null:i}},props:{decorations:v,handleDOMEvents:{mousedown:j},createSelectionBetween:function(t){if(null!=c.getState(t.state))return t.state.selection},handleTripleClick:F,handleKeyDown:P,handlePaste:B},appendTransaction:function(t,e,n){return function(t,e){var n,r,o=(e||t).selection,i=(e||t).doc;if(o instanceof Ae.NodeSelection&&(r=o.node.type.spec.tableRole))if("cell"==r||"header_cell"==r)n=w.create(i,o.from);else if("row"==r){var s=i.resolve(o.from+1);n=w.rowSelection(s,s)}else{var a=N.get(o.node),c=o.from+1,l=c+a.map[a.width*a.height-1];n=w.create(i,c+1,l)}else o instanceof Ae.TextSelection&&function(t){var e=t.$from,n=t.$to;if(e.pos==n.pos||e.pos<e.pos-6)return!1;for(var r=e.pos,o=n.pos,i=e.depth;0<=i&&!(e.after(i+1)<e.end(i));i--,r++);for(var s=n.depth;0<=s&&!(n.before(s+1)>n.start(s));s--,o--);return r==o&&/row|table/.test(e.node(i).type.spec.tableRole)}(o)&&(n=Ae.TextSelection.create(i,o.from));return n&&(e||(e=t.tr)).setSelection(n),e}(n,W(n,e))}})},e.fixTables=W,e.handlePaste=B,e.cellAround=g,e.isInTable=p,e.selectionCell=u,e.moveCellForward=a,e.inSameTable=h,e.findCell=function(t){return N.get(t.node(-1)).findCell(t.pos-t.start(-1))},e.colCount=function(t){return N.get(t.node(-1)).colCount(t.pos-t.start(-1))},e.nextCell=d,e.tableNodes=function(t){var e=t.cellAttributes||{},n={colspan:{default:1},rowspan:{default:1},colwidth:{default:null}};for(var r in e)n[r]={default:e[r].default};return{table:{content:"table_row+",tableRole:"table",isolating:!0,group:t.tableGroup,parseDOM:[{tag:"table"}],toDOM:function(){return["table",["tbody",0]]}},table_row:{content:"(table_cell | table_header)*",tableRole:"row",parseDOM:[{tag:"tr"}],toDOM:function(){return["tr",0]}},table_cell:{content:t.cellContent,attrs:n,tableRole:"cell",isolating:!0,parseDOM:[{tag:"td",getAttrs:function(t){return b(t,e)}}],toDOM:function(t){return["td",S(t,e),0]}},table_header:{content:t.cellContent,attrs:n,tableRole:"header_cell",isolating:!0,parseDOM:[{tag:"th",getAttrs:function(t){return b(t,e)}}],toDOM:function(t){return["th",S(t,e),0]}}}},e.CellSelection=w,e.TableMap=N,e.columnResizing=function(t){void 0===t&&(t={});var n=t.handleWidth;void 0===n&&(n=5);var r=t.cellMinWidth;void 0===r&&(r=25);var o=t.View;void 0===o&&(o=et);var i=t.lastColumnResizable;return void 0===i&&(i=!0),new Ae.Plugin({key:rt,state:{init:function(t,e){return this.spec.props.nodeViews[M(e.schema).table.name]=function(t,e){return new o(t,r,e)},new ot(-1,!1)},apply:function(t,e){return e.apply(t)}},props:{attributes:function(t){return-1<rt.getState(t).activeHandle?{class:"resize-cursor"}:null},handleDOMEvents:{mousemove:function(t,e){!function(t,e,n,r,o){var i=rt.getState(t.state);if(!i.dragging){var s=function(t){for(;t&&"TD"!=t.nodeName&&"TH"!=t.nodeName;)t=t.classList.contains("ProseMirror")?null:t.parentNode;return t}(e.target),a=-1;if(s){var c=s.getBoundingClientRect(),l=c.left,p=c.right;e.clientX-l<=n?a=it(t,e,"left"):p-e.clientX<=n&&(a=it(t,e,"right"))}if(a!=i.activeHandle){if(!o&&-1!==a){var u=t.state.doc.resolve(a),f=u.node(-1),h=N.get(f),d=u.start(-1),m=h.colCount(u.pos-d)+u.nodeAfter.attrs.colspan-1;if(m==h.width-1)return}at(t,a)}}}(t,e,n,0,i)},mouseleave:function(t){var e,n;e=t,-1<(n=rt.getState(e.state)).activeHandle&&!n.dragging&&at(e,-1)},mousedown:function(t,e){!function(r,t,o){var e=rt.getState(r.state);if(-1!=e.activeHandle&&!e.dragging){var n=r.state.doc.nodeAt(e.activeHandle),i=function(t,e,n){var r=n.colspan,o=n.colwidth,i=o&&o[o.length-1];if(i)return i;var s=t.domAtPos(e+1).node.offsetWidth,a=r;if(o)for(var c=0;c<r;c++)o[c]&&(s-=o[c],a--);return s/a}(r,e.activeHandle,n.attrs);r.dispatch(r.state.tr.setMeta(rt,{setDragging:{startX:t.clientX,startWidth:i}})),window.addEventListener("mouseup",s),window.addEventListener("mousemove",a),t.preventDefault()}function s(t){window.removeEventListener("mouseup",s),window.removeEventListener("mousemove",a);var e=rt.getState(r.state);e.dragging&&(function(t,e,n){for(var r=t.state.doc.resolve(e),o=r.node(-1),i=N.get(o),s=r.start(-1),a=i.colCount(r.pos-s)+r.nodeAfter.attrs.colspan-1,c=t.state.tr,l=0;l<i.height;l++){var p=l*i.width+a;if(!l||i.map[p]!=i.map[p-i.width]){var u=i.map[p],f=o.nodeAt(u),h=f.attrs,d=1==h.colspan?0:a-i.colCount(u);if(!h.colwidth||h.colwidth[d]!=n){var m=h.colwidth?h.colwidth.slice():ct(h.colspan);m[d]=n,c.setNodeMarkup(s+u,null,k(h,"colwidth",m))}}}c.docChanged&&t.dispatch(c)}(r,e.activeHandle,st(e.dragging,t,o)),r.dispatch(r.state.tr.setMeta(rt,{setDragging:null})))}function a(t){if(!t.which)return s(t);var e=rt.getState(r.state),n=st(e.dragging,t,o);!function(t,e,n,r){for(var o=t.state.doc.resolve(e),i=o.node(-1),s=o.start(-1),a=N.get(i).colCount(o.pos-s)+o.nodeAfter.attrs.colspan-1,c=t.domAtPos(o.start(-1)).node;"TABLE"!=c.nodeName;)c=c.parentNode;nt(i,c.firstChild,c,r,a,n)}(r,e.activeHandle,n,o)}}(t,e,r)}},decorations:function(t){var e=rt.getState(t);if(-1<e.activeHandle)return function(t,e){for(var n=[],r=t.doc.resolve(e),o=r.node(-1),i=N.get(o),s=r.start(-1),a=i.colCount(r.pos-s)+r.nodeAfter.attrs.colspan,c=0;c<i.height;c++){var l=a+c*i.width-1;if(!(a!=i.width&&i.map[l]==i.map[l+1]||0!=c&&i.map[l-1]==i.map[l-1-i.width])){var p=i.map[l],u=s+p+o.nodeAt(p).nodeSize-1,f=document.createElement("div");f.className="column-resize-handle",n.push(lt.Decoration.widget(u,f))}}return lt.DecorationSet.create(t.doc,n)}(t,e.activeHandle)},nodeViews:{}}})},e.columnResizingPluginKey=rt,e.updateColumnsOnResize=nt,e.__pastedCells=C,e.__insertCells=E,e.__clipCells=T,e.addColumn=K,e.addColumnBefore=function(t,e){if(!p(t))return!1;if(e){var n=q(t);e(K(t.tr,n,n.left))}return!0},e.addColumnAfter=function(t,e){if(!p(t))return!1;if(e){var n=q(t);e(K(t.tr,n,n.right))}return!0},e.removeColumn=H,e.deleteColumn=function(t,e){if(!p(t))return!1;if(e){var n=q(t),r=t.tr;if(0==n.left&&n.right==n.map.width)return!1;for(var o=n.right-1;H(r,n,o),o!=n.left;o--)n.table=n.tableStart?r.doc.nodeAt(n.tableStart-1):r.doc,n.map=N.get(n.table);e(r)}return!0},e.addRow=U,e.addRowBefore=function(t,e){if(!p(t))return!1;if(e){var n=q(t);e(U(t.tr,n,n.top))}return!0},e.addRowAfter=function(t,e){if(!p(t))return!1;if(e){var n=q(t);e(U(t.tr,n,n.bottom))}return!0},e.removeRow=G,e.deleteRow=function(t,e){if(!p(t))return!1;if(e){var n=q(t),r=t.tr;if(0==n.top&&n.bottom==n.map.height)return!1;for(var o=n.bottom-1;G(r,n,o),o!=n.top;o--)n.table=n.tableStart?r.doc.nodeAt(n.tableStart-1):r.doc,n.map=N.get(n.table);e(r)}return!0},e.mergeCells=function(t,e){var n=t.selection;if(!(n instanceof w)||n.$anchorCell.pos==n.$headCell.pos)return!1;var r=q(t),o=r.map;if(function(t,e){for(var n=t.width,r=t.height,o=t.map,i=e.top*n+e.left,s=i,a=(e.bottom-1)*n+e.left,c=i+(e.right-e.left-1),l=e.top;l<e.bottom;l++){if(0<e.left&&o[s]==o[s-1]||e.right<n&&o[c]==o[c+1])return!0;s+=n,c+=n}for(var p=e.left;p<e.right;p++){if(0<e.top&&o[i]==o[i-n]||e.bottom<r&&o[a]==o[a+n])return!0;i++,a++}return!1}(o,r))return!1;if(e){for(var i,s,a=t.tr,c=[],l=Oe.Fragment.empty,p=r.top;p<r.bottom;p++)for(var u=r.left;u<r.right;u++){var f=o.map[p*o.width+u],h=r.table.nodeAt(f);if(!(-1<c.indexOf(f)))if(c.push(f),null==i)i=f,s=h;else{X(h)||(l=l.append(h.content));var d=a.mapping.map(f+r.tableStart);a.delete(d,d+h.nodeSize)}}if(a.setNodeMarkup(i+r.tableStart,null,k(y(s.attrs,s.attrs.colspan,r.right-r.left-s.attrs.colspan),"rowspan",r.bottom-r.top)),l.size){var m=i+1+s.content.size,v=X(s)?i+1:m;a.replaceWith(v+r.tableStart,m+r.tableStart,l)}a.setSelection(new w(a.doc.resolve(i+r.tableStart))),e(a)}return!0},e.splitCell=function(t,e){var n,r,o=t.selection;if(o instanceof w){if(o.$anchorCell.pos!=o.$headCell.pos)return!1;n=o.$anchorCell.nodeAfter,r=o.$anchorCell.pos}else{if(!(n=function(t){for(var e=t.depth-1;0<e;e--){var n=t.node(e).type.spec.tableRole;if("cell"===n||"header_cell"===n)return t.node(e)}return null}(o.$from)))return!1;r=g(o.$from).pos}if(1==n.attrs.colspan&&1==n.attrs.rowspan)return!1;if(e){var i=n.attrs,s=[],a=i.colwidth;1<i.rowspan&&(i=k(i,"rowspan",1)),1<i.colspan&&(i=k(i,"colspan",1));for(var c=q(t),l=t.tr,p=0;p<c.right-c.left;p++)s.push(a?k(i,"colwidth",a&&a[p]?[a[p]]:null):i);for(var u,f=M(t.schema)[n.type.spec.tableRole],h=0;h<c.bottom;h++)if(h>=c.top){var d=c.map.positionAt(h,c.left,c.table);h==c.top&&(d+=n.nodeSize);for(var m=c.left,v=0;m<c.right;m++,v++)m==c.left&&h==c.top||l.insert(u=l.mapping.map(d+c.tableStart,1),f.createAndFill(s[v]))}l.setNodeMarkup(r,null,s[0]),o instanceof w&&l.setSelection(new w(l.doc.resolve(o.$anchorCell.pos),u&&l.doc.resolve(u))),e(l)}return!0},e.setCellAttr=function(o,i){return function(t,e){if(!p(t))return!1;var n=u(t);if(n.nodeAfter.attrs[o]===i)return!1;if(e){var r=t.tr;t.selection instanceof w?t.selection.forEachCell(function(t,e){t.attrs[o]!==i&&r.setNodeMarkup(e,null,k(t.attrs,o,i))}):r.setNodeMarkup(n.pos,null,k(n.nodeAfter.attrs,o,i)),e(r)}return!0}},e.toggleHeaderRow=Y,e.toggleHeaderColumn=Z,e.toggleHeaderCell=tt,e.goToNextCell=function(o){return function(t,e){if(!p(t))return!1;var n=function(t,e){if(e<0){var n=t.nodeBefore;if(n)return t.pos-n.nodeSize;for(var r=t.index(-1)-1,o=t.before();0<=r;r--){var i=t.node(-1).child(r);if(i.childCount)return o-1-i.lastChild.nodeSize;o-=i.nodeSize}}else{if(t.index()<t.parent.childCount-1)return t.pos+t.nodeAfter.nodeSize;for(var s=t.node(-1),a=t.indexAfter(-1),c=t.after();a<s.childCount;a++){var l=s.child(a);if(l.childCount)return c+1;c+=l.nodeSize}}}(u(t),o);if(null!=n){if(e){var r=t.doc.resolve(n);e(t.tr.setSelection(Ae.TextSelection.between(r,a(r))).scrollIntoView())}return!0}}},e.deleteTable=function(t,e){for(var n=t.selection.$anchor,r=n.depth;0<r;r--)if("table"==n.node(r).type.spec.tableRole)return e&&e(t.tr.delete(n.before(r),n.after(r)).scrollIntoView()),!0;return!1}});e(Q);Q.tableEditing,Q.fixTables,Q.handlePaste,Q.cellAround,Q.isInTable,Q.selectionCell,Q.moveCellForward,Q.inSameTable,Q.findCell,Q.colCount,Q.nextCell,Q.tableNodes,Q.CellSelection,Q.TableMap,Q.columnResizing,Q.columnResizingPluginKey,Q.updateColumnsOnResize,Q.__pastedCells,Q.__insertCells,Q.__clipCells,Q.addColumn,Q.addColumnBefore,Q.addColumnAfter,Q.removeColumn,Q.deleteColumn,Q.addRow,Q.addRowBefore,Q.addRowAfter,Q.removeRow,Q.deleteRow,Q.mergeCells,Q.splitCell,Q.setCellAttr,Q.toggleHeaderRow,Q.toggleHeaderColumn,Q.toggleHeaderCell,Q.goToNextCell,Q.deleteTable;var Y=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var p=function(i,s){return function(t){Array.isArray(i)||(i=[i]);for(var e=0,n=i.length;e<n;e++){var r=y(i[e])(t.selection);if(r){var o=a(r.pos,s)(t);if(o!==t)return o}}return t}},u=function(n){var r=1<arguments.length&&void 0!==arguments[1]?arguments[1]:1;return function(t){var e=Ae.Selection.findFrom(t.doc.resolve(n),r,!0);return e?t.setSelection(e):t}},d=function(c,l){return function(t){var e="number"==typeof l,n=t.selection.$from,r=e?t.doc.resolve(l):f(t.selection)?t.doc.resolve(n.pos+1):n,o=r.parent;r.depth;if(g(o)&&t!==(t=p(o.type,c)(t)))return u(r.pos)(t);if(v(r,c))return t.insert(r.pos,c),h(u(e?r.pos:t.selection.$anchor.pos)(t));for(var i=r.depth;0<i;i--){var s=r.after(i),a=t.doc.resolve(s);if(v(a,c))return t.insert(s,c),h(u(s)(t))}return t}},f=function(t){return t instanceof Ae.NodeSelection},o=function(t,e){return Array.isArray(t)&&-1<t.indexOf(e.type)||e.type===t},h=function(t){return Object.assign(Object.create(t),t).setTime(Date.now())},a=function(o,i){return function(t){var e=t.doc.nodeAt(o),n=t.doc.resolve(o);if(s(n,i)){var r=(t=t.replaceWith(o,o+e.nodeSize,i)).selection.$from.pos-1;return t=u(Math.max(r,0),-1)(t),t=u(t.selection.$from.start())(t),h(t)}return t}},s=function(t,e){var n=t.node(t.depth);return n&&n.type.validContent(e instanceof Oe.Fragment?e:Oe.Fragment.from(e))},r=function(n){return function(t){var e=t.doc.nodeAt(n);return h(t.delete(n,n+e.nodeSize))}},m=function(n){if(n.cached.tableNodeTypes)return n.cached.tableNodeTypes;var r={};return Object.keys(n.nodes).forEach(function(t){var e=n.nodes[t];e.spec.tableRole&&(r[e.spec.tableRole]=e)}),n.cached.tableNodeTypes=r},v=function(t,e){var n=t.index();return e instanceof Oe.Fragment?t.parent.canReplace(n,n,e):e instanceof Oe.Node&&t.parent.canReplaceWith(n,n,e.type)},g=function(t){return!t||"paragraph"===t.type.name&&2===t.nodeSize},i=function(o){return function(t){for(var e=t.$from,n=e.depth;0<n;n--){var r=e.node(n);if(o(r))return{pos:0<n?e.before(n):0,start:e.start(n),node:r}}}},c=function(t,e){for(var n=t.depth;0<n;n--){var r=t.node(n);if(e(r))return{pos:0<n?t.before(n):0,start:t.start(n),node:r}}},l=function(n,r){return function(t){var e=i(n)(t);if(e)return b(e.pos,r)}},n=function(e){return function(t){return!!i(e)(t)}},y=function(e){return function(t){return i(function(t){return o(e,t)})(t)}},w=function(t){var e=t.$from.nodeBefore,n=Ae.Selection.findFrom(t.$from,-1);if(n&&e){var r=y(e.type)(n);return r?r.pos:n.$from.pos}},b=function(t,e){var n=e(t),r=n.node.childNodes[n.offset];return r||n.node},S=function(t){var n=!(1<arguments.length&&void 0!==arguments[1])||arguments[1];if(!t)throw new Error('Invalid "node" parameter');var r=[];return t.descendants(function(t,e){if(r.push({node:t,pos:e}),!n)return!1}),r},C=function(t,e,n){if(!t)throw new Error('Invalid "node" parameter');if(!e)throw new Error('Invalid "predicate" parameter');return S(t,n).filter(function(t){return e(t.node)})},k=function(t,e,n){return C(t,function(t){return t.type===e},n)};var x=function(t){return i(function(t){return t.type.spec.tableRole&&"table"===t.type.spec.tableRole})(t)},M=function(t){return t instanceof Q.CellSelection},O=function(t){return!!M(t)&&(t.isColSelection()&&t.isRowSelection())},T=function(n){return function(t){var r=x(t);if(r){var e=Q.TableMap.get(r.node);if(0<=n&&n<=e.width-1)return e.cellsInRect({left:n,right:n+1,top:0,bottom:e.height}).map(function(t){var e=r.node.nodeAt(t),n=t+r.start;return{pos:n,start:n+1,node:e}})}}},A=function(n){return function(t){var r=x(t);if(r){var e=Q.TableMap.get(r.node);if(0<=n&&n<=e.height-1)return e.cellsInRect({left:0,right:e.width,top:n,bottom:n+1}).map(function(t){var e=r.node.nodeAt(t),n=t+r.start;return{pos:n,start:n+1,node:e}})}}},N=function(t){var r=x(t);if(r){var e=Q.TableMap.get(r.node);return e.cellsInRect({left:0,right:e.width,top:0,bottom:e.height}).map(function(t){var e=r.node.nodeAt(t),n=t+r.start;return{pos:n,start:n+1,node:e}})}},D=function(h){return function(e){var t=x(e.selection);if(t){var n=Q.TableMap.get(t.node);if(0<=h&&h<=n.height){for(var r=t.node,o=m(r.type.schema),i=t.start,s=0;s<h+1;s++)i+=r.child(s).nodeSize;var a=r.child(h),c=[],l=0;if(a.forEach(function(t){1===t.attrs.rowspan&&(l+=t.attrs.colspan,c.push(o[t.type.spec.tableRole].createAndFill(t.attrs,t.marks)))}),l<n.width){for(var p=[],u=function(r){var t=$(r,function(t,e){var n=t.node.attrs.rowspan;return 1<n&&h<r+n})(e);p.push.apply(p,function(t){if(Array.isArray(t)){for(var e=0,n=Array(t.length);e<t.length;e++)n[e]=t[e];return n}return Array.from(t)}(t))},f=h;0<=f;f--)u(f);p.length&&p.forEach(function(t){e=_(t,{rowspan:t.node.attrs.rowspan+1})(e)})}return d(o.row.create(a.attrs,c),i)(e)}}return e}},R=function(r){return function(t){var e=x(t.selection);if(e){var n=Q.TableMap.get(e.node);if(0===r&&1===n.width)return P(t);if(0<=r&&r<=n.width)return Q.removeColumn(t,{map:n,tableStart:e.start,table:e.node},r),h(t)}return t}},E=function(r){return function(t){var e=x(t.selection);if(e){var n=Q.TableMap.get(e.node);if(0===r&&1===n.height)return P(t);if(0<=r&&r<=n.height)return Q.removeRow(t,{map:n,tableStart:e.start,table:e.node},r),h(t)}return t}},P=function(t){for(var e=t.selection.$from,n=e.depth;0<n;n--){if("table"===e.node(n).type.spec.tableRole)return h(t.delete(e.before(n),e.after(n)))}return t},_=function(e,n){return function(t){return e?(t.setNodeMarkup(e.pos,null,Object.assign({},e.node.attrs,n)),h(t)):t}},I=function(t){return c(t,function(t){return t.type.spec.tableRole&&/cell/i.test(t.type.spec.tableRole)})},z=function(t){var e=I(t);if(e){var n=c(t,function(t){return t.type.spec.tableRole&&/table/i.test(t.type.spec.tableRole)}),r=Q.TableMap.get(n.node),o=e.pos-n.start;return r.rectBetween(o,o)}},$=function(o,i){return function(t){var e=[],n=A(o)(t.selection);if(n)for(var r=n.length-1;0<=r;r--)i(n[r],t)&&e.push(n[r]);return e}};e.isNodeSelection=f,e.canInsert=v,e.findParentNode=i,e.findParentNodeClosestToPos=c,e.findParentDomRef=l,e.hasParentNode=n,e.findParentNodeOfType=y,e.findParentNodeOfTypeClosestToPos=function(t,e){return c(t,function(t){return o(e,t)})},e.hasParentNodeOfType=function(e){return function(t){return n(function(t){return o(e,t)})(t)}},e.findParentDomRefOfType=function(e,n){return function(t){return l(function(t){return o(e,t)},n)(t)}},e.findSelectedNodeOfType=function(r){return function(t){if(f(t)){var e=t.node,n=t.$from;if(o(r,e))return{node:e,pos:n.pos}}}},e.findPositionOfNodeBefore=w,e.findDomRefAtPos=b,e.flatten=S,e.findChildren=C,e.findTextNodes=function(t,e){return C(t,function(t){return t.isText},e)},e.findInlineNodes=function(t,e){return C(t,function(t){return t.isInline},e)},e.findBlockNodes=function(t,e){return C(t,function(t){return t.isBlock},e)},e.findChildrenByAttr=function(t,e,n){return C(t,function(t){return!!e(t.attrs)},n)},e.findChildrenByType=k,e.findChildrenByMark=function(t,e,n){return C(t,function(t){return e.isInSet(t.marks)},n)},e.contains=function(t,e){return!!k(t,e).length},e.findTable=x,e.isCellSelection=M,e.isColumnSelected=function(a){return function(t){if(M(t)){var e=t.$anchorCell,n=t.$headCell,r=e.start(-1),o=Q.TableMap.get(e.node(-1)),i=o.colCount(e.pos-r),s=o.colCount(n.pos-r);return t.isColSelection()&&a<=Math.max(i,s)&&a>=Math.min(i,s)}return!1}},e.isRowSelected=function(i){return function(t){if(M(t)){var e=t.$anchorCell,n=t.$headCell,r=e.index(-1),o=n.index(-1);return t.isRowSelection()&&i<=Math.max(r,o)&&i>=Math.min(r,o)}return!1}},e.isTableSelected=O,e.getCellsInColumn=T,e.getCellsInRow=A,e.getCellsInTable=N,e.selectColumn=function(o){return function(t){var e=T(o)(t.selection);if(e){var n=t.doc.resolve(e[0].pos),r=t.doc.resolve(e[e.length-1].pos);return h(t.setSelection(new Q.CellSelection(n,r)))}return t}},e.selectRow=function(o){return function(t){var e=A(o)(t.selection);if(e){var n=t.doc.resolve(e[0].pos),r=t.doc.resolve(e[e.length-1].pos);return h(t.setSelection(new Q.CellSelection(n,r)))}return t}},e.selectTable=function(t){var e=N(t.selection);if(e){var n=t.doc.resolve(e[0].pos),r=t.doc.resolve(e[e.length-1].pos);return h(t.setSelection(new Q.CellSelection(n,r)))}return t},e.emptyCell=function(n,r){return function(t){if(n){var e=m(r).cell.createAndFill().content;if(!n.node.content.eq(e))return t.replaceWith(n.pos,n.pos+n.node.nodeSize-1,new Oe.Slice(e,0,0)),h(t)}return t}},e.addColumnAt=function(r){return function(t){var e=x(t.selection);if(e){var n=Q.TableMap.get(e.node);if(0<=r&&r<=n.width)return h(Q.addColumn(t,{map:n,tableStart:e.start,table:e.node},r))}return t}},e.addRowAt=function(o,i){return function(t){var e=x(t.selection);if(e){var n=Q.TableMap.get(e.node),r=o-1;if(i&&0<=r)return h(D(r)(t));if(0<=o&&o<=n.height)return h(Q.addRow(t,{map:n,tableStart:e.start,table:e.node},o))}return t}},e.cloneRowAt=D,e.removeColumnAt=R,e.removeRowAt=E,e.removeTable=P,e.removeSelectedColumns=function(t){var e=t.selection;if(O(e))return P(t);if(M(e)){var n=x(e);if(n){for(var r=Q.TableMap.get(n.node).rectBetween(e.$anchorCell.pos-n.start,e.$headCell.pos-n.start),o=r.right-1;o>=r.left;o--)t=R(o)(t);return t}}return t},e.removeSelectedRows=function(t){var e=t.selection;if(O(e))return P(t);if(M(e)){var n=x(e);if(n){for(var r=Q.TableMap.get(n.node).rectBetween(e.$anchorCell.pos-n.start,e.$headCell.pos-n.start),o=r.bottom-1;o>=r.top;o--)t=E(o)(t);return t}}return t},e.removeColumnClosestToPos=function(n){return function(t){var e=z(n);return e?R(e.left)(u(n.pos)(t)):t}},e.removeRowClosestToPos=function(n){return function(t){var e=z(n);return e?E(e.top)(u(n.pos)(t)):t}},e.forEachCellInColumn=function(o,i,s){return function(t){var e=T(o)(t.selection);if(e){for(var n=e.length-1;0<=n;n--)t=i(e[n],t);if(s){var r=t.doc.resolve(t.mapping.map(e[e.length-1].pos));t.setSelection(Ae.Selection.near(r))}return h(t)}return t}},e.forEachCellInRow=function(o,i,s){return function(t){var e=A(o)(t.selection);if(e){for(var n=e.length-1;0<=n;n--)t=i(e[n],t);if(s){var r=t.doc.resolve(t.mapping.map(e[e.length-1].pos));t.setSelection(Ae.Selection.near(r))}}return t}},e.setCellAttrs=_,e.createTable=function(t){for(var e=1<arguments.length&&void 0!==arguments[1]?arguments[1]:3,n=2<arguments.length&&void 0!==arguments[2]?arguments[2]:3,r=!(3<arguments.length&&void 0!==arguments[3])||arguments[3],o=m(t),i=o.cell,s=o.header_cell,a=o.row,c=o.table,l=[],p=0;p<n;p++)l.push(i.createAndFill(null));var u=[];if(r)for(var f=0;f<n;f++)u.push(s.createAndFill(null));for(var h=[],d=0;d<e;d++)h.push(a.createChecked(null,r&&0===d?u:l));return c.createChecked(null,h)},e.findCellClosestToPos=I,e.findCellRectClosestToPos=z,e.removeParentNodeOfType=function(n){return function(t){var e=y(n)(t.selection);return e?r(e.pos)(t):t}},e.replaceParentNodeOfType=p,e.removeSelectedNode=function(t){if(f(t.selection)){var e=t.selection.$from.pos,n=t.selection.$to.pos;return h(t.delete(e,n))}return t},e.replaceSelectedNode=function(o){return function(t){if(f(t.selection)){var e=t.selection,n=e.$from,r=e.$to;if(n.parent.canReplaceWith(n.index(),n.indexAfter(),o.type))return h(t.replaceWith(n.pos,r.pos,o))}return t}},e.setTextSelection=u,e.safeInsert=d,e.setParentNodeMarkup=function(n,r,o,i){return function(t){var e=y(n)(t.selection);return e?h(t.setNodeMarkup(e.pos,r,Object.assign({},e.node.attrs,o),i)):t}},e.selectParentNodeOfType=function(n){return function(t){if(!f(t.selection)){var e=y(n)(t.selection);if(e)return h(t.setSelection(Ae.NodeSelection.create(t.doc,e.pos)))}return t}},e.removeNodeBefore=function(t){var e=w(t.selection);return"number"==typeof e?r(e)(t):t}});e(Y);Y.isNodeSelection,Y.canInsert;var Z=Y.findParentNode;Y.findParentNodeClosestToPos,Y.findParentDomRef,Y.hasParentNode,Y.findParentNodeOfType,Y.findParentNodeOfTypeClosestToPos,Y.hasParentNodeOfType,Y.findParentDomRefOfType,Y.findSelectedNodeOfType,Y.findPositionOfNodeBefore,Y.findDomRefAtPos,Y.flatten,Y.findChildren,Y.findTextNodes,Y.findInlineNodes,Y.findBlockNodes,Y.findChildrenByAttr,Y.findChildrenByType,Y.findChildrenByMark,Y.contains,Y.findTable,Y.isCellSelection,Y.isColumnSelected,Y.isRowSelected,Y.isTableSelected,Y.getCellsInColumn,Y.getCellsInRow,Y.getCellsInTable,Y.selectColumn,Y.selectRow,Y.selectTable,Y.emptyCell,Y.addColumnAt,Y.addRowAt,Y.cloneRowAt,Y.removeColumnAt,Y.removeRowAt,Y.removeTable,Y.removeSelectedColumns,Y.removeSelectedRows,Y.removeColumnClosestToPos,Y.removeRowClosestToPos,Y.forEachCellInColumn,Y.forEachCellInRow,Y.setCellAttrs,Y.createTable,Y.findCellClosestToPos,Y.findCellRectClosestToPos,Y.removeParentNodeOfType,Y.replaceParentNodeOfType,Y.removeSelectedNode,Y.replaceSelectedNode,Y.setTextSelection,Y.safeInsert,Y.setParentNodeMarkup,Y.selectParentNodeOfType,Y.removeNodeBefore;function tt(t,e,n){var r=Z(function(t){return t.type===e})(t.selection);return n!=={}&&r?r.node.hasMarkup(e,n):!!r}var et=function(t){var e=t.node,n=t.editorView;this.editorView=n,this.node=e,this.element=this.node.elm,this.element.style.visibility="hidden",this.element.style.opacity=0,this.editorView.dom.addEventListener("blur",this.hide.bind(this))};et.prototype.update=function(t,e){var n=t.state;if(!(e&&e.doc.eq(n.doc)&&e.selection.eq(n.selection)))if(n.selection.empty)this.hide();else{this.show();var r=n.selection,o=r.from,i=r.to,s=t.coordsAtPos(o),a=t.coordsAtPos(i),c=this.element.offsetParent.getBoundingClientRect(),l=Math.max((s.left+a.left)/2,s.left+3);this.element.style.left=l-c.left+"px",this.element.style.bottom=c.bottom-s.top+"px"}},et.prototype.show=function(){this.element.style.visibility="visible",this.element.style.opacity=1},et.prototype.hide=function(t){t&&t.relatedTarget||(this.element.style.visibility="hidden",this.element.style.opacity=0)},et.prototype.destroy=function(){this.editorView.dom.removeEventListener("blur",this.hide)};var nt=function(t){void 0===t&&(t={}),this.options=Object.assign({},this.defaultOptions,t)},rt={name:{configurable:!0},defaultOptions:{configurable:!0},type:{configurable:!0},view:{configurable:!0},schema:{configurable:!0},plugins:{configurable:!0}};rt.name.get=function(){return null},rt.defaultOptions.get=function(){return{}},rt.type.get=function(){return"node"},rt.view.get=function(){return null},rt.schema.get=function(){return null},rt.plugins.get=function(){return[]},nt.prototype.command=function(){return function(){}},nt.prototype.keys=function(){return{}},nt.prototype.inputRules=function(){return[]},Object.defineProperties(nt.prototype,rt);var ot=function(t){void 0===t&&(t={}),this.options=Object.assign({},this.defaultOptions,t)},it={name:{configurable:!0},defaultOptions:{configurable:!0},type:{configurable:!0},view:{configurable:!0},schema:{configurable:!0},plugins:{configurable:!0}};it.name.get=function(){return null},it.defaultOptions.get=function(){return{}},it.type.get=function(){return"mark"},it.view.get=function(){return null},it.schema.get=function(){return null},it.plugins.get=function(){return[]},ot.prototype.command=function(){return function(){}},ot.prototype.keys=function(){return{}},ot.prototype.inputRules=function(){return[]},Object.defineProperties(ot.prototype,it);var st=function(t){void 0===t&&(t=[]),this.plugins=t},at={nodes:{configurable:!0},marks:{configurable:!0},pluginplugins:{configurable:!0},views:{configurable:!0}};at.nodes.get=function(){return this.plugins.filter(function(t){return"node"===t.type}).reduce(function(t,e){var n,r=e.name,o=e.schema;return Object.assign({},t,((n={})[r]=o,n))},{})},at.marks.get=function(){return this.plugins.filter(function(t){return"mark"===t.type}).reduce(function(t,e){var n,r=e.name,o=e.schema;return Object.assign({},t,((n={})[r]=o,n))},{})},at.pluginplugins.get=function(){return this.plugins.filter(function(t){return t.plugins}).reduce(function(t,e){var n=e.plugins;return t.concat(n)},[])},at.views.get=function(){return this.plugins.filter(function(t){return t.view}).reduce(function(t,e){var n,r=e.name,o=e.view;return Object.assign({},t,((n={})[r]=o,n))},{})},st.prototype.keymaps=function(t){var e=t.schema;return this.plugins.filter(function(t){return t.keys}).map(function(t){return t.keys({type:e[t.type+"s"][t.name],schema:e})}).map(function(t){return k(t)})},st.prototype.inputRules=function(t){var e=t.schema;return this.plugins.filter(function(t){return t.inputRules}).map(function(t){return t.inputRules({type:e[t.type+"s"][t.name],schema:e})}).reduce(function(t,e){return t.concat(e)},[])},st.prototype.commands=function(t){var s=t.schema,a=t.view;return this.plugins.filter(function(t){return t.command}).reduce(function(t,e){var n,r=e.name,o=e.type,i=e.command;return Object.assign({},t,((n={})[r]=function(t){a.focus(),i({type:s[o+"s"][r],attrs:t,schema:s})(a.state,a.dispatch,a)},n))},{})},Object.defineProperties(st.prototype,at);var ct=r(function(t,e){Object.defineProperty(e,"__esModule",{value:!0});var n=["ol",0],r=["ul",0],o=["li",0],i={attrs:{order:{default:1}},parseDOM:[{tag:"ol",getAttrs:function(t){return{order:t.hasAttribute("start")?+t.getAttribute("start"):1}}}],toDOM:function(t){return 1==t.attrs.order?n:["ol",{start:t.attrs.order},0]}},s={parseDOM:[{tag:"ul"}],toDOM:function(){return r}},a={parseDOM:[{tag:"li"}],toDOM:function(){return o},defining:!0};function c(t,e){var n={};for(var r in t)n[r]=t[r];for(var o in e)n[o]=e[o];return n}e.orderedList=i,e.bulletList=s,e.listItem=a,e.addListNodes=function(t,e,n){return t.append({ordered_list:c(i,{content:"list_item+",group:n}),bullet_list:c(s,{content:"list_item+",group:n}),list_item:c(a,{content:e})})},e.wrapInList=function(p,u){return function(t,e){var n=t.selection,r=n.$from,o=n.$to,i=r.blockRange(o),s=!1,a=i;if(!i)return!1;if(2<=i.depth&&r.node(i.depth-1).type.compatibleContent(p)&&0==i.startIndex){if(0==r.index(i.depth-1))return!1;var c=t.doc.resolve(i.start-2);a=new Oe.NodeRange(c,c,i.depth),i.endIndex<i.parent.childCount&&(i=new Oe.NodeRange(r,t.doc.resolve(o.end(i.depth)),i.depth)),s=!0}var l=Te.findWrapping(a,p,u,i);return!!l&&(e&&e(function(t,e,n,r,o){for(var i=Oe.Fragment.empty,s=n.length-1;0<=s;s--)i=Oe.Fragment.from(n[s].type.create(n[s].attrs,i));t.step(new Te.ReplaceAroundStep(e.start-(r?2:0),e.end,e.start,e.end,new Oe.Slice(i,0,0),n.length,!0));for(var a=0,c=0;c<n.length;c++)n[c].type==o&&(a=c+1);for(var l=n.length-a,p=e.start+n.length-(r?2:0),u=e.parent,f=e.startIndex,h=e.endIndex,d=!0;f<h;f++,d=!1)!d&&Te.canSplit(t.doc,p,l)&&(t.split(p,l),p+=2*l),p+=u.child(f).nodeSize;return t}(t.tr,i,l,s,p).scrollIntoView()),!0)}},e.splitListItem=function(d){return function(t,e){var n=t.selection,r=n.$from,o=n.$to,i=n.node;if(i&&i.isBlock||r.depth<2||!r.sameParent(o))return!1;var s=r.node(-1);if(s.type!=d)return!1;if(0==r.parent.content.size){if(2==r.depth||r.node(-3).type!=d||r.index(-2)!=r.node(-2).childCount-1)return!1;if(e){for(var a=Oe.Fragment.empty,c=0<r.index(-1),l=r.depth-(c?1:2);l>=r.depth-3;l--)a=Oe.Fragment.from(r.node(l).copy(a));a=a.append(Oe.Fragment.from(d.createAndFill()));var p=t.tr.replace(r.before(c?null:-1),r.after(-3),new Oe.Slice(a,c?3:2,2));p.setSelection(t.selection.constructor.near(p.doc.resolve(r.pos+(c?3:2)))),e(p.scrollIntoView())}return!0}var u=o.pos==r.end()?s.defaultContentType(0):null,f=t.tr.delete(r.pos,o.pos),h=u&&[null,{type:u}];return!!Te.canSplit(f.doc,r.pos,2,h)&&(e&&e(f.split(r.pos,2,h).scrollIntoView()),!0)}},e.liftListItem=function(f){return function(t,e){var n,r,o,i,s,a,c=t.selection,l=c.$from,p=c.$to,u=l.blockRange(p,function(t){return t.childCount&&t.firstChild.type==f});return!!u&&(!e||(l.node(u.depth-1).type==f?(n=e,r=f,o=u,i=t.tr,s=o.end,a=o.$to.end(o.depth),s<a&&(i.step(new Te.ReplaceAroundStep(s-1,a,s,a,new Oe.Slice(Oe.Fragment.from(r.create(null,o.parent.copy())),1,0),1,!0)),o=new Oe.NodeRange(i.doc.resolve(o.$from.pos),i.doc.resolve(a),o.depth)),n(i.lift(o,Te.liftTarget(o)).scrollIntoView()),!0):function(t,e,n){for(var r=t.tr,o=n.parent,i=n.end,s=n.endIndex-1,a=n.startIndex;a<s;s--)i-=o.child(s).nodeSize,r.delete(i-1,i+1);var c=r.doc.resolve(n.start),l=c.nodeAfter,p=0==n.startIndex,u=n.endIndex==o.childCount,f=c.node(-1),h=c.index(-1);if(!f.canReplace(h+(p?0:1),h+1,l.content.append(u?Oe.Fragment.empty:Oe.Fragment.from(o))))return!1;var d=c.pos,m=d+l.nodeSize;return r.step(new Te.ReplaceAroundStep(d-(p?1:0),m+(u?1:0),d+1,m-1,new Oe.Slice((p?Oe.Fragment.empty:Oe.Fragment.from(o.copy(Oe.Fragment.empty))).append(u?Oe.Fragment.empty:Oe.Fragment.from(o.copy(Oe.Fragment.empty))),p?0:1,u?0:1),p?0:1)),e(r.scrollIntoView()),!0}(t,e,u)))}},e.sinkListItem=function(d){return function(t,e){var n=t.selection,r=n.$from,o=n.$to,i=r.blockRange(o,function(t){return t.childCount&&t.firstChild.type==d});if(!i)return!1;var s=i.startIndex;if(0==s)return!1;var a=i.parent,c=a.child(s-1);if(c.type!=d)return!1;if(e){var l=c.lastChild&&c.lastChild.type==a.type,p=Oe.Fragment.from(l?d.create():null),u=new Oe.Slice(Oe.Fragment.from(d.create(null,Oe.Fragment.from(a.copy(p)))),l?3:1,0),f=i.start,h=i.end;e(t.tr.step(new Te.ReplaceAroundStep(f-(l?3:1),h,f,h,u,1,!0)).scrollIntoView())}return!0}}});e(ct);ct.orderedList,ct.bulletList,ct.listItem,ct.addListNodes;var ft=ct.wrapInList,ht=ct.splitListItem,dt=ct.liftListItem,mt=ct.sinkListItem;function vt(r,o,i){return void 0===i&&(i={}),function(t,e,n){return tt(t,r,i)?B(o)(t,e,n):B(r,i)(t,e,n)}}function gt(r,o){return function(t,e,n){return tt(t,r)?dt(o)(t,e,n):ft(r)(t,e,n)}}var yt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"blockquote"},n.schema.get=function(){return{content:"block+",group:"block",defining:!0,draggable:!1,parseDOM:[{tag:"blockquote"}],toDOM:function(){return["blockquote",0]}}},e.prototype.command=function(t){var e=t.type;return B(e)},e.prototype.keys=function(t){var e=t.type;return{"Ctrl->":F(e)}},e.prototype.inputRules=function(t){var e=t.type;return[K(/^\s*>\s$/,e)]},Object.defineProperties(e.prototype,n),e}(nt),wt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"bullet_list"},n.schema.get=function(){return{content:"list_item+",group:"block",parseDOM:[{tag:"ul"}],toDOM:function(){return["ul",0]}}},e.prototype.command=function(t){return gt(t.type,t.schema.nodes.list_item)},e.prototype.keys=function(t){var e=t.type;return{"Shift-Ctrl-8":ft(e)}},e.prototype.inputRules=function(t){var e=t.type;return[K(/^\s*([-+*])\s$/,e)]},Object.defineProperties(e.prototype,n),e}(nt),bt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"code_block"},n.schema.get=function(){return{content:"text*",marks:"",group:"block",code:!0,defining:!0,draggable:!1,parseDOM:[{tag:"pre",preserveWhitespace:"full"}],toDOM:function(){return["pre",["code",0]]}}},e.prototype.command=function(t){return vt(t.type,t.schema.nodes.paragraph)},e.prototype.keys=function(t){var e=t.type;return{"Shift-Ctrl-\\":B(e)}},e.prototype.inputRules=function(t){var e=t.type;return[H(/^```$/,e)]},Object.defineProperties(e.prototype,n),e}(nt),St=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"doc"},n.schema.get=function(){return{content:"block+"}},Object.defineProperties(e.prototype,n),e}(nt),Ct=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"hard_break"},n.schema.get=function(){return{inline:!0,group:"inline",selectable:!1,parseDOM:[{tag:"br"}],toDOM:function(){return["br"]}}},e.prototype.keys=function(t){var n=t.type,e=V(z,function(t,e){return e(t.tr.replaceSelectionWith(n.create()).scrollIntoView()),!0});return{"Mod-Enter":e,"Shift-Enter":e}},Object.defineProperties(e.prototype,n),e}(nt),kt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},defaultOptions:{configurable:!0},levels:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"heading"},n.defaultOptions.get=function(){return{maxLevel:6}},n.levels.get=function(){return Array.from(new Array(this.options.maxLevel),function(t,e){return e+1})},n.schema.get=function(){return{attrs:{level:{default:1}},content:"inline*",group:"block",defining:!0,draggable:!1,parseDOM:this.levels.map(function(t){return{tag:"h"+t,attrs:{level:t}}}),toDOM:function(t){return["h"+t.attrs.level,0]}}},e.prototype.command=function(t){var e=t.type,n=t.schema,r=t.attrs;return vt(e,n.nodes.paragraph,r)},e.prototype.keys=function(t){var r=t.type;return this.levels.reduce(function(t,e){var n;return Object.assign({},t,((n={})["Shift-Ctrl-"+e]=B(r,{level:e}),n))},{})},e.prototype.inputRules=function(t){var e=t.type;return[H(new RegExp("^(#{1,"+this.options.maxLevel+"})\\s$"),e,function(t){return{level:t[1].length}})]},Object.defineProperties(e.prototype,n),e}(nt),xt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"list_item"},n.schema.get=function(){return{content:"paragraph block*",group:"block",defining:!0,draggable:!1,parseDOM:[{tag:"li"}],toDOM:function(){return["li",0]}}},e.prototype.keys=function(t){var e=t.type;return{Enter:ht(e),Tab:mt(e),"Shift-Tab":dt(e)}},Object.defineProperties(e.prototype,n),e}(nt),Mt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"ordered_list"},n.schema.get=function(){return{attrs:{order:{default:1}},content:"list_item+",group:"block",parseDOM:[{tag:"ol",getAttrs:function(t){return{order:t.hasAttribute("start")?+t.getAttribute("start"):1}}}],toDOM:function(t){return 1===t.attrs.order?["ol",0]:["ol",{start:t.attrs.order},0]}}},e.prototype.command=function(t){return gt(t.type,t.schema.nodes.list_item)},e.prototype.keys=function(t){var e=t.type;return{"Shift-Ctrl-9":ft(e)}},e.prototype.inputRules=function(t){var e=t.type;return[K(/^(\d+)\.\s$/,e,function(t){return{order:+t[1]}},function(t,e){return e.childCount+e.attrs.order===+t[1]})]},Object.defineProperties(e.prototype,n),e}(nt),Ot=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"paragraph"},n.schema.get=function(){return{content:"inline*",group:"block",draggable:!1,parseDOM:[{tag:"p"}],toDOM:function(){return["p",0]}}},e.prototype.command=function(t){var e=t.type;return B(e)},e.prototype.keys=function(t){var e=t.type;return{"Shift-Ctrl-0":B(e)}},Object.defineProperties(e.prototype,n),e}(nt),Tt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"text"},n.schema.get=function(){return{group:"inline"}},Object.defineProperties(e.prototype,n),e}(nt),At=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"todo_list"},n.schema.get=function(){return{group:"block",content:"todo_item+",toDOM:function(){return["ul",{"data-type":"todo_list"},0]},parseDOM:[{priority:51,tag:'[data-type="todo_list"]'}]}},e.prototype.command=function(t){var e=t.type;return ft(e)},e.prototype.inputRules=function(t){var e=t.type;return[K(/^\s*(\[ \])\s$/,e)]},Object.defineProperties(e.prototype,n),e}(nt),Nt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},view:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"todo_item"},n.view.get=function(){return{props:["node","updateAttrs","editable"],methods:{onChange:function(){this.editable&&this.updateAttrs({done:!this.node.attrs.done})}},template:'\n\t\t\t\t<li data-type="todo_item" :data-done="node.attrs.done.toString()">\n\t\t\t\t\t<span class="todo-checkbox" contenteditable="false" @click="onChange"></span>\n\t\t\t\t\t<div class="todo-content" ref="content" :contenteditable="editable.toString()"></div>\n\t\t\t\t</li>\n\t\t\t'}},n.schema.get=function(){return{attrs:{done:{default:!1}},draggable:!1,content:"paragraph",toDOM:function(t){return["li",{"data-type":"todo_item","data-done":t.attrs.done.toString()},["span",{class:"todo-checkbox",contenteditable:"false"}],["div",{class:"todo-content"},0]]},parseDOM:[{priority:51,tag:'[data-type="todo_item"]',getAttrs:function(t){return{done:"true"===t.getAttribute("data-done")}}}]}},e.prototype.keys=function(t){var e=t.type;return{Enter:ht(e),"Shift-Tab":dt(e)}},Object.defineProperties(e.prototype,n),e}(nt),Dt=[new St,new Ot,new Tt,new yt,new bt,new kt({maxLevel:3}),new Ct,new Mt,new wt,new xt,new At,new Nt],Rt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"code"},n.schema.get=function(){return{parseDOM:[{tag:"code"}],toDOM:function(){return["code",0]}}},e.prototype.keys=function(t){var e=t.type;return{"Mod-`":j(e)}},e.prototype.command=function(t){var e=t.type;return j(e)},Object.defineProperties(e.prototype,n),e}(ot),Et=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"italic"},n.schema.get=function(){return{parseDOM:[{tag:"i"},{tag:"em"},{style:"font-style=italic"}],toDOM:function(){return["em",0]}}},e.prototype.keys=function(t){var e=t.type;return{"Mod-i":j(e)}},e.prototype.command=function(t){var e=t.type;return j(e)},Object.defineProperties(e.prototype,n),e}(ot),Pt=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},view:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"link"},n.view.get=function(){return{props:["node"],methods:{onClick:function(){console.log("click on link")}},template:'\n\t\t\t\t<a :href="node.attrs.href" rel="noopener noreferrer nofollow" ref="content" @click="onClick"></a>\n\t\t\t'}},n.schema.get=function(){return{attrs:{href:{default:null}},inclusive:!1,parseDOM:[{tag:"a[href]",getAttrs:function(t){return{href:t.getAttribute("href")}}}],toDOM:function(t){return["a",Object.assign({},t.attrs,{rel:"noopener noreferrer nofollow"}),0]}}},e.prototype.command=function(t){var i,s,a,e=t.type,n=t.attrs;return n.href?(i=e,s=n,function(t,e){var n=t.selection,r=n.from,o=n.to;return e(t.tr.addMark(r,o,i.create(s)))}):(a=e,function(t,e){var n=t.selection,r=n.from,o=n.to;return e(t.tr.removeMark(r,o,a))})},Object.defineProperties(e.prototype,n),e}(ot),_t=function(t){function e(){t.apply(this,arguments)}t&&(e.__proto__=t),(e.prototype=Object.create(t&&t.prototype)).constructor=e;var n={name:{configurable:!0},schema:{configurable:!0}};return n.name.get=function(){return"bold"},n.schema.get=function(){return{parseDOM:[{tag:"strong"},{tag:"b",getAttrs:function(t){return"normal"!=t.style.fontWeight&&null}},{style:"font-weight",getAttrs:function(t){return/^(bold(er)?|[5-9]\d{2,})$/.test(t)&&null}}],toDOM:function(){return["strong",0]}}},e.prototype.keys=function(t){var e=t.type;return{"Mod-b":j(e)}},e.prototype.command=function(t){var e=t.type;return j(e)},Object.defineProperties(e.prototype,n),e}(ot),It=[new Rt,new Et,new Pt,new _t],zt={props:{doc:{type:Object,required:!1,default:null},extensions:{type:Array,required:!1,default:function(){return[]}},editable:{type:Boolean,default:!0}},data:function(){var t=new st(Dt.concat(It,this.extensions));return{state:null,view:null,pluginplugins:[],plugins:t,schema:null,nodes:t.nodes,marks:t.marks,views:t.views,keymaps:[],commands:{},menuActions:null}},render:function(t){var r=this,o=[];return Object.entries(this.$scopedSlots).forEach(function(t){var e=t[0],n=t[1];"content"===e?(r.contentNode=n({}),o.push(r.contentNode)):"menubar"===e?(r.menubarNode=n({nodes:r.menuActions?r.menuActions.nodes:null,marks:r.menuActions?r.menuActions.marks:null,focused:!!r.view&&r.view.focused,focus:function(){return r.view.focus()}}),o.push(r.menubarNode)):"menububble"===e&&(r.menububbleNode=n({nodes:r.menuActions?r.menuActions.nodes:null,marks:r.menuActions?r.menuActions.marks:null,focused:!!r.view&&r.view.focused,focus:function(){return r.view.focus()}}),o.push(r.menububbleNode))}),t("div",{class:"vue-editor"},o)},methods:{initEditor:function(){this.schema=this.createSchema(),this.pluginplugins=this.createPlugins(),this.keymaps=this.createKeymaps(),this.inputRules=this.createInputRules(),this.state=this.createState(),this.clearSlot(),this.view=this.createView(),this.commands=this.createCommands(),this.updateMenuActions()},createSchema:function(){return new o({nodes:this.nodes,marks:this.marks})},createPlugins:function(){return this.plugins.pluginplugins},createKeymaps:function(){return this.plugins.keymaps({schema:this.schema})},createInputRules:function(){return this.plugins.inputRules({schema:this.schema})},createCommands:function(){return this.plugins.commands({schema:this.schema,view:this.view})},createState:function(){return a.create({schema:this.schema,doc:this.getDocument(),plugins:this.pluginplugins.concat(this.getPlugins())})},getDocument:function(){return this.doc?this.schema.nodeFromJSON(this.doc):i.fromSchema(this.schema).parse(this.contentNode.elm)},clearSlot:function(){this.contentNode.elm.innerHTML=""},getPlugins:function(){var e,t=this,n=[W({rules:this.inputRules})].concat(this.keymaps,[k(U)],[k(L)],[u()],[M()],[R()],[new c({props:{editable:function(){return t.editable}}})]);return this.menububbleNode&&n.push((e=this.menububbleNode,new c({view:function(t){return new et({editorView:t,node:e})}}))),n},createView:function(){return new l(this.contentNode.elm,{state:this.state,dispatchTransaction:this.dispatchTransaction,nodeViews:(t={nodes:this.views,editable:this.editable},s=t.nodes,a=t.editable,e={},Object.keys(s).forEach(function(i){e[i]=function(t,e,n,r){var o=s[i];return new G(o,{node:t,view:e,getPos:n,decorations:r,editable:a})}}),e)});var t,s,a,e},updateMenuActions:function(){var t,a,c,r;this.menuActions=(t={schema:this.schema,state:this.view.state,commands:this.commands},a=t.schema,c=t.state,r=t.commands,{nodes:Object.entries(a.nodes).map(function(t){var e=t[0],n=r[e]?r[e]:function(){};return{name:e,active:function(t){return void 0===t&&(t={}),tt(c,a.nodes[e],t)},command:n}}).reduce(function(t,e){var n,r=e.name,o=e.active,i=e.command;return Object.assign({},t,((n={})[r]={active:o,command:i},n))},{}),marks:Object.entries(a.marks).map(function(t){var s=t[0],e=function(t,e){var n=t.selection,r=n.from,o=n.to,i=[];t.doc.nodesBetween(r,o,function(t){i=i.concat(t.marks)});var s=i.find(function(t){return t.type.name===e.name});return s?s.attrs:{}}(c,a.marks[s]),n=r[s]?r[s]:function(){};return{name:s,active:function(){return t=c,e=a.marks[s],n=t.selection,r=n.from,o=n.$from,i=n.to,n.empty?!!e.isInSet(t.storedMarks||o.marks()):!!t.doc.rangeHasMark(r,i,e);var t,e,n,r,o,i},attrs:e,command:n}}).reduce(function(t,e){var n,r=e.name,o=e.active,i=e.attrs,s=e.command;return Object.assign({},t,((n={})[r]={active:o,attrs:i,command:s},n))},{})})},dispatchTransaction:function(t){this.state=this.state.apply(t),this.view.updateState(this.state),this.$emit("update",this.state),this.updateMenuActions()}},mounted:function(){this.initEditor()}};t.Editor=zt,Object.defineProperty(t,"__esModule",{value:!0})});
\ No newline at end of file