@vizel/core 0.0.1-alpha.2 → 0.0.1-alpha.4

package/dist/index63.js

@@ -1,1234 +1,16 @@
-function I(h, t, e) {
-  for (let n = 0; ; n++) {
-    if (n == h.childCount || n == t.childCount)
-      return h.childCount == t.childCount ? null : e;
-    let i = h.child(n), r = t.child(n);
-    if (i == r) {
-      e += i.nodeSize;
-      continue;
-    }
-    if (!i.sameMarkup(r))
-      return e;
-    if (i.isText && i.text != r.text) {
-      for (let s = 0; i.text[s] == r.text[s]; s++)
-        e++;
-      return e;
-    }
-    if (i.content.size || r.content.size) {
-      let s = I(i.content, r.content, e + 1);
-      if (s != null)
-        return s;
-    }
-    e += i.nodeSize;
-  }
-}
-function D(h, t, e, n) {
-  for (let i = h.childCount, r = t.childCount; ; ) {
-    if (i == 0 || r == 0)
-      return i == r ? null : { a: e, b: n };
-    let s = h.child(--i), o = t.child(--r), l = s.nodeSize;
-    if (s == o) {
-      e -= l, n -= l;
-      continue;
-    }
-    if (!s.sameMarkup(o))
-      return { a: e, b: n };
-    if (s.isText && s.text != o.text) {
-      let f = 0, a = Math.min(s.text.length, o.text.length);
-      for (; f < a && s.text[s.text.length - f - 1] == o.text[o.text.length - f - 1]; )
-        f++, e--, n--;
-      return { a: e, b: n };
-    }
-    if (s.content.size || o.content.size) {
-      let f = D(s.content, o.content, e - 1, n - 1);
-      if (f)
-        return f;
-    }
-    e -= l, n -= l;
-  }
-}
-class c {
-  /**
-  @internal
-  */
-  constructor(t, e) {
-    if (this.content = t, this.size = e || 0, e == null)
-      for (let n = 0; n < t.length; n++)
-        this.size += t[n].nodeSize;
-  }
-  /**
-  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`.
-  */
-  nodesBetween(t, e, n, i = 0, r) {
-    for (let s = 0, o = 0; o < e; s++) {
-      let l = this.content[s], f = o + l.nodeSize;
-      if (f > t && n(l, i + o, r || null, s) !== !1 && l.content.size) {
-        let a = o + 1;
-        l.nodesBetween(Math.max(0, t - a), Math.min(l.content.size, e - a), n, i + a);
-      }
-      o = f;
-    }
-  }
-  /**
-  Call the given callback for every descendant node. `pos` will be
-  relative to the start of the fragment. The callback may return
-  `false` to prevent traversal of a given node's children.
-  */
-  descendants(t) {
-    this.nodesBetween(0, this.size, t);
-  }
-  /**
-  Extract the text between `from` and `to`. See the same method on
-  [`Node`](https://prosemirror.net/docs/ref/#model.Node.textBetween).
-  */
-  textBetween(t, e, n, i) {
-    let r = "", s = !0;
-    return this.nodesBetween(t, e, (o, l) => {
-      let f = o.isText ? o.text.slice(Math.max(t, l) - l, e - l) : o.isLeaf ? i ? typeof i == "function" ? i(o) : i : o.type.spec.leafText ? o.type.spec.leafText(o) : "" : "";
-      o.isBlock && (o.isLeaf && f || o.isTextblock) && n && (s ? s = !1 : r += n), r += f;
-    }, 0), r;
-  }
-  /**
-  Create a new fragment containing the combined content of this
-  fragment and the other.
-  */
-  append(t) {
-    if (!t.size)
-      return this;
-    if (!this.size)
-      return t;
-    let e = this.lastChild, n = t.firstChild, i = this.content.slice(), r = 0;
-    for (e.isText && e.sameMarkup(n) && (i[i.length - 1] = e.withText(e.text + n.text), r = 1); r < t.content.length; r++)
-      i.push(t.content[r]);
-    return new c(i, this.size + t.size);
-  }
-  /**
-  Cut out the sub-fragment between the two given positions.
-  */
-  cut(t, e = this.size) {
-    if (t == 0 && e == this.size)
-      return this;
-    let n = [], i = 0;
-    if (e > t)
-      for (let r = 0, s = 0; s < e; r++) {
-        let o = this.content[r], l = s + o.nodeSize;
-        l > t && ((s < t || l > e) && (o.isText ? o = o.cut(Math.max(0, t - s), Math.min(o.text.length, e - s)) : o = o.cut(Math.max(0, t - s - 1), Math.min(o.content.size, e - s - 1))), n.push(o), i += o.nodeSize), s = l;
-      }
-    return new c(n, i);
-  }
-  /**
-  @internal
-  */
-  cutByIndex(t, e) {
-    return t == e ? c.empty : t == 0 && e == this.content.length ? this : new c(this.content.slice(t, e));
-  }
-  /**
-  Create a new fragment in which the node at the given index is
-  replaced by the given node.
-  */
-  replaceChild(t, e) {
-    let n = this.content[t];
-    if (n == e)
-      return this;
-    let i = this.content.slice(), r = this.size + e.nodeSize - n.nodeSize;
-    return i[t] = e, new c(i, r);
-  }
-  /**
-  Create a new fragment by prepending the given node to this
-  fragment.
-  */
-  addToStart(t) {
-    return new c([t].concat(this.content), this.size + t.nodeSize);
-  }
-  /**
-  Create a new fragment by appending the given node to this
-  fragment.
-  */
-  addToEnd(t) {
-    return new c(this.content.concat(t), this.size + t.nodeSize);
-  }
-  /**
-  Compare this fragment to another one.
-  */
-  eq(t) {
-    if (this.content.length != t.content.length)
-      return !1;
-    for (let e = 0; e < this.content.length; e++)
-      if (!this.content[e].eq(t.content[e]))
-        return !1;
-    return !0;
-  }
-  /**
-  The first child of the fragment, or `null` if it is empty.
-  */
-  get firstChild() {
-    return this.content.length ? this.content[0] : null;
-  }
-  /**
-  The last child of the fragment, or `null` if it is empty.
-  */
-  get lastChild() {
-    return this.content.length ? this.content[this.content.length - 1] : null;
-  }
-  /**
-  The number of child nodes in this fragment.
-  */
-  get childCount() {
-    return this.content.length;
-  }
-  /**
-  Get the child node at the given index. Raise an error when the
-  index is out of range.
-  */
-  child(t) {
-    let e = this.content[t];
-    if (!e)
-      throw new RangeError("Index " + t + " out of range for " + this);
-    return e;
-  }
-  /**
-  Get the child node at the given index, if it exists.
-  */
-  maybeChild(t) {
-    return this.content[t] || null;
-  }
-  /**
-  Call `f` for every child node, passing the node, its offset
-  into this parent node, and its index.
-  */
-  forEach(t) {
-    for (let e = 0, n = 0; e < this.content.length; e++) {
-      let i = this.content[e];
-      t(i, n, e), n += i.nodeSize;
-    }
-  }
-  /**
-  Find the first position at which this fragment and another
-  fragment differ, or `null` if they are the same.
-  */
-  findDiffStart(t, e = 0) {
-    return I(this, t, e);
-  }
-  /**
-  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.
-  */
-  findDiffEnd(t, e = this.size, n = t.size) {
-    return D(this, t, e, n);
-  }
-  /**
-  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. @internal
-  */
-  findIndex(t) {
-    if (t == 0)
-      return x(0, t);
-    if (t == this.size)
-      return x(this.content.length, t);
-    if (t > this.size || t < 0)
-      throw new RangeError(`Position ${t} outside of fragment (${this})`);
-    for (let e = 0, n = 0; ; e++) {
-      let i = this.child(e), r = n + i.nodeSize;
-      if (r >= t)
-        return r == t ? x(e + 1, r) : x(e, n);
-      n = r;
-    }
-  }
-  /**
-  Return a debugging string that describes this fragment.
-  */
-  toString() {
-    return "<" + this.toStringInner() + ">";
-  }
-  /**
-  @internal
-  */
-  toStringInner() {
-    return this.content.join(", ");
-  }
-  /**
-  Create a JSON-serializeable representation of this fragment.
-  */
-  toJSON() {
-    return this.content.length ? this.content.map((t) => t.toJSON()) : null;
-  }
-  /**
-  Deserialize a fragment from its JSON representation.
-  */
-  static fromJSON(t, e) {
-    if (!e)
-      return c.empty;
-    if (!Array.isArray(e))
-      throw new RangeError("Invalid input for Fragment.fromJSON");
-    return new c(e.map(t.nodeFromJSON));
-  }
-  /**
-  Build a fragment from an array of nodes. Ensures that adjacent
-  text nodes with the same marks are joined together.
-  */
-  static fromArray(t) {
-    if (!t.length)
-      return c.empty;
-    let e, n = 0;
-    for (let i = 0; i < t.length; i++) {
-      let r = t[i];
-      n += r.nodeSize, i && r.isText && t[i - 1].sameMarkup(r) ? (e || (e = t.slice(0, i)), e[e.length - 1] = r.withText(e[e.length - 1].text + r.text)) : e && e.push(r);
-    }
-    return new c(e || t, n);
-  }
-  /**
-  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.
-  */
-  static from(t) {
-    if (!t)
-      return c.empty;
-    if (t instanceof c)
-      return t;
-    if (Array.isArray(t))
-      return this.fromArray(t);
-    if (t.attrs)
-      return new c([t], t.nodeSize);
-    throw new RangeError("Can not convert " + t + " to a Fragment" + (t.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
-  }
-}
-c.empty = new c([], 0);
-const E = { index: 0, offset: 0 };
-function x(h, t) {
-  return E.index = h, E.offset = t, E;
-}
-function k(h, t) {
-  if (h === t)
-    return !0;
-  if (!(h && typeof h == "object") || !(t && typeof t == "object"))
-    return !1;
-  let e = Array.isArray(h);
-  if (Array.isArray(t) != e)
-    return !1;
-  if (e) {
-    if (h.length != t.length)
-      return !1;
-    for (let n = 0; n < h.length; n++)
-      if (!k(h[n], t[n]))
-        return !1;
-  } else {
-    for (let n in h)
-      if (!(n in t) || !k(h[n], t[n]))
-        return !1;
-    for (let n in t)
-      if (!(n in h))
-        return !1;
-  }
-  return !0;
-}
-class p {
-  /**
-  @internal
-  */
-  constructor(t, e) {
-    this.type = t, this.attrs = e;
-  }
-  /**
-  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](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) with this mark are present,
-  those are replaced by this one.
-  */
-  addToSet(t) {
-    let e, n = !1;
-    for (let i = 0; i < t.length; i++) {
-      let r = t[i];
-      if (this.eq(r))
-        return t;
-      if (this.type.excludes(r.type))
-        e || (e = t.slice(0, i));
-      else {
-        if (r.type.excludes(this.type))
-          return t;
-        !n && r.type.rank > this.type.rank && (e || (e = t.slice(0, i)), e.push(this), n = !0), e && e.push(r);
-      }
-    }
-    return e || (e = t.slice()), n || e.push(this), e;
-  }
-  /**
-  Remove this mark from the given set, returning a new set. If this
-  mark is not in the set, the set itself is returned.
-  */
-  removeFromSet(t) {
-    for (let e = 0; e < t.length; e++)
-      if (this.eq(t[e]))
-        return t.slice(0, e).concat(t.slice(e + 1));
-    return t;
-  }
-  /**
-  Test whether this mark is in the given set of marks.
-  */
-  isInSet(t) {
-    for (let e = 0; e < t.length; e++)
-      if (this.eq(t[e]))
-        return !0;
-    return !1;
-  }
-  /**
-  Test whether this mark has the same type and attributes as
-  another mark.
-  */
-  eq(t) {
-    return this == t || this.type == t.type && k(this.attrs, t.attrs);
-  }
-  /**
-  Convert this mark to a JSON-serializeable representation.
-  */
-  toJSON() {
-    let t = { type: this.type.name };
-    for (let e in this.attrs) {
-      t.attrs = this.attrs;
-      break;
-    }
-    return t;
-  }
-  /**
-  Deserialize a mark from JSON.
-  */
-  static fromJSON(t, e) {
-    if (!e)
-      throw new RangeError("Invalid input for Mark.fromJSON");
-    let n = t.marks[e.type];
-    if (!n)
-      throw new RangeError(`There is no mark type ${e.type} in this schema`);
-    let i = n.create(e.attrs);
-    return n.checkAttrs(i.attrs), i;
-  }
-  /**
-  Test whether two sets of marks are identical.
-  */
-  static sameSet(t, e) {
-    if (t == e)
-      return !0;
-    if (t.length != e.length)
-      return !1;
-    for (let n = 0; n < t.length; n++)
-      if (!t[n].eq(e[n]))
-        return !1;
-    return !0;
-  }
-  /**
-  Create a properly sorted mark set from null, a single mark, or an
-  unsorted array of marks.
-  */
-  static setFrom(t) {
-    if (!t || Array.isArray(t) && t.length == 0)
-      return p.none;
-    if (t instanceof p)
-      return [t];
-    let e = t.slice();
-    return e.sort((n, i) => n.type.rank - i.type.rank), e;
-  }
-}
-p.none = [];
-class K extends Error {
-}
-class d {
-  /**
-  Create a slice. When specifying a non-zero open depth, you must
-  make sure that there are nodes of at least that depth at the
-  appropriate side of the fragment—i.e. if the fragment is an
-  empty paragraph node, `openStart` and `openEnd` can't be greater
-  than 1.
-  
-  It is not necessary for the content of open nodes to conform to
-  the schema's content constraints, though it should be a valid
-  start/end/middle for such a node, depending on which sides are
-  open.
-  */
-  constructor(t, e, n) {
-    this.content = t, this.openStart = e, this.openEnd = n;
-  }
-  /**
-  The size this slice would add when inserted into a document.
-  */
-  get size() {
-    return this.content.size - this.openStart - this.openEnd;
-  }
-  /**
-  @internal
-  */
-  insertAt(t, e) {
-    let n = v(this.content, t + this.openStart, e);
-    return n && new d(n, this.openStart, this.openEnd);
-  }
-  /**
-  @internal
-  */
-  removeBetween(t, e) {
-    return new d(B(this.content, t + this.openStart, e + this.openStart), this.openStart, this.openEnd);
-  }
-  /**
-  Tests whether this slice is equal to another slice.
-  */
-  eq(t) {
-    return this.content.eq(t.content) && this.openStart == t.openStart && this.openEnd == t.openEnd;
-  }
-  /**
-  @internal
-  */
-  toString() {
-    return this.content + "(" + this.openStart + "," + this.openEnd + ")";
-  }
-  /**
-  Convert a slice to a JSON-serializable representation.
-  */
-  toJSON() {
-    if (!this.content.size)
-      return null;
-    let t = { content: this.content.toJSON() };
-    return this.openStart > 0 && (t.openStart = this.openStart), this.openEnd > 0 && (t.openEnd = this.openEnd), t;
-  }
-  /**
-  Deserialize a slice from its JSON representation.
-  */
-  static fromJSON(t, e) {
-    if (!e)
-      return d.empty;
-    let n = e.openStart || 0, i = e.openEnd || 0;
-    if (typeof n != "number" || typeof i != "number")
-      throw new RangeError("Invalid input for Slice.fromJSON");
-    return new d(c.fromJSON(t, e.content), n, i);
-  }
-  /**
-  Create a slice from a fragment by taking the maximum possible
-  open value on both side of the fragment.
-  */
-  static maxOpen(t, e = !0) {
-    let n = 0, i = 0;
-    for (let r = t.firstChild; r && !r.isLeaf && (e || !r.type.spec.isolating); r = r.firstChild)
-      n++;
-    for (let r = t.lastChild; r && !r.isLeaf && (e || !r.type.spec.isolating); r = r.lastChild)
-      i++;
-    return new d(t, n, i);
-  }
-}
-d.empty = new d(c.empty, 0, 0);
-function B(h, t, e) {
-  let { index: n, offset: i } = h.findIndex(t), r = h.maybeChild(n), { index: s, offset: o } = h.findIndex(e);
-  if (i == t || r.isText) {
-    if (o != e && !h.child(s).isText)
-      throw new RangeError("Removing non-flat range");
-    return h.cut(0, t).append(h.cut(e));
-  }
-  if (n != s)
-    throw new RangeError("Removing non-flat range");
-  return h.replaceChild(n, r.copy(B(r.content, t - i - 1, e - i - 1)));
-}
-function v(h, t, e, n) {
-  let { index: i, offset: r } = h.findIndex(t), s = h.maybeChild(i);
-  if (r == t || s.isText)
-    return n && !n.canReplace(i, i, e) ? null : h.cut(0, t).append(e).append(h.cut(t));
-  let o = v(s.content, t - r - 1, e, s);
-  return o && h.replaceChild(i, s.copy(o));
-}
-function F(h) {
-  return h.tag != null;
-}
-function $(h) {
-  return h.style != null;
-}
-class z {
-  /**
-  Create a parser that targets the given schema, using the given
-  parsing rules.
-  */
-  constructor(t, e) {
-    this.schema = t, this.rules = e, this.tags = [], this.styles = [];
-    let n = this.matchedStyles = [];
-    e.forEach((i) => {
-      if (F(i))
-        this.tags.push(i);
-      else if ($(i)) {
-        let r = /[^=]*/.exec(i.style)[0];
-        n.indexOf(r) < 0 && n.push(r), this.styles.push(i);
-      }
-    }), this.normalizeLists = !this.tags.some((i) => {
-      if (!/^(ul|ol)\b/.test(i.tag) || !i.node)
-        return !1;
-      let r = t.nodes[i.node];
-      return r.contentMatch.matchType(r);
-    });
-  }
-  /**
-  Parse a document from the content of a DOM node.
-  */
-  parse(t, e = {}) {
-    let n = new N(this, e, !1);
-    return n.addAll(t, p.none, e.from, e.to), n.finish();
-  }
-  /**
-  Parses the content of the given DOM node, like
-  [`parse`](https://prosemirror.net/docs/ref/#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.
-  */
-  parseSlice(t, e = {}) {
-    let n = new N(this, e, !0);
-    return n.addAll(t, p.none, e.from, e.to), d.maxOpen(n.finish());
-  }
-  /**
-  @internal
-  */
-  matchTag(t, e, n) {
-    for (let i = n ? this.tags.indexOf(n) + 1 : 0; i < this.tags.length; i++) {
-      let r = this.tags[i];
-      if (U(t, r.tag) && (r.namespace === void 0 || t.namespaceURI == r.namespace) && (!r.context || e.matchesContext(r.context))) {
-        if (r.getAttrs) {
-          let s = r.getAttrs(t);
-          if (s === !1)
-            continue;
-          r.attrs = s || void 0;
-        }
-        return r;
-      }
-    }
-  }
-  /**
-  @internal
-  */
-  matchStyle(t, e, n, i) {
-    for (let r = i ? this.styles.indexOf(i) + 1 : 0; r < this.styles.length; r++) {
-      let s = this.styles[r], o = s.style;
-      if (!(o.indexOf(t) != 0 || s.context && !n.matchesContext(s.context) || // Test that the style string either precisely matches the prop,
-      // or has an '=' sign after the prop, followed by the given
-      // value.
-      o.length > t.length && (o.charCodeAt(t.length) != 61 || o.slice(t.length + 1) != e))) {
-        if (s.getAttrs) {
-          let l = s.getAttrs(e);
-          if (l === !1)
-            continue;
-          s.attrs = l || void 0;
-        }
-        return s;
-      }
-    }
-  }
-  /**
-  @internal
-  */
-  static schemaRules(t) {
-    let e = [];
-    function n(i) {
-      let r = i.priority == null ? 50 : i.priority, s = 0;
-      for (; s < e.length; s++) {
-        let o = e[s];
-        if ((o.priority == null ? 50 : o.priority) < r)
-          break;
-      }
-      e.splice(s, 0, i);
-    }
-    for (let i in t.marks) {
-      let r = t.marks[i].spec.parseDOM;
-      r && r.forEach((s) => {
-        n(s = P(s)), s.mark || s.ignore || s.clearMark || (s.mark = i);
-      });
-    }
-    for (let i in t.nodes) {
-      let r = t.nodes[i].spec.parseDOM;
-      r && r.forEach((s) => {
-        n(s = P(s)), s.node || s.ignore || s.mark || (s.node = i);
-      });
-    }
-    return e;
-  }
-  /**
-  Construct a DOM parser using the parsing rules listed in a
-  schema's [node specs](https://prosemirror.net/docs/ref/#model.NodeSpec.parseDOM), reordered by
-  [priority](https://prosemirror.net/docs/ref/#model.GenericParseRule.priority).
-  */
-  static fromSchema(t) {
-    return t.cached.domParser || (t.cached.domParser = new z(t, z.schemaRules(t)));
-  }
-}
-const L = {
-  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
-}, V = {
-  head: !0,
-  noscript: !0,
-  object: !0,
-  script: !0,
-  style: !0,
-  title: !0
-}, W = { ol: !0, ul: !0 }, m = 1, M = 2, g = 4;
-function O(h, t, e) {
-  return t != null ? (t ? m : 0) | (t === "full" ? M : 0) : h && h.whitespace == "pre" ? m | M : e & ~g;
-}
-class S {
-  constructor(t, e, n, i, r, s) {
-    this.type = t, this.attrs = e, this.marks = n, this.solid = i, this.options = s, this.content = [], this.activeMarks = p.none, this.match = r || (s & g ? null : t.contentMatch);
-  }
-  findWrapping(t) {
-    if (!this.match) {
-      if (!this.type)
-        return [];
-      let e = this.type.contentMatch.fillBefore(c.from(t));
-      if (e)
-        this.match = this.type.contentMatch.matchFragment(e);
-      else {
-        let n = this.type.contentMatch, i;
-        return (i = n.findWrapping(t.type)) ? (this.match = n, i) : null;
-      }
-    }
-    return this.match.findWrapping(t.type);
-  }
-  finish(t) {
-    if (!(this.options & m)) {
-      let n = this.content[this.content.length - 1], i;
-      if (n && n.isText && (i = /[ \t\r\n\u000c]+$/.exec(n.text))) {
-        let r = n;
-        n.text.length == i[0].length ? this.content.pop() : this.content[this.content.length - 1] = r.withText(r.text.slice(0, r.text.length - i[0].length));
-      }
-    }
-    let e = c.from(this.content);
-    return !t && this.match && (e = e.append(this.match.fillBefore(c.empty, !0))), this.type ? this.type.create(this.attrs, e, this.marks) : e;
-  }
-  inlineContext(t) {
-    return this.type ? this.type.inlineContent : this.content.length ? this.content[0].isInline : t.parentNode && !L.hasOwnProperty(t.parentNode.nodeName.toLowerCase());
-  }
-}
-class N {
-  constructor(t, e, n) {
-    this.parser = t, this.options = e, this.isOpen = n, this.open = 0, this.localPreserveWS = !1;
-    let i = e.topNode, r, s = O(null, e.preserveWhitespace, 0) | (n ? g : 0);
-    i ? r = new S(i.type, i.attrs, p.none, !0, e.topMatch || i.type.contentMatch, s) : n ? r = new S(null, null, p.none, !0, null, s) : r = new S(t.schema.topNodeType, null, p.none, !0, null, s), this.nodes = [r], this.find = e.findPositions, this.needsBlock = !1;
-  }
-  get top() {
-    return this.nodes[this.open];
-  }
-  // 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`.
-  addDOM(t, e) {
-    t.nodeType == 3 ? this.addTextNode(t, e) : t.nodeType == 1 && this.addElement(t, e);
-  }
-  addTextNode(t, e) {
-    let n = t.nodeValue, i = this.top, r = i.options & M ? "full" : this.localPreserveWS || (i.options & m) > 0, { schema: s } = this.parser;
-    if (r === "full" || i.inlineContext(t) || /[^ \t\r\n\u000c]/.test(n)) {
-      if (r)
-        if (r === "full")
-          n = n.replace(/\r\n?/g, `
-`);
-        else if (s.linebreakReplacement && /[\r\n]/.test(n) && this.top.findWrapping(s.linebreakReplacement.create())) {
-          let o = n.split(/\r?\n|\r/);
-          for (let l = 0; l < o.length; l++)
-            l && this.insertNode(s.linebreakReplacement.create(), e, !0), o[l] && this.insertNode(s.text(o[l]), e, !/\S/.test(o[l]));
-          n = "";
-        } else
-          n = n.replace(/\r?\n|\r/g, " ");
-      else if (n = n.replace(/[ \t\r\n\u000c]+/g, " "), /^[ \t\r\n\u000c]/.test(n) && this.open == this.nodes.length - 1) {
-        let o = i.content[i.content.length - 1], l = t.previousSibling;
-        (!o || l && l.nodeName == "BR" || o.isText && /[ \t\r\n\u000c]$/.test(o.text)) && (n = n.slice(1));
-      }
-      n && this.insertNode(s.text(n), e, !/\S/.test(n)), this.findInText(t);
-    } else
-      this.findInside(t);
-  }
-  // 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.
-  addElement(t, e, n) {
-    let i = this.localPreserveWS, r = this.top;
-    (t.tagName == "PRE" || /pre/.test(t.style && t.style.whiteSpace)) && (this.localPreserveWS = !0);
-    let s = t.nodeName.toLowerCase(), o;
-    W.hasOwnProperty(s) && this.parser.normalizeLists && j(t);
-    let l = this.options.ruleFromNode && this.options.ruleFromNode(t) || (o = this.parser.matchTag(t, this, n));
-    t: if (l ? l.ignore : V.hasOwnProperty(s))
-      this.findInside(t), this.ignoreFallback(t, e);
-    else if (!l || l.skip || l.closeParent) {
-      l && l.closeParent ? this.open = Math.max(0, this.open - 1) : l && l.skip.nodeType && (t = l.skip);
-      let f, a = this.needsBlock;
-      if (L.hasOwnProperty(s))
-        r.content.length && r.content[0].isInline && this.open && (this.open--, r = this.top), f = !0, r.type || (this.needsBlock = !0);
-      else if (!t.firstChild) {
-        this.leafFallback(t, e);
-        break t;
-      }
-      let u = l && l.skip ? e : this.readStyles(t, e);
-      u && this.addAll(t, u), f && this.sync(r), this.needsBlock = a;
-    } else {
-      let f = this.readStyles(t, e);
-      f && this.addElementByRule(t, l, f, l.consuming === !1 ? o : void 0);
-    }
-    this.localPreserveWS = i;
-  }
-  // Called for leaf DOM nodes that would otherwise be ignored
-  leafFallback(t, e) {
-    t.nodeName == "BR" && this.top.type && this.top.type.inlineContent && this.addTextNode(t.ownerDocument.createTextNode(`
-`), e);
-  }
-  // Called for ignored nodes
-  ignoreFallback(t, e) {
-    t.nodeName == "BR" && (!this.top.type || !this.top.type.inlineContent) && this.findPlace(this.parser.schema.text("-"), e, !0);
-  }
-  // Run any style parser associated with the node's styles. Either
-  // return an updated array of marks, or null to indicate some of the
-  // styles had a rule with `ignore` set.
-  readStyles(t, e) {
-    let n = t.style;
-    if (n && n.length)
-      for (let i = 0; i < this.parser.matchedStyles.length; i++) {
-        let r = this.parser.matchedStyles[i], s = n.getPropertyValue(r);
-        if (s)
-          for (let o = void 0; ; ) {
-            let l = this.parser.matchStyle(r, s, this, o);
-            if (!l)
-              break;
-            if (l.ignore)
-              return null;
-            if (l.clearMark ? e = e.filter((f) => !l.clearMark(f)) : e = e.concat(this.parser.schema.marks[l.mark].create(l.attrs)), l.consuming === !1)
-              o = l;
-            else
-              break;
-          }
-      }
-    return e;
-  }
-  // 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.
-  addElementByRule(t, e, n, i) {
-    let r, s;
-    if (e.node)
-      if (s = this.parser.schema.nodes[e.node], s.isLeaf)
-        this.insertNode(s.create(e.attrs), n, t.nodeName == "BR") || this.leafFallback(t, n);
-      else {
-        let l = this.enter(s, e.attrs || null, n, e.preserveWhitespace);
-        l && (r = !0, n = l);
-      }
-    else {
-      let l = this.parser.schema.marks[e.mark];
-      n = n.concat(l.create(e.attrs));
-    }
-    let o = this.top;
-    if (s && s.isLeaf)
-      this.findInside(t);
-    else if (i)
-      this.addElement(t, n, i);
-    else if (e.getContent)
-      this.findInside(t), e.getContent(t, this.parser.schema).forEach((l) => this.insertNode(l, n, !1));
-    else {
-      let l = t;
-      typeof e.contentElement == "string" ? l = t.querySelector(e.contentElement) : typeof e.contentElement == "function" ? l = e.contentElement(t) : e.contentElement && (l = e.contentElement), this.findAround(t, l, !0), this.addAll(l, n), this.findAround(t, l, !1);
-    }
-    r && this.sync(o) && this.open--;
-  }
-  // 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.
-  addAll(t, e, n, i) {
-    let r = n || 0;
-    for (let s = n ? t.childNodes[n] : t.firstChild, o = i == null ? null : t.childNodes[i]; s != o; s = s.nextSibling, ++r)
-      this.findAtPoint(t, r), this.addDOM(s, e);
-    this.findAtPoint(t, r);
-  }
-  // 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.
-  findPlace(t, e, n) {
-    let i, r;
-    for (let s = this.open, o = 0; s >= 0; s--) {
-      let l = this.nodes[s], f = l.findWrapping(t);
-      if (f && (!i || i.length > f.length + o) && (i = f, r = l, !f.length))
-        break;
-      if (l.solid) {
-        if (n)
-          break;
-        o += 2;
-      }
-    }
-    if (!i)
-      return null;
-    this.sync(r);
-    for (let s = 0; s < i.length; s++)
-      e = this.enterInner(i[s], null, e, !1);
-    return e;
-  }
-  // Try to insert the given node, adjusting the context when needed.
-  insertNode(t, e, n) {
-    if (t.isInline && this.needsBlock && !this.top.type) {
-      let r = this.textblockFromContext();
-      r && (e = this.enterInner(r, null, e));
-    }
-    let i = this.findPlace(t, e, n);
-    if (i) {
-      this.closeExtra();
-      let r = this.top;
-      r.match && (r.match = r.match.matchType(t.type));
-      let s = p.none;
-      for (let o of i.concat(t.marks))
-        (r.type ? r.type.allowsMarkType(o.type) : R(o.type, t.type)) && (s = o.addToSet(s));
-      return r.content.push(t.mark(s)), !0;
-    }
-    return !1;
-  }
-  // Try to start a node of the given type, adjusting the context when
-  // necessary.
-  enter(t, e, n, i) {
-    let r = this.findPlace(t.create(e), n, !1);
-    return r && (r = this.enterInner(t, e, n, !0, i)), r;
-  }
-  // Open a node of the given type
-  enterInner(t, e, n, i = !1, r) {
-    this.closeExtra();
-    let s = this.top;
-    s.match = s.match && s.match.matchType(t);
-    let o = O(t, r, s.options);
-    s.options & g && s.content.length == 0 && (o |= g);
-    let l = p.none;
-    return n = n.filter((f) => (s.type ? s.type.allowsMarkType(f.type) : R(f.type, t)) ? (l = f.addToSet(l), !1) : !0), this.nodes.push(new S(t, e, l, i, null, o)), this.open++, n;
-  }
-  // Make sure all nodes above this.open are finished and added to
-  // their parents
-  closeExtra(t = !1) {
-    let 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;
-    }
-  }
-  finish() {
-    return this.open = 0, this.closeExtra(this.isOpen), this.nodes[0].finish(!!(this.isOpen || this.options.topOpen));
-  }
-  sync(t) {
-    for (let e = this.open; e >= 0; e--) {
-      if (this.nodes[e] == t)
-        return this.open = e, !0;
-      this.localPreserveWS && (this.nodes[e].options |= m);
-    }
-    return !1;
-  }
-  get currentPos() {
-    this.closeExtra();
-    let t = 0;
-    for (let e = this.open; e >= 0; e--) {
-      let n = this.nodes[e].content;
-      for (let i = n.length - 1; i >= 0; i--)
-        t += n[i].nodeSize;
-      e && t++;
-    }
-    return t;
-  }
-  findAtPoint(t, e) {
-    if (this.find)
-      for (let n = 0; n < this.find.length; n++)
-        this.find[n].node == t && this.find[n].offset == e && (this.find[n].pos = this.currentPos);
-  }
-  findInside(t) {
-    if (this.find)
-      for (let e = 0; e < this.find.length; e++)
-        this.find[e].pos == null && t.nodeType == 1 && t.contains(this.find[e].node) && (this.find[e].pos = this.currentPos);
-  }
-  findAround(t, e, n) {
-    if (t != e && this.find)
-      for (let i = 0; i < this.find.length; i++)
-        this.find[i].pos == null && t.nodeType == 1 && t.contains(this.find[i].node) && e.compareDocumentPosition(this.find[i].node) & (n ? 2 : 4) && (this.find[i].pos = this.currentPos);
-  }
-  findInText(t) {
-    if (this.find)
-      for (let 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));
-  }
-  // Determines whether the given context string matches this context.
-  matchesContext(t) {
-    if (t.indexOf("|") > -1)
-      return t.split(/\s*\|\s*/).some(this.matchesContext, this);
-    let e = t.split("/"), n = this.options.context, i = !this.isOpen && (!n || n.parent.type == this.nodes[0].type), r = -(n ? n.depth + 1 : 0) + (i ? 0 : 1), s = (o, l) => {
-      for (; o >= 0; o--) {
-        let f = e[o];
-        if (f == "") {
-          if (o == e.length - 1 || o == 0)
-            continue;
-          for (; l >= r; l--)
-            if (s(o - 1, l))
-              return !0;
-          return !1;
-        } else {
-          let a = l > 0 || l == 0 && i ? this.nodes[l].type : n && l >= r ? n.node(l - r).type : null;
-          if (!a || a.name != f && !a.isInGroup(f))
-            return !1;
-          l--;
-        }
-      }
-      return !0;
-    };
-    return s(e.length - 1, this.open);
-  }
-  textblockFromContext() {
-    let t = this.options.context;
-    if (t)
-      for (let e = t.depth; e >= 0; e--) {
-        let n = t.node(e).contentMatchAt(t.indexAfter(e)).defaultType;
-        if (n && n.isTextblock && n.defaultAttrs)
-          return n;
-      }
-    for (let e in this.parser.schema.nodes) {
-      let n = this.parser.schema.nodes[e];
-      if (n.isTextblock && n.defaultAttrs)
-        return n;
-    }
-  }
-}
-function j(h) {
-  for (let t = h.firstChild, e = null; t; t = t.nextSibling) {
-    let n = t.nodeType == 1 ? t.nodeName.toLowerCase() : null;
-    n && W.hasOwnProperty(n) && e ? (e.appendChild(t), t = e) : n == "li" ? e = t : n && (e = null);
-  }
-}
-function U(h, t) {
-  return (h.matches || h.msMatchesSelector || h.webkitMatchesSelector || h.mozMatchesSelector).call(h, t);
-}
-function P(h) {
-  let t = {};
-  for (let e in h)
-    t[e] = h[e];
-  return t;
-}
-function R(h, t) {
-  let e = t.schema.nodes;
-  for (let n in e) {
-    let i = e[n];
-    if (!i.allowsMarkType(h))
-      continue;
-    let r = [], s = (o) => {
-      r.push(o);
-      for (let l = 0; l < o.edgeCount; l++) {
-        let { type: f, next: a } = o.edge(l);
-        if (f == t || r.indexOf(a) < 0 && s(a))
-          return !0;
-      }
-    };
-    if (s(i.contentMatch))
-      return !0;
-  }
-}
-class J {
-  /**
-  Create a serializer. `nodes` should map node names to functions
-  that take a node and return a description of the corresponding
-  DOM. `marks` does the same for mark names, but also gets an
-  argument that tells it whether the mark's content is block or
-  inline content (for typical use, it'll always be inline). A mark
-  serializer may be `null` to indicate that marks of that type
-  should not be serialized.
-  */
-  constructor(t, e) {
-    this.nodes = t, this.marks = e;
-  }
-  /**
-  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.
-  */
-  serializeFragment(t, e = {}, n) {
-    n || (n = T(e).createDocumentFragment());
-    let i = n, r = [];
-    return t.forEach((s) => {
-      if (r.length || s.marks.length) {
-        let o = 0, l = 0;
-        for (; o < r.length && l < s.marks.length; ) {
-          let f = s.marks[l];
-          if (!this.marks[f.type.name]) {
-            l++;
-            continue;
-          }
-          if (!f.eq(r[o][0]) || f.type.spec.spanning === !1)
-            break;
-          o++, l++;
-        }
-        for (; o < r.length; )
-          i = r.pop()[1];
-        for (; l < s.marks.length; ) {
-          let f = s.marks[l++], a = this.serializeMark(f, s.isInline, e);
-          a && (r.push([f, i]), i.appendChild(a.dom), i = a.contentDOM || a.dom);
-        }
-      }
-      i.appendChild(this.serializeNodeInner(s, e));
-    }), n;
-  }
-  /**
-  @internal
-  */
-  serializeNodeInner(t, e) {
-    let { dom: n, contentDOM: i } = w(T(e), this.nodes[t.type.name](t), null, t.attrs);
-    if (i) {
-      if (t.isLeaf)
-        throw new RangeError("Content hole not allowed in a leaf node spec");
-      this.serializeFragment(t.content, e, i);
-    }
-    return n;
-  }
-  /**
-  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`](https://prosemirror.net/docs/ref/#model.DOMSerializer.serializeFragment) on
-  its [content](https://prosemirror.net/docs/ref/#model.Node.content).
-  */
-  serializeNode(t, e = {}) {
-    let n = this.serializeNodeInner(t, e);
-    for (let i = t.marks.length - 1; i >= 0; i--) {
-      let r = this.serializeMark(t.marks[i], t.isInline, e);
-      r && ((r.contentDOM || r.dom).appendChild(n), n = r.dom);
-    }
-    return n;
-  }
-  /**
-  @internal
-  */
-  serializeMark(t, e, n = {}) {
-    let i = this.marks[t.type.name];
-    return i && w(T(n), i(t, e), null, t.attrs);
-  }
-  static renderSpec(t, e, n = null, i) {
-    return w(t, e, n, i);
-  }
-  /**
-  Build a serializer using the [`toDOM`](https://prosemirror.net/docs/ref/#model.NodeSpec.toDOM)
-  properties in a schema's node and mark specs.
-  */
-  static fromSchema(t) {
-    return t.cached.domSerializer || (t.cached.domSerializer = new J(this.nodesFromSchema(t), this.marksFromSchema(t)));
-  }
-  /**
-  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.
-  */
-  static nodesFromSchema(t) {
-    let e = A(t.nodes);
-    return e.text || (e.text = (n) => n.text), e;
-  }
-  /**
-  Gather the serializers in a schema's mark specs into an object.
-  */
-  static marksFromSchema(t) {
-    return A(t.marks);
-  }
-}
-function A(h) {
-  let t = {};
-  for (let e in h) {
-    let n = h[e].spec.toDOM;
-    n && (t[e] = n);
-  }
-  return t;
-}
-function T(h) {
-  return h.document || window.document;
-}
-const b = /* @__PURE__ */ new WeakMap();
-function G(h) {
-  let t = b.get(h);
-  return t === void 0 && b.set(h, t = H(h)), t;
-}
-function H(h) {
-  let t = null;
-  function e(n) {
-    if (n && typeof n == "object")
-      if (Array.isArray(n))
-        if (typeof n[0] == "string")
-          t || (t = []), t.push(n);
-        else
-          for (let i = 0; i < n.length; i++)
-            e(n[i]);
-      else
-        for (let i in n)
-          e(n[i]);
-  }
-  return e(h), t;
-}
-function w(h, t, e, n) {
-  if (typeof t == "string")
-    return { dom: h.createTextNode(t) };
-  if (t.nodeType != null)
-    return { dom: t };
-  if (t.dom && t.dom.nodeType != null)
-    return t;
-  let i = t[0], r;
-  if (typeof i != "string")
-    throw new RangeError("Invalid array passed to renderSpec");
-  if (n && (r = G(n)) && r.indexOf(t) > -1)
-    throw new RangeError("Using an array from an attribute object as a DOM spec. This may be an attempted cross site scripting attack.");
-  let s = i.indexOf(" ");
-  s > 0 && (e = i.slice(0, s), i = i.slice(s + 1));
-  let o, l = e ? h.createElementNS(e, i) : h.createElement(i), f = t[1], a = 1;
-  if (f && typeof f == "object" && f.nodeType == null && !Array.isArray(f)) {
-    a = 2;
-    for (let u in f)
-      if (f[u] != null) {
-        let y = u.indexOf(" ");
-        y > 0 ? l.setAttributeNS(u.slice(0, y), u.slice(y + 1), f[u]) : u == "style" && l.style ? l.style.cssText = f[u] : l.setAttribute(u, f[u]);
-      }
-  }
-  for (let u = a; u < t.length; u++) {
-    let y = t[u];
-    if (y === 0) {
-      if (u < t.length - 1 || u > a)
-        throw new RangeError("Content hole must be the only child of its parent node");
-      return { dom: l, contentDOM: l };
-    } else {
-      let { dom: q, contentDOM: C } = w(h, y, e, n);
-      if (l.appendChild(q), C) {
-        if (o)
-          throw new RangeError("Multiple content holes");
-        o = C;
-      }
+function u(o, i) {
+  const s = o.icons, e = o.aliases || /* @__PURE__ */ Object.create(null), t = /* @__PURE__ */ Object.create(null);
+  function r(c) {
+    if (s[c]) return t[c] = [];
+    if (!(c in t)) {
+      t[c] = null;
+      const n = e[c] && e[c].parent, l = n && r(n);
+      l && (t[c] = [n].concat(l));
     }
+    return t[c];
   }
-  return { dom: l, contentDOM: o };
+  return (i || Object.keys(s).concat(Object.keys(e))).forEach(r), t;
 }
 export {
-  z as DOMParser,
-  J as DOMSerializer,
-  c as Fragment,
-  p as Mark,
-  K as ReplaceError,
-  d as Slice
+  u as getIconsTree
 };